Data Structures

41. Collection of related data items is called _________.

  1. files
  2. fields
  3. attributes.
  4. records.

Correct answer: (D)
records

42. Data items that are divided into subitems are called _________.

  1. single items.
  2. group items.
  3. elementary items.
  4. entity items.

Correct answer: (B)
group items.

43. Data structure which is capable of expressing more complex relationship than that of physical adjacency is called_________.

  1. linear data structure.
  2. linked list.
  3. non linear data Structure
  4. data structure.

Correct answer: (C)
non linear data Structure

44. Divide and conquer is an important algorithm design paradigm based on _________.

  1. multi-branched recursion.
  2. single-branched recursion.
  3. two-way recursion.
  4. None.

Correct answer: (A)
multi-branched recursion.

45. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called _________

  1. elementary items.
  2. atoms.
  3. scalars.
  4. structure.

Correct answer: (D)
structure

46. Each entry in a linked list is a called a_________.

  1. Link.
  2. Node.
  3. Data Structure.
  4. Avail.

Correct answer: (B)
Node

47. Each node in a singly linked lists have _________ fields

  1. 2
  2. 3
  3. 4
  4. 5

Correct answer: (A)
2

48. Expression into postfix expression: (A - B) * (D / E)

  1. ABDE - * /
  2. - * / ABDE
  3. A B - D E * /
  4. * - A B / D E

Correct answer: (D)
* - A B / D E

49. For the heap sort, access to nodes involves simple _________ operations.

  1. binary.
  2. arithmetic
  3. algebraic
  4. logarithmic

Correct answer: (B)
arithmetic

50. Graph traversal is different from a tree traversal, because

  1. trees are not connected.
  2. graphs may have loops.
  3. trees have root.
  4. None is true as tree is a subset of graph.

Correct answer: (C)
trees have root.

Previous
Page 5 of 15
Next
Copyright © EngineeringMCQ.com