Cs301 FinalTerm Most Important Repeated Mcqs Online Quiz

Cs 301 FianlTerm Most Important Repeated Mcqs

1 / 17

“+” is a _________operator.

2 / 17

A complete binary tree of height ____ has nodes between 16 to 31 .

3 / 17

Binary Search is an algorithm of searching, used with the ______ data.

4 / 17

Each node in doubly link list has,

5 / 17

A binary tree with 24 internal nodes has ______ external nodes

6 / 17

Binary Search is an algorithm of searching, used with the ______ data

7 / 17

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

8 / 17

What is the best definition of a collision in a hash table?

9 / 17

If one pointer of the node in a binary tree is NULL then it will be a/an _____

10 / 17

If we have 1000 sets each containing a single different person. Which of the following relation will be true on
each set:

11 / 17

If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

12 / 17

What is printed by the call test_a(4)?

13 / 17

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

14 / 17

For compiler a postfix expression is easier to evaluate than infix expression?

15 / 17

What will be postfix expression of the following infix expression?
Infix Expression : a+b*c-d

16 / 17

Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?

17 / 17

A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.

Your score is

The average score is 64%

0%