UNIT – I 14. Explain pointer and arrays.

Review Questions 15. Explain ‘pointers and two dimensional array.

Part A (2 Marks) 16. What is called array of pointers?
1. What is data and information? 17. Explain how pointers are used in representing strings.
2. What is the difference between data and information? 18. Explain how will you implement array.
3. Define entity. 19. List the use of string conversion functions.
4. What are the primitive data structures? 20. Write a program to illustrate the use of string functions.
5. What are the non – primitive data structures? 21. Explain string handling functions in detail.
6. What are the operations that can be performed on data
structures?
7. What are the various approaches in designing an UNIT –II
algorithm? Review Question
8. What is called top down approach? PART A
9. What is called bottom up approach? 1. Define Stack?
10. What is called time Complexity? 2. State the condition for empty stack in array
11. What is called Space Complexity? implementation?
12. What is the use of Big O Notation? 3. What is recursive function?
13. What is an array? 4. What is the property of recursive function?
14. How will you represent one dimensional array? 5. Define queue.
15. How will you declare two dimensional array? 6. State difference between queue and circular queue.
16. What is called string?
17. How will you declare a string? PART B
18. List few operations that can be performed on strings. 1. Write down the algorithm for push operation.
19. What is called null character? 2. What is reverse polish notation? Explain with example.
20. How will you read a string? 3. Write down the algorithm to find factorial of given
21. What is the disadvantage of pointer to string? number
4. Write algorithm to find gcd of two natural numbers
Part B (3 Marks) 5. Ex[lain priority queue.
1. What is called attribute? Give Example.
2. Classify Data Structures. PART C
3. What are primitive and non – primitive data structures? 1. Explain array implementation of stack.
4. Define traversing. Give example. 2. Explain algorithm to convert infix expression to postfix
5. Define sorting. Give example. expression
6. Define searching. Give example. 3. Explain algorithm to evaluate postfix expression
7. Write the algorithm of merging. 4. Explain algorithm to do basic operation in queue
8. What is called inserting and deleting? 5.Explain algorithm to perform PUSH and POP operation
9. Give example for top down and bottom up approach.
10. Write a brief note on Big O Notation.
11. List the advantages and disadvantages of arrays. UNIT –III
12. What is called string conversion? Review Questions
13. How pointers are advantageous in representing string? Part A
14. List few operations that can be performed on array. 1 .Define linked list
Explain any one. 2. What are the two fields in a linked list?
15. What is the use of strcmp() command? 3.List out the types of linked list
4. What is null pointer?
Part C (5 or 10 Marks) 5. What is empty list?
1. List and explain the types of data structures. 6.What are the two pointers in dll?
2. Explain traversing with algorithm . 7. Define circular linked list
3. Explain how will you insert and delete data in array. 8. What are the three fields in a DLL node?
4. Explain primitive and non – primitive data structure in 9. Draw a circular linked list
detail. 10.What are the disadvantages of circular linked list?
5. Explain sorting with example.
6. Assume an array contains 8 data. Explain how will you Part B
search an element in that array. 1. What is address? What are its types?
7. Write the algorithm for merging and explain with 2. Define the different types of linked list
example. 3. Define doubly linked list
8. Explain how will you store 1D array in detail. 4. What are the advantages of circular linked list?
9. What are the two ways of representing array? Explain. 5. What is meant by traversing a list?
10. What is called row major and column major 6. Describe the purpose of the link fields of a doubly linked
representation? list?
11. Explain top down and bottom up approach in detail. 7. List out the advantages of circular linked list
12. Write a brief note on complexity. 8. How to declare a doubly linked list?
13. What is called multidimensional array? Give examples.
 Part C Part B (3 Mark Questions)
1 .Explain array implementation of linked list 1. Write the algorithm for bubble sort.
2. Tabulate the differences between sequential list and 2. Write the algorithm for Insertion sort.
linked list 3. Write the algorithm for Selection sort.
3 . List out the advantages and disadvantages of linked list 4. Write the algorithm for Merge sort.
4 .Explain Traversing a linked list 5. Write the algorithm for Radix sort.
5. Write down the algorithm to search for a particular 6. Write the algorithm for Shell sort.
element in a SLL? 7. Write the algorithm for Quick sort.
6. Explain How to inserting a node at the front of a list? 8. Write the algorithm for linear or sequential search
7.. Explain How to insert a node as a last node in a list? 9. Write the algorithm for binary search.
8. .Explain How to insert a node at a middle of a list? 10. What is meant by hashing.
9. .Explain deleting first node in a linked list? 11. Write any one method of hash function.
10. Explain deleting last node in a linked list? 12. Write short notes on any one collision resolution
method..

UNIT –IV Part c (5 or 10 Mark Questions)

Review Question 1. Explain bubble sort by taking 8 data in array.
PART A 2. Write a program to implement bubble sort.
1. Define directed graph? 3. Explain with example Selection sort.
2. Define path? 4. Write a program to implement selection sort.
3. Define length of a graph? 5. Explain with example Insertion sort.
4. Expand DFS and BFS. 6. Write a program to implement Insertion sort.
7. Explain with example Merge sort.
PART B 8. Explain with example Radix sort.
1. Write short notes on the following 9. Explain with example Shell sort.
a) in-degree b) out-degree c) edge 10. Explain with example Quick sort.
2. Write down the application of the graph 11. Explain linear searching method with suitable example.
3. Draw BFS graph with 8 node. 12. Explain Binary searching method with suitable example.
4. Draw DFS graph with 8 node. 13. Explain hashing.
5. Explain Set representation of graph. 14. Explain Hashing function.
15. Explain any one Collision Resolution method in detail.
PART C 16. What is open addressing?. Explain with example.
1. Explain DFS with example 17. What is called separate chaining?. When will you use it?.
2. Explain BFS with algorithm. Explain.
3. Explain Adjacency List Representation of graph.
4. Explain Matrix representation of graph.
5. Write down the comparison of graph representation.

UNIT –V
Review Questions
Part A (2 mark Questions)
1. Define sorting. What are the two types of sorting?
2. What is the principle used in bubble sort?
3. What is the principle used in selection sort?
4. What is the logic behind insertion sort?
5. What is the principle used in Merge sort?
6. What is the principle used in Shell sort?
7. What is the logic behind Radix sort?
8. What is the principle used in Quick sort?
9. Define searching. What are the two types of searching?
10. Define Linear Search.
11. Define Binary search.
12. Define Hashing.
13. What is called hash table?
14. What is called collision?
15. What is meant by hash function?
16. What are the two methods of Collision Resolution?
17. What is the principle used in separate chaining?
18. What is called open addressing?