Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Notes > GATE Computer Science Engineering(CSE) 2025 Mock Test Series > Gate (CS) 2013 Paper with Solution (Set A)
Gate (CS) 2013 Paper with Solution (Set A) | GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Computer Science Engineering (CSE) PDF Download
| Download, print and study this document offline |
Please wait while the PDF view is loading
Page 1
SESSION - 1
Page 2
SESSION - 1
2013 Question Booklet Code
CS-A
1/20
CS : COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Duration: Three Hours Maximum Marks: 100
Read the following instructions carefully.
1. Do not open the seal of the Question Booklet until you are asked to do so by the invigilator.
2. Take out the Optical Response Sheet (ORS) from this Question Booklet without breaking the seal
and read the instructions printed on the ORS carefully. If you find that either
a. The Question Booklet Code printed at the right hand top corner of this page does not match with
the Question Booklet Code at the right hand top corner of the ORS or
b. The Question Paper Code preceding the Registration number on the ORS is not CS,
then exchange the booklet immediately with a new sealed Question Booklet.
3. On the right hand side of the ORS, using ONLY a black ink ballpoint pen, (i) darken the appropriate
bubble under each digit of your registration number and (ii) write your registration number, your name
and name of the examination centre and put your signature at the specified location.
4. This Question Booklet contains 20 pages including blank pages for rough work. After you are
permitted to open the seal, check all pages and report discrepancies, if any, to the invigilator.
5. There are a total of 65 questions carrying 100 marks. All these questions are of objective type. Each
question has only one correct answer. Questions must be answered on the left hand side of the ORS
by darkening the appropriate bubble (marked A, B, C, D) using ONLY a black ink ballpoint pen
against the question number. For each question darken the bubble of the correct answer. More
than one answer bubbled against a question will be treated as an incorrect response.
6. Since bubbles darkened by the black ink ballpoint pen cannot be erased, candidates should darken the
bubbles in the ORS very carefully.
7. Questions Q.1 – Q.25 carry 1 mark each. Questions Q.26 – Q.55 carry 2 marks each. The 2 marks
questions include two pairs of common data questions and two pairs of linked answer questions. The
answer to the second question of the linked answer questions depends on the answer to the first
question of the pair. If the first question in the linked pair is wrongly answered or is not attempted,
then the answer to the second question in the pair will not be evaluated.
8. Questions Q.56 – Q.65 belong to General Aptitude (GA) section and carry a total of 15 marks.
Questions Q.56 – Q.60 carry 1 mark each, and questions Q.61 – Q.65 carry 2 marks each.
9. Questions not attempted will result in zero mark and wrong answers will result in NEGATIVE
marks. For all 1 mark questions, ? mark will be deducted for each wrong answer. For all 2 marks
questions, ? mark will be deducted for each wrong answer. However, in the case of the linked
answer question pair, there will be negative marks only for wrong answer to the first question and no
negative marks for wrong answer to the second question.
10. Calculator is allowed whereas charts, graph sheets or tables are NOT allowed in the examination hall.
11. Rough work can be done on the Question Booklet itself. Blank pages are provided at the end of the
Question Booklet for rough work.
12. Before the start of the examination, write your name and registration number in the space provided
below using a black ink ballpoint pen.
Name
Registration Number CS
A
Page 3
SESSION - 1
2013 Question Booklet Code
CS-A
1/20
CS : COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Duration: Three Hours Maximum Marks: 100
Read the following instructions carefully.
1. Do not open the seal of the Question Booklet until you are asked to do so by the invigilator.
2. Take out the Optical Response Sheet (ORS) from this Question Booklet without breaking the seal
and read the instructions printed on the ORS carefully. If you find that either
a. The Question Booklet Code printed at the right hand top corner of this page does not match with
the Question Booklet Code at the right hand top corner of the ORS or
b. The Question Paper Code preceding the Registration number on the ORS is not CS,
then exchange the booklet immediately with a new sealed Question Booklet.
3. On the right hand side of the ORS, using ONLY a black ink ballpoint pen, (i) darken the appropriate
bubble under each digit of your registration number and (ii) write your registration number, your name
and name of the examination centre and put your signature at the specified location.
4. This Question Booklet contains 20 pages including blank pages for rough work. After you are
permitted to open the seal, check all pages and report discrepancies, if any, to the invigilator.
5. There are a total of 65 questions carrying 100 marks. All these questions are of objective type. Each
question has only one correct answer. Questions must be answered on the left hand side of the ORS
by darkening the appropriate bubble (marked A, B, C, D) using ONLY a black ink ballpoint pen
against the question number. For each question darken the bubble of the correct answer. More
than one answer bubbled against a question will be treated as an incorrect response.
6. Since bubbles darkened by the black ink ballpoint pen cannot be erased, candidates should darken the
bubbles in the ORS very carefully.
7. Questions Q.1 – Q.25 carry 1 mark each. Questions Q.26 – Q.55 carry 2 marks each. The 2 marks
questions include two pairs of common data questions and two pairs of linked answer questions. The
answer to the second question of the linked answer questions depends on the answer to the first
question of the pair. If the first question in the linked pair is wrongly answered or is not attempted,
then the answer to the second question in the pair will not be evaluated.
8. Questions Q.56 – Q.65 belong to General Aptitude (GA) section and carry a total of 15 marks.
Questions Q.56 – Q.60 carry 1 mark each, and questions Q.61 – Q.65 carry 2 marks each.
9. Questions not attempted will result in zero mark and wrong answers will result in NEGATIVE
marks. For all 1 mark questions, ? mark will be deducted for each wrong answer. For all 2 marks
questions, ? mark will be deducted for each wrong answer. However, in the case of the linked
answer question pair, there will be negative marks only for wrong answer to the first question and no
negative marks for wrong answer to the second question.
10. Calculator is allowed whereas charts, graph sheets or tables are NOT allowed in the examination hall.
11. Rough work can be done on the Question Booklet itself. Blank pages are provided at the end of the
Question Booklet for rough work.
12. Before the start of the examination, write your name and registration number in the space provided
below using a black ink ballpoint pen.
Name
Registration Number CS
A
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 2/20
Q.1 to Q.25 carry one mark each.
Q.1 A binary operation ? on a set of integers is defined as
2 2
y x y x + = ? . Which one of the following
statements is TRUE about ??
(A) Commutative but not associative (B) Both commutative and associative
(C) Associative but not commutative (D) Neither commutative nor associative
Q.2 Suppose p is the number of cars per minute passing through a certain road junction between 5 PM
and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer
than 3 cars during any given minute in this interval?
(A) 8/(2e
3
) (B) 9/(2e
3
) (C) 17/(2e
3
) (D) 26/(2e
3
)
Q.3
Which one of the following does NOT equal
2
2
2
1
1
1
z z
y y
x x
?
(A)
( )
( )
( ) 1 1 1
1 1 1
1 1 1
+ +
+ +
+ +
z z z
y y y
x x x
(B)
1 1 1
1 1 1
1 1 1
2
2
2
+ +
+ +
+ +
z z
y y
x x
(C)
2
1
0
0
2 2
2 2
z z
z y z y
y x y x
- - - - (D)
2
2 2
2 2
1
2
2
z z
z y z y
y x y x
+ +
+ +
Q.4 The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(A) -256 (B) -128 (C) -127 (D) 0
Q.5 In the following truth table, V = 1 if and only if the input is valid.
Inputs Outputs
D
0
D
1
D
2
D
3
X
0
X
1
V
0 0 0 0 x x 0
1 0 0 0 0 0 1
x 1 0 0 0 1 1
x x 1 0 1 0 1
x x x 1 1 1 1
What function does the truth table represent?
(A) Priority encoder (B) Decoder
(C) Multiplexer (D) Demultiplexer
Q.6 Which one of the following is the tightest upper bound that represents the number of swaps
required to sort n numbers using selection sort?
(A) O(log n) (B) O(n) (C) O(n log n)
(D) O(n
2
)
Q.7 Which one of the following is the tightest upper bound that represents the time complexity of
inserting an object into a binary search tree of n nodes?
(A) O(1) (B) O(log n) (C) O(n) (D) O(n log n)
Page 4
SESSION - 1
2013 Question Booklet Code
CS-A
1/20
CS : COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Duration: Three Hours Maximum Marks: 100
Read the following instructions carefully.
1. Do not open the seal of the Question Booklet until you are asked to do so by the invigilator.
2. Take out the Optical Response Sheet (ORS) from this Question Booklet without breaking the seal
and read the instructions printed on the ORS carefully. If you find that either
a. The Question Booklet Code printed at the right hand top corner of this page does not match with
the Question Booklet Code at the right hand top corner of the ORS or
b. The Question Paper Code preceding the Registration number on the ORS is not CS,
then exchange the booklet immediately with a new sealed Question Booklet.
3. On the right hand side of the ORS, using ONLY a black ink ballpoint pen, (i) darken the appropriate
bubble under each digit of your registration number and (ii) write your registration number, your name
and name of the examination centre and put your signature at the specified location.
4. This Question Booklet contains 20 pages including blank pages for rough work. After you are
permitted to open the seal, check all pages and report discrepancies, if any, to the invigilator.
5. There are a total of 65 questions carrying 100 marks. All these questions are of objective type. Each
question has only one correct answer. Questions must be answered on the left hand side of the ORS
by darkening the appropriate bubble (marked A, B, C, D) using ONLY a black ink ballpoint pen
against the question number. For each question darken the bubble of the correct answer. More
than one answer bubbled against a question will be treated as an incorrect response.
6. Since bubbles darkened by the black ink ballpoint pen cannot be erased, candidates should darken the
bubbles in the ORS very carefully.
7. Questions Q.1 – Q.25 carry 1 mark each. Questions Q.26 – Q.55 carry 2 marks each. The 2 marks
questions include two pairs of common data questions and two pairs of linked answer questions. The
answer to the second question of the linked answer questions depends on the answer to the first
question of the pair. If the first question in the linked pair is wrongly answered or is not attempted,
then the answer to the second question in the pair will not be evaluated.
8. Questions Q.56 – Q.65 belong to General Aptitude (GA) section and carry a total of 15 marks.
Questions Q.56 – Q.60 carry 1 mark each, and questions Q.61 – Q.65 carry 2 marks each.
9. Questions not attempted will result in zero mark and wrong answers will result in NEGATIVE
marks. For all 1 mark questions, ? mark will be deducted for each wrong answer. For all 2 marks
questions, ? mark will be deducted for each wrong answer. However, in the case of the linked
answer question pair, there will be negative marks only for wrong answer to the first question and no
negative marks for wrong answer to the second question.
10. Calculator is allowed whereas charts, graph sheets or tables are NOT allowed in the examination hall.
11. Rough work can be done on the Question Booklet itself. Blank pages are provided at the end of the
Question Booklet for rough work.
12. Before the start of the examination, write your name and registration number in the space provided
below using a black ink ballpoint pen.
Name
Registration Number CS
A
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 2/20
Q.1 to Q.25 carry one mark each.
Q.1 A binary operation ? on a set of integers is defined as
2 2
y x y x + = ? . Which one of the following
statements is TRUE about ??
(A) Commutative but not associative (B) Both commutative and associative
(C) Associative but not commutative (D) Neither commutative nor associative
Q.2 Suppose p is the number of cars per minute passing through a certain road junction between 5 PM
and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer
than 3 cars during any given minute in this interval?
(A) 8/(2e
3
) (B) 9/(2e
3
) (C) 17/(2e
3
) (D) 26/(2e
3
)
Q.3
Which one of the following does NOT equal
2
2
2
1
1
1
z z
y y
x x
?
(A)
( )
( )
( ) 1 1 1
1 1 1
1 1 1
+ +
+ +
+ +
z z z
y y y
x x x
(B)
1 1 1
1 1 1
1 1 1
2
2
2
+ +
+ +
+ +
z z
y y
x x
(C)
2
1
0
0
2 2
2 2
z z
z y z y
y x y x
- - - - (D)
2
2 2
2 2
1
2
2
z z
z y z y
y x y x
+ +
+ +
Q.4 The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(A) -256 (B) -128 (C) -127 (D) 0
Q.5 In the following truth table, V = 1 if and only if the input is valid.
Inputs Outputs
D
0
D
1
D
2
D
3
X
0
X
1
V
0 0 0 0 x x 0
1 0 0 0 0 0 1
x 1 0 0 0 1 1
x x 1 0 1 0 1
x x x 1 1 1 1
What function does the truth table represent?
(A) Priority encoder (B) Decoder
(C) Multiplexer (D) Demultiplexer
Q.6 Which one of the following is the tightest upper bound that represents the number of swaps
required to sort n numbers using selection sort?
(A) O(log n) (B) O(n) (C) O(n log n)
(D) O(n
2
)
Q.7 Which one of the following is the tightest upper bound that represents the time complexity of
inserting an object into a binary search tree of n nodes?
(A) O(1) (B) O(log n) (C) O(n) (D) O(n log n)
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 3/20
Q.8
Consider the languages F =
1
L and { } a L =
2
. Which one of the following represents
1 2 1
L L L
* * U ?
(A) {?} (B) F (C) a* (D) {?, a}
Q.9 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a
grammar with no epsilon- and unit-production (i.e., of type A ? ? and A ? a) to parse a string
with n tokens?
(A) n/2 (B) n-1 (C) 2n-1 (D) 2
n
Q.10 A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process
starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every
T time units and decides the next process to schedule. Which one of the following is TRUE if the
processes have no I/O operations and all arrive at time zero?
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.
Q.11 Match the problem domains in GROUP I with the solution technologies in GROUP II.
GROUP I
GROUP II
(P) Service oriented computing (1) Interoperability
(Q) Heterogeneous communicating systems (2) BPMN
(R) Information representation (3) Publish-find-bind
(S) Process description (4) XML
(A) P-1, Q-2, R-3, S-4 (B) P-3, Q-4, R-2, S-1
(C) P-3, Q-1, R-4, S-2 (D) P-4, Q-3, R-2, S-1
Q.12 The transport layer protocols used for real time multimedia, file transfer, DNS and email,
respectively are
(A) TCP, UDP, UDP and TCP
(B) UDP, TCP, TCP and UDP
(C) UDP, TCP, UDP and TCP
(D) TCP, UDP, TCP and UDP
Q.13 Using public key cryptography, X adds a digital signature s to message M, encrypts <M, s>, and
sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the
operations?
(A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed
by Y’s public key
(B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed
by Y’s private key
(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed
by X’s private key
(D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed
by X’s public key
Page 5
SESSION - 1
2013 Question Booklet Code
CS-A
1/20
CS : COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Duration: Three Hours Maximum Marks: 100
Read the following instructions carefully.
1. Do not open the seal of the Question Booklet until you are asked to do so by the invigilator.
2. Take out the Optical Response Sheet (ORS) from this Question Booklet without breaking the seal
and read the instructions printed on the ORS carefully. If you find that either
a. The Question Booklet Code printed at the right hand top corner of this page does not match with
the Question Booklet Code at the right hand top corner of the ORS or
b. The Question Paper Code preceding the Registration number on the ORS is not CS,
then exchange the booklet immediately with a new sealed Question Booklet.
3. On the right hand side of the ORS, using ONLY a black ink ballpoint pen, (i) darken the appropriate
bubble under each digit of your registration number and (ii) write your registration number, your name
and name of the examination centre and put your signature at the specified location.
4. This Question Booklet contains 20 pages including blank pages for rough work. After you are
permitted to open the seal, check all pages and report discrepancies, if any, to the invigilator.
5. There are a total of 65 questions carrying 100 marks. All these questions are of objective type. Each
question has only one correct answer. Questions must be answered on the left hand side of the ORS
by darkening the appropriate bubble (marked A, B, C, D) using ONLY a black ink ballpoint pen
against the question number. For each question darken the bubble of the correct answer. More
than one answer bubbled against a question will be treated as an incorrect response.
6. Since bubbles darkened by the black ink ballpoint pen cannot be erased, candidates should darken the
bubbles in the ORS very carefully.
7. Questions Q.1 – Q.25 carry 1 mark each. Questions Q.26 – Q.55 carry 2 marks each. The 2 marks
questions include two pairs of common data questions and two pairs of linked answer questions. The
answer to the second question of the linked answer questions depends on the answer to the first
question of the pair. If the first question in the linked pair is wrongly answered or is not attempted,
then the answer to the second question in the pair will not be evaluated.
8. Questions Q.56 – Q.65 belong to General Aptitude (GA) section and carry a total of 15 marks.
Questions Q.56 – Q.60 carry 1 mark each, and questions Q.61 – Q.65 carry 2 marks each.
9. Questions not attempted will result in zero mark and wrong answers will result in NEGATIVE
marks. For all 1 mark questions, ? mark will be deducted for each wrong answer. For all 2 marks
questions, ? mark will be deducted for each wrong answer. However, in the case of the linked
answer question pair, there will be negative marks only for wrong answer to the first question and no
negative marks for wrong answer to the second question.
10. Calculator is allowed whereas charts, graph sheets or tables are NOT allowed in the examination hall.
11. Rough work can be done on the Question Booklet itself. Blank pages are provided at the end of the
Question Booklet for rough work.
12. Before the start of the examination, write your name and registration number in the space provided
below using a black ink ballpoint pen.
Name
Registration Number CS
A
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 2/20
Q.1 to Q.25 carry one mark each.
Q.1 A binary operation ? on a set of integers is defined as
2 2
y x y x + = ? . Which one of the following
statements is TRUE about ??
(A) Commutative but not associative (B) Both commutative and associative
(C) Associative but not commutative (D) Neither commutative nor associative
Q.2 Suppose p is the number of cars per minute passing through a certain road junction between 5 PM
and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer
than 3 cars during any given minute in this interval?
(A) 8/(2e
3
) (B) 9/(2e
3
) (C) 17/(2e
3
) (D) 26/(2e
3
)
Q.3
Which one of the following does NOT equal
2
2
2
1
1
1
z z
y y
x x
?
(A)
( )
( )
( ) 1 1 1
1 1 1
1 1 1
+ +
+ +
+ +
z z z
y y y
x x x
(B)
1 1 1
1 1 1
1 1 1
2
2
2
+ +
+ +
+ +
z z
y y
x x
(C)
2
1
0
0
2 2
2 2
z z
z y z y
y x y x
- - - - (D)
2
2 2
2 2
1
2
2
z z
z y z y
y x y x
+ +
+ +
Q.4 The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(A) -256 (B) -128 (C) -127 (D) 0
Q.5 In the following truth table, V = 1 if and only if the input is valid.
Inputs Outputs
D
0
D
1
D
2
D
3
X
0
X
1
V
0 0 0 0 x x 0
1 0 0 0 0 0 1
x 1 0 0 0 1 1
x x 1 0 1 0 1
x x x 1 1 1 1
What function does the truth table represent?
(A) Priority encoder (B) Decoder
(C) Multiplexer (D) Demultiplexer
Q.6 Which one of the following is the tightest upper bound that represents the number of swaps
required to sort n numbers using selection sort?
(A) O(log n) (B) O(n) (C) O(n log n)
(D) O(n
2
)
Q.7 Which one of the following is the tightest upper bound that represents the time complexity of
inserting an object into a binary search tree of n nodes?
(A) O(1) (B) O(log n) (C) O(n) (D) O(n log n)
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 3/20
Q.8
Consider the languages F =
1
L and { } a L =
2
. Which one of the following represents
1 2 1
L L L
* * U ?
(A) {?} (B) F (C) a* (D) {?, a}
Q.9 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a
grammar with no epsilon- and unit-production (i.e., of type A ? ? and A ? a) to parse a string
with n tokens?
(A) n/2 (B) n-1 (C) 2n-1 (D) 2
n
Q.10 A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process
starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every
T time units and decides the next process to schedule. Which one of the following is TRUE if the
processes have no I/O operations and all arrive at time zero?
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.
Q.11 Match the problem domains in GROUP I with the solution technologies in GROUP II.
GROUP I
GROUP II
(P) Service oriented computing (1) Interoperability
(Q) Heterogeneous communicating systems (2) BPMN
(R) Information representation (3) Publish-find-bind
(S) Process description (4) XML
(A) P-1, Q-2, R-3, S-4 (B) P-3, Q-4, R-2, S-1
(C) P-3, Q-1, R-4, S-2 (D) P-4, Q-3, R-2, S-1
Q.12 The transport layer protocols used for real time multimedia, file transfer, DNS and email,
respectively are
(A) TCP, UDP, UDP and TCP
(B) UDP, TCP, TCP and UDP
(C) UDP, TCP, UDP and TCP
(D) TCP, UDP, TCP and UDP
Q.13 Using public key cryptography, X adds a digital signature s to message M, encrypts <M, s>, and
sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the
operations?
(A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed
by Y’s public key
(B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed
by Y’s private key
(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed
by X’s private key
(D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed
by X’s public key
2013 COMPUTER SCIENCE & INFORMATION TECH. - CS
CS-A 4/20
Q.14 Assume that source S and destination D are connected through two intermediate routers labeled R.
Determine how many times each packet has to visit the network layer and the data link layer during
a transmission from S to D.
(A) Network layer – 4 times and Data link layer – 4 times
(B) Network layer – 4 times and Data link layer – 3 times
(C) Network layer – 4 times and Data link layer – 6 times
(D) Network layer – 2 times and Data link layer – 6 times
Q.15 An index is clustered, if
(A) it is on a set of fields that form a candidate key.
(B) it is on a set of fields that include the primary key.
(C) the data records of the file are organized in the same order as the data entries of the index.
(D) the data records of the file are organized not in the same order as the data entries of the index.
Q.16 Three concurrent processes X, Y, and Z execute three different code segments that access and
update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores
a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the
P operation on semaphores c, d, and a before entering the respective code segments. After
completing the execution of its code segment, each process invokes the V operation (i.e., signal) on
its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the
following represents a deadlock-free order of invoking the P operations by the processes?
(A) X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
(B) X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
(C) X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
(D) X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)
Q.17 Which of the following statements is/are FALSE?
1. For every non-deterministic Turing machine, there exists an equivalent deterministic
Turing machine.
2. Turing recognizable languages are closed under union and complementation.
3. Turing decidable languages are closed under intersection and complementation.
4. Turing recognizable languages are closed under union and intersection.
(A) 1 and 4 only (B) 1 and 3 only (C) 2 only (D) 3 only
Q.18
Which of the following statements are TRUE?
1. The problem of determining whether there exists a cycle in an undirected graph is in P.
2. The problem of determining whether there exists a cycle in an undirected graph is in NP.
3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm
to solve A.
(A) 1, 2 and 3 (B) 1 and 2 only (C) 2 and 3 only (D) 1 and 3 only
Read More
FAQs on Gate (CS) 2013 Paper with Solution (Set A) - GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Computer Science Engineering (CSE)
| 1. What is the Gate (CS) 2013 Paper? |  |
Ans. The Gate (CS) 2013 Paper refers to the Computer Science paper conducted in the Graduate Aptitude Test in Engineering (GATE) exam in the year 2013. It is an exam for admission to postgraduate programs in engineering and technology.
| 2. How can I access the Gate (CS) 2013 Paper with Solution? | |
Ans. You can access the Gate (CS) 2013 Paper with Solution by searching for it online. Many websites and forums provide previous year question papers and their solutions. You can also check official GATE websites for resources.
| 3. What is the importance of solving previous year question papers for GATE (CS) exam preparation? | |
Ans. Solving previous year question papers is crucial for GATE (CS) exam preparation as it helps in understanding the exam pattern, types of questions asked, and the level of difficulty. It gives candidates a real-time experience of the exam and helps them identify their strengths and weaknesses.
| 4. Are the questions in the Gate (CS) 2013 Paper still relevant for the current GATE (CS) exam? | |
Ans. While the Gate (CS) 2013 Paper may not directly reflect the current question pattern, it still holds relevance for GATE (CS) exam preparation. The concepts and topics covered in the previous year papers are still a part of the syllabus, and practicing them can enhance your understanding of the subject.
| 5. Can I rely solely on the Gate (CS) 2013 Paper with Solution for my GATE (CS) exam preparation? | |
Ans. While solving the Gate (CS) 2013 Paper with Solution is beneficial, it is not advisable to rely solely on it for GATE (CS) exam preparation. It is essential to study the entire syllabus, refer to multiple resources, and solve a variety of practice questions to increase your chances of success in the exam.
Related Exams
About this Document
|
4.62/5 Rating |
|
Dec 18, 2024 Last updated |
Document Description: Gate (CS) 2013 Paper with Solution (Set A) for Computer Science Engineering (CSE) 2024 is part of GATE Computer Science Engineering(CSE) 2025 Mock Test Series preparation.
The notes and questions for Gate (CS) 2013 Paper with Solution (Set A) have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Gate (CS) 2013 Paper with Solution (Set A) covers topics
like and Gate (CS) 2013 Paper with Solution (Set A) Example, for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises and tests below for Gate (CS) 2013 Paper with Solution (Set A).
Introduction of Gate (CS) 2013 Paper with Solution (Set A) in English is available as part of our GATE Computer Science Engineering(CSE) 2025 Mock Test Series
for Computer Science Engineering (CSE) & Gate (CS) 2013 Paper with Solution (Set A) in Hindi for GATE Computer Science Engineering(CSE) 2025 Mock Test Series course.
Download more important topics related with notes, lectures and mock test series for Computer Science Engineering (CSE)
Exam by signing up for free. Computer Science Engineering (CSE): Gate (CS) 2013 Paper with Solution (Set A) | GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Computer Science Engineering (CSE)
Description
Full syllabus notes, lecture & questions for Gate (CS) 2013 Paper with Solution (Set A) | GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Computer Science Engineering (CSE) - Computer Science Engineering (CSE) | Plus excerises question with solution to help you revise complete syllabus for GATE Computer Science Engineering(CSE) 2025 Mock Test Series | Best notes, free PDF download
Information about Gate (CS) 2013 Paper with Solution (Set A)
In this doc you can find the meaning of Gate (CS) 2013 Paper with Solution (Set A) defined & explained in the simplest way possible. Besides explaining types of
Gate (CS) 2013 Paper with Solution (Set A) theory, EduRev gives you an ample number of questions to practice Gate (CS) 2013 Paper with Solution (Set A) tests, examples and also practice Computer Science Engineering (CSE)
tests
|
55 docs|215 tests
|
Download as PDF
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
Related Searches
study material
,practice quizzes
,Sample Paper
,Extra Questions
,Gate (CS) 2013 Paper with Solution (Set A) | GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Computer Science Engineering (CSE)
,mock tests for examination
,Important questions
,Gate (CS) 2013 Paper with Solution (Set A) | GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Computer Science Engineering (CSE)
,shortcuts and tricks
,Summary
,Gate (CS) 2013 Paper with Solution (Set A) | GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Computer Science Engineering (CSE)
,Exam
,video lectures
,ppt
,Viva Questions
,Free
,past year papers
,MCQs
,Objective type Questions
,Semester Notes
,Previous Year Questions with Solutions
;
Additional Information about Gate (CS) 2013 Paper with Solution (Set A) for Computer Science Engineering (CSE) Preparation
Gate (CS) 2013 Paper with Solution (Set A) Free PDF Download
The Gate (CS) 2013 Paper with Solution (Set A) is an invaluable resource that delves deep into the core of the Computer Science Engineering (CSE) exam.
These study notes are curated by experts and cover all the essential topics and concepts, making your preparation more efficient and effective.
With the help of these notes, you can grasp complex subjects quickly, revise important points easily,
and reinforce your understanding of key concepts. The study notes are presented in a concise and easy-to-understand manner,
allowing you to optimize your learning process. Whether you're looking for best-recommended books, sample papers, study material,
or toppers' notes, this PDF has got you covered. Download the Gate (CS) 2013 Paper with Solution (Set A) now and kickstart your journey towards success in the Computer Science Engineering (CSE) exam.
Importance of Gate (CS) 2013 Paper with Solution (Set A)
The importance of Gate (CS) 2013 Paper with Solution (Set A) cannot be overstated, especially for Computer Science Engineering (CSE) aspirants.
This document holds the key to success in the Computer Science Engineering (CSE) exam.
It offers a detailed understanding of the concept, providing invaluable insights into the topic.
By knowing the concepts well in advance, students can plan their preparation effectively.
Utilize this indispensable guide for a well-rounded preparation and achieve your desired results.
Gate (CS) 2013 Paper with Solution (Set A) Notes
Gate (CS) 2013 Paper with Solution (Set A) Notes offer in-depth insights into the specific topic to help you master it with ease.
This comprehensive document covers all aspects related to Gate (CS) 2013 Paper with Solution (Set A).
It includes detailed information about the exam syllabus, recommended books, and study materials for a well-rounded preparation.
Practice papers and question papers enable you to assess your progress effectively.
Additionally, the paper analysis provides valuable tips for tackling the exam strategically.
Access to Toppers' notes gives you an edge in understanding complex concepts.
Whether you're a beginner or aiming for advanced proficiency, Gate (CS) 2013 Paper with Solution (Set A) Notes on EduRev are your ultimate resource for success.
Gate (CS) 2013 Paper with Solution (Set A) Computer Science Engineering (CSE) Questions
The "Gate (CS) 2013 Paper with Solution (Set A) Computer Science Engineering (CSE) Questions" guide is a valuable resource for all aspiring students preparing for the
Computer Science Engineering (CSE) exam. It focuses on providing a wide range of practice questions to help students gauge
their understanding of the exam topics. These questions cover the entire syllabus, ensuring comprehensive preparation.
The guide includes previous years' question papers for students to familiarize themselves with the exam's format and difficulty level.
Additionally, it offers subject-specific question banks, allowing students to focus on weak areas and improve their performance.
Study Gate (CS) 2013 Paper with Solution (Set A) on the App
Students of Computer Science Engineering (CSE) can study Gate (CS) 2013 Paper with Solution (Set A) alongwith tests & analysis from the EduRev app,
which will help them while preparing for their exam. Apart from the Gate (CS) 2013 Paper with Solution (Set A),
students can also utilize the EduRev App for other study materials such as previous year question papers, syllabus, important questions, etc.
The EduRev App will make your learning easier as you can access it from anywhere you want.
The content of Gate (CS) 2013 Paper with Solution (Set A) is prepared as per the latest Computer Science Engineering (CSE) syllabus.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup