GATE Computer Science question papers

I want to give GATE (Graduate Aptitude Test in Engineering) exam.Can you please provide the question papers of Computer Science for an idea?

Question paper of Computer Science for GATE(Graduate Aptitude Test in Engineering) exam is given below:

1.In a compiler, keywords of a language are recognized during
(A) parsing of the program
(B) the code generation
(C) the lexical analysis of the program
(D) dataflow analysis
Answer: (C)

2 .A layer-4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT
(A) block entire HTTP traffic during 9:00PM and 5 :0OAM
(B) block all ICMP traffic
(C) stop incoming traffic from a specific IP address but allow outgoing traffic to the same IP address
(D) block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM
Answer: (A)

3 .If two fair coins are flipped and at least one of the outcomes is known to be a head, what is the probability that both outcomes are heads?
(A) 1/3
(B) 1/4
(C) 1/2
(D) 2/3
Answer: (A)

4. Consider different activities related to email. m1: Send an email from a mail client to a mail server m2: Download an email from mailbox server to a mail client m3: Checking email in a web browser Which is the application level protocol used in each activity?
(A) ml: HTTP m2: SMTP m3: POP
(B) ml: SMTP m2: FTP m3: HTTP
(C) ml: SMTP m2: POP m3: HTTP
(D) ml: POP m2: SMTP m3: IMAP
Answer: (C)

5 Let the time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2. Which of the following is TRUE? (A) t1 > t2
(B) t1 = t2
(C) t1 < t2
(D) nothing can be said about the relation betweent1 and t2

For more questions here I am giving attachment

Attached Files Available for Download

GATE Computer Science question paper.pdf (368.8 KB, 41 views)

__________________
Answered By StudyChaCha Member

You need GATE Computer Science question paper, here I am giving;

1. Which one of the following in NOT necessarily a property of a Group?

(A) Commutativity (B) Associativity

(C) Existence of inverse for every element (D) Existence of identity



2. What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n = 2.

(A) 2 (B) 3

(C) n-1 (D) n



3. Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?

(A) No two vertices have the same degree.

(B) At least two vertices have the same degree.

(C) At least three vertices have the same degree.

(D) All vertices have the same degree.



4. Consider the binary relation R = {(x,y), (x,z), (z,x), (z,y)} on the set {x,y,z}.

Which one of the following is TRUE?

(A) R is symmetric but NOT antisymmetric

(B) R is NOT symmetric but antisymmetric

(C) R is both symmetric and antisymmetric

(D) R is neither symmetric nor antisymmetric



5. (1217)8 is equivalent t o

(A) (1217)16 (B) (028F)16 (C) (2297)10 (D) (0B17)16



6. What is the minimum number of gates required to implement the Boolean function (AB+C) if we have to use only 2-input NOR gates?

(A) 2 (B) 3 (C) 4 (D) 5



7. How many 32K ´ 1 RAM chips are needed to provide a memory capacity of 256K-bytes?

(A) 8 (B) 32 (C) 64 (D) 128



8. A CPU generally handles an interrupt by executing an interrupt service routine

(A) As soon as an interrupt is raised

(B) By checking the interrupt register at the end of fetch cycle.

(C) By checking the interrupt register after finishing the execution of the current instruction.

(D) By checking the interrupt register at fixed time intervals.



9. In which one of t he following page replacement policies, Belady's anomaly may occur?

(A) FIFO (B) Optimal (C) LRU (D) MRU



10. The essential content (s) in each entry of a page table is / are

(A) Virtual page number

(B) Page frame number

(C) Both virtual page number and page frame number

(D) Access right information



11. What is the number of swaps required t o sort n elements using selection sort, in the worst case?

(A) q(n) (B) q(n log n) (C) q(n2) (D) q(n2 log n)



12. S ® aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of

(A) All palindromes.

(B) All odd length palindromes.

(C) Strings that begin and end with the same symbol

(D) All even length palindromes.



13. Which of the following statement (s) is / are correct regarding Bellman-Ford shortest path algorithm?

P. Always finds a negative weighted cycle, if one exist s.

Q. Finds whether any negative weighted cycle is reachable from the source.

(A) P only (B) Q only

(C) both P and Q (D) Neither P nor Q



14. Let pA be a problem that belongs to the class NP. Then which one of the following is TRUE?

(A) There is no polynomial time algorithm for pA.

(B) If pA can be solved deterministically in polynomial time, then P = NP.

(C) If pA is NP-hard, then it is NP-complete.

(D) pA may be undecidable.



15. Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

(A) The set of all strings containing the substring 00.

(B) The set of all strings containing at most two 0's.

(C) The set of all strings containing at least two 0's.

(D) The set of all strings that begin and end with either 0 or 1.



16. Which one of the following is FALSE?

(A) There is unique minimal DFA for every regular language

(B) Every NFA can be convert ed to an equivalent PDA.

(C) Complement of every context-free language is recursive.

(D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.


For detailed paper, here is attachment:

Attached Files Available for Download

GATE CSE paper.doc (118.5 KB, 26 views)

__________________
Answered By StudyChaCha Member

You need GATE Computer Science question paper, here I am giving;

1. Which one of the following in NOT necessarily a property of a Group?

(A) Commutativity (B) Associativity

(C) Existence of inverse for every element (D) Existence of identity



2. What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n = 2.

(A) 2 (B) 3

(C) n-1 (D) n



3. Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?

(A) No two vertices have the same degree.

(B) At least two vertices have the same degree.

(C) At least three vertices have the same degree.

(D) All vertices have the same degree.



4. Consider the binary relation R = {(x,y), (x,z), (z,x), (z,y)} on the set {x,y,z}.

Which one of the following is TRUE?

(A) R is symmetric but NOT antisymmetric

(B) R is NOT symmetric but antisymmetric

(C) R is both symmetric and antisymmetric

(D) R is neither symmetric nor antisymmetric



5. (1217)8 is equivalent t o

(A) (1217)16 (B) (028F)16 (C) (2297)10 (D) (0B17)16



6. What is the minimum number of gates required to implement the Boolean function (AB+C) if we have to use only 2-input NOR gates?

(A) 2 (B) 3 (C) 4 (D) 5



7. How many 32K ´ 1 RAM chips are needed to provide a memory capacity of 256K-bytes?

(A) 8 (B) 32 (C) 64 (D) 128



8. A CPU generally handles an interrupt by executing an interrupt service routine

(A) As soon as an interrupt is raised

(B) By checking the interrupt register at the end of fetch cycle.

(C) By checking the interrupt register after finishing the execution of the current instruction.

(D) By checking the interrupt register at fixed time intervals.



9. In which one of t he following page replacement policies, Belady's anomaly may occur?

(A) FIFO (B) Optimal (C) LRU (D) MRU



10. The essential content (s) in each entry of a page table is / are

(A) Virtual page number

(B) Page frame number

(C) Both virtual page number and page frame number

(D) Access right information



11. What is the number of swaps required t o sort n elements using selection sort, in the worst case?

(A) q(n) (B) q(n log n) (C) q(n2) (D) q(n2 log n)



12. S ® aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of

(A) All palindromes.

(B) All odd length palindromes.

(C) Strings that begin and end with the same symbol

(D) All even length palindromes.



13. Which of the following statement (s) is / are correct regarding Bellman-Ford shortest path algorithm?

P. Always finds a negative weighted cycle, if one exist s.

Q. Finds whether any negative weighted cycle is reachable from the source.

(A) P only (B) Q only

(C) both P and Q (D) Neither P nor Q



14. Let pA be a problem that belongs to the class NP. Then which one of the following is TRUE?

(A) There is no polynomial time algorithm for pA.

(B) If pA can be solved deterministically in polynomial time, then P = NP.

(C) If pA is NP-hard, then it is NP-complete.

(D) pA may be undecidable.



15. Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

(A) The set of all strings containing the substring 00.

(B) The set of all strings containing at most two 0's.

(C) The set of all strings containing at least two 0's.

(D) The set of all strings that begin and end with either 0 or 1.



16. Which one of the following is FALSE?

(A) There is unique minimal DFA for every regular language

(B) Every NFA can be convert ed to an equivalent PDA.

(C) Complement of every context-free language is recursive.

(D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.


For detailed paper, here is attachment:

__________________
Answered By StudyChaCha Member