CS301 Midterm Online Quiz

CS301-Midterm

1 / 50

The operation for adding an entry to a stack is traditionally called :

insert

add

push

append

2 / 50

The operation for adding an entry to a stack is traditionally called :

add

insert

push

append

3 / 50

Each node in doubly link list has,

1 pointer

2 pointers

3 pointers

4 pointers

4 / 50

Which one of the following statements is correct?

Binary Search Tree size isfixed once it is created

AVL Tree size is fixed once it is created

Link List size is fixed once it is created.

Array size is fixed once it is created

5 / 50

Which of the above is/are related to normal queues?

None of the given options

(i), (ii) and (iv) only

(ii) and (iv) only

(iii) and (ii) only

6 / 50

________ is the maximum number of nodes that you can have on a stack-linked list ?

Zero

None of these

2n (where n is the number of nodes in linked list)

Any Number

7 / 50

Which of the following abstract data types are NOT used by Integer Abstract Data type group?

Int

float

long

short

8 / 50

What statement changes currentNode so that it refers to the next node?

currentNode += nextNode;

currentNode = nextNode;

currentNode ++;

currentNode = currentNode->nextNode;

9 / 50

A queue where the de-queue operation depends not on FIFO, is called a priority queue

FALSE

TRUE

10 / 50

Which one of the following calling methods does not change the original value of the argument in the calling function?

Call by passing reference of the argument

Call by passing the address of the argument

Call by passing the value of the argument

None of the given options

11 / 50

Which of the following is a non linear data structure?

Linked List

Stack

Tree

Queue

12 / 50

Which one of the following operators has higher priority than all of others?

Plus operator

Multiplication operator

Exponentiation operator

Minus operator

13 / 50

We access elements in AVL Tree in,

Both linear and non linear ways

Non Linear way only

Linear way only

14 / 50

bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?

if (alpha < beta)

if (alpha.LessThan(beta))

if (LessThan(alpha).beta)

if (LessThan(alpha, beta))

15 / 50

What is the maximum depth of recursive calls a function may make?

There is no fixed maximum

n (where n is the argument)

16 / 50

The tree data structure is a

Graphical data structure

Data structure like queue

Non-linear data structure

Linear data structure

17 / 50

The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

Use the better algorithm

Increase the hard disk space

Use better data structures

Use as much data as we can store on the hard disk

18 / 50

The expression AB+C* is called?

Postfix expression

Infix expression

None of these

Prefix expression

19 / 50

AVL Tree is,

Hybrid data structure (Mixture of Linear and Non Linear)

Non Linear data structure

Linear data structure

20 / 50

In which of the traversal method, the recursive calls can be used to traverse a binary tree ?

In inorder traversal only

All of the given options

In postorder traversal only

In preorder traversal only

21 / 50

Which statement of the following statements is incorrect?

A list is a sequence of one or more data items

Stacks are easier to implement than lists

Stack is a special kind of list in which all insertions and deletions take place at one end

Lists can be implemented by using arrays or linked lists

22 / 50

There is/are case/s for rotation in an AVL tree,

23 / 50

bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?

if (LessThan(alpha, beta))

if (LessThan(alpha).beta)

if (alpha.LessThan(beta))

if (alpha < beta)

24 / 50

What is the maximum depth of recursive calls a function may make?

n (where n is the argument)

There is no fixed maximum

25 / 50

Which one of the following is a valid postfix expression?

abc+*d-

ab+c*d-

abc*+d- (According to rule)

(abc*)+d-

26 / 50

Which one of the following statements is NOT correct?

Binary Search Tree size can be changed after its creation

Array size can be changed after its creation.

Link List size can be changed after its creation

AVL Tree size can be changed after its creation

27 / 50

The operation for removing an entry from a stack is traditionally called:

pop

peek

remove

delete

28 / 50

Which one of the following is correct in respect of the above statements regarding the Binary trees?

(ii) and (iii) only

(i) and (iii) only

(i), (ii) and (iii) only

(ii), (iii) and (iv) only

29 / 50

Is a data structure that can grow easily dynamically at run time without having to copy existing elements?

Array

Both of these

List

None of these

30 / 50

A Compound Data Structure is the data structure which can have multiple data items of same type or of different types.Which of the following can be considered compound data structure?

Arrays

LinkLists

Binary Search Trees

All of the given options

31 / 50

We access elements in AVL Tree in,

Both linear and non linear ways

Linear way only

Non Linear way only

32 / 50

Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,

Log2 (n)

Log2 (n+1) -1

Log2 (n+1)

Log2 (n) – 1

33 / 50

Consider the following sequence of push operations in a stack: stack.push(’7’); stack.push(’8’); stack.push(’9’); stack.push(’10’); stack.push(’11’); stack.push(’12’);

910811127

910812711

789101112

981110712

34 / 50

In a program a reference variable, say x, can be declared as

int x ;

None of the given options

int *x ;

int &x ;

35 / 50

Where does the push member function place the new entry in the array?

data[1]

data[11]

data[2]

data[12]

36 / 50

We can add elements in QUEUE From _________

From Both Rare and Front

Front

None of these

Rear

37 / 50

A tree is an AVL tree if

Any one node fulfills the AVL condition

All the nodes fulfill the AVL condition

At least half of the nodes fulfill the AVL condition

None of the given options

38 / 50

Consider the following function: void test_a(int n) { cout << n << " "; if (n>0) test_a(n-2); } What is printed by the call test_a(4)?

0 2 4

4 2 0

0 2

2 4

39 / 50

A queue where the de-queue operation depends not on FIFO, is called a priority queue

TRUE

FALSE

40 / 50

In an array list the current element is

The element where the current pointer points to

The first element

The middle element

The last element

41 / 50

Consider the following infix expression: 3+5*6–7*(8+5) Which of the following is a correct equivalent expression(s) for the above?

365758+*+-*

3 56*+785+* -

365+*758+-*

3 56+*785+-*

42 / 50

Queue follows,

First in First out

First in Last out

Last in First out

None of these

43 / 50

Which of the following is Non Linear Data Structure?

Arrays

Binary Search Trees

LinkLists

None of these

44 / 50

The operation for removing an entry from a stack is traditionally called:

remove

peek

pop

delete

45 / 50

A queue where the de-queue operation depends not on FIFO, is called a priority queue

FALSE

TRUE

46 / 50

The nodes with no successor are called _________

Leaf Nodes

Both of these

None of these

Root Nodes

47 / 50

AVL Tree is,

Non Linear data structure

Hybrid data structure (Mixture of Linear and Non Linear)

Linear data structure

48 / 50

AVL Tree is,

Non Linear data structure

Linear data structure

Hybrid data structure (Mixture of Linear and Non Linear)

49 / 50

Which one of the following calling methods does not change the original value of the argument in the calling function?

Call by passing the value of the argument

None of the given options

Call by passing reference of the argument

Call by passing the address of the argument

50 / 50

Consider the following sequence of push operations in a stack: stack.push(’7’); stack.push(’8’); stack.push(’9’); stack.push(’10’); stack.push(’11’); stack.push(’12’);

789101112

910812711

981110712

910811127

Your score is

The average score is 51%