Each statement below is either TRUE or FALSE. Choose the most appropriate one and
ENTER in the “OMR” answer sheet supplied with the question paper, following
instructions therein.
2.1 A command that lets you change one or more fields in a record is look up.
2.2 In relational schema each tuple is divided into fields called relations.
2.3 The best average SORTING behavior is shown by merge sort.
2.4 The data structure that is needed to convert infix notation to prefix notation is graph.
2.5 The best case and worst case time for searching an element using linear search is 1, n.
2.6 Forest is a set of N>=0 disjoint trees, which are obtained when root is removed.
2.7 PERT graph is a graph used to perform PERT calculation.
2.8 Priority queue is a queue that is used to store priority data.
2.9 A symmetric diagraph is a directed graph such that for every edge VW there is reverse edge WV.
2.10 Maximum degree in any vector in a graph with n vertices is n-1.
