GATE Computer Science (CS) Previous Year Question Paper 2017
Graduate Aptitude Test in Engineering (GATE) 2017 Computer Science (CS) Previous year question paper with answers GATE Computer Science (CS) 2017 Question with solution you can download it in FREE, if GATE Computer Science (CS) 2017 paper in text or pdf for GATE Computer Science (CS) 2017 Answer Keys you can download GATE 2017 page also just Go to menu bar, Click on File->then Save.
Graduate Aptitude Test in Engineering (GATE) 2017 Computer Science (CS) Previous year question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this GATE 2017 paper is available for all the students in FREE and also GATE Computer Science (CS) Previous year question paper 2017 fully solved GATE with answer keys and solution.
GATE Computer Science (CS) Question Papers 2017
You can get daily updates on GATE 2017 from www.oldquestionpapers.net here you can also check similar links for other related study materials on GATE Computer Science (CS) Here Graduate Aptitude Test in Engineering (GATE) Computer Science (CS) question bank 2017 is also available in Computer Science (CS) English Language.
GATE Mechanical Engineering (ME) Question Paper 2017 | Download Free PDF:
1. Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?
I. 3, 5, 7, 8, 15, 19, 25
II. 5, 8, 9, 12, 10, 15, 25
III. 2, 7, 10, 8, 14, 16, 20
IV. 4, 6, 7, 9 18, 20, 25
- (A) I and IV only
- (B) II and III only
- (C) II and IV only
- (D) II only
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) ∀𝑋𝑋 ∈ 𝑈𝑈 ∀𝑌𝑌 ∈ 𝑈𝑈 (𝑋𝑋 ∖ 𝑌𝑌 = 𝑌𝑌′ ∖ 𝑋𝑋′)
3. Which one of the following is TRUE at any valid state in shift-reduce parsing?
- (A) Viable prefixes appear only at the bottom of the stack and not inside
- (B) Viable prefixes appear only at the top of the stack and not inside
- (C) The stack contains only a set of viable prefixes
- (D) The stack never contains viable prefixes
4. Which one of the following is NOT equivalent to p ↔ q?
- (A) (┐p ˅ q) ˄ (p ˅ ┐q)
- (B) (┐p ˅ q) ˄ (q → p)
- (C) (┐p ˄ q) ˅ (p ˄ ┐q)
- (D) (┐p ˄ ┐q) ˅ (p ˄ q)
5. Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is
- (A) 0, 1, 3, 7, 15, 14, 12, 8, 0
- (B) 0, 1, 3, 5, 7, 9, 11, 13, 15, 0
- (C) 0, 2, 4, 6, 8, 10, 12, 14, 0
- (D) 0, 8, 12, 14, 15, 7, 3, 1, 0
Download GATE ME 01 Question Papers 2017 Full PDF
Download GATE ME 02 Question Papers 2017 Full PDF
Download GATE ME 03 Question Papers 2017 Full PDF
See Also……