CS301 MCQs Lectures 1-20

CS301 MCQs lecture 1 to 20

Node in a binary tree can have maximum ________ child node(s). Two children

Similarly, log2 64 = 6, because 26 =64

Level-order traversal for Binary Search Tree can be implemented,

The algorithm can be implemented as follows in C++, Java, and Python: C++

What will be the preorder traversal of the given tree?

We allocate memory dynamically by using _______ operator.

New

Generally there is/are _________ case(s) to delete a node from BST.

Analyze the given code carefully and identify which type of binary tree traversal this is :void traversal (TreeNode<int>* treeNode){ if( treeNode != NULL ) { traversal (treeNode->getLeft()); cout << *(treeNode->getInfo())<<" "; traversal (treeNode->getRight()); }}

Postwar

Elements in a queue data structure are added from______ and removed from ______

Rear and font end

Consider an array int x[] = {14,15,4,9,7,18,3}. Which statement will be used to set first number of the list into the root node.

setInfo -> root( &x[0] );

For a perfect binary tree of height 4, what will be the sum of highest of node

If Ahmed is cousin of Ali and Ali is cousin of Asad then Ahmed is also cousin of Asad. This statement has the following property. Transitivity

Suppose there are 100 elements in an equivalence class, so initially there will be 100 trees,the collection of these trees is called.

Forest

The percolate Down procedure will move the smaller value and bigger value.

Up,down

For a perfect binary tree of height h, having N nodes, the sum of height of nodes is

N-h-1

If we want to find median of 50 elements, then after applying builtHeap method, how Manytime deleteMin method will be called?

The Expression

If(!heap-> isEmpty () )

Check

Heap is not empty

Which of the following heap method increase the value if Key at position’p’ by the Amount’delta’?

Increase Key(p,delta)

44 56 64 78 100 What is the 5th smallest element in the given heap?

Which of the following data structure linear type

All of above

in a program a reference variable with name ‘x’can be declared as

int &’x;

Object (object oriented by pointers)are called anonymous object

Friend

in the perspective each process divided into……..section

In tree the search operation is……..as compared to the linked list