Interview Questions in Data structures

Posted on June 4, 2014

USEFUL FOR FYBSC (IT), FYBCA STUDENTS  

1.)  Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations.

i.)      Prefix Notation: – * +ABC ^ – DE + FG

ii.)    Postfix Notation: AB + C * DE – FG + ^ –

2.)  Sorting is not possible by using which of the following methods? (Insertion, Selection, Exchange, Deletion)

An.) Sorting is not possible in Deletion. Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion.

3.)  List out few of the applications that make use of Multilinked Structures?

(i)                Sparse matrix,

(ii)              Index generation.

4.)  In tree construction which is the suitable efficient data structure? (Array, Linked list, Stack, Queue)

An.)Linked list is the suitable efficient data structure

5.)  Classify the Hashing Functions based on the various methods by which the key value is found.

1. Direct method,
2. Subtraction method,
3. Modulo-Division method,
4. Digit-Extraction method,
5. Mid-Square method,
6. Folding method,
7. Pseudo-random method

6.)  What are the types of Collision Resolution Techniques and the methods used in each of the type?

• Open addressing (closed hashing),the methods used include: Overflow block.
• Closed addressing (open hashing),The methods used include: Linked list, Binary tree

7.)  Whether Linked List is linear or Non-linear data structure?

An.)

According to Access strategies Linked list is a linear one.
According to Storage Linked List is a Non-linear one

 

Posted By-: Vissicomp Technology Pvt. Ltd.

Website -: http://www.vissicomp.com