CS301 Midterm Quiz File 2023 by Danish Hanif

Paid Services Available 10/10 Marks Guarantee · CS301 Quiz File · Jun 05, 2023 12:00 AM

Q1. A tree is an AVL tree if

1. Any one node fulfills the AVL condition
2. At least half of the nodes fulfill the AVL condition
3. Root node fulfills the AVL condition
4. All the nodes fulfill the AVL condition

Q2. When a function calling itself is called as __________.

1. Inline
2. Iteration
3. Recursion
4. Nested loop

Q3. What will be output of following code?

1. 10
2. 25
3. Compile time error
4. 15
5. Level-order traversal for Binary Search Tree can be implemented, _______________.

Through both recursive method call and non-recursive method call Only through recursive method

Through max-heap

Only through non-recursive method

Q4. What will be the output of following code?

1. 14
2. 15
3. 16
4. 17
5. Which one is the correct function call for the following function of calculating cube? int cube(int& num)

1. cube(num)

cube(*num) C. cube(&num)

Q6. 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.

1. root->setInfo( &x[1] )
2. setInfo -> root( &x[0] );
3. setInfo -> root( &x[1] );
4. root->setInfo( &x[0] );

Q7. What will be output of the given C++ code?

char lhs[] = " Army"; char rhs[] = " Army";

cout<<strcmp(lhs,rhs);

A. Syntax error B. Positive number C. 0 D. Negative number