After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just before committing suicide, he came across a spider attempting tirelessly to have its net. Time and again, the spider failed but that did not deter it to refrain from making attempts. Such attempts by the spider made Bruce curious. Thus, Bruce started observing the near-impossible goal of the spider to have the net. Ultimately, the spider succeeded in having its net despite several failures. Such act of the spider encouraged Bruce not to commit suicide. And then, Bruce went back again and won many a battle, and the rest is history. Which one of the following assertions is best supported by the above information?

Failure is the pillar of success

Life begins and ends with adventures

No adversity justifies giving up hope

Choose the grammatically INCORRECT sentence:

They migrated from India to Australia

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree

10, 20, 15, 23, 25, 35, 42, 39, 30

15, 10, 25, 23, 20, 42, 35, 39, 30

15, 20, 10, 23, 25, 42, 35, 39, 30

15, 10, 23, 25, 20, 35, 42, 39, 30

Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence?

Initiation of interrupt service

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 are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from.

(j mod v) * k to (j mod v) * k + (k-1

(j mod k) * v to (j mod k) * v + (v-1)

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 (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?

X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)

X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)

X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)

X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)

X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)

An index is clustered, if

the data records of the file are organized not in the same order as the data entries of the index

it is on a set of fields that form a candidate key.

it is on a set of fields that include the primary key.

the data records of the file are organized in the same order as the data entries of the index.

the data records of the file are organized not in the same order as the data entries of the index

Using public key cryptography, X adds a digital signature \sigma to message M, encrypts , and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?

Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by Y’s public key

Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by Y’s private key

Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by X’s private key

Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed by X’s public key

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?

This algorithm is equivalent to the shortest-job-first algorithm..

This algorithm is equivalent to the first-come-first-serve algorithm

This algorithm is equivalent to the round-robin algorithm

This algorithm is equivalent to the shortest-job-first algorithm..

This algorithm is equivalent to the shortest-remaining-time-first algorithm

A binary operation \oplus on a set of integers is defined as x \oplus y = x2 + y2. Which one of the following statements is TRUE about \oplus?

Both commutative and associative

Commutative but not associative

Both commutative and associative

Associative but not commutative

Neither commutative nor associative

47 + Mcqs in Gate CS-2013 in Computer Science Page 1 McqOptions

1.	A process executes the code fork(); fork(); fork(); The total number of child processes created is
A.	3
B.	4
C.	7
D.	8
Answer» D. 8

Discussion

2.	The current erection cost of a structure is Rs. 13,200. If the labour wages per day increase by 1/5 of the current wages and the working hours decrease by 1/24 of the current period, then the new cost of erection in Rs. is
A.	16,500
B.	15,180
C.	11,000
D.	10,120
Answer» C. 11,000

Discussion

3.	A tourist covers half of his journey by train at 60 km/h, half of the remainder by bus at 30 km/h and the rest by cycle at 10 km/h. The average speed of the tourist in km/h during his entire journey is
A.	36
B.	30
C.	24
D.	18
Answer» D. 18

Discussion

4.	After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just before committing suicide, he came across a spider attempting tirelessly to have its net. Time and again, the spider failed but that did not deter it to refrain from making attempts. Such attempts by the spider made Bruce curious. Thus, Bruce started observing the near-impossible goal of the spider to have the net. Ultimately, the spider succeeded in having its net despite several failures. Such act of the spider encouraged Bruce not to commit suicide. And then, Bruce went back again and won many a battle, and the rest is history. Which one of the following assertions is best supported by the above information?
A.	Failure is the pillar of success
B.	Honesty is the best policy.
C.	Life begins and ends with adventures
D.	No adversity justifies giving up hope
Answer» E.

Discussion

5.	Out of all the 2-digit integers between 1 and 100, a 2-digit number has to be selected at random. What is the probability that the selected number is not divisible by 7?
A.	13/90
B.	12/90
C.	78/90
D.	77/90
Answer» E.

Discussion

6.	Choose the grammatically INCORRECT sentence:
A.	He is of Asian origin.
B.	They belonged to Africa.
C.	She is an European
D.	They migrated from India to Australia
Answer» D. They migrated from India to Australia

Discussion

7.	Were you a bird, you ______________ in the sky
A.	would fly
B.	shall fly
C.	should fly
D.	shall have flown
Answer» B. shall fly

Discussion

8.	What will be the maximum sum of 44, 42, 40, ...... ?
A.	502
B.	504
C.	506
D.	500
Answer» D. 500

Discussion

9.	Complete the sentence: Universalism is to particularism as diffuseness is to
A.	specificity
B.	neutrality
C.	generality
D.	adaptation
Answer» B. neutrality

Discussion

10.	Which one of the following options is the closest in meaning to the word given below? Nadir
A.	Highest
B.	Lowest
C.	Medium
D.	Integration
Answer» C. Medium

Discussion

11.	Consider the FDs given in above question. The relation R is
A.	in 1NF, but not in 2NF
B.	in 2NF, but not in 3NF
C.	in 3NF, but not in BCNF
D.	in BCNF
Answer» B. in 2NF, but not in 3NF

Discussion

12.	Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
A.	3
B.	4
C.	5
D.	6
Answer» C. 5

Discussion

13.	Consider the same data as above question. What is the minimum number of page colours needed to guarantee that no two synonyms map to different sets in the processor cache of this computer?
A.	2
B.	4
C.	8
D.	16
Answer» D. 16

Discussion

14.	A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table (T1), which occupies exactly one page. Each entry of T1 stores the base address of a page of the second-level table (T2). Each entry of T2 stores the base address of a page of the third-level table (T3). Each entry of T3 stores a page table entry (PTE). The PTE is 32 bits in size. The processor used in the computer has a 1 MB 16-way set associative virtually indexed physically tagged cache. The cache block size is 64 bytes. What is the size of a page in KB in this computer?
A.	2
B.	4
C.	8
D.	16
Answer» D. 16

Discussion

15.	In the above question, if array A is made to hold the string “abcde”, which of the above four test cases will be successful in exposing the flaw in this procedure?
A.	None
B.	2 Only
C.	3 and 4 only
D.	4 only
Answer» D. 4 only

Discussion

16.	The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be replaced are supplied in array oldc, while their respective replacement characters are supplied in array newc. Array A has a fixed length of five characters, while arrays oldc and newc contain three characters each. However, the procedure is flawed void find_and_replace(char A, char oldc, char *newc) { for (int i = 0; i < 5; i++) for (int j = 0; j < 3; j++) if (A[i] == oldc[j]) A[i] = newc[j]; } The procedure is tested with the following four test cases (1) oldc = "abc", newc = "dab" (2) oldc = "cde", newc = "bcd" (3) oldc = "bca", newc = "cda" (4) oldc = "abc", newc = "bac" The tester now tests the program on all input strings of length five consisting of characters ‘a’, ‘b’, ‘c’, ‘d’ and ‘e’ with duplicates allowed. If the tester carries out this testing with the four test cases given above, how many test cases will be able to capture the flaw?
A.	Only one
B.	Only Two
C.	Only Three
D.	All Four
Answer» C. Only Three

Discussion

17.	Consider the same data as above question. What is the minimum number of registers needed in the instruction set architecture of the processor to compile this code segment without any spill to memory? Do not apply any optimization other than optimizing register allocation.
A.	3
B.	4
C.	5
D.	6
Answer» C. 5

Discussion

18.	The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d = c * a; e = c + a; x = c * c; if (x > a) { y = a * a; } else { d = d * d; e = e * e; } Suppose the instruction set architecture of the processor has only two registers. The only allowed compiler optimization is code motion, which moves statements from one place to another while preserving correctness. What is the minimum number of spills to memory in the compiled code?
A.	0
B.	1
C.	2
D.	3
Answer» C. 2

Discussion

19.	A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is
A.	4
B.	5
C.	6
D.	7
Answer» C. 6

Discussion

20.	Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are 5 ns, 7 ns, 10 ns, 8 ns and 6 ns, respectively. There are intermediate storage buffers after each stage and the delay of each buffer is 1 ns. A program consisting of 12 instructions I1, I2, I3, …, I12 is executed in this pipelined processor. Instruction I4 is the only branch instruction and its branch target is I9. If the branch is taken during the execution of this program, the time (in ns) needed to complete the program is
A.	132
B.	165
C.	176
D.	328
Answer» C. 176

Discussion

21.	The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree
A.	10, 20, 15, 23, 25, 35, 42, 39, 30
B.	15, 10, 25, 23, 20, 42, 35, 39, 30
C.	15, 20, 10, 23, 25, 42, 35, 39, 30
D.	15, 10, 23, 25, 20, 35, 42, 39, 30
Answer» E.

Discussion

22.	Consider the following two sets of LR(1) items of an LR(1) grammar. X -> c.X, c/d X -> .cX, c/d X -> .d, c/d X -> c.X, $ X -> .cX, $ X -> .d, $ Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE? 1. Cannot be merged since look aheads are different. 2. Can be merged but will result in S-R conflict. 3. Can be merged but will result in R-R conflict. 4. Cannot be merged since goto on c will lead to two different sets.
A.	1 only
B.	2 only
C.	1 and 4 only
D.	1, 2, 3, and 4
Answer» E.

Discussion

23.	A certain computation generates two arrays a and b such that a[i]=f(i) for 0 ≤ i < n and b[i]=g(a[i]) for 0 ≤ i < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below. Process X: Process Y: private i; private i; for (i=0; i < n; i++) { for (i=0; i < n; i++) { a[i] = f(i); EntryY(R, S); ExitX(R, S); b[i]=g(a[i]); } } Which one of the following represents the CORRECT implementations of ExitX and EntryY? (A) ExitX(R, S) { P(R); V(S); } EntryY (R, S) { P(S); V(R); } (B) ExitX(R, S) { V(R); V(S); } EntryY(R, S) { P(R); P(S); } (C) ExitX(R, S) { P(S); V(R); } EntryY(R, S) { V(S); P(R); } (D) ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
A.	A
B.	B
C.	C
D.	D
Answer» D. D

Discussion

24.	In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are
A.	Last fragment, 2400 and 2789
B.	First fragment, 2400 and 2759
C.	Last fragment, 2400 and 2759
D.	Middle fragment, 300 and 689
Answer» D. Middle fragment, 300 and 689

Discussion

25.	Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s.
A.	1
B.	2
C.	2.5
D.	5
Answer» C. 2.5

Discussion

26.	A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?
A.	-2
B.	-1
C.	1
D.	2
Answer» E.

Discussion

27.	Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is . A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
A.	1281
B.	1282
C.	1283
D.	1284
Answer» E.

Discussion

28.	Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence?
A.	Instruction fetch
B.	Operand fetch
C.	Conditional branch
D.	Initiation of interrupt service
Answer» E.

Discussion

29.	The line graph L(G) of a simple graph G is defined as follows: · There is exactly one vertex v(e) in L(G) for each edge e in G. · For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e'are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
A.	P only
B.	P and R only
C.	R only
D.	P, Q and S only
Answer» B. P and R only

Discussion

30.	Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even.
A.	P only
B.	Q only
C.	Both P and Q
D.	Neither P nor Q
Answer» D. Neither P nor Q

Discussion

31.	Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
A.	1/8
B.	1
C.	7
D.	8
Answer» D. 8

Discussion

32.	Which one of the following expressions does NOT represent exclusive NOR of x and y?
A.	xy+xy
B.	x⊕y
C.	x⊕y
D.	x⊕y
Answer» E.

Discussion

33.	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 are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from.
A.	(j mod v) * k to (j mod v) * k + (k-1
B.	(j mod v) to (j mod v) + (k-1)
C.	(j mod k) to (j mod k) + (v-1)
D.	(j mod k) * v to (j mod k) * v + (v-1)
Answer» B. (j mod v) to (j mod v) + (k-1)

Discussion

34.	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. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
A.	1, 2 and 3
B.	1 and 2 only
C.	2 and 3 only
D.	1 and 3 only
Answer» B. 1 and 2 only

Discussion

35.	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 closed under union and complementation. 3. Turing decidable languages are closed under intersection and complementation. 4. Turing recognizable languages are closed under union and intersection.
A.	1 and 4 only
B.	1 and 3 only
C.	2 only
D.	3 only
Answer» D. 3 only

Discussion

36.	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 (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
A.	X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
B.	X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
C.	X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
D.	X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)
Answer» C. X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)

Discussion

37.	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
Answer» D. the data records of the file are organized not in the same order as the data entries of the index

Discussion

38.	Using public key cryptography, X adds a digital signature \sigma to message M, encrypts < M, \sigma >, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
A.	Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by Y’s public key
B.	Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by Y’s private key
C.	Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by X’s private key
D.	Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed by X’s public key
Answer» E.

Discussion

39.	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
Answer» D. TCP, UDP, TCP and UDP

Discussion

40.	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) Heterogeneous communicating systems (2) BPMN (R) Information representation (3) Publish-find-bind (S) Process description (4) XML
A.	P-1, Q-2, R-3, S-4
B.	P-3, Q-4, R-2, S-1
C.	P-3, Q-1, R-4, S-2
D.	P-4, Q-3, R-2, S-1
Answer» D. P-4, Q-3, R-2, S-1

Discussion

41.	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
Answer» C. This algorithm is equivalent to the shortest-job-first algorithm..

Discussion

42.	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., of type A -> є and A -> a) to parse a string with n tokens?
A.	n/2
B.	n-1
C.	2n-1
D.	2n
Answer» C. 2n-1

Discussion

43.	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(Logn)
C.	O(n)
D.	O(nLogn)
Answer» D. O(nLogn)

Discussion

44.	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.	O(log n)
B.	O(n)
C.	O(nLogn
D.	O(n^2)
Answer» C. O(nLogn

Discussion

45.	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
Answer» C. -127

Discussion

46.	Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?
A.	8 / (2e3)
B.	9 / (2e3)
C.	17 / (2e3)
D.	26 / (2e3)
Answer» D. 26 / (2e3)

Discussion

47.	A binary operation \oplus on a set of integers is defined as x \oplus y = x2 + y2. Which one of the following statements is TRUE about \oplus?
A.	Commutative but not associative
B.	Both commutative and associative
C.	Associative but not commutative
D.	Neither commutative nor associative
Answer» B. Both commutative and associative

Discussion

Explore topic-wise MCQs in Computer Science.

A process executes the code fork(); fork(); fork(); The total number of child processes created is

The current erection cost of a structure is Rs. 13,200. If the labour wages per day increase by 1/5 of the current wages and the working hours decrease by 1/24 of the current period, then the new cost of erection in Rs. is

A tourist covers half of his journey by train at 60 km/h, half of the remainder by bus at 30 km/h and the rest by cycle at 10 km/h. The average speed of the tourist in km/h during his entire journey is

Out of all the 2-digit integers between 1 and 100, a 2-digit number has to be selected at random. What is the probability that the selected number is not divisible by 7?

Choose the grammatically INCORRECT sentence:

Were you a bird, you ______________ in the sky

What will be the maximum sum of 44, 42, 40, ...... ?

Complete the sentence: Universalism is to particularism as diffuseness is to

Which one of the following options is the closest in meaning to the word given below? Nadir

Consider the FDs given in above question. The relation R is

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?

Consider the same data as above question. What is the minimum number of page colours needed to guarantee that no two synonyms map to different sets in the processor cache of this computer?

In the above question, if array A is made to hold the string “abcde”, which of the above four test cases will be successful in exposing the flaw in this procedure?

Consider the same data as above question. What is the minimum number of registers needed in the instruction set architecture of the processor to compile this code segment without any spill to memory? Do not apply any optimization other than optimizing register allocation.

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree

In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are

Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s.

Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence?

Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even.

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?

Which one of the following expressions does NOT represent exclusive NOR of x and y?

An index is clustered, if

Using public key cryptography, X adds a digital signature \sigma to message M, encrypts < M, \sigma >, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?

The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are:

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) Heterogeneous communicating systems (2) BPMN (R) Information representation (3) Publish-find-bind (S) Process description (4) XML

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., of type A -> є and A -> a) to parse a string with n tokens?

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?

Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?

The smallest integer that can be represented by an 8-bit number in 2’s complement form is

Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?

A binary operation \oplus on a set of integers is defined as x \oplus y = x2 + y2. Which one of the following statements is TRUE about \oplus?