Question Detail

A graph with one or more edges is at least

1-chromatic
2-chromatic
3-chromatic
4-chromatic

Answer: Option B

Similar Questions :

1. Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

2. The complexity of merge sort algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option D

3. In C how many parameters can passed to a function

2
5
10
as many as defined in function definition

Answer: Option D

4. Which is problem oriented language

BASIC
PL/I
FORTRAN
none of above

Answer: Option D

5. Deletion from one end and insertion from other end is

stack
branch
tree
queue

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1