Jump to content
ChetanaSforum
Sign in to follow this  
Ravi

(FAQ) Interview FAQ in Data Structures

Recommended Posts

Try to answer these questions frens. All these are asked in various interviews.ravi^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^What is a data structure? What does abstract data type means? Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked) Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked) How is it possible to insert different type of elements in stack? Stack can be described as a pointer. Explain. Write a Binary Search program Write programs for Bubble Sort, Quick sort Explain about the types of linked lists How would you sort a linked list? Write the programs for Linked List (Insertion and Deletion) operations What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion? Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. Explain binary searching, Fibinocci search. What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute? When will you sort an array of pointers to list elements, rather than sorting the elements themselves? The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? Which sort show the best average behavior? What is the average number of comparisons in a sequential search? Which data structure is needed to convert infix notations to post fix notations? What do you mean by: Syntax Error Logical Error Runtime Error How can you correct these errors? In which data structure, elements can be added or removed at either end, but not in the middle? How will inorder, preorder and postorder traversals print the elements of a tree? Parenthesis are never needed in prefix or postfix expressions. Why? Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.

Share this post


Link to post
Share on other sites

Hi, This is Priya here.Pls try to post the answers to these questions if possible. This would a great help for a quick revision.

Try to answer these questions frens. All these are asked in various interviews.ravi^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^What is a data structure? What does abstract data type means? Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked) Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked) How is it possible to insert different type of elements in stack? Stack can be described as a pointer. Explain. Write a Binary Search program Write programs for Bubble Sort, Quick sort Explain about the types of linked lists How would you sort a linked list? Write the programs for Linked List (Insertion and Deletion) operations What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion? Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. Explain binary searching, Fibinocci search. What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute? When will you sort an array of pointers to list elements, rather than sorting the elements themselves? The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? Which sort show the best average behavior? What is the average number of comparisons in a sequential search? Which data structure is needed to convert infix notations to post fix notations? What do you mean by: Syntax Error Logical Error Runtime Error How can you correct these errors? In which data structure, elements can be added or removed at either end, but not in the middle? How will inorder, preorder and postorder traversals print the elements of a tree? Parenthesis are never needed in prefix or postfix expressions. Why? Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.

Share this post


Link to post
Share on other sites

sorry priya but i dont know answers.i thought i can get some answers from knowledgeable chetanaites.lets start discussing the answers.i am sure most of the question answers will be known to our chetanaites.those who knows can help others like me.

Share this post


Link to post
Share on other sites

Try to answer these questions frens. All these are asked in various interviews.

ravi

 

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

What is a data structure?

What does abstract data type means?

Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)

Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked)

How is it possible to insert different type of elements in stack?

Stack can be described as a pointer. Explain.

Write a Binary Search program

Write programs for Bubble Sort, Quick sort

Explain about the types of linked lists

How would you sort a linked list?

Write the programs for Linked List (Insertion and Deletion) operations

What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?

Explain quick sort and merge sort algorithms and derive the time-constraint relation for these.

Explain binary searching, Fibinocci search.

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

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

A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?

A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?

When will you sort an array of pointers to list elements, rather than sorting the elements themselves?

The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?

What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?

Which sort show the best average behavior?

What is the average number of comparisons in a sequential search?

Which data structure is needed to convert infix notations to post fix notations?

What do you mean by:

Syntax Error

Logical Error

Runtime Error

How can you correct these errors?

In which data structure, elements can be added or removed at either end, but not in the middle?

How will inorder, preorder and postorder traversals print the elements of a tree?

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

Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.

Bubble Sort Algorithm Analysis:

The bubble sort is the oldest and simplest sort in use. Unfortunately, it's also the slowest, this sort works by comparing each item in the list with the item next to it, and swapping them if required.

The algorithm repeats this process until it makes a pass all the way through the list without swapping any items (in other words, all items are in the correct order). This causes larger values to "bubble" to the end of the list while smaller values "sink" towards the beginning of the list.

 

While the insertion, selection, and shell sorts also have O(n2) complexities, they are significantly more fficient than the bubble sort.

 

Pros: Simplicity and ease of implementation.

Cons: Horribly inefficient.

 

 

Quick Sort Analysis:

The quick sort is an in-place, divide-and-conquer, massively recursive sort. As a normal person would say, it's essentially a faster in-place version of the merge sort. The quick sort algorithm is simple in theory, but very difficult to put into code.The efficiency of the algorithm is majorly impacted by which element is choosen as the pivot point. The worst-case efficiency of the quick sort, O(n2), occurs when the list is sorted and the left-most element is chosen. Randomly choosing a pivot point rather than using the left-most element is recommended if the data to be sorted isn't random. As long as the pivot point is chosen randomly, the quick sort has an algorithmic complexity of O(n log n).

 

 

Pros: Extremely fast.

Cons: Very complex algorithm, massively recursive.

Share this post


Link to post
Share on other sites

ans 1 Data structure is a logical model of a particular organization of data. It must be simple so that it can process efficiently as and when neccesary.it includes:logical description of data structureimplementation of data structureans 3 take a stack and push operators into stack such as (*,+,_,/,etc) and when 2 operands(let a & B) appears pop out 1 operator and perform the expression (a operator B) and push it in 2 a stackeg: ++2 6+-13 2 4+(2+6) +-13 2 4+8+(13-2)4+8+11 4+8(11+4)+8 158+1523 ansans 4 in post fix notation operator symbol is placed after its two operands eg: to add a & b we can write as ab+ or ba+((a+2)*(b+4))-1((a2+) *(b4+))-1(a2+b4+*)-1a2+b4+*1- ansi will send u more answers afterwards ok

Try to answer these questions frens. All these are asked in various interviews.ravi^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^What is a data structure? What does abstract data type means? Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked) Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked) How is it possible to insert different type of elements in stack? Stack can be described as a pointer. Explain. Write a Binary Search program Write programs for Bubble Sort, Quick sort Explain about the types of linked lists How would you sort a linked list? Write the programs for Linked List (Insertion and Deletion) operations What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion? Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. Explain binary searching, Fibinocci search. What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute? When will you sort an array of pointers to list elements, rather than sorting the elements themselves? The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? What is the average number of comparians sons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? Which sort show the best average behavior? What is the average number of comparisons in a sequential search? Which data structure is needed to convert infix notations to post fix notations? What do you mean by: Syntax Error Logical Error Runtime Error How can you correct these errors? In which data structure, elements can be added or removed at either end, but not in the middle? How will inorder, preorder and postorder traversals print the elements of a tree? Parenthesis are never needed in prefix or postfix expressions. Why? Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.

Share this post


Link to post
Share on other sites

Adding few more popular question.What is Third normal form?How to normalize a database?

Share this post


Link to post
Share on other sites

Hi All,IQRA Software is a company having offices at Bangalore and Kanpur.We are offering courses on various software technologies for B. Tech., M. Tech., BCA and MCA. We have special courses on SUMMER TRAINING for B. Tech. 3rd year..For more information, you can check the following web-site,www.iqrasoftwares.comKindly forward this mail to your colleague and friends.Regards,ISTL

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  



×