An ordered set of items from which items may be deleted inserted at either end

July 21, 2021 in C and CPP

An ordered set of items from which items may be deleted inserted at either end

1.4 An ordered set of items from which items may be deleted inserted at either end
A) Queue
B) Graph
C) Heap
D) Dequeue

July 21, 2021 in C and CPP

Which data structure is implemented in automatic variable declaration?

1.3 Which data structure is implemented in automatic variable declaration?
A) Queue
B) Stack
C) Heap
D) Graph

July 21, 2021 in C and CPP

An undirected graph with ‘n’ vertices and ‘e’ edges will require a memory space of n locations plus:

1.2 An undirected graph with ‘n’ vertices and ‘e’ edges will require a memory space of n locations
plus:
A) 2e+1
B) 2e-1
C) 2e
D) None of the above

July 21, 2021 in C and CPP

Number of subtrees of a node in a Tree/Graph is called

1.1 Number of subtrees of a node in a Tree/Graph is called
A) Order
B) Degree
C) Level
D) Depth

July 17, 2021 in C and CPP

Insert the following keys into a B-Tree of order 3.

b) Insert the following keys into a B-Tree of order 3.
10 , 24 , 23 , 11 , 31 , 16 , 26 , 35 , 29 , 20 , 46 , 28

July 17, 2021 in C and CPP

Show the steps of sorting a set of numbers using quick sort.

a) Show the steps of sorting a set of numbers using quick sort.

July 17, 2021 in C and CPP

Show that the number of vertices of odd degree in a finite graph is even.

c) Show that the number of vertices of odd degree in a finite graph is even.

July 17, 2021 in C and CPP

Explain how existence of a cycle in an undirected graph may be detected by traversing the graph in the depth first manner.

b) Explain how existence of a cycle in an undirected graph may be detected by traversing the graph in the depth first manner.

July 17, 2021 in C and CPP

What is a directed graph?

a) What is a directed graph? What is a subgraph? What is a Hamiltonian path?

July 17, 2021 in C and CPP

What do you mean by circular queues?

b) What do you mean by circular queues? Give the array implementation of it. Write an algorithm for insertion and deletion of elements from the circular queue.