2023 2024 MBA - GATE Computer Science Paper With Solution

Here I am giving you solved question paper for GATE Computer Science engineering examination in a File attached with it so you can get it easily.

1. Consider an undirected random graph of eight vertices. The probability that there is an edge
between a pair of vertices is ½. What is the expected number of unordered cycles of length
three?
(A) 1/8 (B) 1 (C) 7 (D) 8
2. Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
(A) P only (B) Q only
(C) Both P and Q (D) Neither P nor Q
Answer:- (C)

6. In a k-way set associative cache, the cache is divided into v sets, each of which consists of k
lines. The lines of a set are placed in sequence one after another. The lines in set s are
sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards.
The main memory block numbered j must be mapped to any one of the cache lines from
(A) ( ) ( ) ( ) j mod v *k to j mod v *k k 1 + −
(B) ( ) ( ) ( ) j mod v to j mod v k 1 + −
(C) ( ) ( ) ( ) j mod k to j mod k v 1 + −
(D) ( ) ( ) ( ) j mod k * v to j mod k * v v 1 + −
Answer: -(A)

7. What is the time complexity of Bellman-Ford single-source shortest path algorithm on a
complete graph of n vertices?
(A) ( ) 2 n Q (B) ( ) 2 n log n Q (C) ( ) 3 n Q (D) ( ) 3 n log n Q
Answer:-(C)

8. 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
Answer: -(A)

9. 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
Answer: -(C)

GATE Computer Science Paper With Solution
http://mba.ind.in/images/GATE-Comput...Solution-1.jpg
http://mba.ind.in/images/GATE-Comput...Solution-2.jpg
http://mba.ind.in/images/GATE-Comput...Solution-3.jpg
http://mba.ind.in/images/GATE-Comput...Solution-4.jpg