DSA Concepts

Question 1

is a method of organizing data in a virtual system. examples are sequence of numbers, tables of data

Answer 1

Data Structure

Question 2

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

Answer 2

Algorithm

Question 3

allows us to organize and store data

Answer 3

Data Structure

Question 4

allows us to process that data in a meaningful way

Answer 4

Algorithm

Question 5

Uses of DSA

Answer 5

• allows us to organize and store data while algorithm allows us to process that data in a meaningful way
• specialized format for organizing, processing, retreiving, and storing data

Question 6

Importance of DSA in Problem Solving

Answer 6

• helps breakdown complex problems into smaller, more manageable components, allowing for easier analysis and solution design
• developers (programmers) can identify patterns and apply appropriate solutions to a wide range of challenges

Question 7

can identify patterns and apply appropriate solutions to a wide range of challenges

Answer 7

developers (programmers)

Question 8

is a type of linear data structure that is defined as a collection of elements with some or different data types

Answer 8

Array

Question 9

is used as solutions to many problems from the small sorting problems to more complex problems

Answer 9

Array

Question 10

an ordered list in which all insertions and deletions are made at one end, called the top of the stack

Answer 10

Stacks

Question 11

clears the stack, all elements in the stack will be deleted or cleared

Answer 11

Clearstack (s)

Question 12

there is no element in the stack

Answer 12

Emptystack (s)

Question 13

insert or add an element onto the stack

Answer 13

Push (i, s)

Question 14

remove or delete an element from the stack

Answer 14

Pop (s, d)

Question 15

the operator is placed between operands

Answer 15

Infix

Question 16

the operator is placed before the operands

Answer 16

Prefix

Question 17

the operator is placed after the operands

Answer 17

Postfix

Question 18

_____ an ordered list in which all insertions are made at one end called the _____, and all deletions are made at the other end called the ______

Answer 18

Queue, rear, front

Question 19

it clears the queue, once the queue is clear, no elements remain in the queue

Answer 19

Clear queue (Q)

Question 20

there is no element in the queue

Answer 20

Entry queue (Q)

Question 21

insert an element or node in the queue

Answer 21

En queue (i, q)

Question 22

delete any element or node in the queue

Answer 22

De queue (q, d)

Question 23

hierarchical data structure in which each note has at most two chidren, referred to as the left child and the right child

Answer 23

Binary Tree

Question 24

it is commonly used for efficient storage and retrieval of data, with various operations such as insertion, deletion, traversal

Answer 24

Binary Tree

Question 25

3 Types of Binary Tree

Answer 25

• Full Binary Tree
• Complete Binary Tree
• Skewed to the left/right

Question 26

3 Binary Tree Traversal

Answer 26

• Inorder traversal (LTR)
• Pre-order traversal (TLR)
• Post-order traversal (LRT)