Previous year solved question papers of GATE Computer Science

Any buddy, please provide me the Previous year solved question papers of GATE Computer Science……..

Yes sure, here I am uploading a pdf file that contains the previous year solved question papers of GATE Computer Science; you can use this question paper in your studies. This is the content of attachment:

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

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

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

A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is given as 2.8 for the software development on embedded systems, while the exponentiation factor is given as 1.20. What is the estimated effort in person -months?

(A) 234.25

(B) 932.50

(C) 287.80

(D) 122.40

Rests of the questions are in the attachment, please click on it……..

Attached Files Available for Download

GATE Computer Science Previous year solved question paper.doc (314.5 KB, 70 views)

__________________
Answered By StudyChaCha Member

Here I am providing the list of few questions of GATE Computer Science exam question paper which you are looking for .

1. What does the following C-statement declare?
int ( * f) (int * );
(a) A function that takes an integer pointer as argument and returns an integer
(b) A function that takes an integer as argument and returns an integer pointer
(c) A pointer to a function that takes an integer pointer as argument and returns an integer.
(d) A function that takes an integer pointer as argument and returns a function pointer

2. An Abstract Data Type (ADT) is:
(a) same as an abstract class
(b) a data type that cannot be instantiated
(c) a data type type for which only the operations defined on it can be used, but none else
(d) all of the above

3. A common property of logic programming languages and functional languages is:
(a) both are procedural languages (b) both are based on A-calculus
(c) both are declarative (d) both use Horn-clauses

4. Which one of the following are essential features of an object-oriented programming language?
(i) Abstraction and encapsulatoin
(ii) Strictly-typedness
(iii) Type-safe property coupled with sub-type rule
(iv) Polymorphism in the presence of inheritance
(a) (i) and (ii) only (b) (i) and (iv) only
(c) (i), (ii) and (iv) only (d) (i), (iii) and (iv) only

5. A program P reads in 500 integers in the range [0,100] representing the scores of 500 students. It then prints the frequency of each score above 50. what would be the best way for P to store the frequencies?
(a) An array of 50 numbers (b) An array of 100 numbers
(c) An array of 500 numbers
(d) A dynamically allocated array of 550 numbers

6. An undirected graph G has n nodes. Its adjacency matrix is given by an n x n square matr4ix whose (i) diagonal elements are 0’s and (ii) non-diagonal elements are l’s. which one of the following is TRUE?
(a) Graph G has no minimum spanning tree (MST)
(b) Graph G has a unique MST of cost n-i
(C) Graph G has multiple distinct MSTs, each of cost n-i
(d) Graph G has multiple spanning trees of different costs
GATE Computer Science exam books







GATE Computer Science exam question paper
For more questions , here is the attachment.....................

Attached Files Available for Download

GATE Computer Science exam question paper.pdf (321.7 KB, 278 views)

__________________
Answered By StudyChaCha Member