Go Back   2022-2023 StudyChaCha > StudyChaCha Discussion Forum > General Topics

  #2  
Old January 14th, 2014, 05:23 PM
Super Moderator
 
Join Date: Jun 2013
Default Re: Solved Paper for GATE Computer Science

Here I am giving you question paper for the GATE computer science examination in PDF file attached with it so you can get it free of cost ..

Some questions are given below :
Q.1 Consider the following logical inferences.
I1: If it rains then the cricket match will not be played.
The cricket match was played.
Inference: There was no rain.
I2: If it rains then the cricket match will not be played.
It did not rain.
Inference: The cricket match was played.
Which of the following is TRUE?
(A) Both I1 and I2 are correct inferences
(B) I1 is correct but I2 is not a correct inference
(C) I1 is not correct but I2 is a correct inference
(D) Both I1 and I2 are not correct inferences

Q.2 Which of the following is TRUE?
(A) Every relation in 3NF is also in BCNF
(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every
key of R
(C) Every relation in BCNF is also in 3NF
(D) No relation can be in both BCNF and 3NF

Q.3 What will be the output of the following C program segment?
char inChar = ‘A’ ;
switch ( inChar ) {
case ‘A’ : printf (“Choice A\ n”) ;
case ‘B’ :
case ‘C’ : printf (“Choice B”) ;
case ‘D’ :
case ‘E’ :
default : printf ( “ No Choice” ) ; }
(A) No Choice
(B) Choice A
(C) Choice A
Choice B No Choice
(D) Program gives no output as it is erroneous

Q.4 Assuming P ≠ NP, which of the following is TRUE?
(A) NP-complete = NP (B) NP-complete ∩ P = 
(C) NP-hard = NP (D) P = NP-complete

Q.5 The worst case running time to search for an element in a balanced binary search tree with n2n
elements is
(A) Θ (n log n) (B) Θ (n2n) (C) Θ (n) (D) Θ (log n)

Q.14 Given the basic ER and relational models, which of the following is INCORRECT?
(A) An attribute of an entity can have more than one value
(B) An attribute of an entity can be composite
(C) In a row of a relational table, an attribute can have more than one value
(D) In a row of a relational table, an attribute can have exactly one value or a NULL value

Q.15 Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause
R : All attributes used in the GROUP BY clause must appear in the SELECT clause
S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
(A) P and R (B) P and S (C) Q and R (D) Q and S

Q.19 The amount of ROM needed to implement a 4 bit multiplier is
(A) 64 bits (B) 128 bits (C) 1 Kbits (D) 2 Kbits
Q.20 Register renaming is done in pipelined processors
(A) as an alternative to register allocation at compile time
(B) for efficient access to function parameters and local variables
(C) to handle certain kinds of hazards
(D) as part of address translation
Attached Files Available for Download
File Type: pdf GATE Computer Science paper.pdf (387.8 KB, 47 views)
File Type: pdf GATE Computer Science paper 1.pdf (215.1 KB, 48 views)
__________________
Answered By StudyChaCha Member
Reply With Quote
  #3  
Old January 17th, 2015, 11:34 AM
Super Moderator
 
Join Date: Nov 2011
Default Re: Solved Paper for GATE Computer Science

Below I am providing you some questions of from Solved question paper of GATE Computer Science and attaching a PDF attachment which has detail information regarding this that you can down load for free:

1. Which of the following problems are decidable?
1) Does a given program ever produce an output?
2) If L is context-free language, then, is L also context-free?
3) If L is regular language, then, is L also regular?
4) If L is recursive language, then, is L also recursive?
(A) 1,2,3,4 (B) 1,2 (C) 2,3,4 (D) 3,4
Answer:- (D)
Exp:- CFL’s are not closed under complementation. Regular and recursive languages are closed
under complementation.
2. Given the language L-{ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
(A) 1,2 and 3 (B) 2,3 and 4 (C) 1,2 and 4 (D) 1,3 and 4
Answer:-(C)
Exp:- { } L ab, aa, baa =
Let S1 = ab , S2 = aa and S3 =baa
abaabaaabaa can be written as S1S2S3S1S2
aaaabaaaa can be written as S1S1S3S1
baaaaabaa can be written as S3S2S1S2

Solved Paper for GATE Computer Science





Attached Files Available for Download
File Type: pdf Solved Paper for GATE Computer Science.pdf (427.3 KB, 38 views)
__________________
Answered By StudyChaCha Member
Reply With Quote
Reply


Reply to this Question / Ask Another Question
Your Username: Click here to log in

Message:
Options



All times are GMT +6.5. The time now is 03:28 PM.


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

1 2 3 4 5 6 7 8