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 of the following data structure is linear data structure

Trees
Graphs
Array
None of above

Answer: Option C

2. A linear list from which elements can be added or removed from either end is called

stack
queue
deque
tree

Answer: Option C

3. Which statement we should ignore in structure programming

WHILE-DO
GO-TO
IT-ELSE
SWITCH

Answer: Option B

4. Merge sort uses

Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Answer: Option A

5. Information about an array used in a program will be stored in

symbol table
activation record
dope vector
system table

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1