Data Structure Interview Questions

Size: px

Start display at page:

Download "Data Structure Interview Questions"

Bartholomew Daniel
6 years ago
Views:

1 Data Structure Interview Questins A list f tp frequently asked Data Structure interview questins and answers are given belw. 1) What is Data Structure? Explain. Data structure is a way that specifies hw t rganize and manipulate the data. It als specifies the relatinship between them. It prvides sme algrithms t make data access mre efficient and easy. 2) In which areas data structures are applied extensively? Data structures are applied extensively in the fllwing areas f cmputer science: Cmpiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulatin 3) What is the difference between file structure and strage structure? Difference between file structure and strage structure: The main difference between file structure and strage structure is based n memry area that is being accessed. Strage structure: When we deal with the structure that resides in the main memry f the cmputer system, knwn as the strage structure. File structure: When we deal with an auxiliary structure then it is referred as file structures.

2 4) Which data structures are used with the fllwing areas: RDBMS, Netwrk data mdel and hierarchical data mdel? RDBMS uses Array data structure Netwrk data mdel uses Graph Hierarchal data mdel uses Trees 5) What are Binary trees? A Binary Tree is a type f data structure that has tw ndes: A left nde and a right nde. In prgramming, binary trees are actually an extensin f the linked list structures. 6) What is a Stack? A stack is a data structure in which nly the tp element can be accessed. As data is stred in the stack, each data is pushed dwnward, leaving the mst recently added data n tp. 7) What is a multidimensinal array? A multidimensinal array stres data in multiple indexes. It is used when the string data that cannt be represented using a single dimensinal indexing, such as data representatin in a bard game, tables with data stred in mre than ne clumn. 8) What is a linked list in data structure? A linked list is a sequence f ndes in which each nde is cnnected t the nde fllwing it. It makes a chain like link f data strage.

3 9) If yu are using C language t implement the hetergeneus linked list, what pinter type shuld be used? The hetergeneus linked list cntains different data types, s it is nt pssible t use rdinary pinters fr this. Fr this wrk, yu have t use a generic pinter type like vid pinter because vid pinter is capable f string pinter t any type. 10) Hw many minimum numbers f queues are needed t implement the pririty queue? Tw queues are needed. One queue is used fr actual string f data and anther fr string pririties. 11) Which data structure is used t perfrm recursin?

4 Stack is used t perfrm recursin because f its LIFO (Last In First Out) prperty. It knws whm t return when the functin has t return. 12) When shuld yu use binary search engine? A binary search algrithm is used t search a list when the elements are already in rder r srted. The list starts searching in the middle, if the middle value is nt the target search key, it will check t see if it will cntinue the search n the lwer half f the list r the higher half. The split and search will then cntinue in the same manner. Example: 13) Hw t reference all the elements in a ne-dimensin array? It can be dne by using an indexed lp such that the cunter runs frm 0 t the array size minus ne. By this manner, yu can reference all the elements in sequence by using the lp cunter as the array subscript.

5 14) Which ntatins are used in Evaluatin f Arithmetic Expressins using prefix and pstfix frms? Plish and Reverse Plish ntatins. 15) Give sme example f the applicatin f Tree-data structure? Applicatin f Tree- data structure: The manipulatin f Arithmetic expressin, Symbl Table cnstructin, Syntax analysis 16) Give the example f sme applicatins that make use f Multilinked Structures? Sparse matrix, Index generatin. 17) Are linked lists cnsidered linear r nn-linear data structures? A linked list is cnsidered bth linear and nn-linear data structure depending n the situatin. On the basis f data strage, it is cnsidered as nn-linear data structure. On the basis f access strategy, it is cnsidered as linear data-structure. 18) What is the difference between NULL and VOID? Null is actually a value, whereas Vid is a data type identifier. A null variable simply indicates an empty value, whereas vid is used t identify pinters as having n initial size.

6 19) What is the difference between PUSH and POP? PUSH and POP peratins specify hw data is stred and retrieved in a stack. PUSH: PUSH specifies that data is being "pushed" int the stack. POP: POP specifies data retrieval, and in particular refers t the tpmst data being accessed. 20) What is a pstfix expressin? An expressin which each peratr fllws its perand is knwn as pstfix expressin. The main benefit f this frm is that there is n need t grup sub-expressins in parentheses r t cnsider peratr precedence.

Chapter 3 Stack. Books: ISRD Group New Delhi Data structure Using C

Chapter 3 Stack. Books: ISRD Group New Delhi Data structure Using C C302.3 Develp prgrams using cncept f stack. Bks: ISRD Grup New Delhi Data structure Using C Tata McGraw Hill What is Stack Data Structure? Stack is an abstract data type with a bunded(predefined) capacity.