DSA important question bsc csit third semester
ON this 📄 You Will find Important Question on Data structure and algorithm
Here is a List of important question on Data structure
and algorithm of Bsc Csit 3rd semester Which may help to pass you in exam
CHAPTER 1 :INTRODUCTION TO DATA STRUCTURE AND ALGORITHMS
Q.N.1. WHAT IS ADT (ABSTRACT DATA TYPE) ? HOW IT IS DIFFERENT FROM OTHER DATA TYPES?
Q.N.2. WRITE SHORT NOTES ON
A. DYNAMIC MEMORY ALLOCATION
B. BIG OH NOTATION
Q.N.3. WHAT DO YOU MEAN BY COMPLEXITY OF ALGORITHMS? DESCRIBE TIME COMPLEXITY AND SPACE CMPLEXITY.
Q.N.4. DEFINE ALGORITHMS.WHAT IS GOOD ALGORITHM?
Q.N.5. DEFINE WORST BEST AVERAGE CASE COMPLEXITY OF ALGORITHMS. EXPLAIN WITH SUITABLE EXAMPLE.
CHAPTER 2 : STACK
Q.N.1. HOW CAN YOU USE A STACK TO EVALUATE A POSTFIX EXPRESSION?EXPLAIN.
Q.N.2. HOW CAN YOU USE STACK TO CONVERT INFIX EXPRESSION TO POSTFIX EXPRESSION?
Q.N.3. COMPARE STACK WITH QUEUE AND DISCUSS STACK AS ADT.
Q.N.4. HOW CAN YOU CONVERT INFIX TO POSTFIX NOTATION?
CHAPTER 3: QUEUE
Q.N.1. WRITE A PROGRAM TO IMPLEMENT CIRCULAR QUEUE.
Q.N.2. WHAT IS PRIORITY QUEUE. WHAT ARE THE ADVANTAGES OF PRIORITY QUEUE OVER LINEAR QUEUE?DESCRIBE INSERTION AND DELETION PROCESS OF ELEMENTS FROM PRIORITY QUEUE.
Q.N.3. WHAT IS QUEUE ? WHAT ARE THE DRWABACKS OF LINEAR QUEUE OVER CIRCULAR QUEUE?
Q.N.4. DEFINE CIRCULAR QUEUE.WHAT ARE THE PRIMITIVE OPERATION OF QUEUE.
CHAPTER 4: RECURSION
Q.N.1. DEFINE RECURSIVE ALGORITHM. HOW DO YOU IMPLEMENT RECURSIVE GCD ALGORITHM?
Q.N.2. HOW DO YOU IMPLEMENT RECURSIVE ALGORITHMS WHILE WRITING COMPUTER PROGRAMS?
Q.N.3. WHAT ARE ADVANTAGES AND DISADVANTAGES OF RECURSIVE PROGRAMMING?
Q.N.4. WRITE A C PROGRAM TO FIND GCD OF TWO NUMBERS USING RECURSION.
Q.N.5. WHAT IS RECURSION? WRITE AN ALGORITHM FOR FIBONACCI SERIES USING RECURSION.
Q.N.6. STATE TOH PROBLEM . WRITE RECURSION TREE WHEN NUMBER OF DISKS ARE FOUR.
CHAPTER 5 : LIST,LINKED LIST
Q.N.1. WHAT IS LINKED LIST? EXPLAIN DIFFERENT TYPES OF LINKED LISTS.DISCUSS ALGORITHMS FOR INSERTING AND DELETING A NODE AT FRONT POSITION OF THE LINKED LIST.
Q.N.2. WHAT ARE THE BENEFITS OF USING LINKED LIST OVER ARRAY? HOW CAN YOU INSERT A NODE IN A SINGLY LINKED LIST?
Q.N.3. WRITE A COMPLETE PROGRAM IN C TO DEMONSTRATE THE USE OF LINKED LIST IMPLEMENTATION OF STACK.
Q.N.4. WHAT IS MAIN ADVANTAGE AND DISADVANTAGE OF USING DOUBLY LINKED LIST OVER SINGLY LINKED LIST?
Q.N.5. HOW CAN YOU DELETE A NODE IN A SINGLY LINKED LIST?
CHAPTER 6 : SORTING
Q.N.1 HAND TEST SELECTION SORT ALGORITHM WITH THE DATA GIVEN BELOW :- 56 23 14 20 65 7 8 14 15 25.
Q.N.2. WHAT IS STABLE SORT?LIST OUT RECURSIVE SORTING ALGORITHMS AND DESCRIBE QUICK SORT IN DETAIL.
Q.N.3. WHY SORTING IS IMPORTANT ? DESCRIBE ANY ONE OF THE BEST SORTING TECHNIQUE WITH SUITABLE EXAMPLE.
Q.N.4. HAND TEST QUICK SORT HEAP SORT MERGE SORT
CHAPTER 7 : SEARCHING AND HASHING
Q.N.1. DISCUSS BINARY SEARCH ALGORITHM.WHAT IS TIME COMPLEXITY OF THIS ALGORITHM?
Q.N.2. WHAT ARE THE BENEFITS OF USING HASHING? HOW DO YOU CHOOSE A HASH FUNCTION?
Q.N.3 WHAT DO YOU MEAN BY HASH COLLISION? EXPLAIN HASH COLLISION RESOLVING TECHNIQUES WITH SUITABLE EXAMPLE.
Q.N.4. WHAT IS HASH FUNCTION? SHOW THAT QUADRATIC HASHING WITH SUITABLE EXAMPLE.
Q.N.5. WHAT IS HASH TABLE? EXPLAIN REHASHING WITH SUITABLE EXAMPLE.
CHAPTER 8 : TREES AND GRAPHS
Q.N.1. DEFINE GRAPH. DISCUSS DIJKASTRA ALGORITHM FOR FINDING SHORTEST PATH IN A GRAPH.
Q.N.2. HOW DO YOU BALANCE A BINARY TREE ? DISCUSS.
Q.N.3. DISCUSS DEPTH FIRST SEARCH IN A GRAPH WITH EXAMPLE.
Q.N.4. WHAT IS SPANNING TREE?EXPLAIN WITH ITS PROPERTIES.
Q.N.5. DISCUSS BREADTH FIRST TRAVERSAL OF A GRAPH WITH EXAMPLE.
Q.N.6. DISCUSS PRIMS AND KRUSKALS ALGORITHM WITH SUITABLE EXAMPLE.
Q.N.7. SHOW BINARY TREE AS AN ADT.CONSTRUCT AVL TREE OF FOLLOWING DATA ITEMS .
A[4 5 6 22 3 9 34 11 89 2 10 17 24 ]
Q.N.8. DESCRIBE STRONG AND WEEKLY CONNECTED GRAPHS WITH EXAMPLES. WHAT IS WEIGHTED GRAPH?
......!!!!!!! BEST OF LUCK 💗!!!!....
Thanks for Visiting my Blog 😊 Make share to share with your Friends ❤️ For More.. check it out my blog daily..I update content daily
Vv
ردحذفCfdff
حذفإرسال تعليق