26. Queue is a _____________ list.
A. LIFO
B. LILO
C. FILO
D. FIFO
Answer : D
27. The statement print f ("%d", 10 ? 0 ? 5 : 1 : 12); will print?
A. 10
B. 0
C. 12
D. 1
Answer : D
28. To represent hierarchical relationship between elements, which data structure is suitable?
A. Priority
B. Tree
C. Dqueue
D. All of the above
Answer : B
29. Which of the following data structure is linear type?
A. Strings
B. Queue
C. Lists
D. All of the above
Answer : D
30. The statement printf("%c", 100); will print?
A. prints 100
B. print garbage
C. prints ASCII equivalent of 100
D. None of the above
Answer : C
A. LIFO
B. LILO
C. FILO
D. FIFO
Answer : D
27. The statement print f ("%d", 10 ? 0 ? 5 : 1 : 12); will print?
A. 10
B. 0
C. 12
D. 1
Answer : D
28. To represent hierarchical relationship between elements, which data structure is suitable?
A. Priority
B. Tree
C. Dqueue
D. All of the above
Answer : B
29. Which of the following data structure is linear type?
A. Strings
B. Queue
C. Lists
D. All of the above
Answer : D
30. The statement printf("%c", 100); will print?
A. prints 100
B. print garbage
C. prints ASCII equivalent of 100
D. None of the above
Answer : C
No comments:
Post a Comment