The Structures cannot contain a pointer to itself.

July 17, 2021 in C and CPP

The Structures cannot contain a pointer to itself.

Each statement below is either TRUE or FALSE. Choose the most appropriate one
and ENTER in the “tear-off” sheet attached to the question paper, following
instructions therein.

2.1 The Structures cannot contain a pointer to itself.
2.2 A simple graph is connected if and only if it has a spanning tree.
2.3 Insertion of an element in an array requires shifting of some elements of the array by
one position.
2.4 Two sorted lists with m elements and n elements can be merged into a sorted list using
no more than m+n-1 comparisons.
2.5 The number of disk accesses required for most operations on a B tree is inversely
proportional to the height of the tree.
2.6 The time required to perform a sequence of data structure operations is averaged over
all the operations performed in an Amortized analysis.
2.7 All the terminal nodes are traversed in the same order from left to right in in-order,
preorder and post-order traversals of a binary tree.
2.8 A complete binary tree with n internal nodes has (n-1) leaves.
2.9 AVL trees, 2-3 trees and B trees permits searches, inserts, deletes in O(log n) time.
2.10 The in-degree of a vertex is the number of edges leaving it.

July 17, 2021 in C and CPP

The number of comparisons needed to merge-sort a list of n elements is

1.10 The number of comparisons needed to merge-sort a list of n elements is
A) O(n log n)
B) O(n log log n)
C) O(n)
D) O(n log n2 )

July 17, 2021 in C and CPP

The number vertices in a full m-ary tree with i internal nodes is

1.9 The number vertices in a full m-ary tree with i internal nodes is
A) mi + 1
B) 2^mi – 1
C) Mi
D) 2^mi-1

July 17, 2021 in C and CPP

Which of the following statement is false?

1.8 Which of the following statement is false?
A) In a circular queue, overflow occurs less frequently than in a simple queue
B) In a deque, insertion and deletion of elements can take place on either end
C) In a priority queue, insertion of new elements always takes place at one end
D) None of the above

July 17, 2021 in C and CPP

The number of null pointers in a binary tree with k internal nodes is

1.7 The number of null pointers in a binary tree with k internal nodes is
A) k + 1
B) k – 1
C) k
D) The number depends on the slope of the tree

July 17, 2021 in C and CPP

Which of the following statements is true?

1.6 Which of the following statements is true?
A) A binary tree is always a heap
B) A heap is a full binary tree
C) A heap is a complete binary tree
D) Root of the heap is always the smallest element in the heap

July 17, 2021 in C and CPP

In the text of the divide and conquer algorithm must contain at least

1.5 In the text of the divide and conquer algorithm must contain at least
A) One recursive call
B) Two recursive calls
C) Either one or zero calls
D) None of the above

July 17, 2021 in C and CPP

To insert a node at the end of the singly connected linked list having ‘p’ nodes,

1.4 To insert a node at the end of the singly connected linked list having ‘p’ nodes, how
many nodes are to be traversed for this insertion operation?
A) p/2
B) p
C) 1
D) none of the above

July 17, 2021 in C and CPP

Refer to the above declaration which one of the following statements are true regarding the expression ((char *)p)++?

1.3 int *p;
Refer to the above declaration which one of the following statements are true regarding
the expression ((char *)p)++?
A) It gives the first byte of the value pointed by p and increments p by 1.
B) It increases p by 1
C) This expression is not portable
D) It increments the first byte of the value pointed by p by 1.

July 17, 2021 in C and CPP

Depth first traversal of a graph produces

1.2 Depth first traversal of a graph produces
A) a spanning tree of the graph
B) a spanning forest of the graph
C) a minimal spanning tree
D) none of the above