Scribd
Upload
57 views2 pages

Saurabh Sahu Bca

Uploaded by

Saurabh
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
57 views2 pages

Saurabh Sahu Bca

Uploaded by

Saurabh
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

Infix to Prefix Conversion usi…

usi… Expression Conversion Usin…


Usin…

Stack | Part-2 | BCA-2 | Subo…


Subo… Introduction To Data Structu…
Structu…

Important Semester-end Examination Questions


Click Here to Upload Previous Semester Question
Papers

DATA STRUCTURE IMPORTANT QUESTIONS

[ Questions marked with bold & italic are most important]

Data Structure

1. What is Data Structure? Explain different types of Data Structures


and their operations.
2. Explain the difference between Linear & Non-Linear Data Structures.
3. What is Binary search? Write an algorithm for Binary search.
4. What is Searching? Write the difference between Sequential/Linear &
Binary Search.
5. Explain with example Bubble and Merge sort.
6. Explain the Selection sort with an Algorithm and example. Also,
mention its Time complexity. [ Kolhan-2017]
7. Explain Insertion sort with an example.
8. Explain the Stack and Queue data structure. [ Kolhan-2017]
9. Write the difference between Stack and Queue.
10. Explain the array implementation of Stack. (push, pop, traverse)
11. Explain the difference in array implementation of Stack and
Queue.
12. What are various Queue operations? Explain with proper examples.
13. Write an algorithm to Push/Pop an element into a Stack. [
Kolhan-2017]
14. Write an algorithm to Insert/Delete an element into a Queue. [
Kolhan-2017]
15. Write an algorithm to evaluate postfix expression. [ Kolhan-2017]
16. Write an algorithm to convert infix expressions to postfix
expressions.
17. Evaluate following postfix expression using a stack-
50,40,+,18,14,-,4,*,+ [ Kolhan-2017]
18. Convert the following infix expression into postfix using stack – [
Kolhan-2017]
(i) (A-B)+C*D/E-F (ii) A*B+C/D (iii)(A+B)/(A-C) (iv) A+(B*C) (v)
A+B-C
19. Write a short note on Linked – List. How it is represented?
Explain its different types. [ Kolhan-2017]
20. Write the difference between the Singly and Doubly Linked list?
21. Write the difference between Circular and Doubly Linked lists?
22. Explain the difference between Linked-List and Array. [ Kolhan-2017]
23. Write a program to add an item in the desired location of the linked
list.
24. Write an algorithm to add a node in the middle of the linked list.
25. Write an algorithm to add a node after a given node in the linked list.
26. Write a program to delete an item from the desired location of the
linked list.
27. Write an algorithm to add a node from a Linked list.
28. Write a program to delete a node from the head/beginning of a
Linked-list.
29. Explain the Tree, Binary Tree and Binary Search Tree [ Kolhan-
2017].
30. Explain the different ways of traversal of Binary Tree-Preorder,
Postorder and Inorder. [ Kolhan-2017]
31. Design a Binary Search Tree by using the following data
elements 7,3,5,11,2,10,8 [ Kolhan-2017]
32. Write Pre-order, Post-order and In-order traverse of the
following Binary tree – [ Kolhan-2017]

33. Draw the Binary Tree by using the following sequence of node –
Pre-order: G, B, Q, A, C, K, F, P, D, E, R, H In-order: Q, B, K, C, F, A,
G, P, E, D, H, R
34. Write a program for Binary Search Tree.
35. Write algorithm for Pre-order traversing of a Tree.
36. Question on Expression Tree.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy