Top MCQs on Data Structures and Algorithms

Last Updated :
Discuss
Comments

Question 1

Inserting an item into the stack when the stack is not full is called…….. Operation and deletion of an item from the stack, when the stack is not empty is called ...........operation.
 

  • push, pop

  • pop, push

  • insert, delete

  • delete, insert

Discuss it

Question 2

The Worst case occurs in linear search algorithm when

  • Item is somewhere in the middle of the array

  • Item is not in the array at all

  • Item is the last element in the array

  • Item is the last element in the array or is not there at all.

Discuss it

Question 3

Within a switch statement, you can use—

  • Continue but not break

  • Break but not continue

  • Both continue and break

  • Neither continue nor break

Discuss it

Question 4

Which operator is used to invert all the digits in a binary representation of a number?

  • ~

  •  <<<

  • >>>

  • ^

Discuss it

Question 5

The Default Parameter passing mechanism is

  • Call by value

  • Call by reference

  • Call by value result

  • None of the above

Discuss it

Question 6

One IF statement can have multiple

  • IF

  •  ELSEIF

  • ELSE

  • CASE

Discuss it

Question 7

The program fragment—   

int a=5, b=2;
print(a++*++b);

  • Prints 15

  • Prints 10

  • Prints 18

  • None of these.

Discuss it

Question 8

Which is not the arithmetic operator in programming

  • %

  • >

  • *

  • +

Discuss it

Question 9

What will be the output of the following program?    

int a=5, b=2;
print ( a+++b);

  • Results in compilation error

  • Prints 7

  • Prints 8

  • None of above

Discuss it

Question 10

What happens if the base condition is not defined in recursion? 

  • Stack Underflow

  • Stack Overflow

  • None of these

  • Both a and b

Discuss it

There are 20 questions to complete.

Take a part in the ongoing discussion
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy