Data Structures Quiz

It is a linear list of objects or items where all insertions and deletions are done at one end called the top.

• Stack

• Queue

• Tree

• None of the above

This refers to the operation of stack where it adds a data element onto the stack, making the added item as the new top

• Pop()

• Size()

• Push()

• Peek()

It is referring to an operation of stack where it removes the top data element onto the stack and return it to the user

• Pop()

• Size()

• Push()

• Peek()

An application of stack where it needs to postpone the use of its data for a while. One example of this is expression conversion among different notations.

• Backtracking

• Parsing

• Reversing a list

• Postponement

It is a process of breaking data into individual pieces for further application. For example, in order to convert source programming into machine language

• Backtracking

• Parsing

• Reversing a list

• Postponement

An application of stack where it is commonly found in computer gaming, decision analysis, and expert system.

• Backtracking

• Parsing

• Reversing a list

• Postponement

It is referring to a stack can be used in problem-solving like number system conversion

• Backtracking

• Parsing

• Reversing a list

• Postponement

An operation of stack where it gets the top data element without removing it from the stack

• Pop()

• Size()

• Push()

• Peek()

This refers to a mathematical notation where it is characterized by operand, operator and operand

• Infix Notation

• Postfix Notation

• Prefix Notation

• None of the above

This refers to a mathematical notation where it is characterized by operand, operand and operator.

• Infix Notation

• Postfix Notation

• Prefix Notation

• None of the above