Skip to main content

Data Structure – Technical interview questions


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?
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 is a data structure?
What does abstract data type means?
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
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 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 in order, preorder and post order 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 ordered set of elements in an array or a sequential search of the elements.

Knowing all basic questions you can prepare these questions and can attend technical interviews confidently.
Hope these questions will help you getting your dream job!

Popular posts from this blog

Introduction to JavaScript- Basics

JavaScript is the most popular scripting language on the internet, and works in all major browsers, such as Internet Explorer, Firefox, Chrome, Opera, and Safari. What You Should Already Know Before you continue you should have a basic understanding of the following: HTML and CSS If you want to study these subjects first, find the tutorials on our Languages page . What is JavaScript? JavaScript was designed to add interactivity to HTML pages JavaScript is a scripting language A scripting language is a lightweight programming language JavaScript is usually embedded directly into HTML pages JavaScript is an interpreted language (means that scripts execute without preliminary compilation) Everyone can use JavaScript without purchasing a license Are Java and JavaScript the same? NO! Java and JavaScript are two completely different languages in both concept and design! Java (developed by Sun Microsystems) is a powerful and much more complex programming language ...

IBM Sample Problem Using Speed

Question 1 A policeman starts chasing a thief 30 minutes after the thief had run from a spot. With an average speed of 20km per hour, he takes 2 hours to catch the thief. What is the average speed of the thief? a)16km/hr b)25km/hr c)24km/hr d)18km/hr Answer : a)16km/hr Solution: As given, the average speed of the policeman = 20km/hr. He takes 2 hours to catch the thief, so from formula, "distance = speed x time" we have The total distance covered by the police to catch the thief = 20 x 2 = 40 km (This value is also equal to the distance run by thief before being caught by Police.) Policeman had started late by 30 minutes and took 2 hours to catch the running thief. Above means that the thief takes (30minutes + 2 hours =) 5/2 hours to reach 40km. So the speed of the thief = 40/(5/2) = 40 x 2 / 5 = 16 km/hr. Hence the answer is 16km/hr. Question 2 From a particular spot, Tom started to chase Jerry which had left the spot before 30 minutes. Tom ran acro...

MCA - Syllabus, Notes, Question Papers, Projects

MCA - Syllabus, Notes, Question Papers, Projects : SEMESTER - 1 Syllabus: Syllabus PDF Notes: Semester 1 Notes Question Papers:  Project: SEMESTER - 2 Syllabus: Syllabus PDF                                   Notes: Semester 2 Notes Question Papers:  Projects:  SEMESTER - 3  Syllabus: Syllabus PDF                                   Notes: Semester 3 Notes Question Papers:  Project: SEMESTER - 4  Syllabus: Syllabus PDF                               ...