Scribd
Upload
40 views

Dsu Importance

This document is intended for diploma students and is one of six copies.

Uploaded by

Teaiya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
40 views

Dsu Importance

This document is intended for diploma students and is one of six copies.

Uploaded by

Teaiya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DSU IMPORTANCE

1. Define Data structure. Explain the need of data Structure


2. Classify types of data structure.
3. Differentiate between linear and non-linear data structure.
4. Differentiate between top down and bottom up approach.
5. Differentiate between Linear search and Binary search
6. Explain time and space complexity.
7. List any 4 sorting and searching techniques.
8. Write any 4 Applications of Stack.
9. State and explain operations on data structure.
10. Describe working of linear search and binary search with example.
11. Describe working of bubble sort with example.
12. Sort the given numbers in ascending order using Radix sort:
(i) 348, 14, 641, 3851, 74
(ii) 181, 289, 390, 121, 145, 736
13. Write algorithm for performing push and pop operations on stack.
14. Define the terms ‘overflow’ and ‘underflow’ with respect to stack.
15. Evaluate the following arithmetic expression P written in postfix notation:
( 1. ) 4, 2, ^, 3, *, 3, -, 8, 4, /, +
(2.) 5, 6, 2, +, *, 12 , 4, /, -
16. Explain selection sort with example.
17. Show the memory representation of Stack using array with the help of diagram .
18. Write program of bubble sort ,Selection Sort and Insertion Sort
19. Write program of linear search.
20. Write program of binary search.
21. Describe queue full and queue empty operation condition on linear queue with
suitable diagrams.
22. Implement a ‘c’ program to insert element into the queue and delete the
element from the queue
23. Describe terms Node , Information , Pointer , Empty list.
24. Describe following terms w.r.to tree :
i) leaf node (ii) level of node iii) Root iv) Siblings v) Binary tree vi)Binary search tree
25. Define the following term w.r.t. graph : (i) In-degree (ii) out-degree.
26. Explain Complete graph with diagram.
27. Write Operations on linked List and Trees.
28. Difference between Array and linked List.
29. Write an algorithm to search a particular node in the given linked list.
30. Show with suitable diagram for deleting a node in SLL at beginning, in between and
end .
31. Algorithm to delete a node at beginning , in between and at the end.
32. Algorithm to count nodes in linked list.
33. Algorithm to insert an element at the beginning and end of linked list.
34. Create a singly linked list using data fields 15, 20, 22, 58, 60. Search a node
22 from the SLL and show procedure step-by-step with the help of diagram
from start to end.
35. Difference between Trees and graph.
36. Construct a binary search tree for following elements :
30, 100, 90, 15, 2, 25, 36, 72, 78, 10 show each step of construction of BST.
37. Draw the tree structure of the following expressions:
(i) (2a+5b)3 * (x – 7y) 4
ii) (a-3b) (2x-y)3
iii) E2 = (2a +5c)4 ( x- 8y)3
iv) (x+2y+3z-4-4a+5b+6c)4 (7b + 4z)2
38. For given binary tree write in-order, pre-order and post-order traversal.

39. Write Adjacency matrix and Adjacency list representation and Indegree , Outdegree of each
vertex of following graph

Dhrupesh Sir 9699692059

You might also like