# Data Structure Questions and Answers updated daily – Computer Knowledge

Data Structure Questions: Solved 242 Data Structure Questions and answers section with explanation for various online exam preparation, various interviews, Computer Knowledge Category online test. Category Questions section with detailed description, explanation will help you to master the topic.

## Data Structure Questions

21. If every node u in G is adjacent to every other node v in G, A graph is said to be

SHOW ANSWER

Correct Ans:complete

Explanation:

Workspace

22. Which of the following is useful in traversing a given graph by breadth first search?

SHOW ANSWER

Correct Ans:Queue

Explanation:

Workspace

23. The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is

SHOW ANSWER

Correct Ans:2

Explanation:

Workspace

24. The minimum number of edges required to create a cyclic graph of n vertices is

SHOW ANSWER

Correct Ans:n

Explanation:

Workspace

25. Graph traversal is different from a tree traversal, because

SHOW ANSWER

Correct Ans:trees have root.

Explanation:

Workspace

26. All possible spanning trees of graph G

SHOW ANSWER

Correct Ans:have same number of edges and vertices.

Explanation:

Workspace

27. A complete graph can have

SHOW ANSWER

Correct Ans:n

^{(n - 2)}spanning treesExplanation:

Workspace

28. A connected graph T without any cycles is called ________

SHOW ANSWER

Correct Ans:free graph

Explanation:

Workspace

29. Graph G is _________ if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

SHOW ANSWER

Correct Ans:Unliterally connected

Explanation:

Workspace

30. In a graph if e=[u,v], then u and v are called

SHOW ANSWER

Correct Ans:all of the above

Explanation:

Workspace

31. A _________ indicates the end of the list.

SHOW ANSWER

Correct Ans:Sentinel

Explanation:

Workspace

32. A run list is _______

SHOW ANSWER

Correct Ans:small batches of records from a file

Explanation:

Workspace

33. The dummy header in linked list contain _______

SHOW ANSWER

Correct Ans:first record of the actual data

Explanation:

Workspace

34. Which of the following is two way lists?

SHOW ANSWER

Correct Ans:List traversed in two directions

Explanation:

Workspace

35. The situation when in a linked list START=NULL is ______

SHOW ANSWER

Correct Ans:Underflow

Explanation:

Workspace

36. A linked list in which the last node of Linked list points to the first is called a _________.

SHOW ANSWER

Correct Ans:Circular Linked List

Explanation:

Workspace

37. Time require to find any element of the linked list is _______.

SHOW ANSWER

Correct Ans:O(n)

Explanation:

Workspace

38. The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list could be used ?

SHOW ANSWER

Correct Ans:Circular Doubly Linked List

Explanation:

Workspace

39. Consider a linked list of n elements. What is the time taken to insert an element after element pointed by same pointer ?

SHOW ANSWER

Correct Ans:O(1)

Explanation:

Workspace

40. Consider the Singly linked list having n elements. What will be the time taken to add an node at the end of linked list if Pointer is initially pointing to first node of the list.

SHOW ANSWER

Correct Ans:O(n-1)

Explanation:

Workspace

Are you seeking for good platform for practicing Data Structure questions in online. This is the right place. The time you spent in Fresherslive will be the most beneficial one for you.

## Online Test on Data Structure @ Fresherslive

This page provides important questions on Data Structure along with correct answers and clear explanation, which will be very useful for various Interviews, Competitive examinations and Entrance tests. Here, Most of the Data Structure questions are framed with Latest concepts, so that you may get updated through these Data Structure Online tests. Data Structure Online Test questions are granted from basic level to complex level.

## Why To Practice Data Structure Test questions Online @ Fresherslive?

Data Structure questions are delivered with accurate answer. For solving each and every question, very lucid explanations are provided with diagrams wherever necessary.

Practice in advance of similar questions on Data Structure may improve your performance in the real Exams and Interview.

Time Management for answering the Data Structure questions quickly is foremost important for success in Competitive Exams and Placement Interviews.

Through Fresherslive Data Structure questions and answers, you can acquire all the essential idea to solve any difficult questions on Data Structure in short time and also in short cut method.

Winners are those who can use the simplest method for solving a question. So that they have enough time for solving all the questions in examination, correctly without any tense. Fresherslive provides most simplest methods to answer any tough questions. Practise through Fresherslive test series to ensure success in all competitive exams, entrance exams and placement tests.

## Why Fresherslive For Data Structure Online Test Preparation?

Most of the job seekers finding it hard to clear Data Structure test or get stuck on any particular question, our Data Structure test sections will help you to success in Exams as well as Interviews. To acquire clear understanding of Data Structure, exercise these advanced Data Structure questions with answers.

You're Welcome to use the Fresherslive Online Test at any time you want. Start your beginning, of anything you want by using our sample Data Structure Online Test and create yourself a successful one. Fresherslive provides you a new opportunity to improve yourself. Take it and make use of it to the fullest. GOODLUCK for Your Bright Future.