CS301 Quiz 1 Solution Fall 2021

CS301 Quiz No.01 Solution Fall2021

highest of node

If Ahmed is cousin of Ali and Ali is cousin of Asad then Ahmed is also cousin of Asad. Thisstatement 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)

Given the values are the array representation of heap;12 23 26 31

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

Very fast Level order transversal for binary tree search can be implemented………

Only through non recursive method

……….is an area in computer memory that is used to allocate memory dynamically

Stock

Suppose we want to create the right child of ‘p’and set the value x in it.which of the following statement is correct in this operation

Set Right (x,p)

In level order traversal for binary search tree of each level we visit node in……..order

Right to left

We can calculate the……..of a subtree counting the level from the bottom

Data items

A ……….is a tree in which every level except possibly the last is completely filled