Q. The statement print f ("%d", 10 ? 0 ? 5 : 1 : 12); will print?

  • (A) 10
  • (B) 0
  • (C) 12
  • (D) 1
πŸ’¬ Discuss
βœ… Correct Answer: (D) 1

Q. To represent hierarchical relationship between elements, which data structure is suitable?

  • (A) priority
  • (B) tree
  • (C) dqueue
  • (D) all of the above
πŸ’¬ Discuss
βœ… Correct Answer: (B) tree

Q. Which of the following data structure is linear type?

  • (A) strings
  • (B) queue
  • (C) lists
  • (D) all of the above
πŸ’¬ Discuss
βœ… Correct Answer: (D) all of the above

Q. The statement printf("%c", 100); will print?

  • (A) prints 100
  • (B) print garbage
  • (C) prints ascii equivalent of 100
  • (D) none of the above
πŸ’¬ Discuss
βœ… Correct Answer: (C) prints ascii equivalent of 100

Q. The _______ memory allocation function modifies the previous allocated space.

  • (A) calloc
  • (B) free
  • (C) malloc
  • (D) realloc
πŸ’¬ Discuss
βœ… Correct Answer: (D) realloc

Q. Number of binary trees formed with 5 nodes are

  • (A) 30
  • (B) 36
  • (C) 108
  • (D) 42
πŸ’¬ Discuss
βœ… Correct Answer: (D) 42

Q. The "C" language is

  • (A) context free language
  • (B) context sensitive language
  • (C) regular language
  • (D) none of the above
πŸ’¬ Discuss
βœ… Correct Answer: (A) context free language

Q. The worst case time complexity of AVL tree is better in comparison to binary search tree for

  • (A) search and insert operations
  • (B) search and delete operations
  • (C) insert and delete operations
  • (D) search, insert and delete operations
πŸ’¬ Discuss
βœ… Correct Answer: (D) search, insert and delete operations

Q. In which tree, for every node the height of its left subtree and right subtree differ almost by one?

  • (A) binary search tree
  • (B) avl tree
  • (C) threaded binary tree
  • (D) complete binary tree
πŸ’¬ Discuss
βœ… Correct Answer: (B) avl tree

Q. C is ______ Language?

  • (A) low level
  • (B) high level
  • (C) assembly level
  • (D) machine level
πŸ’¬ Discuss
βœ… Correct Answer: (A) low level