• Placement Questions
• /
• DATA STRUCTURE

Frequently Asked DATA STRUCTURE interview questions and answers for freshers

(#M40108950) DATA STRUCTURE QUESTION Keep an EYE

Number of possible ordered trees with 3 nodes A, B, C is

Option 1 : 16
Option 2 : 12
Option 3 : 13
Option 4 : 14

Asked In DATA STRUCTURE neha roy (5 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (42)   (33) Submit Your Solution Technical

(#M40156442) DATA STRUCTURE QUESTION binary tree Keep an EYE

Consider a Binary tree having two pointer for its each children. These pointer are set to NULL if the corresponding child is empty . How many NULL pointer does a Binary Tree with N nodes have ? options are N,n+1,n-1,depend on the shape of the tree

Asked In DATA STRUCTURE ANURAG SINGH (4 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (23)   (10) Submit Your Solution Technical

(#M40038630) DATA STRUCTURE QUESTION AMCAT Keep an EYE

The best average behaviour is shown by
(A) Quick Sort (B) Merge Sort
(C) Insertion Sort (D) Heap Sort

Asked In DATA STRUCTURE MUKESH YADAV (6 years ago)

Unsolved Read Solution (27)

Is this Puzzle helpful?   (50)   (16) Submit Your Solution Technical

(#M40151840) DATA STRUCTURE QUESTION Keep an EYE

In the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. In the question here, we are concerned with the following, related problem: First n straws are dumped on the table. Next, for every pair of straws, we want to determine if the straws are connected by a path of touching straws. In other words, given a list of the endpoints for n > 1 straws (as if they were dumped on a large piece of graph paper), determine all the pairs of straws that are connected. Note that touching is connecting, but also two straws can be connected indirectly via other connected straws. Give an algorithm to compute all the pairs of straws that are connected.
Here is some additional information that you can use:
i. As a basic step you need to determine whether two straws directly touch (intersect), i.e., whether straw ab with end points a and b intersects with straw cd (with end points c and d).
ii. To get full credit also explain how the elementary step i) can be done. If you cannot find an algorithm for this step, assume an O(n 2 ) algorithm and explain how to find all pairs of straws that are connected.
Analyse and explain the worst-case computational complexity of your algorithm in terms of n.

Asked In DATA STRUCTURE aditi yadav (5 years ago)

Solved Kostav Chaudhuri Read Solution (1)

Is this Puzzle helpful?   (3)   (6) Submit Your Solution Technical

(#M40151277) DATA STRUCTURE QUESTION Data structure Keep an EYE

A level order traversal in a binary tree requires which data structure?
a)stack b)Deque
c)Linked List d)DoublLinked list

Asked In DATA STRUCTURE kranthi kanchanapally (5 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (22)   (15) Submit Your Solution Technical

(#M40151839) DATA STRUCTURE QUESTION Keep an EYE

You are planning the group seating arrangement for a open book test given a list of students, V from different schools to participate. Assuming the fact that students who are known to each other directly or indirectly will probably cheat more as compared to unknown people sitting together.
Suppose you are also given a lookup table T where T[u] for u ? V is a list of students that u knows. If u knows v, then v knows u. You are required to arrange the seating such that any student at a table doesn't knows any other student sitting at the same table either directly or through some other student sitting at the same table. For example, if x knows y, and y knows z, then x, y, z can sit at the same table. Describe an efficient algorithm that, given V and T, returns the minimum number of tables needed to achieve this requirement. Analyze the running time of your algorithm.

Asked In DATA STRUCTURE aditi yadav (5 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (8)   (3) Submit Your Solution Technical

(#M40152056) DATA STRUCTURE QUESTION array Keep an EYE

Q.Two dimensional array elements are stored
a. System dependent
b. In Row major dependent
c. Compiler dependent
d. In column major dependent

Asked In DATA STRUCTURE Supriya_kamkar (5 years ago)

Unsolved Read Solution (18)

Is this Puzzle helpful?   (65)   (29) Submit Your Solution Technical

(#M40019022) DATA STRUCTURE QUESTION DATA STRUCTURE QUESTIONS Keep an EYE

How many different binary trees and binary search trees
can be made from three nodes that contain the key values
1, 2 & 3?

Asked In DATA STRUCTURE (7 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (11)   (4) Submit Your Solution Technical

(#M40019037) DATA STRUCTURE QUESTION DATA STRUCTURE QUESTIONS Keep an EYE

Parenthesis are never needed in prefix or postfix
expressions. Why?

Asked In DATA STRUCTURE (7 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (6)   (1) Submit Your Solution Technical

(#M40019021) DATA STRUCTURE QUESTION DATA STRUCTURE QUESTIONS Keep an EYE

What is the maximum total number of nodes in a tree that
has N levels? Note that the root is level (zero)

Asked In DATA STRUCTURE (7 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (2)   (0) Submit Your Solution Technical