#1
27th September 2014, 08:24 AM
| |||
| |||
GATE CSE Previous model paper
Tell me form where I can get GATE Computer Science and Engineering model question paper???
|
#2
27th September 2014, 12:55 PM
| |||
| |||
Re: GATE CSE Previous model paper
I am giving here GATE Computer Science and Engineering questions: The smallest integer that can be represented by an 8-bit number in 2’s complement form is (A) -256 (B) -128 (C) -127 (D) 0 Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? (A) O(1) (B) O(log n) (C) O(n) (D) O(n log n) A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero? (A) This algorithm is equivalent to the first-come-first-serve algorithm. (B) This algorithm is equivalent to the round-robin algorithm. (C) This algorithm is equivalent to the shortest-job-first algorithm. (D) This algorithm is equivalent to the shortest-remaining-time-first algorithm. The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are (A) TCP, UDP, UDP and TCP (B) UDP, TCP, TCP and UDP (C) UDP, TCP, UDP and TCP (D) TCP, UDP, TCP and UDP An index is clustered, if (A) it is on a set of fields that form a candidate key. (B) it is on a set of fields that include the primary key. (C) the data records of the file are organized in the same order as the data entries of the index. (D) the data records of the file are organized not in the same order as the data entries of the index. For detailed paper here is attachment: |
|