CSE IT GATE 2015 Question Papers with Solutions PDF- Part 1

 GATE 2015 Question Papers with Solutions For CSE and IT – Part 1

In this post you can see the set of Gate 2015 Question Papers with Solutions For CSE and IT Engineering students. 

[1] Consider the following C program segment.

What will be printed by the program?
(A.) 12
(B.) 120400
(C.) 1204
(D.) 1034

Answer: C


The array s1 have four entities: s0=1, s1=2,s2=3,s3=4.
p = s1 + 2;==> p=s1(address of first character ) +2==> 0+2=2=address of third character .
Note s1 = address of first character, s1+1 = address of second character, s1+2 = address of third character.
p= Address of third character. (here address of 3).
*p=0==> set the value of address pointed by p as “0”.
Hence the output is 1204.

[2] Suppose 𝑈 is the power set of the set 𝑆={1,2,3,4,5,6}. For any 𝑇∈𝑈, let |𝑇| denote the number of elements in 𝑇 and 𝑇′ denote the complement of 𝑇. For any 𝑇,𝑅∈𝑈, let 𝑇∖𝑅 be the set of all elements in 𝑇 which are not in 𝑅. Which one of the following is true?
(A) ∀𝑋∈𝑈 (|𝑋|=|𝑋′|)
(B) ∃𝑋∈𝑈 ∃𝑌∈𝑈 (|𝑋|=5,|𝑌|=5 and 𝑋∩𝑌=∅)
(C) ∀𝑋∈𝑈 ∀𝑌∈𝑈 (|𝑋|=2,|𝑌|=3 and 𝑋∖𝑌=∅)
(D) ∀𝑋∈𝑈 ∀𝑌∈𝑈 (𝑋∖𝑌=𝑌′∖𝑋′)

Answer: D

[3] Consider the relation 𝑋(𝑃,𝑄,𝑅,𝑆,𝑇,𝑈) with the following set of functional dependencies

Which of the following is the trivial functional dependency in 𝐹+, where 𝐹+ is closure of F ?
(A) {𝑃,𝑅}→{𝑆,𝑇}
(B) {𝑃,𝑅}→{𝑅,𝑇}
(C) {𝑃,𝑆}→{𝑆}
(D) {𝑃,𝑆,𝑈}→ {𝑄}

Hint: X–>Y is trivial if Y⊆X

[4] The maximum number of processes that can be in Ready state for a computer system with 𝑛 CPUs is
(A) 𝑛
(B) 𝑛2
(C) 2𝑛
(D) Independent of 𝑛


[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?
(B) Canonical LR, LALR
(C) SLR, canonical LR
(D) LALR, canonical LR

Answer: C

[6] Let # be a binary operator defined as
𝑋 # 𝑌=𝑋′+ 𝑌′ where 𝑋 and 𝑌 are Boolean variables. Consider the following two statements.
(S1) (𝑃 # 𝑄)#𝑅=𝑃#(𝑄 # 𝑅)
(S2) 𝑄#𝑅=𝑅#𝑄
Which of the following is/are true for the Boolean variables 𝑃, 𝑄 and 𝑅?
(A) Only S1 is true
(B) Only S2 is true
(C) Both S1 and S2 are true
(D) Neither S1 nor S2 are true

Answer: B

[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 _____________.

Answer: 612.06


The value of function point metric = UPF * VAF
Here, UPF: Unadjusted Function Point (UFP) count
VAF: Value Adjustment Factor
UPF = 4*I+5*O+4*E+10*F+7*N==>4*30 + 60*5 + 23*4 + 8*10 + 7*2 = 606
VAF = (TDI * 0.01) + 0.65,  Where TDI is Total Degree of Influence
TDI = 3*4 + 0*4 + 4*6 = 36
VAF = (TDI * 0.01) + 0.65 = 36*0.01 + 0.65 ==> 0.36 + 0.65 = 1.01
FP = UPF * VAF ==> 1.01 * 606 = 612.06

[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) <a href: “http://www.yourname.com/”, href: “…var.html”>
(B) <base href: “http://www.yourname.com/”>
(C) <a href: “http://www.yourname.com/”>
(D) <base href: “http://www.yourname.com/”, range:“…var.html”>


[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


TCP connections are full-duplex: TCP connections are bidirectional-full duplex (can send and receive data simultaneously). Hence this statement is true.
TCP has no option for selective acknowledgement:  the receiver always sends either positive or negative acknowledgement about the data packet to the sender, Hence the given statement is false.
TCP connections are message streams: TCP connection transmits data packets not message stream.Hence the given statement is also false.

Thanks for reading….

You may also like...

Leave a Reply

Your email address will not be published. Required fields are marked *