Data Structures

21. A connected graph T without any cycles is called _________.

1. a tree graph.
2. free tree.
3. a tree.
4. all of the above.

View answer

22. A linked list whose last node points back to the list node instead of containing the null pointer _________.

1. circular list.
2. linked list.
3. circular doubly linked list.
4. doubly linked list.

View answer

23. A list that has no nodes is called_________.

1. End list.
2. Zero list.
3. Null list.
4. Sentinel list.

View answer

24. A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.

1. n.
2. n+1.
3. n+2.
4. n-1.

View answer

25. A string `s` consists of x, y and if x is an empty string then y is called as_________.

1. initial substring.
2. substring of s.
3. node of the string.
4. index.

View answer

26. A technique for direct search is _________.

1. Binary Search
2. Linear Search
3. Tree Search
4. Hashing

View answer

27. A tree is a data structure which represents hierarchical relationship between individual _________.

1. data items.
2. fields.
3. nodes.
4. linked list.

View answer

28. A tree is a finite set of _________.

1. loops.
2. domains.
3. functions.
4. nodes.

View answer

29. A variable whose size is determined at compile time and cannot be changed at run time is _________.

1. static variable.
2. dynamic variable.
3. not a variable.
4. data variable.

View answer

30. A vertex of degree one is called _________.

1. padent
2. isolated vertex
3. null vertex
4. colored vertex

View answer