Scribd
Upload
15 views1 page

Sample Questions For Oral - Viva Exam

Uploaded by

principal
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
15 views1 page

Sample Questions For Oral - Viva Exam

Uploaded by

principal
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/ 1

Basic Concepts

1. What is a data structure, and why are they important?


2. Explain the difference between primitive and non-primitive data structures.
3. Explain the difference between linear and non-linear data structures.
4. How do you choose the best data structure for a particular problem?
5. What is the difference between an array and a linked list?

Arrays and Linked Lists

6. How is memory allocated for an array, and what are the advantages and disadvantages?
7. What are the main differences between a singly linked list, doubly linked list, and circular linked
list?
8. Describe the operations of insertion and deletion in a linked list.
9. How would you reverse a linked list?

Stacks and Queues

10. What is a stack, and where is it commonly used?


11. Explain stack overflow and underflow conditions.
12. What is a queue, and how does it differ from a stack?
13. Describe the different types of queues (e.g., circular queue, priority queue).
14. How would you implement a stack/queue using a linked list?

Trees

15. Define a binary tree. What are the differences between a binary tree, binary search tree, and a
heap?
16. Explain tree traversal methods: in-order, pre-order, and post-order.
17. What is a balanced tree? Why is balancing important in trees?
18. Describe AVL trees and how they differ from binary search trees.
19. What are B and B+ Trees?

Hashing

20. What is hashing, and what are its main applications?


21. Describe different hashing techniques.
22. What is a hash collision, and how can it be resolved?
23. Explain open addressing and chaining in the context of hash tables.

Graphs

24. Define a graph. What is the difference between a directed and an undirected graph?
25. Describe the adjacency matrix and adjacency list representations of graphs.
26. Explain depth-first search (DFS) and breadth-first search (BFS) traversal.

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