What is Data structure?
Ans.: The logical or mathematical representation of data.
It is way of organizing data that considers the data stored and also their relationship with each other.
Applications of data structures in computer science
Ans.: Compiler design
DBMS
Artificial intelligence
Statistical analysis
Numerical analysis
Graphics
Operating system
Simulation
What is the minimum number of queue needed to implement priority queue?
Ans.: Two
Explanation: One queue for actual storing of data and another queue for storing priorities.
Arithmetic expressions cam be evaluated using
Ans.: Polish and reverse polish notations.
Methods used to store sequential files
Ans.: Straight merging
Polyphase sort
Distribution of initial runs.
Natural merging
How many different trees possible with 7 nodes.
Ans.: 121
Explanation: 2^n-n
2^7-7=128-7=121
Which is the condition that occurs when two distinct key values are mapped to the same memory location.
Ans.: Collision
Simplest file structure is
Ans.: Sequential file structure
What is computational procedure
Ans.: An algorithm that does not terminate.
Example: Operating System
8 queens problem can be solved by
Ans.: Backtracking method.
Which is the memory address of the first element of the array.
Ans.:Base address.
Stack is also called as
Ans.:Push down list.
A descending heap is also called as
Ans.:Max heap
A linked list with no nodes is called as
Ans.:Empty list or null list.
A strictly binary tree with n leaves have how many nodes.
Ans.:2n-1 nodes
Which is the most commonly used hash functions to compute hash address.
Ans.:Division method
Which graph shows basic blocks and the success of relationships
Ans.:Flow graph
Commonly used language processors are
Ans.:Compilers
Interpreters
Assembler
In queue, the end from which data is inserted is called as
Ans.:Rear
Through linked list, we can implement
Ans.:Stack, queue, graph
Ans.: The logical or mathematical representation of data.
It is way of organizing data that considers the data stored and also their relationship with each other.
Applications of data structures in computer science
Ans.: Compiler design
DBMS
Artificial intelligence
Statistical analysis
Numerical analysis
Graphics
Operating system
Simulation
What is the minimum number of queue needed to implement priority queue?
Ans.: Two
Explanation: One queue for actual storing of data and another queue for storing priorities.
Arithmetic expressions cam be evaluated using
Ans.: Polish and reverse polish notations.
Methods used to store sequential files
Ans.: Straight merging
Polyphase sort
Distribution of initial runs.
Natural merging
How many different trees possible with 7 nodes.
Ans.: 121
Explanation: 2^n-n
2^7-7=128-7=121
Which is the condition that occurs when two distinct key values are mapped to the same memory location.
Ans.: Collision
Simplest file structure is
Ans.: Sequential file structure
What is computational procedure
Ans.: An algorithm that does not terminate.
Example: Operating System
8 queens problem can be solved by
Ans.: Backtracking method.
Which is the memory address of the first element of the array.
Ans.:Base address.
Stack is also called as
Ans.:Push down list.
A descending heap is also called as
Ans.:Max heap
A linked list with no nodes is called as
Ans.:Empty list or null list.
A strictly binary tree with n leaves have how many nodes.
Ans.:2n-1 nodes
Which is the most commonly used hash functions to compute hash address.
Ans.:Division method
Which graph shows basic blocks and the success of relationships
Ans.:Flow graph
Commonly used language processors are
Ans.:Compilers
Interpreters
Assembler
In queue, the end from which data is inserted is called as
Ans.:Rear
Through linked list, we can implement
Ans.:Stack, queue, graph
No comments:
Post a Comment