Analysis of Algorithms and Computational Complexity Questions and Answers

Practice Mode
Showing 10 of 239 questions
Q11
Which of the following statements is false ?
  • A Every tree is a bipartite graph
  • B A tree contains a cycle
  • C A tree with a n nodes contains n-1 edges
  • D A tree is a connected graph
Answer: Option B
Q12
Which of the following sorting method is stable ?
  • A Straight insertion sort
  • B Binary insertion sort
  • C Shell sort
  • D Heap sort
Answer: Option A
Q13
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as
  • A binary search tree
  • B AVL tree
  • C Completely balanced tree
  • D Heap
Answer: Option D
Q14
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as
  • A binary search tree
  • B AVL tree
  • C Completely balanced tree
  • D Heap
Answer: Option D
Q15
In which of the following sorting algorithm the number of comparisons needed is the minimum if the items are initially in reverse order and is the maximum if the items are in order ?
  • A Straight insertion sort
  • B binary insertion sort
  • C Heap
  • D Bubble sort
Answer: Option B
Q16
Which of the following best describes sorting ?
  • A Accessing and processing each record exactly ocne
  • B Finding the location of the record with a given key
  • C Arranging the data (record) in some given order
  • D Adding a new reccord to the data structure
Answer: Option C
Q17
A search procedure which associates an address with a key value and provides a mechanism for dealing with two or more values assigned to the same address is called
  • A linear search
  • B binary search
  • C hash coded search
  • D radix search
Answer: Option C
Q18
When key values are reals a similar data representation might be produced by using a hashing function with
  • A mod
  • B div
  • C trunc
  • D log N
Answer: Option C
Q19
A characteristic of the data that binary search uses but the linear search ignores, is the
  • A order of the list
  • B length of the list
  • C maximum value in the list
  • D mean of data valuesd
Answer: Option A
Q20
A sort which compares adjacent elements in a list and switches where necessary is a
  • A insertion sort
  • B heap sort
  • C quick sort
  • D bubble sort
Answer: Option D

📚 More from Computer Science & Engineering(CSE)

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Computer Science & Engineering(CSE)
Back to Computer Science & Engineering(CSE)
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test