Data Structure & Algorithms Questions and Answers

Practice Mode
Showing 10 of 77 questions
Q51
In a Heap tree values in a node is greater than
  • A every value in left sub tree and smaller than
  • B every value in children of it
  • C Both of above conditions are true
  • D None of above conditions are true
Answer: Option B
Q52
In a graph  if e=[u, v], Then u and v are called
  • A endpoints of e
  • B adjacent nodes
  • C neighbors
  • D all of the above
Answer: Option D
Q53
A connected graph T withut any cycles is called
  • A tree
  • B free tree
  • C tree
  • D All of the above
Answer: Option D
Q54
The difference between linear array and a record is
  • A An array is suitable for homogeneous data but hte data items in a record may have diferent data type
  • B In a record, there may not be a natural ordering in opposed to linear array.
  • C A record form ahierachical structure but a linear array does not
  • D All of above
Answer: Option D
Q55
The following data structure store the homogeneous data elements
  • A Arrays
  • B Records
  • C Pointers
  • D None of the above
Answer: Option B
Q56
Which of the following data structure is not linear data structure ?
  • A Arrays
  • B Linked lists
  • C A and B are true
  • D None is true
Answer: Option C
Q57
Object model is a
  • A Rule
  • B Process guidance
  • C System model
  • D Entity
Answer: Option C
Q58
Software engineering is an engineering discipline concerned with
  • A Software concerned with
  • B Software production
  • C Software implementation
  • D All the above
Answer: Option D
Q59
A workflow model represents
  • A Sequence of activities
  • B Role of users involved
  • C Set of activities
  • D None of these
Answer: Option A
Q60
Sensor component
  • A Causes changes in system environment
  • B Communicate with other components
  • C Collects information from system environment
  • D Coordinate the operation of other components.
Answer: Option C
Questions and Answers for Competitive Exams Various Entrance Test