Other Useful Links
By Downloading Pdf file, you are accepting our Site Policies and Terms & Conditions.
SET A-CS GATE Exam Previous Papers 2016 | CS GATE Model Papers 2016
Please find download button below to download the CS GATE Exam Previous Papers | CS GATE Model Papers 2016 SET A
GATE COMPUTER SCIENCE AND INFORMATION TECHNOLOGY Previous Paper 2016 Details
- Total number of Questions = 65
Few Question are listed below for preview: GATE Civil Engineering Previous Paper 2016
1. A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?
(A) Both operations can be performed in O(1) time
(B) At most one operation can be performed in O(1) time but the worst case time for the other operation will beΩ(n)
(C) The worst case time complexity for both operations will beΩ(n)
(D) Worst case time complexity for both operations will beΩ(logn)
2. Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change
(A) P only
(B) Q only
(C) Neither P nor Q
(D) Both P and Q
3. Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
(A) Shortest remaining time first
(B) Round-robin with time quantum less than the shortest CPU burst
(C) Uniform random
(D) Highest priority first with priority proportional to CPU burst length
4. Which one of the following is NOT a part of the ACID properties of database transactions?
(A) Atomicity
(B) Consistency
(C) Isolation
(D) Deadlock-freedom