GATE Shift 2 CS Question Paper 1st February 2025: Memory-Based Question, Answer Key
GATE 2025 aspirants can check the memory-based GATE Shift 2 Computer Science Question Paper 1st February 2025 available here.
GATE Shift 2 CS Question Paper 1st February 2025: The GATE 2025 Shift 2 Computer Science (CS) examination was conducted today, February 2, 2025, from 2:30 PM to 5:30 PM. Candidates who appeared for the examination can check the memory-based GATE Shift 2 CS Question Paper 1st February 2025 and the GATE Shift 2 CS Answer Key 1st February 2025 available here.
GATE 2025 CS Paper Analysis, Question Paper and Answer Key |
- GATE Computer Science Paper Analysis 1st Feb Shift 1 2025: Overall Difficulty Level, Student Review
- GATE Shift 1 Computer Science Question Paper 1st February 2025: Memory Based Question, Answer Key
- GATE 1st Feb CS Shift 2 Paper Analysis 2025: Overall Difficulty Level, Student Review
GATE 2025 CS Paper Expected Cutoff |
GATE Shift 2 CS Question Paper 1st February 2025: PDF Link
The GATE 2025 Shift 2 CS memory-based question paper PDF is in the table below.
GATE Shift 2 CS Question Paper 1st February 2025 PDF Link (to be added soon) |
GATE Shift 2 CS Question Paper 1st February 2025: Memory-Based Questions
The GATE CS Shift 2 of Feb 1 memory-based questions are given below.
- Given N distinct elements in a array to determine number of comparison required to find the element which is not the largest.
(a) 2N-1
(b) N-1
(c) N
(d) 1 - In a BST with elements 10, -4, 15, 13, 20, 5, 16, 19. What are the number of edges from node 19 to root?
- Consider a binary tree T in which every node has either two or zero children. Let n>0 be the number of nodes in T. Which of the following is the number of nodes in T that exactly that exactly has two children?
(a) (n+1)/2
(b) (n-2)/2
(c) n/2
(d) (n-1)/2 - 5, 6, 15, ___, 89, 170, 291, ...
- Bird : Nest :: Bee : ________
- main ()
{
int x=126, y=105;
do
{
if (x>y)
x=x-y;
else
y=y-x;
}
while (x!=y)
printf("%d",x);
} - int a;
int arr[ ]={30,20,10};
int *ptr=&a[0]+1 - What is included in instructions set architecture?
(a) number of registers
(b) clock cycle time or frequency of CPU
(c) number of cache levels
(d) cache size - IPv4 packet has X written in its protocol field. Protocol X can't be
(a) IGMP
(b) ICMP
(c) RIP
(d) OSPF - Matrix A=[1 2], then A8=?
2 -1 - Which of the follwoing is accepted as DPDA?
(a) Regular language
(b) All CFL
(c) All languages accepted NPDA
(d) All decidable langauges - In case of a 4 bit ripple counter, time period of the waveform is 64 microseconds. What is input frequency?
GATE Shift 2 CS Question Paper 1st February 2025: Answer Key
Candidates can check the answers to the GATE Shift 2 CS February 1 2025 memory-based questions below.
- Given N distinct elements in a array to determine number of comparison required to find the element which is not the largest.
(a) 2N-1
(b) N-1
(c) N
(d) 1
Answer: (d) - In a BST with elements 10, -4, 15, 13, 20, 5, 16, 19. What are the number of edges from node 19 to root?
Answer: 4 - Consider a binary tree T in which every node has either two or zero children. Let n>0 be the number of nodes in T. Which of the following is the number of nodes in T that exactly that exactly has two children?
(a) (n+1)/2
(b) (n-2)/2
(c) n/2
(d) (n-1)/2
Answer: (d) - 5, 6, 15, ___, 89, 170, 291, ...
Answer: 40 - Bird : Nest :: Bee : ________
Answer: Hive - main ()
{
int x=126, y=105;
do
{
if (x>y)
x=x-y;
else
y=y-x;
}
while (x!=y)
printf("%d",x);
}
Answer: 21 - int a;
int arr[ ]={30,20,10};
int *ptr=&a[0]+1
Answer: To Be Added - What is included in instructions set architecture?
(a) number of registers
(b) clock cycle time or frequency of CPU
(c) number of cache levels
(d) cache size
Answer: (a) (b) - IPv4 packet has X written in its protocol field. Protocol X can't be
(a) IGMP
(b) ICMP
(c) RIP
(d) OSPF
Answer: (c) - Matrix A=[1 2], then A8=?
2 -1
Answer: 425I - Which of the follwoing is accepted as DPDA?
(a) Regular language
(b) All CFL
(c) All languages accepted NPDA
(d) All decidable langauges
Answer: (a) - In case of a 4 bit ripple counter, time period of the waveform is 64 microseconds. What is input frequency?
Answer: 250kHz
IIT Roorkee will release the GATE Provisional Answer Key 2025 by the last week of February 2025. Candidates are advised to visit the official website of GATE 2025 for regular updates. Use the memory-based GATE Shift 2 CS Question Paper 1st February 2025 and the unofficial answer key available here for personal reference.
GATE 2025 Subject-wise Expected Cutoff |
- GATE AG Expected Cutoff Marks 2025: Agricultural Engineering Qualifying Marks
- GATE MA Expected Cutoff Marks 2025: Mathematics Qualifying Marks
- GATE NM Expected Cutoff Marks 2025: Naval Architecture and Marine Engineering Qualifying Marks
- GATE MT Expected Cutoff Marks 2025: Metallurgical Engineering Qualifying Marks
- GATE TF Expected Cutoff Marks 2025: Textile Engineering and Fibre Science Qualifying Marks
- GATE IN Expected Cutoff Marks 2025: Instrumentation Engineering Qualifying Marks