GATE CSE 2015 SET-3

Question 1
Consider the following C program segment.
 #include < stdio.h >
int main()
{
char s1[7] = "1234", *p;
p = s1 + 2;
*p = '0';
printf("%s", s1);
} 
What will be printed by the program?
A
12
B
120400
C
1204
D
1034
C Programming   Array and Pointer
Question 2
Suppose U is the power set of the set S={1,2,3,4,5,6}. For any T\inU, let |T| denote the number of elements in T and T' denote the complement of T. For any T,R\inU, let T\R be the set of all elements in T which are not in R. Which one of the following is true?
A
\forall X\in U \; (|X|=|X'|)
B
\exists X\in U \; \exists Y\in U \; (|X|=2,\; |Y|=3 \; and \; X \setminus Y=\phi )
C
\forall X\in U \; \forall Y\in U \; (|X|=5,\; |Y|=5 \; and \; X \cap Y=\phi )
D
\forall X \in U \; \forall Y\in U\; (X \setminus Y=Y' \setminus X')
Discrete Mathematics   Set Theory
Question 3
Consider the relation X(P,Q,R,S,T,U) with the following set of functional dependencies
F= {{P,R}\rightarrow{S,T}, {P,S,U}\rightarrow{Q,R} }
Which of the following is the trivial functional dependency in F^{+}, where F^{+} is closure of F ?
A
{P,R}\rightarrow{S,T}
B
{P,R}\rightarrow{R,T}
C
{P,S}\rightarrow{S}
D
{P,S,U}\rightarrow{Q}
Database Management System   Normal Form
Question 4
The maximum number of processes that can be in Ready state for a computer system with n CPUs is
A
n
B
n^{2}
C
2^{n}
D
Independent of n
Operating System   Process
Question 5
Among simple LR (SLR) , canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful , in that order?
A
SLR, LALR
B
Canonical LR, LALR
C
SLR, canonical LR
D
LALR, canonical LR
Compiler Design   Parsing
Question 6
Let # be a binary operator defined as
X#Y=X'+Y' where X and Y are Boolean variables.
Consider the following two statements.

(S1) (P # Q) # R = P # (Q # R)
(S2) Q # R = R # Q

Which of the following is/are true for the Boolean variables P, Q and R?
A
Only S1 is true
B
Only S2 is true
C
Both S1 and S2 are true
D
Neither S1 nor S2 are true
Digital Logic   Boolean Algebra
Question 7
Consider a software project with the following information domain characteristics for calculation of function point metric.
Number of external inputs (I) = 30
Number of external outputs (O) = 60
Number of external inquiries (E) = 23
Number of files (F) = 08
Number of external interfaces (N) = 02

It is given that the complexity weighting factors for I, O, E, F and N are 4, 5, 4, 10 and 7, respectively. It is also given that, out of fourteen value adjustment factors that influence the development effort, four factors are not applicable, each of the other four factors have value 3, and each of the remaining factors have value 4. The computed value of function point metric is _____________.
A
415
B
612
C
850
D
356
Software Engg   
Question 8
In a web server, ten WebPages are stored with the URLs of the form http://www.yourname.com/var.html; where, var is a different number from 1 to 10 for each Webpage. Suppose, the client stores the Webpage with var =1 (say W1) in local machine, edits and then tests. Rest of the WebPages remains on the web server. W1 contains several relative URLs of the form "var.html" referring to the other WebPages. Which one of the following statements needs to be added in W1, so that all the relative URLs in W1 refer to the appropriate WebPages on the web server?
A
\lt a href: "http://www.yourname.com/", href: "...var.html" \gt
B
\lt base href: "http://www.yourname.com/" \gt
C
\lt a href: "http://www.yourname.com/" \gt
D
\lt base href: "http://www.yourname.com/", range:"…var.html" \gt
Web Technology   
Question 9
Consider the following statements.
I. TCP connections are full duplex
II. TCP has no option for selective acknowledgement
III. TCP connections are message streams
A
Only I is correct
B
Only I and III are correct
C
Only II and III are correct
D
All of I, II and III are correct
Computer Network   Transport Layer Protocol
Question 10
Consider the equality \sum_{i=0}^{n}i^{3}=X and the following choices for X
I. \Theta (n^{4})
II. \Theta (n^{5})
III. O (n^{5})
IV. \Omega (n^{3})
The equality above remains correct if X is replaced by
A
Only I
B
Only II
C
I or III or IV but not II
D
II or III or IV but not I
Algorithm   Asymptotic Notation
There are 10 questions to complete.

Leave a Comment

Like this FREE website? Please share it among all your friends and join the campaign of FREE Education to ALL.