CS GATE Exam Previous Papers | CS GATE Model Papers 2015 SET 1

Other Useful Links

By Downloading Pdf file, you are accepting our Site Policies and Terms & Conditions.

SET 1-CS GATE Exam Previous Papers 2015 | CS GATE Model Papers 2015

Please find download button below to download the CS GATE Exam Previous Papers | CS GATE Model Papers 2015 SET 1
GATE Computer Science Previous Paper 2015 Details

  • Total number of Questions = 25
  • Q. 1 – Q. 25 carry one mark each
  • Q. 26 – Q. 55 carry two mark each

Few Question are listed below for preview: GATE Computer Science Previous Paper 2015

1. The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
(A) 63 and 6, respectively
(B) 64 and 5, respectively
(C) 32 and 6, respectively
(D) 31 and 5, respectively
2. 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
3. Which one of the following fields of an IP header is NOT modified by a typical IP router?
(A) Checksum
(B) Source address
(C) Time to Live (TTL)
(D) Length
4. A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called
(A) Dense
(B) Sparse
(C) Clustered
(D) Unclustered



Leave a Reply

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

kalebetbahis.com - ieski.com - kabak koyu - bilimveyaratilisagaci.com - escort mersin