Subject

Data structure using ‘C’ ( 22317)

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page1 of 15

 Marks With
Chapter No. Name of chapter
Option

1 Introduction to data structure 12

2 Searching and sorting 22

3 Stack and queues 26

4 Linked list 24

5 Trees and Graphs 22

Total Marks :- 106

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page2 of 15

 Q.1 Attempt any FIVE 5*2=10
a) Introduction to data structure
b) Stack and queues
c) Linked list
d) Stack and queues
e) Trees and Graphs
f) Searching and sorting
g) Stack and queues
Q.2 Attempt any THREE 3*4=14
a) Searching and sorting
b) Linked list
c) Stack and queues
d) Trees and Graphs
Q.3 Attempt any THREE 3*4=12
a) Introduction to data structure
b) Stack and queues
c) Searching and sorting
d) Trees and Graphs
Q.4 Attempt any TWO 2*6=12
a) Searching and sorting
b) Trees and Graphs
c) Linked list
d) Stack and queues

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page3 of 15

 e) Linked list
Q.5 Attempt any TWO 2*6=12
a) Stack and queues
b) Trees and Graphs
c) Linked list
Q.6 Attempt any TWO 2*6=12
a) Searching and sorting
b) Introduction to data structure
c) Linked list

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page4 of 15

 Syllabus:-
Unit Course Outcome
Name of the Unit
No. (CO)
1 Introduction to data structure CO-317.1

2 Searching and sorting CO-317.2

3 Stack and queues CO-317.3

Course Outcome
Q.1 Attempt any FOUR 4*2=8Marks (CO)

a) Introduction to data structure CO-317.1

b) Searching and sorting CO-317.2

c)
Stack and queues CO-317.3
d)
Introduction to data structure CO-317.1
e) Searching and sorting CO-317.2
f) Stack and queues CO-317.3
Q.2 Attempt any TWO 3*4=12Marks
a) Introduction to data structure CO-317.1
b) Searching and sorting CO-317.2
c) Searching and sorting CO-317.2
d)
Stack and queues CO-317.3

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page5 of 15

 Syllabus:-
Course Outcome
Unit Name of the Unit (CO)
No.
3 Stack and queues CO-317.3

4 Linked list CO-317.4

5 Trees and Graphs CO-317.5

Course Outcome
Q.1 Attempt any FOUR 4*2=8Marks (CO)

a) Stack and queues (CO-317.3)

b) Stack and queues (CO-317.3)

c) Linked list (CO-317.4)

d) Linked list (CO-317.4)
e) Trees and Graphs (CO-317.5)
f) Trees and Graphs (CO-317.5)
Q.2 Attempt any TWO 3*4=12Marks

a) Stack and queues (CO-317.3)

b) Linked list (CO-317.4)

c) Trees and Graphs (CO-317.5)

(CO-317.5)
d) Trees and Graphs

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page6 of 15

 COURSE: Object Oriented Programming (22317)

CO.NO Course Outcome

CO-317.01 Perform basic operation on arrays.

CO-317.02 Apply different searching and sorting techniques.

CO-317.03 Implement basic operation on stack and queue using array representation.

CO-317.04 Implement basic operation on link list.

CO-317.05 Implement program to create and traverse tree to solve problems.

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page7 of 15

 UNIT-1 . Principle of Object Oriented programming

(Total Marks =06)

Q1. Define data structure ? why do you need data structure?

Q2. Give classification of data structure.

Q3. Explain different approaches to design algorithm.

Q4. State different types of data types.

Q5. Compare linear and nonlinear data structure.

Q6. Explain time and space complexity in an algorithm.

Q7. Give four basic operation of data structure.

Q8 define primitive and non primitive data structure.

Q9.Desdcribe abstract data type in detail

Q10. Describe Big ‘O’ notation.

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page8 of 15

 UNIT- 2. Searching and sorting (Total Marks =12)

Q1.Define sorting.Enlist different methods.

Q2. Define internal and external sorting.

Q3. Expalin efficiency of sorting algorithm.

Q4. Describe bubble sort with example.

Q5. Write an algorithm of bubble sort.

Q6. Describe the principle of selection sort with example.

Q7. Write an algorithm of selection sort.

Q8. Describe the principle of insertion sort with example.

Q9. Write an algorithm of insertion sort.

Q10. Describe the principle of radix sort with example.

Q11. Write an algorithm of radix sort.

Q12. Sort the following numbers using radix sort.

10,5,99,105,55,100,135,141,137,200,199

Q13. Describe the principle of quick sort with example.

Q14. Write an algorithm of quick sort.

Q15. Give advantages and disadvantages of quick sort.

Q16. Give complexity of bubble sort and radix sort.

Q17. Compare quick sort and radix sort.

Q18.What is copy constructor ?Give the syntax and example for copy constructor.
Prepared By: Mrs.S.S.Tile (Department of Information technology) Page9 of 15
Q19. Define searching. State two methods.

Q20. Differentiate between linearand binary search.

Q21. Explain linear search algorithm.

Q22. Describe linear search with example.

Q23. Explain binary search algorithm.

Q24. Describe binary search with example

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page10 of 15

 UNIT- 3. Stacks and queues

(Total Marks =20)

Q1.State the principle of stack with basic operation.

Q2. Define stack.

Q3.State importance of top pointer in stack.

Q4. Explain stack as an abstract data type.

Q5. Explain the condition stack overflow and stack underflow.

Q6.Explain push and pop operation in stack.

Q7. Explain application of stack.

Q8. Evaluate the following postfix expressions.

5,4,6,+,*,4,9,3,/,+,*

Q9. Convert the following infix expression into postfix expression.

(A+B*C/D-E+F/G/(H+I))

Q10. Write an algorithm to convert infix to postfix expression.

Q11 Convert the following expression into prefix.

(A-B/C)*(D*E-F)

Q 12 Explain the concept of recursion.

Q 13 How the problem of tower of honoi is solved?

Q 14 Define queue. Explain the term front and rear.

Q15 Compare stack and queue.

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page11 of 15

Q16. Write a program for insertion and deletion of queue.

Q17. Explain queue implementation using linked list.

Q18. Explain queue as an abstract data type.
Q19. Draw and explain circular queue in detail.
Q20. Explain the insertion and deletion of circular queue.

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page12 of 15

 UNIT- 4. Linked list

(Total Marks =16)

Q1. List types of linked list and state the operation performed on linked list.

Q2. Write an algorithm to insert new node at the beginning, middle and end of linked list.

Q3. Define node, null pointer, empty list, data, nextpointer, address.

Q4. Explain the operation on searching a desired node in linked list.

Q5. Explain the linked list as an abstract data type.

Q6. Write program to delete node in linked list.

Q7. Describe the structure of circular linked list.

Q8. Define dynamic memory allocation. Give its importance.

Q9. Write an algorithm to count number of nodes in singly link list.

Q10. Draw representation of singly linked list.

Q11. Draw representation of doubly linked list.

Q12. Draw representation of circular linked list.

Q13. With example describe how circular linked list works when a node is deleted from

beginning of list.

Q14. Compare linear linked list, circular linked list.

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page13 of 15

 UNIT- 5.

Trees and graph (Total Marks =16)

Q1. Define the term tree

Q2. Describe in brief the terms related to binary tree: root, parent, child, siblings, path,
degree of node ,leaf node ,level, depth, degree of tree, height of tree, ancestor/descendent
node

Q3.Explain height of tree.

Q4. Explain the binary tree with suitable example and diagram.

Q5.Describe with an example sequential representation of tree in memory.

Q6. Describe with an example linked representation of trees in memory.

Q7. Define the term general tree.

Q8. Compare general tree and binary tree.

Q9.Write a c program to count nodes in binary tree.

Q10.Enlist the type of binary tree and give there meaning.

Q11. Define the tree traversal.list different types.

Q12. Write an algorithm to for inorder traversal.

Q13. Write an algorithm to for preorder traversal.

Q14. Write an algorithm to for postorder traversal.

Q15 enlist operation on trees.

Q16 Construct binary tree for the following data

10,3,15,22,6,45,65,23,78,34,5

Q17 Describe expression tree with example.

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page14 of 15

Q18 Draw binary tree for following expression.

(21+5b)3(x-7y)4

Q19 define following terms:

 graph,
 undirected graph,
 directed graph,
 complete graph,
 weighted graph,
 path,
 sink,
 articulation point,
 cycle,
 subgraph,
 connected graph ,
 componenet,
 degree of vertex,
 multigraph,
 self loop,
 spanning tree,
 successor,
 predecessor.

Q 20 Explain adjacency matrix for graph with example.

Q21 what is indegree and outdegree in graph.

Prepared By: Mrs.S.S.Tile (Department of Information technology) Page15 of 15