Similar Topics

3.2k+ articles

60+ articles

GATE-GATE CS 1996

60+ posts

Popular articles

Recent articles

GATE | GATE CS 1996 | Question 66

Last Updated: 24 March 2019

Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N1. The program is erroneous. Under what ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 63

Last Updated: 30 July 2019

Insert the characters of the string K R P C S N Y T J M into a hash table of size 10. Use the hash functionh(x) = ( ord(x) – ord(\"A\") + 1 ) mod10If linear probing is use ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 52

Last Updated: 10 September 2018

A binary search tree is used to locate the number 43. Which of the following probe sequences are possible and which are not? Explain(A) 61 52 14 17 40 43(B) 2 ...read more

GATE-GATE CS 1996

Similar Topics

3.2k+ articles

60+ articles

GATE | GATE CS 1996 | Question 44

Last Updated: 28 March 2020

A solution to the Dining Philosophers Problem which avoids deadlock is:(A) ensure that all philosophers pick up the left fork before the right fork(B) ensure that all phil ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 40

Last Updated: 12 December 2018

Quicksort is run on two inputs shown below to sort in ascending order taking the first element as pivot,(i) 1, 2, 3,......., n(ii) n, n-1, n-2,......, 2, 1 Let C1 and C2 b ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 39

Last Updated: 01 November 2017

A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24 The number of nodes in the left subtree and rig ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 38

Last Updated: 03 July 2020

The average number of key comparisons done in a successful sequential search ina list of length n is (A)log n(B)(n-1)/2(C)n/2(D)(n+1)/2 ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 33

Last Updated: 10 May 2020

If L1 and L2 are context free languages and R a regular set, one of the languages below is not necessarily a context free language, which one?(A) L1 . L2(B) L1 ∩ L2(C) L1 ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 23

Last Updated: 20 November 2018

Booth's algorithm for integer multiplication gives worst performance when the multiplier pattern is(A) 101010 .........1010(B) 100000 .........0001(C) 111111 .........1111 ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 20

Last Updated: 31 October 2017

A critical section is a program segment(A) which should run in a certain specified amount of time(B) which avoids deadlocks(C) where shared resources are accessed(D) which ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 15

Last Updated: 31 October 2017

Which of the following sequences denotes the post order traversal sequence of the given tree? a / \ b e / \ / c d f / g(A) f e g c ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 13

Last Updated: 20 May 2019

An advantage of chained hash table (external hashing) over the open addressing scheme is (A)Worst case complexity of search operations is less(B)Spa ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 12

Last Updated: 28 May 2020

Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS.ii. Implementing LISTS on linked lists is ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 9

Last Updated: 10 May 2020

Which of the following statements is false?(A) The Halting Problem of Turing machines is undecidable(B) Determining whether a context-free grammar is ambiguous is undecida ...read more

GATE-GATE CS 1996

GATE | GATE CS 1996 | Question 8

Last Updated: 21 May 2020

Which two of the following four regular expressions are equivalent? (ε is the empty string).(i). (00)*(ε+0)(ii). (00)*(iii). 0*(iv). 0(00)*(A) (i) and (ii)(B) (ii) and (ii ...read more

GATE-GATE CS 1996