Chapter 11: Linear List – Online Education & Certification

Results

#1. _______ is the basic fact of entity that is utilized in a calculation or manipulation.

File

Structure

Pointer

Data

#2. ________ may be a single value or it may be a set of values, whether it is a single value or group of values to be processed it must be organized in a particular fashion.

File

Data

Structure

Pointer

#3. This type of organization leads to ____________ of data.

File

Structure

Pointer

Graphics

#4. _____________ is a representation of the logical relationship between individual elements of data.

Data

Structure

File

Data Structure

#5. ________ is a way of organizing all data items that considers not only elements but also their relationship to each other.

Data

Structure

DataStructure

Files

#6. How many types of data?

#7. Types of data are

Numerical

Alpha-Numerical

Both of the above

None of the above

#8. Algorithm+Data Structure = ___________

Data

File

Program

Graphics

#9. Static Implementation of Stack Process using _________

Arrays

List

Linked List

Structure

#10. Dynamic Implementation of Stack Process using _________

Arrays

Linked List

List

Empty

#11. Push means

Delete

Pack

Insert

Process

#12. Pop means

Delete

Insert

Empty

Full

#13. ________ are used to pass parameter between functions.

Queue

Tree

Graph

Stack

#14. High level programming like pascal, c etc can be support by

Queue

Stack

Graph

Tree

#15. A _________ is a linear list in which insertions can take place at one end of the list and deletion can take place only at the other end.

Queue

Stack

Tree

Graph

#16. In Queue, Insertion can take place at one end of the list called _____

Insert

Rear

Front

Delete

#17. In Queue, deletions can take place only at the other end, called ______

Insert

Rear

Front

Delete

#18. The behavior of a queue is like a _________

LIFO

SIFO

FISO

FIFO

#19. FIFO means

First In Fast Out

Fast In First Out

First In First Out

Favour in First Out

#20. Enqueue means _____________ in the queue.

Insert

Delete

Move

Copy

#21. Dequeue means __________ in the queue.

Insert

Delete

Move

Copy

#22. ________ are used to organize information in database system and to represent the syntactic structure of source programs in computer.

Data

Structure

Queue

Tree

#23. ________ can be used to evaluate arithmetic expression.

Queue

Stack

Graph

Tree

#24. A Single ______ represent itself is a tree.

Rear

Front

Node

Structure

#25. _______ of the node is immediate predecessor of a node.

Parent

Child

Link

Root

Finish