2020 2021 2022 MBA > MBA
 User Name Remember Me? Password

#1
20th October 2014, 03:25 PM
 Unregistered Guest
GATE Computer Science Paper With Solution

Can you give me solved question paper for GATE Computer Science engineering examination ?
#2
21st October 2014, 10:11 AM
 Super Moderator Join Date: May 2012
Re: 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

Attached Files
 GATE Computer Science Paper With Solution.pdf (311.0 KB, 66 views)

 Similar Threads Thread Thread Starter Forum Replies Last Post Unregistered Main Forum 1 27th October 2016 02:58 PM Unregistered Online MBA Discussions 1 21st November 2015 12:16 PM Unregistered Main Forum 1 5th November 2015 01:04 PM Unregistered Main Forum 0 17th July 2015 11:20 AM Unregistered Main Forum 0 16th July 2015 11:37 AM Unregistered Main Forum 0 16th July 2015 08:59 AM Unregistered Main Forum 0 13th July 2015 03:27 PM Unregistered Main Forum 0 9th July 2015 08:47 AM Unregistered Main Forum 1 27th October 2014 10:37 AM Unregistered Main Forum 1 27th October 2014 10:32 AM azmat ullahma Main Forum 1 18th March 2013 04:31 PM runumas Main Forum 1 31st January 2013 02:08 PM rajivkumar78 Main Forum 1 7th December 2012 03:36 PM Unregistered Main Forum 1 26th November 2012 10:25 AM pravin manghana Main Forum 1 21st September 2012 05:05 PM SRIGANESH. Main Forum 1 6th September 2012 05:44 PM fashana banu Main Forum 1 28th June 2012 08:46 PM raj_kumar Main Forum 1 22nd June 2012 02:55 PM sonu johny Main Forum 1 16th June 2012 11:23 AM

Quick Reply
 Your Username: Click here to log in

Message:
Options

 Thread Tools Search this Thread

All times are GMT +5.5. The time now is 12:48 AM.

 -- Default Style -- Lightweight Contact Us - MBA.ind.in Blog MBA.ind.in Discussion Forum - Archive - Top Powered by : Eduvark | Courses Our Contributors : StudyChaCha | Management Forum | InfoVerdict | FindJobs | Ejobs | Plan for Exam

Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2022, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2