Sail E0 Webinar

MCQs

Total Questions : 50 | Page 3 of 5 pages
Question 21. It is a step by step process to solve a given problem
  1.    Pseudo code
  2.    Programming
  3.    Algorithm
  4.    none of the above
 Discuss Question
Answer: Option C. -> Algorithm
Question 22. Which of these best describes an array?
  1.    A data structure that shows a hierarchical behaviour
  2.    Container of objects of similar types
  3.    Arrays are immutable once initialised
  4.    Array is not a data structure
 Discuss Question
Answer: Option B. -> Container of objects of similar types
Question 23. Which of the following sorting algorithms has the lowest worst-case complexity?
  1.    Quick sort
  2.    Merge sort
  3.    Selection sort
  4.    Bubble sort
 Discuss Question
Answer: Option A. -> Quick sort
Question 24. What does the following function do for a given Linked List with first node as head?
  1.    Prints all nodes of linked lists
  2.    Prints all nodes of linked list in reverse order
  3.    Prints alternate nodes of Linked List
  4.    Prints alternate nodes in reverse order
 Discuss Question
Answer: Option B. -> Prints all nodes of linked list in reverse order
Question 25. Which of the following points is/are true about Linked List data structure when it is compared with array
  1.    It is easy to insert and delete elements in Linked List
  2.    Random access is not allowed in a typical implementation of Linked Lists
  3.    The size of array has to be pre-decided, linked lists can change their size any time.
  4.    All of the above
 Discuss Question
Answer: Option D. -> All of the above
Question 26. What is the value of the postfix expression 6 3 2 4 + – *:
  1.    1
  2.    14
  3.    74
  4.    -18
 Discuss Question
Answer: Option D. -> -18
Question 27. Full form of LIFO is ____________
  1.    Last Inside First Outside
  2.    Last Innner First Outer
  3.    Last In First Out
  4.    Last Impact First Out
 Discuss Question
Answer: Option C. -> Last In First Out
Question 28. Which data structure is needed to convert infix to postfix
  1.    Branch data structure
  2.    Tree data structure
  3.    Stack data structure
  4.    Queue data structure
 Discuss Question
Answer: Option C. -> Stack data structure
Question 29. The data structure required to check whether an expression contains balanced parenthesis is?
  1.    a) Stack
  2.    b) Queue
  3.    c) Array
  4.    d) Tree
 Discuss Question
Answer: Option A. -> a) Stack
Question 30. Maximum degree of any vertex in a simple graph of vertices n is
  1.    A - 2n - 1
  2.    B - n
  3.    C - n + 1
  4.    D - n - 1
 Discuss Question
Answer: Option D. -> D - n - 1

Latest Videos

Latest Test Papers