Dsa

Front 1

We all know that a computer understands only computer language that is ___________.

Back 1

Binary language (containing only 0s and 1s)

Front 2

An _________ is an environment that is used to write computer programs, to compile them, to run them and to debug them

Back 2

Integrated Development Environment (IDE)

Front 3

The #include is a ____________ that tells the compiler to put code from the header called stdio.h into our program before actually creating the executable.

Back 3

Preprocessor directive

Front 4

Every full C program begins inside a function called __________.

Back 4

main

Front 5

___________ are used to indicate something to the person reading the code, or often used to explain sections of code.

Back 5

Comments

Front 6

There are two most commonly used syntaxes used for comments in C, the original ______ and the slightly newer _____.

Back 6

/**/ and //

Front 7

Large chunks of code can also be "commented out" using the preprocessor directives ________________.

Back 7

#if 0 and #endif

Front 8

A _________ is a set of alphabets, letters and some special characters that are valid in C language.

Back 8

Character set

Front 9

C accepts both ___________ and ____________ alphabets as variables and functions.

Back 9

lowercase and uppercase

Front 10

___________ are predefined, reserved words used in programming that have special meanings to the compiler.

Back 10

Keywords

Front 11

___________ refers to name given to entities such as variables, functions, structures etc._____________ must be unique. They are created to give a unique name to an entity to identify it during the execution of the program.

Back 11

Identifiers

Front 12

In programming, input and data are stored in ___________, is a container (storage area) to hold data.

Back 12

Variable

Front 13

_________ are data used for representing fixed values. They can be used directly in the code.

Back 13

Literals

Front 14

________ is a numeric literal(associated with numbers) without any fractional or exponential part.

Back 14

Integer

Front 15

______________ is a numeric literal that has either a fractional form or an exponent form

Back 15

Floating-point literal

Front 16

A ____________ is created by enclosing a single character inside single quotation marks.

Back 16

Character literal

Front 17

it is necessary to use characters that cannot be typed or has special meaning in C programming.

Back 17

Escape sequence

Front 18

A __________ is a sequence of characters enclosed in double-quote marks.

Back 18

String literal

Front 19

If you want to define a variable whose value cannot be changed, you can use the _________.

Back 19

Constant keyword

Front 20

__________ are declarations for variables. This determines the type and size of data associated with variables.

Back 20

Data types

Front 21

_________ are whole numbers that can have both zero, positive and negative values but no decimal values.

The size of _____ is usually 4 bytes (32 bits).

Back 21

Integers

Front 22

____ and _____ are used to hold real numbers.

Back 22

Float and Double

Front 23

floating-point numbers can also be represented in ____________ .

Back 23

Exponential

Front 24

_____ is an incomplete type. It means "nothing" or "no type". You can think of it as absent.

Back 24

Void

Front 25

________ and ________ are type modifiers. You can alter the data storage of a data type by using them.

Back 25

Signed and Unsigned

Front 26

Data types that are derived from fundamental data types are ________.

For example: arrays, pointers, function types, structures etc.

Back 26

Derived types or derived data types.

Front 27

____ are values or set of values.

Back 27

Data

Front 28

refers to single unit of values.

Back 28

Data item

Front 29

Data items that are divided into sub items are called as __________.

Back 29

Group Items

Front 30

Data items that cannot be divided are called as _________.

Back 30

Elementary Items

Front 31

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

Back 31

Attribute and Entity

Front 32

Entities of similar attributes form an _______.

Back 32

Entity Set

Front 33

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

Back 33

Field

Front 34

________ is a collection of field values of a given entity.

Back 34

Record

Front 35

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

Back 35

File

Front 36

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

Back 36

Data Structures

Front 37

The representation of a particular data structure in the memory of a computer is called a _______.

Back 37

Storage structure

Front 38

Abstract Data Structure are :

Back 38

Linked List, Tree, Graph, Stack , Queue

Front 39

These are the basic data structures and are directly operated upon by the machine instructions, which is in a primitive level.

Back 39

Primitive data structures

Front 40

It is a more sophisticated data structure emphasizing on structuring of a group of homogeneous (same type) or heterogeneous (different type) data items.

Back 40

Non-primitive data structures

Front 41

_____________ the data items are arranged in a linear sequence.

Back 41

Linear data structures

Front 42

_________ the data items are not in sequence. Example: Tree, Graph

Back 42

Non-Linear data structures

Front 43

_______________ all the elements are of same type. Example: Array

Back 43

homogeneous data structures

Front 44

the elements may or may not be of the same type.

Back 44

Non-Homogeneous data structure

Front 45

are those whose sizes and structures associated memory locations are fixed, at compile time. Example: Array

Back 45

Static data structures

Front 46

are those which expands or shrinks depending upon the program need and its execution.

Back 46

Dynamic structures

Front 47

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

Back 47

Algorithm

Front 48

Algorithm to find an item in a data structure

Back 48

Search

Front 49

Algorithm to arrange items in a certain order.

Back 49

Sort

Front 50

Algorithm to put item in a data structure.

Back 50

Insert

Front 51

Algorithm to append an existing item in a data structure.

Back 51

Update

Front 52

Algorithm to remove an existing item from a data structure.

Back 52

Delete

Front 53

Each data structure has an ________. It represents the set of operations that a data structure supports.

Back 53

Interface

Front 54

__________ provides the internal representation of a data structure. It also provides the definition of the algorithms used in the operations of the data structure.

Back 54

Implementation

Front 55

Data structure implementation should implement its interface ________.

Back 55

Correctly

Front 56

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

Back 56

Time Complexity

Front 57

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

Back 57

Space Complexity

Front 58

process of finding the desired information from the set of items stored in the form of elements in the computer memory

Back 58

Data Search

Front 59

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

Back 59

Processor speed

Front 60

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

Back 60

Multiple requests

Front 61

This is the scenario where a particular data structure operation takes maximum time it can take. If an operation's _______ time is ƒ(n) then this operation will not take more than ƒ(n) time where ƒ(n) represents function of n.

Back 61

Worst Case

Front 62

This is the scenario depicting the average execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then m operations will take mƒ(n) time.

Back 62

Average Case

Front 63

This is the scenario depicting the least possible execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then the actual operation may take time as the random number which would be maximum as ƒ(n).

Back 63

Best Case

Front 64

What are the three execution time cases:

Back 64

Worst case

Average case

Best case

Front 65

is a finite set of unambiguous instructions that, given some set of initialconditions, can be performed in a prescribed sequence to achieve a certain goal and that has a recognizable set of end conditions.

Back 65

Algorithm

Front 66

That is to convert an informal algorithm to a program, we must go through several stages of formalization until we arrive at a program- whose meaning is formally defined by a programming language manual-is called __________ .

Back 66

Stepwise refinement techniques

Front 67

The development phase consists of two phases:

Back 67

Design Phase

Coding Phase

Front 68

_______the architecture, logic, and implementation details of the algorithm are envisioned and documented.

The _______ of an algorithm is an iterative process that involves comparing different candidate algorithms.

Back 68

Design phase

Front 69

The _______ and _____ phases of an algorithm are iterative in nature.

Back 69

designing and coding

Front 70

the designed algorithm is converted into a computer program.

Back 70

Coding phase

Front 71

The simplest way to specify the logic for an algorithm is to write the higher-level description of an algorithm in a semi-structured way, called _________ .

Back 71

Pseudocode

Front 72

an alternative approach is becoming popular, which is to represent the logic of the algorithm directly in the programming language in a somewhat simplified version. Like pseudocode, this selected code captures the important logic and structure of the proposed algorithm, avoiding detailed code. This selected code is sometimes called a _______.

void swap(int x, int y){int buffer = x;x = y;y = buffer;}

Back 72

Snippet

Front 73

_______ and ________ are not always enough to specify all the logic related to more complex distributed algorithms.

Back 73

Pseudocode and snippets

Front 74

_______ is a mathematical solution to a real-world problem.

Back 74

Algorithm

Front 75

__________ are designed to deal with a large amount of data.

Back 75

Data-intensive algorithms

Front 76

______ have considerable processing requirements but do not involve large amounts of data

Back 76

Compute-intensive algorithms

Front 77

To categorize the data dimension of the problem, we look at its (3Vs)

Back 77

Volume, Velocity and Variety

Front 78

_________ is about the processing and computing needs of the problem at hand. The processing requirements of an algorithm will determine what sort of design is most efficient for it.

Back 78

Compute dimension

Front 79

_________ is heavily procedural. The focus is entirely on writing code (functions). Data is passive in ___________.

Back 79

Modular Programming

Front 80

Two methods may be used for modular programming. They are known as

Back 80

Top-down and bottom-up

Front 81

_____ design dictates that a program should be divided into a main module and its related modules.

Back 81

Top-down

Front 82

It refers to a style of programming where an application is constructed starting with existing primitives of the programming language, and constructing gradually more and more complicated features, until the all of the application has been written.

Back 82

Bottom-up algorithm design

Front 83

is not programming with structures but by using following types of code structures to write programs:

Back 83

Structured programming

Front 84

It should be ______. An algorithm won't do you much good if it doesn't give you the right answers

Back 84

correct

Front 85

A good algorithm should be _______________. The best algorithm in the world won't do you any good if it's too complicated for you to implement on a computer

Back 85

understandable

Front 86

A good algorithm should be __________. Even if an algorithm produces a correct result, it won't help you much if it takes a thousand years or if it requires 1 billion terabytes of memory.

Back 86

efficient

Front 87

is the study of how complicated algorithms are.

Back 87

Complexity theory

Front 88

Estimates the runtime memory requirements needed to execute the algorithm.

estimates the amount of memory required by the algorithm to process input data.

Back 88

Space complexity analysis

Front 89

Estimates the time the algorithm will take to run.

estimates how long it will take for an algorithm to complete its assigned job based on its structure

Back 89

Time complexity analysis

Front 90

need to have efficient resource allocation mechanisms that are aware of the memory requirements at different execution phases of the algorithm.

Back 90

Resilient Distributed Datasets (RDD)

Front 91

Space needed to store the executable version of the program and it is fixed

Back 91

Instruction space

Front 92

Space needed to store all constants, variable values and has further two components:

Back 92

Data space

Front 93

This space is needed to store the information to resume the suspended (partially completed) functions.

Back 93

Environment stack space

Front 94

The amount of space needed by recursive function is called the __________.

Back 94

recursion stack space

Front 95

In this approach, different candidate algorithms are implemented and their performance is compared.

Back 95

A post-implementation profiling approach

Front 96

In this approach, the performance of each algorithm is approximated mathematically before running an algorithm.

Back 96

A pre-implementation theoretical approach

Front 97

The _________ of a typical algorithm will depend on the type of the data given to it as an input.

Back 97

Performance

Front 98

_________ are subjected to a sequence of instructions rather than one set of instruction.

Back 98

Data structures

Front 99

In many situations, data structures are subjected to a sequence of instructions rather than one set of instruction.

Back 99

Amstrong

Front 100

can be used to show that the average cost of an operation is small, if one averages over a sequence of operations, even though a simple operation might be expensive.

Back 100

Amortized analysis

Front 101

There may be more than one approach (or algorithm) to solve a problem. The best algorithm (or program) to solve a given problem is one that requires less space in memory and takes less time to complete its execution.

Back 101

Time-Space Trade Off

Front 102

is when an algorithm requires a maximum number of iterations or steps to search and find out the target value in the array

Back 102

worst case f(n) = n

Front 103

is when the number of steps is less as possible.

Back 103

best case

f(n) = 1

Front 104

falls between these two extremes (i.e., best and worst).

Back 104

Average case

f(n) = n/2

Front 105

It is said to run in _________________ If an algorithm takes the same amount of time to run, independent of the size of the input data.

Back 105

constant time O(1)

Front 106

It is represented by _______ If an algorithm takes the same amount of time to run, independent of the size of the input data

Back 106

O(1)

Front 107

An algorithm is said to have a complexity of __________ if the execution time is directly proportional to the size of the input.

Back 107

linear time

Front 108

It is represented by _____ if the execution time is directly proportional to the size of the input.

Back 108

O(n)

Front 109

An algorithm is said to run in _________ if the execution time of an algorithm is proportional to the square of the input size

Back 109

quadratic time

Front 110

It is represented by ______ if the execution time of an algorithm is proportional to the square of the input size.

Back 110

O(n²)

Front 111

An algorithm is said to run in ___________ if the execution time of the algorithm is proportional to the logarithm of the input size.

Back 111

logarithmic time

Front 112

It is represented by ______ if the execution time of the algorithm is proportional to the logarithm of the input size.

Back 112

O(log n)

Front 113

________ confirms that it is actually providing a mathematical solution to the problem we are trying to solve.

Back 113

Validating an algorithm

Front 114

a particular input always generates exactly the same output. But for certain classes of algorithms, a sequence of random numbers is also taken as input, which makes the output different each time the algorithm is run.

Back 114

Deterministic algorithms

Front 115

Algorithms can also be divided into the following two types based on assumptions or approximation used to simplify the logic to make them run faster:

Back 115

•An exact algorithm

•An approximate algorithm

Front 116

are expected to produce a precise solution without introducing any assumptions or approximations.

Back 116

Exact algorithms

Front 117

When the problem complexity is too much to handle for the given resources, we simplify our problem by making some assumptions. The algorithms based on these simplifications or assumptions are called ____________, which doesn't quite give us the precise solution.

Back 117

approximate algorithm

Front 118

The ability to exactly identify the features that are used directly or indirectly to come up with a particular decision is called the _________ of an algorithm.

Back 118

explainability