Sail E0 Webinar

MCQs

Total Questions : 50 | Page 5 of 5 pages
Question 41. Two lists, A and B are implemented as singly linked link-lists
  1.    Op 1: lastB -> next = firstA
  2.    Op 2: lastA = firstB
  3.    Op 3: lastA->next = firstB
  4.    Op 4: lastB = firstA
 Discuss Question
Answer: Option C. -> Op 3: lastA->next = firstB
Question 42. Root has more left descendants than the right descendants or vice versa
  1.    Balanced Tree
  2.    Perfect Tree
  3.    Right Tree
  4.    Unbalanced Tree
 Discuss Question
Answer: Option D. -> Unbalanced Tree
Question 43. In a graph if E=(u,v) means _____________
  1.    u is adjacent to v but v is not adjacent to u
  2.    e begins at u and ends at v
  3.    u is processor and v is successor
  4.    both b and c
 Discuss Question
Answer: Option D. -> both b and c
Question 44. TREE[1]=NULL indicates is _____________
  1.    Overflow
  2.    Empty
  3.    Underflow
  4.    Full
 Discuss Question
Answer: Option B. -> Empty
Question 45. To measure Time complexity of an algorithm Big O notation is used which:
  1.    describes limiting behaviour of the function
  2.    characterises a function based on growth of function
  3.    upper bound on growth rate of the function
  4.    all of the mentioned
 Discuss Question
Answer: Option D. -> all of the mentioned
Question 46. A tree sort is also known as__________ sort
  1.    quick
  2.    heap
  3.    shell
  4.    selection
 Discuss Question
Answer: Option B. -> heap
Question 47. Entries in a stack are “ordered”
  1.    A collection of stacks is sortable
  2.    Stack entries may be compared with the ‘
  3.    The entries are stored in a linked list
  4.    There is a Sequential entry that is one by one
 Discuss Question
Answer: Option D. -> There is a Sequential entry that is one by one
Question 48. A terminal node in a binary tree is called __________
  1.    Root
  2.    Branch
  3.    Child
  4.    Leaf
 Discuss Question
Answer: Option D. -> Leaf
Question 49. The process of Visiting each element in any Data structure is termed as ____________
  1.    Traversing
  2.    Searching
  3.    Movement
  4.    Visiting
 Discuss Question
Answer: Option A. -> Traversing
Question 50. Which of the following principle does queue use?
  1.    FIFO
  2.    LIFO
  3.    Linear
  4.    Ordered
 Discuss Question
Answer: Option A. -> FIFO

Latest Videos

Latest Test Papers