DATA STRUCTURE (IMP QUESTIONS )FOR (BE STUDENTS ,DIPLOMA STUNDENTS,UNIVERSITY) (CHEPTAR WISE )

• DATA STRUCTURE IMPORTANT QUESTIONS : 

👇👇👇👇👇👇👇

QUESTIONS :

1 . WHAT IS DATA STRUCTURE AND TYPES OF DATA STRUCTURE ?

2.DIFFERENCE BETWEEN LINIEAR DATA AND NON LINEAR DATA STRUCTURE.

3 DIFFERNECE BETWEEN PRIMITIVE AND NON-PRIMITIVE DATA STRUCTURE .

4. WRITE ALGORITHM FOR PUSH AND POP STACK OPERATION

5.APPLICATION OF STACK AND QUEUE .

6. WRITE A C FUNCATION FOR INSERATION AND DELETION OPERATION IS SIMPLE QUEUE.

7.WRITE AN ALGORITHM TO DELETE AN ELEMENT FROM CIRCULAR QUEUE SHOWS THE STEPS OF INSERATION AND DELETION OPERATION IS SAMPLE CIRCULAR QUEUE.

8.DESCRIBE THE ADVANTAGE OF LINKED LIST OVER ARRY.

9.WRITE AN ALGORITHM TO INSERT A NODE ATLAST POSTION IN DOUBLY LINKED LIST.

10.EXPLAIN ARRAY IN DATA STRUCTURE .

 11.WORKING OF PRIORITY QUEUE WITH SDING ORDER BY APPLYING QUUITABLE EXAMPLE .

12.WIRTE RECURSIVE ALGORITHMS TO COMPLETE FACTORIAL OF A GIVEN NUMVBERS WHICH DATA STRUCTURE CAN BE USED TO IMPLEMENT THIS ALGORITHMS.

13. SORT THE FOLLOWING NUMBER IN ASCENDING ORDER BY APPLYING QUICK SORT.

14.IF NO INTERCHANGE OCCURED THEN ALL THE ELEMENTS MUST BE SORTED AND NO FURTHER PASEES ARE REQUIRED. WHICH SORTING TECHNIQUE WORKS ON THIS PROBLEMS?

15. WRITE THE ALGORITM FOR BINARY SEARCH.

16. EXPLAIN THE WORKING OF THE PRIM'S ALGORITM WITH EXAMPLE.

17. LIST THE ADVANTAGES OF A DOUBLY LINKED LIST OVER SINGLY LINKED LIST.

18.LIST OUT GRAPH TRAVRESAL TECHNIQUES AND EXPLAIN ANY ONE USING SUITABLE EXAMPLE.

19. EXPLAIN SEQUENTIAL SEARCH METHOD WITH SUITABLE EXAMPLE.

20. EXPLAIN COLLISION IN THE CONTEXT OF HASHING ?DISSCUSS COLLISON RESOLUTION TECHNIQUES.

21.EXPLAIN THREDED BINARY TREES WITH SUITABLE EXAMPLE.

22.EXPLAIN SEQENTIAL FILE ORAGANIZATION AND LIST ITS ADVANTAGES AND DISADVANTAGES.

23.WRITE AN ALGORITHM FOR INSERTION SORT.

24. DISSCUSS DIFFERENT REPRESENTATION OF A GRAPH.

25.ALGORITHM OF BUBBLE SORT.

26. HASH FUNCTION