Week 1

Question 1

is a way of collecting and organizing data in such a way that we can
perform operations on these data in an effective way. It is about rendering
data elements in terms of some relationship, for better organization and storage.

Answer 1

Data Structure

Question 2

are structures programmed to store ordered data, so that various operations
can be performed on it easily. It represents the knowledge of data to be organized in
memory.

Answer 2

Data Structures

Question 3

Characteristics ofa Data Structure

Answer 3

• Correctness — Data structure implementation should implement its interface correctly.
• Time Complexity — Running time or the execution time of operations of data structure
  must be as small as possible.
  Space Complexity — Memory usage of a data structure operation should be as little as
  possible.

Question 4

Data structure implementation should implement its interface correctly.

Answer 4

• Correctness —

Question 5

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

Answer 5

• Time Complexity —

Question 6

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

Answer 6

Space Complexity —

Question 7

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 7

Algorithm

Question 8

Need for data structure

Answer 8

Data Search — Consider an inventory of 1 million (106) items of a store. If the application is to
search an item, it has to search an item in 1 million (106) items every time slowing down the
search. As data grows, search will become slower.
Processor Speed — Processor speed although being very high, falls limited if the data grows to
billion records.
Multiple Requests — as thousands of users can search data simultaneously on a web server, even
the fast server fails while searching the data.

Question 9

Consider an inventory of 1 million (106) items of a store. If the application is to
search an item, it has to search an item in 1 million (106) items every time slowing down the
search. As data grows, search will become slower.

Answer 9

Data Search —

Question 10

although being very high, falls limited if the data grows to
billion records.

Answer 10

Processor Speed —

Question 11

as thousands of users can search data simultaneously on a web server, even
the fast server fails while searching the data.

Answer 11

Multiple Requests —

Question 12

categories of algorithm

Answer 12

• Search — Algorithm to search an item in a data structure.
• Sort — Algorithm to sort items in a certain order.
• Insert — Algorithm to insert item in a data structure.
  Update — Algorithm to update an existing item in a data structure.
  Delete — Algorithm to delete an existing item from a data structure.

Question 13

algorithm characteristic

Answer 13

• Unambiguous — 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.
• Input — an algorithm should have 0 or more well-defined inputs.
• Output — an algorithm should have 1 or more well-defined outputs, and should match
  the desired output.
• Finiteness — Algorithms must terminate after a finite number of steps.
• Feasibility — should be feasible with the available resources.
• Independent — an algorithm should have step-by-step directions, which should be
  independent of any programming code.

Question 14

Basically, data structures are divided into two categories:

Answer 14

Linear data structure
Non-linear data structure

Question 15

the elements are arranged in sequence one after the other. Since
elements are arranged order, they are easy to implement.

Answer 15

In linear data structures,

Question 16

, elements in memory are arranged in continuous memory. All the elements of an —–
are of the same type. And the type of elements that can be stored in the form of —- is determined
by the programming language.

Answer 16

In an array

Question 17

popular linear data structure

Answer 17

1. Array data structure
2. Stack data structure
3. Queue Data Structure
4. Linked List Data Structure

Question 18

elements are stored in the LIFO principle. That is, the last element stored in
a stack will be removed first.
It works just like a pile of plates where the last plate kept on the pile will be removed first.

Answer 18

2. Stack Data Structure

Question 19

works in the FIFO principle where first element stored in the
queue will be removed first.

Answer 19

3. Queue Data Structure

Question 20

data elements are connected through a series of nodes. And each node
contains the data items and address to the next node.

Answer 20

4. Linked List Data Structure

Question 21

Unlike linear data structures, elements are not in any sequence. Instead they
are arranged in a hierarchical manner where one element will be connected to one or more elements.

Answer 21

non-linear data structures

Question 22

types of non-linear data structures

Answer 22

1. Graph Data Structure
   In graph data structure, each node is called vertex and each vertex is connected to other
   vertices through edges.
2. Trees Data Structure
   Like a graph, a tree is also a collection of vertices and edges. However, in tree data
   structure, here can only be one edge between two vertices.

Question 23

each node is called vertex and each vertex is connected to other
vertices through edges.

Answer 23

1. Graph Data Structure

Question 24

Like a graph, it is also a collection of vertices and edges. However, there can only be one edge between two vertices.

Answer 24

2. Trees Data Structure

Question 25

In computer programming terms, an —- is a set of well-defined instructions to solve a
particular problem. It takes a set of input(s) and produces the desired output.

Answer 25

algorithm