CS302 Quiz 2 by VU Stars

CS302 Quiz 2 · Date 08 March 2022 · For Paid quizzes

If the height of perfect binary tree is 4, what will be the total number of nodes in it?

Suppose there are set of fruits and the set of vegetables, both sets are sets. Disjoint A binary relation R over S is called an equivalence relation if it has following property(s) All of Above Heap can be used to implement Priority queue If a tree has 20 edges/links, then the total number of nodes in the tree will be:

If there are 100 elements in an equivalence class, then we will have sets initially.

Given the values are the array representation of heap; 12 23 26 31 34 44 56 64 78 100 What is the 5th smallest element in the given heap?

A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time. True Which one of the following is known as " Last-In, First-Out" or LIFO Data Structure? Stack What will be postfix expression of the following infix expression? infix Expression: a+b*c-d abc*+dFor compiler a postfix expression is easier to evaluate than infix expression? True Consider the following pseudo code declare a stack of characters while ( there are more characters in the word to read )

read a character push the character on the stack

while ( the stack is not empty )

pop a character off the stack write the character to the screen

What is written to the screen for the input "apples"?

selppa A binary tree of N nodes has . Log2 N levels The easiest case of deleting a node from BST is the case in which the node to be deleted . Is a leaf node

Search is . log2N Merge sort and quick sort both fall into the same category of sorting algorithms. What is this category?

If one pointer of the node in a binary tree is NULL then it will be a/an . External node We convert the _ pointers of binary to threads in threaded binary tree. NULL If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT complete Binary tree What is the best definition of a collision in a hash table?

Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays below; determine the one that cannot possibly be a heap: 16, 24, 20, 30, 28, 18, 22 Do you see any problem in the code of nextInOrder below: TreeNode * nextInorder(TreeNode * p) if(p->RTH == thread) return( p->R ); else { p = p->R;

while(p->LTH == child) p = p->R; return p;

The function has logical problem, therefore, it will not work properly. Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).

Which one of the following operations returns top value of the stack?

Top Which one of the following is NOT true regarding the skip list? List Sh contains only the n special keys. By using we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time. Threaded binary tree What is the best definition of a collision in a hash table?

Which formula is the best approximation for the depth of a heap with n nodes?

log (base 2) of n which of the following is not true regarding the maze generation? Remove a randomly chosen wall if the cells it separates are already in the same set.

when we have declared the size of the array, it is not possible to increase or decrease it during the of the program. Execution

Constant is the stack characteristic but was implemented because of the size limitation of the array.