UNIT-1

An ______ is a step by step process to solve a problem

• Array

• Program

• Algorithm

• Analysis

Algorithm contain _______ number of step

• Number

• Finite

• Infinite

• More than one

Adding a node to the stack is referred to as ________ operation.

• Push

• Pop

• Traversing

• Editing

Linked list is a _______ data structure that contain of elements.

• Non-linear

• Linear

• Standard

• Dynamic

Each elements in a linked list is called as

• Links

• Values

• Node

• Address

Which data structure is required to convert the infix to prefix notation?

• 1. Stack

• 1. Linked list

• 1. Binary tree

• 1. Queue

Which of the following is the infix expression ?

• 1. A+B*C

• 1. +A*BC

• 1. ABC+*

• 1. None of the above

Which of the following is not the correct statement for a stack data structure?

• 1. Arrays can be used to implement the stack

• 1. Stack follows FIFO

• 1. Elements are stored in a sequential manner

• 1. Top of the stack contains the last inserted element

If the elements '1', '2', '3' and '4' are added in a stack, so what would be the order for the removal?

• 1. 1234

• 1. 2134

• 1. 4321

• 1. None of the above

Which of the following principle does Queue use?

• 1. LIFO principle

• 1. FIFO principle

• 1. Linear tree

• 1. Linear tree