Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.

Technical Interview Questions and Answers :: Data Structure

  • 1. What are the types of data structure you know, explain it.
  • Answer:

    There are two types of datastructure.



    1).Linear data structure



    2).Non Linear datastucture.



    For example linear datastructure are stack queue and link list



    Non linear datastructure are tree

    Please Login First :
    Tags:

    No Tags on this question yet!

  • 2. What array, linked list? What are major difference ?
  • Answer:

    Array is an indexed based sequential datasture which is stored contigous memory locations . It is mainly used when the operation is searching of element from the list.



    Link list is a sequential datastructure which consists of nodes located at non contigous memory locations. It is used when the operation is insertion and deletion.

    Please Login First :
    Tags:

    Wipro Syntel Inc. 

  • 3. What is stack and queue?
  • Answer:

    Stack is a sequential datastructure which will follow last in first out (LIFO) rules. The mainly operations of stack are : push pop peer empty and full.



    Qeque is also a sequential datastructure which will work on First In First Out(FIFI) . It is the datastructure with restriction that the insertion will be performed from one end and deletion from the another end with help of front and rear. The mainly operations will be performed are : enque and deque operations .



    We can implement both by using an array (i.e. static implementation ) and another is using linklist that is dynamic implementation.

    Please Login First :
    Tags:

    Wipro TCS Virtusa Syntel Inc. 

  • 4. What is circular linked list ?
  • Answer:

    No Discussion on this question yet!

    Please Login First :
    Tags:

    Wipro Virtusa Accenture 

  • 5. What is circular queue ?
  • Answer:

    No Discussion on this question yet!

    Please Login First :
    Tags:

    Wipro Virtusa Accenture 

  • 6. What is priority queue ?
  • Answer:

    No Discussion on this question yet!

    Please Login First :
    Tags:

    Wipro Virtusa Accenture 

  • 7. Write a structure of doubly linked list?
  • Answer:

    Struct Node{



    Int data;   //datafield



    Struct  Node* next;//address field of                                        the next node



    Struct Node*prev;//address field of                                       the previous field



    }Struct Node node;

    Please Login First :
    Tags:

    Wipro Virtusa Accenture 

  • 8. What is binary search?
  • Answer:

    No Discussion on this question yet!

    Please Login First :
    Tags:

    Wipro iGate Virtusa Accenture 

  • 9. What is a self referencing pointer?
  • Answer:

    No Discussion on this question yet!

    Please Login First :
    Tags:

    Wipro TCS iGate Virtusa Accenture 

  • 10. Draw the nodes of doubly linked list?
  • Answer:

    No Discussion on this question yet!

    Please Login First :
    Tags:

    Wipro iGate Virtusa Accenture 

Operating System, Data Structure are some of the topics which will find the place in almost every interview, as they serve as the base and are a must especially for freshers. Also, a good subject to learn algorithms, storing methodologies, maintaining the quality and optimal time of the code and much more for college students.

The collection of Data Structure Interview Questions and Answers questions here helps you to do that and much more. Learn and test your knowledge through the mock tests. Giving an interview, need some quick questions to review, WE HAVE GOT YOUR BACK!!, just save the questions to your personalized reading list using TO READING LIST and see through them anytime anywhere you want.
All questions here are based on the real time experience of previous candidates and have been asked in various IT Companies interviews at freshers and Experience level.