## GATE | GATE-CS-2014-(Set-3) | Question 65

Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots… Read More »

Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots… Read More »

Suppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up… Read More »

Consider the decision problem 2CNFSAT defined as follows: (A) NP-Complete. (B) solvable in polynomial time by reduction to directed graph reachability. (C) solvable in constant… Read More »

Suppose you want to move from 0 to 100 on the number line. In each step, you either move right by a unit distance or… Read More »

Here, wr is the reverse of the string w. Which of these languages are deterministic Context-free languages? (A) None of the languages (B) Only L1… Read More »

Which of the following problems is undecidable? (A) Deciding if a given context-free grammar is ambiguous. (B) Deciding if a given string is generated by… Read More »

Consider the basic block given below. a = b + c c = a + d d = b + c e = d -… Read More »

Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10… Read More »

An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times… Read More »

A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have… Read More »

Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that… Read More »

Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. T1: r1(X); r1(Z); w1(X); w1(Z) T2: r2(Y); r2(Z); w2(Z) T3:… Read More »

An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header… Read More »

Every host in an IPv4 network has a 1-second resolution real-time clock with battery backup. Each host needs to generate up to 1000 unique identifiers… Read More »

Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries: Prefix Output Interface Identifier 131.16.0.0/12 3 131.28.0.0/14… Read More »