Scribd
Upload
11 views2 pages

Expected Viva Questions

Uploaded by

fuuny coc
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
11 views2 pages

Expected Viva Questions

Uploaded by

fuuny coc
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

Viva questions:

1. What is a data structure?


2. Can you classify the data types?
3. What are the common operations in any type of data structure?
4. Define structure?
5. How can you access elements in array?
6. What is a self -referencial structure?
7. How structure is differ from union?
8. What is a pointer?
9. How will you access members of a structures , write the syntax for that?
10. What is DMA and how it is differ from SMA ?
11. How many functions are there in DMA and what are they?
12. What is a dynamically allocated Array?
13. Explain the steps for performance analysis of an algorithm?
14. What is space complexity?
15. What is time complexity?
16. What is a stack?
17. What is a queue?
18. What are the types of representations do stack have and what are those?
19. What are the operations are there in stack and explain them?
20. What are the operations are there in queue and explain them?
21. How will you state that stack is in initial position and full in array representation?
22. How will you state that stack is in initial position and full in linked list representation?
23. How will you state that queue is in initial position and full in array representation?
24. How will you state that queue is in initial position and full in linked list representation?
25. What is a polish notation?
26. What is a reverse polish notation?
27. What are the types of recursions are there?
28. What is a circular queue?
29. How circular queue is differed from regular queue?
30. What is a DEQUE?
31. What is a priority queue?
32. What is a linked list?
33. What are the types of linked list we have?
34. What is a header linked list?
35. Name few applications of linked list?
36. What is a linear search?
37. What is a binary search?
38. What is a interpolation search?
39. Write the formula for interpolation search?
40. Explain about selection sort and what is its time complexity?
41. Explain about insertion sort and what is its time complexity?
42. Explain about bubble sort and what is its time complexity?
43. Explain about quick sort and what is its time complexity?
44. Explain about merge sort and what is its time complexity?
45. Explain about Radix sort and what is its time complexity?
46. What is a binary tree?
47. What are the properties of binary tree?
48. What are the representations of binary tree?
49. What are the types of traversals we have in binary trees?
50. Explain few additional operations of binary tree?
51. What is a threaded binary tree?
52. Define binary search tree?
53. Explain about insertion, deletion, traversals ,searching in BST?
54. Explain about Tree – evaluation of expressions?
55. Explain the types of rotations in AVL tree balancing?
56. Explain the rules to remember during red- black tree balancing?
57. What is hashing?
58. What is a hash table?
59. What is a hash table?
60. What are static and dynamic hashing?
61. Explain how collision happens?
62. Explain about few collisions handling techniques?
63. Explain about various types of connections in graphs?
64. Explain different types of graphs?
65. What are the two convenient representations of graphs?
66. What is BFS?
67. What is DFS?

You might also like