• +91 9971497814
  • info@interviewmaterial.com

Computer Interview Questions Answers

Data structure Interview Questions Answers

Question - 41 : - List out the areas in which data structures are applied extensively?

Answer - 41 : - Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation

Question - 42 : - List out few of the Application of tree data-structure?

Answer - 42 : - The manipulation of Arithmetic expression, Symbol Table construction, Syntax analysis.

Question - 43 : - In RDBMS, what is the efficient data structure used in the internal storage representation?

Answer - 43 : - B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.

Question - 44 : - What is the heap ?

Answer - 44 : - The heap is where malloc(), calloc(), and realloc() get memory. Getting memory from the heap is much slower than getting it from the stack. On the other hand, the heap is much more flexible than the stack. Memory can be allocated at any time and deallocated in any order. Such memory isn't deallocated automatically; you have to call free(). Recursive data structures are almost always implemented with memory from the heap. Strings often come from there too, especially strings that could be very long at runtime. If you can keep data in a local variable (and allocate it from the stack), your code will run faster than if you put the data on the heap. Sometimes you can use a better algorithm if you use the heap faster, or more robust, or more flexible. Its a tradeoff. If memory is allocated from the heap, its available until the program ends. That's great if you remember to deallocate it when you're done. If you forget, it's a problem. A �memory leak is some allocated memory that's no longer needed but isn't deallocated. If you have a memory leak inside a loop, you can use up all the memory on the heap and not be able to get any more. (When that happens, the allocation functions return a null pointer.) In some environments, if a program doesn't deallocate everything it allocated, memory stays unavailable even after the program ends.

Question - 45 : - Run Time Memory Allocation is known as ?

Answer - 45 : - Allocating memory at runtime is called a dynamically allocating memory. In this, you dynamically allocate memory by using the new operator when declaring the array, for example : int grades[] = new int[10];

Question - 46 : - What is the bucket size, when the overlapping and collision occur at same time?

Answer - 46 : - One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.

Question - 47 : - Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

Answer - 47 : - Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

Computer Contributors

krishan
Rajeev Katiyar
Yes Baroda

Share your email for latest updates

Name:
Email:

Our partners