GATE

WALLAH

GATE
2025 Memory based
QUESTION & SOLUTION

COMPUTER SCIENCE &

INFORMATION TECHNOLOGY
PAPER-I

Exam held on:

FOLLOW US:
1 FEBRUARY 2025
(MORNING SHIFT)
Mobile App Youtube Twitter facebook Telegram
QUESTION-1—MCQ
Which of the following used in compiler code optimization uses live variable analysis?
(a) strength reduction (b) register assignment of variable
(c) Constant folding (d) Run time function calling

SOLUTION: (b)
Register assignment of variable used in compiler code optimization uses live variable analysis.

QUESTION-2—MCQ
Consider the following recurrence relation
T(n) = 2T(n–1) + n * 2n; n > 0; T(0) = 1
The above recurrence relation is equivalent to
(a) (n2 2n) (b) ((log n)2 2n)
(c) (n 2n) (d) (4n)

SOLUTION: (a)
T(n) = 2k T (n – k) + 2n [n + (n – 1) + (n – 2) + … + (n – (k – 1))]
n ( n + 1)
T(n) = 2k T(n – k) + × 2n
2
T(n) =  (2n n2)

QUESTION-3—NAT
The height of any rooted tree is defined as the maximum number of edges in the path from root node
to any leaf node.
Suppose a min heap T stores 32 keys, the height of T is _______.

SOLUTION: (5)

| 1 |
No. of elements = 31; height = 4
If we add one more element then height will be 5.

QUESTION-4—MCQ
Consider the following grammar where S is start symbol, A, B are variables and {a, b} are terminals.
S → aaB | Abb; A → a|aA; B → b|bB
The language generated by above grammar (G) is:
(a) {an b2n | n g 1}  {a2n bn | n g 1} (b) {a2 bn | n g 1}  {an b2 | n g 1}
(c) {an bn | n g 1} (d) {a2n b2n | n g 1}
SOLUTION: (b)
S → aaB | Abb
A → a|aA → a+
B → b|bB → b+
S = {aab+  a+bb} = {a2 bn | n g 1}  {an b2 | n g 1}

QUESTION-5—MSQ
A regular language L is accepted by a NFA with n states, then which of the following is/are correct?
(a) Every DFA that accepts L has > 2n states
(b) L may have an accepting NFA with < n states
(c) There exists a DFA with f 2n states that accept L
(d) L may have an accepting DFA with < n states

SOLUTION: (b, c, d)
(a) Every DFA that accept L has> 2n states → False
(b) L may have an accepting NFA with < n states → True
(c) There exists a DFA with f 2n states that accept L → True
(d) L may have an accepting DFA with < n states → True

| 2 |
QUESTION-6—MSQ
Which of the following is true about any binary search tree with n distinct elements?
(a) Finding an element take O(log n) time in worst case
(b) Every BST is also a min heap
(c) An inorder traversal always produce sorted sequence of elements
(d) The maximum length of a path from root to any other node is (n–1).

SOLUTION: (c, d)
(a) Finding an element take O(log n) time in worst case → False
(b) Every BST is also a min heap → False
(c) An inorder traversal always produce sorted sequence of elements → True
(d) The maximum length of a path from root to any other node is (n–1) → True

QUESTION-7—MSQ
Which of the following is/are correct about first and follow?
(a) For A → ,  is added to first(A)
(b) If there is any right end input marker it will be added to first (S), S is start symbol.
(c) If there is any right end input marker it will be added to follow (S), S is start symbol.
(d) For A → ,  is added to follow(A)

SOLUTION: (a, c)
(a) For A → ,  is added to first(A) → True
(b) If there is any right end input marker it will be added to first (S), S is start symbol → False
(c) If there is any right end input marker it will be added to follow (S), S is start symbol → True
(d) For A → ,  is added to follow(A) → False

QUESTION-8—MCQ
Let G(V, E) be an undirected and unweighted graph with 100 vertices. Let d (u, v) denote the edges
in shortest path between u and v in V. Let the maximum value of d(u, v), u, v  V, such that u  v
be 30. Let T be any BFS tree of G. Which of the following is correct?
(a) The height of T exactly 30
(b) The height of T atleast 15
(c) The height of T exactly 15
(d) The height of T atleast 30

| 3 |
SOLUTION: (b)
(a) The height of T exactly 30 X - Incorrect. BFS ensures that the tree height is at most half the
diameter in the worst case.
(b) The height of T at least 15 Correct. The height of BFS tree is at least 15, depending on the
structure.
(c) The height of T exactly 15 × - Incorrect. While 15 is a reasonable height, it is not always exact
(d) The height of T at least 30 × Incorrect. The BFS tree cannot have a height more than the
diameter.
QUESTION-9—MCQ
Consider the following languages
L1 = {ñòñ | ñ  {a, b}+ and ò  {a, b}+}
L2 = {ñòñ | ñ  {a}+ and ò  {a, b}+}
Which of the following is correct?
(a) L1 CFL and L2 Regular (b) L1 is regular and L2 is CFL
(c) L1 is Regular and L2 Regular (d) None of these

SOLUTION: (a)
L1 = {ñòñ | ñ  {a, b}+ and ò  {a, b}+}
L2 = {ñòñ | ñ  {a}+ and ò  {a, b}+}
L1 CFL and L2 Regular

QUESTION-10—NAT
ù1 1ù
A=ú 13
ú ; then find the eigen value of A .
û1 − 1û

SOLUTION: ( ±64 2 )

ù1 1 ù
A=ú ú
û1 −1 û

 2 − 0 + ( −2 ) = 0

= 2

( 2)
13
eigen value of A 13 þ

=  64 2

| 4 |
QUESTION-11—NAT
int gate (int n) {
int d, t, newnum, turn;
newnum = turn = 0; t = 1;
while (n >= t) t *= 10;
t /= 10;
while (t > 0) {
d = n/t;
n = n % t;
t /= 10;
if (turn)
newnum = 10 * newnum + d;
turn = (turn + 1) % 2;
}
return newnum;
}
int main() {
printf(<%d=; gate (1 4 3 6 2));
return 0;
}
The value printed by the given C-prog is _________. (answer should be in integer)

SOLUTION: (46)
Program defines a function gate that processes the digits of an integer alternately based on the turn
variable. Initially, turn is set to 0, and the function processes each digit of the number starting from the
most significant one. If turn is 1, the digit is added to the result newnum, otherwise, it is skipped. For
the number 14362, the program adds digits 4 and 6 to newnum (when turn is 1) and skips the other
digits (1, 3, and 2). After processing all the digits, the final value of newnum is 46. The function returns
this value, and it is printed by the main function. Thus, the value printed by the program is 46.

QUESTION-12—NAT
In double hashing scheme, h1(k) = k mod 11 and h2(k) = 1+(k mod 7) are the auxiliary hash functions.
The size of the hash table is 11. The hash function for the ith probe in the open address table is
[h1 (k) + i h2 (k)] mod m. The following keys are inserted in the given order 63, 50, 25, 79, 67, 24.
The slot at which key 24 gets stored is __________(Answer should be in integer).

| 5 |
SOLUTION: (10)
h1(k) = kmod 11
h2(k) = 1 + k mod7
m = 11
ùû h1 ( k ) + i * h 2 ( k ) ùû %m

(1) 63 % 11 = 8
(2) 50 % 11 = 6
(3) 25 % 11 = 3
(4) 79 % 11 = 2
(5) 67 % 11 = 1
(6) 24 % 11 = 2
h2(24) = 1 + 24% 7
=1+3=4
2+1×4=6
2+2×4
0
67 1
79 2
25 3
4
5
50 6
7
63 8
9
24 10

QUESTION-13—NAT
Let LIST be a datatype for an implementation of linked list defined as follows:
typedef struct list {
int data;
struct list *next;
} LIST;
Suppose a program has created 829 linked-lists L1 & L2, whose contents are given in the figure
below (code for creating L1 & L2 is not provided here). L1 contains 9 nodes and L2 contains 7 nodes.

| 6 |
 Consider the following C-prog segment that modifies the list L1. The number of nodes that will be
there in L1 after execution of the code sequence is ________.

int find (int query, LIST *list) {

while (list != NULL) {
if (list → data == query) return 1;
list = list → next;
}
return 0;
}
int main (){
List ptr1 = L1; ptr2 = L2;
while (ptr1 → next! = NULL) {
query = ptr1 → next → data;
if ((find(query, L2))
ptr1 → next = ptr1 → next → next;
else
ptr1 = ptr1 → next;
}
return 0;
}

SOLUTION: (5)
The given problem involves two linked lists, L1 and L2, where L1 initially contains 9 nodes, and L2
contains 7 nodes. The C program iterates through L1, checking if each node9s next value exists in L2
using the find function. If a match is found, that node is removed by skipping it; otherwise, traversal
continues. The deletions occur systematically, removing nodes with values 11, 12, 9, 11, and 15 from
L1. After executing the program, the remaining nodes in L1 are 7, 3, 5, 6, and 8. The crucial point is
that 6 is retained in L1, leading to a total of 5 remaining nodes. The process ensures that only non-
matching elements persist, maintaining the linked list9s structure. Thus, after execution, the number of
nodes left in L1 is 5.

| 7 |
QUESTION-14—NAT
ÿ ax + b, x ü 1
ü
Let f ( x ) = ý 3 2
þ x + x + 1, x ó 1
ÿ

If f is differentiable at every point then value of b?

SOLUTION: (–2)
f(x) is differentiable so will continuous also.
üÿ ax + b, x ü1
f (x) = ý 3 2
ÿþ x + x + 1 x ó1

üÿ a x ü1
f '( x ) = ý 2
ÿþ 3x + 2x + 1 x ó1

At, x = 1,
LHL=RHL = f(1) & LHD = RHD
a+b=3 a=3+2
b = 3 – 5 = –2 a=6
QUESTION-15—MCQ
Which of the following is False?
(a) Symbol table is responsible for keeping track of scope of variable
(b) Symbol table is created during lexical analysis.
(c) Symbol table can be implemented using a BST
(d) Symbol table is not required after the parsing phase.

SOLUTION: (d)
(a) Symbol table is responsible for keeping track of scope of variable → True
(b) Symbol table is created during lexical analysis → True
(c) Symbol table can be implemented using a BST → True
(d) Symbol table is not required after the parsing phase → False
QUESTION-16—NAT
Let S be the ternary string over alphabets (a, b, c) All strings in S contain at least one occurrence of
two consecutive symbol that is aa, bb or cc. Such strings of length 5 that are possible is ____

SOLUTION: (195)
3 × 3 × 3 × 3 × 3 – 3×2×2×2×2
(3)5 – 48
= 243 – 48
= 195

| 8 |
QUESTION-17—MCQ
Let G be any undirected graph with positive weight and T be a MST of G for any two vertices u, v
Let d1 (u, v) and d2 (u, v) be the sortest distance between u and v in G and T respectively.
(a) d1 (u, v) = d2 (u, v) (b) d1 (u, v)  d2 (u, v)
(c) d1 (u, v) g d2 (u, v) (d) d1 (u, v) ≤ d2 (u, v)
SOLUTION: (d)
d1 (u, v) always ≤ d2 (u, v)

QUESTION-18—MCQ
Consider the following languages L1 and L2
L1 = {am bm cm+n | m, n g 1}
L2 = {am bn cm+n | m, n g 1}
Which of the following is correct?
(a) L1 CFL and L2 Regular (b) L1 and L2 both are CFL
(c) L1 is non-CFL and L2 CFL (d) L1 CSL and L2 is Regular

SOLUTION: (c)
L1 = {am bm cm+n | m, n g 1}
L2 = {am bn cm+n | m, n g 1}
• L1 is CSL
• L2 is CFL
QUESTION-19—NAT
Consider three address code segment. How many basic blocks are needed?
1001 i=1
1002 j=1
1003 t1 = 10 × i
1004 t2 = t 1 + j
1005 t3 = 8 ×t2
1006 t4 = t3 – 88
1007 a [t4] = 0.0
1008 j=j+1
1009 if j  10 go to 1003
1010 i=i+1
1011 if i  10 go to 1002
1012 i=i

| 9 |
 1013 t5 = i –1
1014 t6 = 88 ×t5
1015 a[t6] = 1.0
1016 i=i+1
1017 if i  1 10 go to 1013
SOLUTION: (6)
No. of blocks = 6

QUESTION-20—MCQ
Consider the following DFA

Which of the following is/are correct?

(a) Set of all string contains the pattern bab
(b) Set of all string contains n even number of b9s
(c) Set of all string contains ending with bab.
(d) Set of all string containing string aba
SOLUTION: (c)
(a) Set of all string contains the pattern bab → False
(b) Set of all string contains n even number of b9s → False
(c) Set of all string contains ending with bab.→ True
(d) Set of all string containing string aba → False

| 10 |
QUESTION-21—MCQ
A dice is thrown thrice find the probability of getting exactly one 6?
(a) 75/216 (b) 64/216
(c) 70/216 (d) None of these

SOLUTION: (a)
ö1 5 5ö ö5 1 5ö ö5 5 1ö 75
Required probability = ÷ ô ô ÷ + ÷ ô ô ÷ + ÷ ô ô ÷ =
ø6 6 6ø ø6 6 6ø ø6 6 6ø 216

QUESTION-22—MCQ
A box contains 5 coins 4 are real 1 is fake always head giving. if 1 coin is removed and tossed twice
the outcome is H and H what is the probability the coin was fake one
(a) 1/2 (b) 2/3
(c) 3/4 (d) None of these

SOLUTION: (a)

1
ô1ô1
1
P ( E1 / A ) = 5 =
1 4 1 1 2
ô1ô1 + ô ô
5 5 2 2

QUESTION-23—MCQ
In a max out B tree if an element is added what will happen
(a) nodes will never split (b) h of tree will increase
(c) at least 1 node will split (d) none of these

SOLUTION: (c)

| 11 |
QUESTION-24—MSQ
If -6 in 29s compliment is represented as 1010 in 4 bits. Then -6 is represented in 29s compliment as
(a) 1111 1010 in 8 bits (b) 1111 1111 1111 1010 in 16 bits
(c) 11110101 in 8 bits (d) 1111 1111 1111 0101 in 16 bits

SOLUTION: (a, b)
To write (–6)10 is 29s compliment representation we need minimum 4 bits and the representation is
(–6)10 = (1010)2 = –8 × 1 + 0 × 4 + 1 × 2 + 0 × 1 = (–6)10
we (–6)10 is 8 bit is = (1111 = 1010)2 (MSB is copied here)
(–6)10 is 16 bit
= (111111111111 1010) (MSB is copied here).

QUESTION-25—MCQ
Consider a computer system having 64 registers and 50 distinct instructions. The instruction size is
32 bits. How many bits will be required for the immediate value field in the below instructions?
ADD R1, #200 R1 ← R1 + 200
(a) 20 (b) 21
(c) 22 (d) 23
SOLUTION: (a)

Required operand = 6 bits ùú( log 2 50 ) ùú

Required = 64 ý
Number of instructions = 50 þ place
Instruction length = 32 bit
ADD RI #200
Instruction þ ,
  
opcode opcode Immedate value

Number of bits in immediate value filed = 20 bits

| 12 |
QUESTION-26—MCQ
Mother(y, x) means y is mother of x
Noteq(x, y) mean x and y are not same people the correct expression for the statement every one has
exactly one mother is?

SOLUTION: (*)
Every has exactly one mother
Mother (y, x) = y is mother of x
Note q (y, x) = y not equal to x
xy ( Mother x, y ) ù ~ z ( Mother ( z , x ) ù Noteq ( z , y ) )

ù ~ z ~ Mother ( z , x ) ú ~ Noteq ( z , y )

~ Noteq ( z, y ) ú ~ Mother ( z, x )
Noteq ( z , y ) − ~ Mother ( z , x )

QUESTION-27—NAT
void foo (int*p , int x)
{
*p = x
}
int main ( )
{
int * z;
int a = 20, b = 25;
z = & a;
foo(z, b);
printf(<%d=, a)
return 0;
}
Output is (answer should be in integer)

SOLUTION: (25)
a function foo is defined, which takes a pointer and an integer as arguments. Inside the function, *p =
x; assigns the value of x to the memory location pointed to by p. In main(), two integer variables a and
b are initialized with values 20 and 25, respectively. A pointer z is declared and assigned the address of
a using z = &a;. The function foo(z, b); is then called, passing the address of a and the value of b. Inside

| 13 |
foo, *p = x; effectively updates a to 25. When printf("%d", a); executes, it prints 25 because a was
modified through the pointer. Thus, the output of this program is 25.

QUESTION-28—NAT
The pseudocode of fun ( ) is given below:
fun (int A [0,……….., n-1]){
for (i = 0 to n–2)
for (j = 0 to n –i–2)
if (A [j] > A [j + 1])
then swap A[j] and A [j + 1]
}
Let A[0,…….., 29] be an array storing 30 distinct integer in descending order. The number of swap
operation that will be performed, if the function fun() is called with A [0,………,29] as argument is
(answer should be in integer).

SOLUTION: (465)
The given array is initially in descending order, the algorithm will perform the maximum number of
swaps to arrange it in ascending order. In Bubble Sort, for an array of size n, the number of swaps in
the worst case is given by the formula:
n −2
õ ( n − i − 1)
i=0

For the given array of size n = 30, the number of swaps will be:
28
õ ( 30 − i − 1) = ( 30 − 1) + ( 30 − 2 ) + ( 30 − 3 ) + ... + ( 30 − 29 )
i=0

This represents the sum of the first 29 natural numbers, which can be computed using the formula:
n (n + 1)
2
Substituting n = 29
29 ô 30
= 435
2
Thus, the total number of swap operations performed when the function is called with an array of 30
elements in descending order is 435.

| 14 |
QUESTION-29—NAT
int foo (int S[], int size) {
if (size == 0) return 0;
if (size == 1) return 1;
if (S[0] != S[1]) return 1 + foo (s +1, size–1)
return foo (S+1, size–1) ;
}
int main (){
int A [] = { 0, 1, 2, 2, 2, 0, 0, 1, 1})
printf (<%d=, foo (A, 9));
return 0;
}
The value printed is .

SOLUTION: (5)
The foo function recursively compares adjacent elements in the array, counting how many times
consecutive elements are different. If two elements are different, it adds 1 to the count and continues
with the subarray starting from the next element. If the elements are the same, it proceeds without
incrementing the count. Given the array A[] = { 0, 1, 2, 2, 2, 0, 0, 1, 1 }, the function will check each
pair and return the final count. After completing all recursive calls, the function returns a value of 5,
which is the result printed by the program.

QUESTION-30—NAT
L.A = 32 bit
P.A = 20 bit
P.S = 2048 B
Maximum number of entries in page table is ________.

SOLUTION: (221)
Logical address = 32 bits
Physical address = 20 bits

Page size = 2 KB = 211 or 2048 bytes

Max. no. of PT entries = No. of pages = 221

| 15 |
QUESTION-31—NAT
R1(x) W1(y) R2(x) R2(Y) R3(Y) abort (T1)
Which transactions will roll back along with T1?
Both T1 T3

SOLUTION: (*)
T2 and T3 will roll back

QUESTION-32—NAT
The Maximum value of x such that key between BC is included in every MST of given-

SOLUTION: (5)
Graph (G)

The maximum weight of x will be 5.

QUESTION-33—MCQ
In a computer system, there are two processors M1 and M2. There are four processes P1, P2, P3,
and P4 that arrives at the same time with burst time 20, 16, 25, and 10 respectively. Any process that
is ready to be scheduled must be scheduled immediately in the processor that is currently available.
Both the processors are using non-preemptive priority based scheduling algorithm with the
following priority order:
M1 = P1> P3 > P2 > P4 (P1 has highest priority and P4 has lowest priority)
M2 = P2 > P5 > P4 > P1 (P2 has highest priority and P1 has lowest priority)
The average waiting time is ____.
(a) 7.50 (b) 9.00
(c) 6.50 (d) 8.70

| 16 |
SOLUTION: (b)
2 Processor: M1, M2
AT BT
P1 0 20
P2 0 16
P3 0 25
P4 0 10

M1: P1 > P3 > P2 > P4

M2: P2 > P3 > P4 > P1
WT
P1 0
P2 0
P3 16
P4 20

36
Average WT = = 9.0
4

QUESTION-34—MCQ
Match the following
Layer Function/Services
Data link Framing and Error Control
Network layer Packet Routing
Transport layer Host to Host Communication

SOLUTION: (*)

| 17 |
QUESTION-35—NAT
Cache Memory

Asked average memory access -time =?

SOLUTION: (11.85ns)
0.95 ×10 + 0.5 × 0.85 × 20 + 0.05 × 0.15 × 200
= 11.85

QUESTION-36— MCQ
MM adds. = 20 bits
Direct = 1MB
MM size = 1 MB
Cache member = 16 KB
Block size = 16 bytes
Total bits to store entire Tag bits?
(a) 8× 210 (b) 6 × 210
(c) 10 × 210 (d) 4 × 210

SOLUTION: (b)

mm size = 1MB þ add = 20 bits

cm size = 16 kB = 214 B
Direct mapping
block = 16 bytes = 24 B
Total tag mem size = 6 × 210 byte

| 18 |
QUESTION-37 — MCQ
Question on Data path

What RA and RB can contain?

(a) Reg & Imm value
(b) Reg & Reg Arithmetic operation
(c) Only Reg & Reg Arithmetic operation
(d) Imme. & Imm. value Arithmetic operation

SOLUTION: (*)

QUESTION-38—MCQ
P1: content of pcb are stored in stack
P2: load interrupt service onto program counter
P3: complete current instruction execution
What will be the sequence
(a) P3, P1, P2 (b) P1, P3, P2
(c) P2, P3, P1 (d) P2, P1, P3

SOLUTION: (a)
Interrupt: If any interrupt occurs
P1: Content of PC stand on stack
P2: Load interrupt service onto program counter
P3: Complete current code execution
correct sequence: P3, P1, P2

| 19 |
QUESTION-39— MCQ

How many different states will be there in above counter:

SOLUTION: (8)
Given, counter is Johnson counter designed with n = 4 F Fs
Therefore, MOD no.
M = 2n = 2 × 4 = 8

QUESTION-40—NAT
ü 3
ÿ cx , 0üxü4
(f) f (x) = ý then P(2 < x < 3) = ?
ÿ
þ 0, otherwise

SOLUTION: (65/256)
4
0 cx
3
dx = 1

c4 4
=1
4
1
c= ,
64
ü x3
ÿ , 0üxü4
f (x) = ý 64
ÿ 0, otherwise
þ
3
p(2 ü x ü 3) = 2 f (x)dx
3
1 ö x4 ö 81 − 16
= ÷ ÷ =
64 ø 4 ø 2 64 ô 4
65
=
256

| 20 |
QUESTION-41—NAT
If 5-bit are transmitted & probability of flipping the bit is 0.01, then what is the probability that the
message received is error free?

SOLUTION: (0.951)
Pb = Probability that a bit is corrupted = 0.01
Packet size/length (L) = 5
Ans. = (1 – Pb) × (1 – Pb) × … (1 – Pb) = (1 – Pb)L
= (1 – 0.01)5 = 0.95099  0.950 or 0.951

QUESTION-42—NAT

Message = 15000 byte

Segment = (20 + 15000) byte = 15020 bytes
IPv4 header = 20 byte

SOLUTION: (7)

No. of IPv4 fragments reaches destination = 7

QUESTION-43—MCQ
f(b3, b2, b1, b0) = (0, 2, 4, 8, 10, 11, 12)
b3 is a most significant bit and b0 is the least significant bit. Then what will be the SOP(some of
product) of given Boolean function?
(a) b1 b 3 + b 2 b 3 + b 0 b1b 2 (b) b 0 b1 + b 2 b3 + b 0 b1b 2

(c) b 0 b1 + b 2 b 3 + b 0 b1 (d) None of these

| 21 |
SOLUTION: (a)

= b1 b3 + b 2 b3 + b 0 b1b 2

QUESTION-44—MCQ
Classless Routing Table
Addresses Next Hop
146.136.0.0/16 E1
146.136.128.0/17 E2

146.136.64.0/18 E3
146.136.255.0/24 E4
Default E5
Dest. IP add → 146.136.109.27
(a) E1 (b) E2
(c) E3 (d) E5

SOLUTION: (c)

QUESTION-45—NAT
In the given figure, find the ratio of area of a triangle is to area of trapezium if PQ || BC and height
of triangle is twice the height of trapezium.

| 22 |
SOLUTION: (4/3)

If height of trapezium = h

height of triangle = 3h

 PQ || BC, thus  ABC ~  APQ

height triangle 2
=
height of trapezium 1

BC 2 1
 = þ PQ = BC
PQ 1 2

1
ô BC ô 2 h
Area of  2
=
Area of trapezium 1 ö 1 ö
ô ÷ BC + BC ÷ h
2 ø 2 ø

2BC 2 4
= = 2 BC ô =
2BC + BC 3 BC 3
2

| 23 |
 SCAN FOR YOUTUBE

GATE Wallah (English) GATE Wallah

GATE
WALLAH

GATE Wallah EE, EC, CS & IN GATE Wallah ME, CE, XE & CH

Join us on our Youtube Channels

 GATE
WALLAH

THANK
YOU