Data Structures and Algorithms Topic - 1

Question 1

• is information such as facts and numbers used to
  analyze something or make decisions.
• is a piece of information, especially facts or
  numbers.

Answer 1

Data

Question 2

• is the arrangement of and relations between the parts or elements of something complex.
• It is constructed or arranged according to a plan; gives a
  pattern or organization.

Answer 2

Structure

Question 3

is a specialized format for organizing, processing, retrieving and storing data.

Answer 3

Data Structures

Question 4

• is a set of instructions for solving a problem or accomplishing a task.
• act as an exact list of instructions that conduct specified actions step by step in either hardware- or software-based routines.

Answer 4

Algorithm

Question 5

is a method of organizing data in a virtual system. Think of sequences of numbers, or tables of data: these are both well-defined data structures.

Answer 5

Data Structures

Question 6

is a sequence of steps executed by a computer that takes an input and transforms it into a
target output.

Answer 6

Algorithm

Question 7

5 Types of Data Structures and Algorithms :

Answer 7

1. Linear Data Structure
2. Nonlinear Data Structures
3. Sorting Algorithm
4. Searching Algorithm
5. Graph Traversal Algorithm

Question 8

are the simplest, arranging data on a single level.

Answer 8

Linear Data Structures

Question 9

Types of Linear Data
Structures :

Answer 9

• Array
• Linked List
• Stack
• Queues

Question 10

They contain multiple levels of data and do not connect elements sequentially.

Answer 10

Nonlinear Data Structures

Question 11

Graphs consist of _____ and _____.

Answer 11

Nodes and Edges

Question 12

The topmost node is the ____. Connected to the root are zero or more _________.

Answer 12

Root & Subtrees

Question 13

are step-by-step procedures
for rearranging data in arrays and lists.

Answer 13

Sorting Algorithm

Question 14

3 fundamental algorithms for sorting :

Answer 14

• Insertion Sort
  
  • For small data sets that are
    almost sorted, insertion sort is
    an efficient way to finish the
    job.
• Merge Sort
  
  • is ideal for organizing
    linked lists.
• Quick Sort
  
  • Large data sets benefit from
    quick sort. It partitions an
    array in two subarrays based
    on a specified data element,
    called the pivot.

Question 15

find and retrieve specific
elements from data structures.

Answer 15

Searching Algorithm

Question 16

is a sequential searching
algorithm for sorted and unsorted data structures. It
traverses lists and arrays sequentially, one element at
a time.

Answer 16

Linear Search

Question 16

Two key examples of Searching Algorithm :

Answer 16

• Linear Search
• Binary Search

Question 16

• is an interval searching algorithm. Interval searches divide elements into multiple intervals and only traverse the expected interval. They are more efficient than sequential searches because they divide
  the search space.
• is efficient for finding
  elements of a sorted list.

Answer 16

Binary Search

Question 17

to search nodes in graphs
and trees.

Answer 17

Graph Traversal Algorithm

Question 18

Two algorithms for traversing graphs are :

Answer 18

Breadth - First Search
- traverses the shortest
path between two nodes.
Depth - First Search
- searches graphs from top to
bottom.

Question 19

In a tree with two levels of nodes, BFS would search
nodes from left to right in the following order:

Answer 19

1. Tree Root
2. Nodes to the First Level
3. Nodes to the Second Level

Question 20

There are three ways to apply DFS:

Answer 20

1. Pre-Order Traversal
   
   • ( root - leftChild - rightChild )
2. In-Order Traversal
   
   • ( root - leftChild – root - rightChild )
3. Post-Order Traversal
   
   • ( leftChild - rightChild - root )

Question 21

store similar data elements at contiguous memory
locations, making it easy to process, sort, and search.

Answer 21

Array

Question 22

is a series of data elements where each element
points to the next.

Answer 22

Linked List

Question 23

is a collection of data elements that follows the
“last-in, first-out” (LIFO) rule.

Answer 23

Stack

Question 24

are collections of data elements that follow
the “first-in, first-out” (FIFO) rule.

Answer 24

Queues