# MCQ’s on DATA STRUCTURES (Goldman Sachs special)

Questions with concepts covered.

This course covers Best 90 Multiple Choice Questions in Data Structures with clear explanation which is useful for the candidates  who are preparing for placements and GATE exam and for the students who wants to get thorough knowledge in Data Structures. Check your knowledge in Data Structures by watching this videos clearly. My suggestion is, see the question and pause it and guess the answer then continue the video so that you asses your knowledge in concepts in Data Structures.All these questions are asked in TOP MNC placement recruitment tests and All india GATE exams in Computer science and Engineering.Please go through the basics in Data structures before starting this content.

What you’ll learn

• A total of 90 Questions realated to concepts in Data structures..
• Most of the questions are Medium and Hard level..
• More Questions on Binary tree and Binary Search Tree..
• Most of the Quetstion taken from Previous company placement papers like Goldman Sachs…

Course Content

• Data Structures MCQ’s –> 18 lectures • 4hr 27min.

Requirements

• Basic Knowledge on Data Structures..

This course covers Best 90 Multiple Choice Questions in Data Structures with clear explanation which is useful for the candidates  who are preparing for placements and GATE exam and for the students who wants to get thorough knowledge in Data Structures. Check your knowledge in Data Structures by watching this videos clearly. My suggestion is, see the question and pause it and guess the answer then continue the video so that you asses your knowledge in concepts in Data Structures.All these questions are asked in TOP MNC placement recruitment tests and All india GATE exams in Computer science and Engineering.Please go through the basics in Data structures before starting this content.

The topics covered are

1.Linked lists (Insert and Delete operations)

2.Stacks and Queues(Priority Queues).

3.Max Binary Heap and Min Binary Heap and Heap sort(Heapify method).

4.Graphs and methods(Depth First Search and Breadth First Search).

5.Minimum cost spanning trees(Prim’s and Kruskal’s).

6.Binary Tree and Binary Search Trees (Pre-order and Post-order Traversals) .

7.Infix ,postfix and Prefix operations.

8.Sorting techniques and complexities(Selection sort , Bubble sort , Merge sort and Quick sort).

9.Topological sort.

10.Balanced Binary Search trees(AVL Trees).

11.Dijkstra’s Algorithm.

Good luck and All the very best.

Get Tutorial