Mark the following statements are true or false: (20 marks, 2 mark each)

discuss your answer.

1) The Depth-First algorithm is used to search for a node in the graph by traversing from root node and explore the search as deep as possible until a dead end is found.

2) Finding the largest element in a linked list of size n is of O(log n).

3) Compared to doubly linked lists, singly-linked lists require less space

4) To represent hierarchical relationship between family members, a graph data structure is suitable.

5) Linked lists are the best data-structure in case the size and structure of the data are constantly changing.

6) The selection-sort performs equal swapping steps in comparison with the bubble-sort algorithm.

7) NP problems are problems that have yes/no answers that are easy to verify, but are hard to solve.

8) Minimal spanning tree algorithm belongs to the brute-force paradigm.

9) In linear search, search start randomly from any element in the list and check all the other element in the list.

10) KMP searching algorithm is faster than the Linear search.