Chapter 1

Question 1

are values or set of values.

Answer 1

Data

Question 2

refers to single unit of values.

Answer 2

Data Item

Question 3

Data items that are divided into sub items are called as

Answer 3

Group Items

Question 4

Data items that cannot be divided are called as

Answer 4

Elementary Items

Question 5

An entity is that which contains certain attributes or properties, which may be assigned values.

Answer 5

Attribute and Entity

Question 6

Entities of similar attributes form an entity set.

Answer 6

Entity Set

Question 7

is a single elementary unit of information representing an attribute of an entity.

Answer 7

Field

Question 8

is a collection of field values of a given entity.

Answer 8

Record

Question 9

is a collection of records of the entities in a given entity set.

Answer 9

File

Question 10

Algorithm should be clear and unambiguous. Each of its steps (or phases), and their inputs/outputs should be clear and must lead to only one meaning.

Answer 10

Unambiguous

Question 11

An algorithm should have 0 or more well-defined inputs.

Answer 11

Input

Question 12

An algorithm should have 1 or more well-defined outputs, and should match the desired output.

Answer 12

Output

Question 13

Algorithms must terminate after a finite number of steps.

Answer 13

Finiteness

Question 14

Should be feasible with the available resources.

Answer 14

Feasibility

Question 15

An algorithm should have step-by-step directions, which should be independent of any programming code.

Answer 15

Independent

Question 16

the programmatic way of storing data so that data can be used efficiently.

Answer 16

Data Structures

Question 17

a computer procedure that is a lot like a recipe (called a procedure) and tells your computer precisely what steps to take to solve a problem or reach a goal.

Answer 17

Algorithm

Question 18

are called inputs

Answer 18

The ingredients

Question 19

are called the outputs.

Answer 19

the results

Question 20

is a kind of data structure that stores the data of only one type.

Answer 20

Primitive data structure

Question 21

is a type of data structure that can store the data of more than one type.

Answer 21

Non-primitive data structure

Question 22

is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.

Answer 22

Algorithm

Question 23

is all about data structures and algorithms.

Answer 23

Programming

Question 24

are used to hold data

Answer 24

Data structures

Question 25

are used to solve the problem using that data.

Answer 25

Algorithms

Question 26

goes through solutions to standard problems in detail and gives you an insight into how efficient it is to use each one of them.

Answer 26

Data structures and algorithms (DSA)

Question 27

is a way to classify various types of data such as integer, string, etc.

Answer 27

Data Type

Question 28

Those data types for which a language has built-in support are known as

Answer 28

Built-in Data types

Question 29

Those data types which are implementation independent as they can be implemented in one or the other way are known as

Answer 29

derived data types

Question 30

is a systematic way to organize data in order to use it efficiently.

Answer 30

Data Structure

Question 31

provides the internal representation of a data structure

Answer 31

Implementation

Question 32

Data structure implementation should implement its interface correctly.

Answer 32

Correctness

Question 33

Running time or the execution time of operations of data structure must be as small as possible.

Answer 33

Time Complexity

Question 34

Memory usage of a data structure operation should be as little as possible.

Answer 34

Space Complexity

Question 35

This step involves breaking the problem into smaller sub-problems.

Answer 35

Divide/Break

Question 36

This step receives a lot of smaller sub-problems to be solved.

Answer 36

Conquer/Solve

Question 37

When the smaller sub-problems are solved, this stage recursively combines them until they formulate a solution of the original problem.

Answer 37

Merge/Combine

Question 38

 are linear data structures that follow a particular order to add or remove entities. 

Answer 38

Stacks and queues

Question 39

is an Abstract Data Type (ADT)

Answer 39

stack

Question 40

Pushing (storing) an element on the stack.

Answer 40

push()

Question 41

Removing (accessing) an element from the stack. When data is PUSHed onto stack.

Answer 41

pop()

Question 42

get the top data element of the stack, without removing it.

Answer 42

peek()

Question 43

check if stack is full.

Answer 43

IsFull()

Question 44

check if stack is empty.

Answer 44

isEmpty()