coding_quiz3

Jaswinder has a book of tickets and wants to store ticket numbers in a data structure. New ticketsare added to the end of the booklet. Ticket at the top of the stack is issued to the customer. Which data structure should Jaswinder use to represent the ticket booklet?

• Queue

• Stack

• Array

• Graph

Q is an empty queue. The following operations are done on it:

ADD 5

ADD 7

ADD 46

DELETE

ADD 13

DELETE

DELETE

ADD 10

What will be the content of Q after these operations. Front is marked by (F) and Rear is markedby (R).

• 10(R) 13(F)

• 5(R) 10(F)

• 13(R) 10(F)

• 10(R) 5(F)

A stack is implemented as a linear array A[0…N-1]. Noor writes the following functions for popping an element from the stack.

function POP( top, N ){

if( X ){

top = top - 1

}else{

print "Underflow"}

return top}

Fill in the condition X

• top< N-1

• top<n

• top>1

• top >= 0

A stack is implemented as a linear array A[0…N-1]. Farhan writes the following functions for pushing an element E in to the stack.

function PUSH( top, E, N ){

if(X){

top= top+1A[top] = E

}else{

print "Overflow"}

return top}

Fill in the condition X

• top< N

• top <n-1

• top > 0

• top > 1

A is an empty stack. The following operations are done on it.

PUSH(1)

PUSH(2)

POP

PUSH(5)

PUSH(6)

POP

What will the stack contain after these operations. (Top of the stack is underlined)

• 5 6

• 1 5

• 2 5

• 2 6

The array A has n elements. We want to determine the position of X in the array. We know that X is present in the array A and X can be present at any location in the array with equal probability. How many comparisons will be required on average to find the element X using linear search?

• n

• 2*n

• (n+1)/2

• n^2

Srishti writes a program to find an element in the array A[5] with the following elements in order: 8 30 40 45 70. She runs the program to find a number X. X is found in the first iteration of binary search. What is the value of X?

• 40

• 8

• 70

• 30

An array of 5 numbers has the following entries in order: 7 4 5 10 8. Prashant uses selection sort to sort this array in descending order. What will the array contain after two iterations of selection sort?

• 10 8 7 5 4

• 10 8 5 7 4

• 8 10 5 7 4

• Error

An integer X is saved as an unsigned 8-bit number, 00001011.What is X?

• 22

• 11

• 10

• 0

What does this function compute for positive n?

function f(int n){

if (n equals 1){

return 1

}else{

return f(n-1)/f(n-1) + n }

}

• 1 + n

• 1 + 2 + 3 + ... + n

• 1 + n, if n > 1, 1 otherwise

• 1+3+5+7+...