In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set… Read More
Tag Archives: GATE-CS-2013
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? (A) A (B) B (C) C (D)… Read More
Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirected graph is in P. 2.… Read More
Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. 2. Turing recognizable languages are… Read More
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation… Read More
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… Read More
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the… Read More
Using public key cryptography, X adds a digital signature to message M, encrypts < M, >, and sends it to Y, where it is decrypted.… Read More
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,… Read More
Match the problem domains in GROUP I with the solution technologies in GROUP II GROUP I GROUP II (P) Service oriented computing (1) Interoperability (Q)… Read More
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… Read More
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e.,… Read More
Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1* (A) {} (B) (C) a* (D)… Read More
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… Read More
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort? (A)… Read More
