What is an algorithm?

When an algorithm is written in the form of a programming language, it becomes a _________

If the running time of the algorithm is logest for all the inputs then it is called _______.
*

______ are languages that allows ust to analyze an algorithm's running time by identifying its behavior as the input si

______ notation lies between upper bound and lower bound of an algorithm.

A ______ is a sequence of instructions that is continually repeated until a certain condition is reached.

In _______, the problem is divided into smaller sub-prolems and then each problem is solved independently.
*

Find Recurrence for binary search : T(n)=T(n/2)+1

*

Find Recurrence for binary search : T(n)= 0.9 T(n/2)+n log n

*

In _______ data structure, data is organized in sequential order.

In a tree data structure, the first node is called as _______.

In a tree data structure, children of the same parent is called as _______.

In a tree data structure,the root node is said to be at _________.

The total number of edges from root node to a leaf node at the last level is said to be _______ of a tree.
*

_______ is a binary tree in which every internal node have exactly two children or none.
*

In _______ traversal we traverse from root-left-right.

_______ are used in data compression algorithms.

*

Extended binary tree is also called as _______.

A binary tree with n nodes has exactly _____ nodes.

*

In a complete binary tree, number of external nodes = __________

*

In a tree data structure, the node which is predecessor of any node is called as _______.
*

In a tree data structure, the leaf node is also called as _______.

*

In a tree data structure,the children of level 1 node is said to be at _________.

A binary tree may be empt known as ______ tree.

_______ is a transformation of any binary tree into a complete binary tree.

In _______ traversal we traverse from left-right-root.

_______ support, search and deletion of minimum (or maximum) on a collection of items in logarithmic time (in wor

Strictly binary tree is also called as _______.

*

The maximum numer of nodes is a binary tree of height 'h' is ______.

*

In a complete binary tree, if there are 'n' nodes at level 1 then at level '1+1', there are ____ nodes.

AVL stands for Adelson, Velski and ______

A individual data elemeent of a graph is called as ________.

A _____ is a connecting link between two vertices.

DFS stands for _______

*

________ algorithm is used to find minimum spanning tree for connected weighted undirected graph.

________ algorithm uses the greedy approach to find the minimum cost spanning tree.
*
________ algorithm is the one that calls itself repeatedly until condition is true.

Exact algorithm is also known as ______ algorithm.

________ is a technique of compressing data to reduce its size without losing any of the details.
*

________ solves problems by combining the solutions of different sub problem.

*

The _______ is an optimization problem and it is useful in solving resource allocation problem.

The Bellmann Ford Algorithm returns __________ value?

Two main measures of the efficiency of an algorithm are?

*
______ is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong

A _______ is a sequence of data structures, which are connected together via links.

A ______ is a problem-solving algorithm that uses a brute force approach for finding the desired output.

What is the time complexity of the binary search algorithm?

Identify the fastest sorting technique among the following?

Identify the sorting technique which compares adjacent elements in a list and switches whenever necessary?
*

Heap is a _____________?

*
1 shuffle
A flowchart
A pseudocode
A decision
Step by step instructions used to solve a problem

1 shuffle
Flowchart
Program
Pseudo Code
Syntax

1 shuffle
Worst case
Best case
Average case
None

1 shuffle
Symtotic Notations
Exponential Notations
Asymptotic Notations
Linear Notations

1 shuffle
Big-Omega
Little-Oh
Big-Oh
Theta

1 shuffle
Consecutive Statement
Loop
If-then-else statements
Switch

1 shuffle
Divide and Conquer
Guessing and Confirming
Subtract and Conquer
Divide and Guessing

1 shuffle
θ(log n)
θ(n.log n)
θ(n²)
θ(n².log n)

1 shuffle
None
θ(n.log n)
θ(n²)
θ(n².log n)

1 shuffle
Non-linear
Exponential
Linear
Binary

1 shuffle
Path node
Leaf node
Edge node
Root node

1 shuffle
Path node
Leaf node
Edge node
Siblings node

1 shuffle
Level n
Level 2
Level 1
Level 0

1 shuffle
Depth
Breadth
Height
Length

1 shuffle
Complete Binary Tree
Strictly Binary Tree
Extended Binary Tree
Perfect Binary Tree

1 shuffle
Back-order
Post-order
In-order
Pre-order

1 shuffle
Huffman coding tree
Binary Search Tree
Priority Queue
Expression trees

1 shuffle
Full Binary Tree
Perfect Binary tree
Almost Complete Binary Tree
All of the above

1 shuffle
n-1
n+1
n*1
n²-1

1 shuffle
Numer of internal nodes + 1
Numer of external nodes + 1
Numer of internal nodes - 1
Numer of external nodes - 1

1 shuffle
Parent node
Leaf node
Edge node
Root node

1 shuffle
Path node
External node
Internal node
Child node

1 shuffle
Level n
Level 2
Level 1
Level 0

1 shuffle
AVL
Null
Threaded
Leaf

1 shuffle
Complete Binary Tree
Strictly Binary Tree
Extended Binary Tree
Full Binary Tree

1 shuffle
Back-order
Post-order
In-order
Pre-order

1 shuffle
Huffman coding tree
Binary Search Tree
Priority Queue
Expression trees

1 shuffle
Full Binary Tree
Perfect Binary tree
Almost Complete Binary Tree
All of the above

1 shuffle
2^(h-1) + 1
2^(h-1) - 1
2^(h*1) - 1
2^(h+1) - 1

1 shuffle
2n+1
2n
2n-1
n+1

1 shuffle
Laplace
Landis
Luis
Landsberg

1 shuffle
Arc
Adjacent
Vertex
Edge

1 shuffle
Node
Adjacent
Vertex
Edge

1 shuffle
Depth First Search
Depth Find Solution
Down First Search
Depth First Solution

1 shuffle
Kruskal's
Prim's
Bellman-Ford
Dijkstra's

1 shuffle
Kruskal's
Prim's
Bellman-Ford
Dijkstra's
1 shuffle
Serial
Deterministic
Recursion
Procedural

1 shuffle
Serial
Deterministic
Approximate
Procedural

1 shuffle
Huffman Coding
Bellman-Ford
Divide and Conquer
Greedy

1 shuffle
Dynamic Programming
Bellman-Ford
Dijkstra's
Greedy

1 shuffle
Dynamic Programming
Knapsack Problem
Dijkstra's
Greedy

1 shuffle
String
Boolean
Double
Integer

1 shuffle
Time & Space Complexity
Data & Space
Processor & Memory
Complexity & Capacity
1 shuffle
Quick Sort
Merge Sort
Bubble Sort
Selection Sort

1 shuffle
Queue
Linked List
Stack
Array

1 shuffle
Greedy Technique
Backtracking algorithm
Dynamic Programming
Linear Programming

1 shuffle
O(n)
O(log2n)
O(1)
O(n^2)

1 shuffle
Bubble Sort
Merge Sort
Quick Sort
Selection Sort

1 shuffle
Bubble Sort
Merge Sort
Quick Sort
Selection Sort

1 shuffle
Tree structure
Complete binary tree
Binary tree
Decision tree
The word ____________comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Mus

Algorithms cannot be represented as ___________

If the running time of the algorithm is shortest for all the inputs then it is called _______.

______ notation gives te tight upper bound of the function.

______ notation is used to describe an upper-bound that cannot be tight.

_________ of an algorithm is the amount of memory it needs to run to completion.

*

In _______, instead of joining the sub-problems to find the final solution, we find the solution from the sub

Find Recurrence for binary search : T(n)=4 T(n/2)+n

*

Find Recurrence for binary search : T(n)=0.2 T(n/2)+n/logn

*

In _______ data structure, data is organized in random order.

In a tree data structure, the connecting link between any two nodes is called as _______.

In a tree data structure, the node that has one one or more child is called as _______.

In a tree data structure,the children of root node is said to be at _________.

A tree in which every node can have a maximum of two children is called as _____ tree.

_______ is a binary tree in which every internal node have exactly two children and all leaf nodes are at same
*
In _______ traversal we traverse from left-root-right.

_________ supports search, insertion and deletion on a collection of items in O(log n) (average).

Complete binary tree is also called as _______.

The minimum number of nodes in a binary tree of heigt 'h' is _____.

*

Number of leaf nodes in a complete binary tree is ______.

*

The word algorithm comes from the name of a Persian mathematician _______.

_________ = Data Structure + Algorithm

*
If the running time of the algorithm falls between the worst case and the best case then it is called _______.

______ notation gives te tighter lower bound of the given function.

*

______ notation is used to denote a lower bound that is not asymptotically tight.

_________ of an algorithm is the amount of computer time it needs to run to completion.

If a solution is guessed and then try to verify our guess inductively, usually either the proof will succeed, o

Find Recurrence for binary search : T(n)=2 T(n/2)+4n

*

Find Recurrence for binary search : T(n)=0.8 T(n/2)+1/n

*
_______ is a non-linear data structure which organized data in heirarchical structure.

AVL stands for _______, Velski and Landis

Vertex is also known as ________

Edge is also known as ________

BFS stands for _______

*

________ algorithm finds the shortest path from source vertex to all other verticess in the graph.

________ is an algorithm that computes shortest paths from a single source vertex to all of the other vertices

*
Recursion algorithm is also called as _____ algorithm.

The algorithms for which we are able to find the optimal solutions are called _____ algorithms.

_________ algorithm works by overestimating the length of the path from the starting vertex to all other vert

___________ is both a mathematical optimization method and a computer programming method.

*

Fractional knapsack problem is solved most efficiently by which of the following algorithm?

Dijkstra’s algorithm is used to solve __________ problems?

Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?

*
______ algorithm works by selecting a 'pivot' element from the array and partitioning the other elements into
*

Which of the following data structure is used to perform recursion?

*

Identify the approach followed in Floyd Warshall’s algorithm?

The worst-case time complexity of Quicksort is?

Identify the slowest sorting technique among the following?

*

Among the following options which is the best sorting algorithm when the list is already sorted?
*

Which of the following is incorrect? Algorithms can be represented:

*
1 shuffle
Flowchart
Algorithm
Flow
Syntax

1 shuffle
Flowchart
Program
Pseudo Code
Syntax

1 shuffle
Worst case
Best case
Average case
None

1 shuffle
Big-Omega
Little-Oh
Big-Oh
Theta

1 shuffle
Big-Omega
Little-Oh
Big-Oh
Theta

1 shuffle
Space Complexity
Time Complexity
Data Complexity
Size Complexity

1 shuffle
Divide and Conquer
Guessing and Confirming
Subtract and Conquer
Divide and Guessing

1 shuffle
θ(n²)
θ(n.log n)
θ(log n)
θ(n².log n)

1 shuffle
None
θ(n.log n)
θ(log n)
θ(n².log n)

1 shuffle
Linear
Exponential
Non-linear
Binary

1 shuffle
Path node
Leaf node
Edge node
Root node

1 shuffle
Path node
Leaf node
Internal node
External node

1 shuffle
Level n
Level 2
Level 1
Level 0

1 shuffle
Graph
Binary
Linked
Exponential

1 shuffle
Complete Binary Tree
Strictly Binary Tree
Extended Binary Tree
Full Binary Tree

1 shuffle
Back-order
Post-order
In-order
Pre-order

1 shuffle
Huffman coding tree
Binary Search Tree
Priority Queue
Expression trees

1 shuffle
Full Binary Tree
Perfect Binary tree
Almost Complete Binary Tree
All of the above

1 shuffle
h+1
h-1
h*1
h²-1

1 shuffle
(n+1)/2
(n-1)/2
(n*1)/2
n+1

1 shuffle
Al-Biruni
Mohammed ibn-i Musa al Khowarizmi
Al-Karaji
Omar Kayyam

1 shuffle
Flowchart
Program
Pseudo Code
Syntax

1 shuffle
Worst case
Best case
Average case
None

1 shuffle
Big-Omega
Little-Oh
Big-Oh
Theta

1 shuffle
Big-Omega
Little-Omega
Big-Oh
Theta

1 shuffle
Space Complexity
Time Complexity
Data Complexity
Size Complexity

1 shuffle
Divide and Conquer
Guessing and Confirming
Subtract and Conquer
Divide and Guessing

1 shuffle
θ(n.log n)
θ(n²)
θ(log n)
θ(n².log n)

1 shuffle
None
θ(n²)
θ(log n)
θ(n².log n)

1 shuffle
Graph
Linked List
Tree
Heap

1 shuffle
Armstrong
Adelson
Anderson
Android

1 shuffle
Arc
Adjacent
Node
Edge

1 shuffle
Node
Adjacent
Vertex
Arc

1 shuffle
Breadth First Search
Breadth Find Solution
Bottom First Search
Breadth First Solution

1 shuffle
Kruskal's
Prim's
Bellman-Ford
Dijkstra's

1 shuffle
Kruskal's
Prim's
Bellman-Ford
Dijkstra's

1 shuffle
Serial
Deterministic
Iteration
Procedural

1 shuffle
Serial
Deterministic
Exact
Procedural

1 shuffle
Huffman Coding
Bellman-Ford
Divide and Conquer
Greedy

1 shuffle
Dynamic Programming
Bellman-Ford
Dijkstra's
Greedy

1 shuffle
Dynamic Programming
Knapsack Problem
Dijkstra's
Greedy

1 shuffle
Sorting
Knapsack Problem
Dijkstra's
Single source shortest path

1 shuffle
Quick Sort
Merge Sort
Bubble Sort
Selection Sort
1 shuffle
Quick Sort
Merge Sort
Bubble Sort
Selection Sort

1 shuffle
Queue
Linked List
Stack
Array

1 shuffle
Greedy Technique
Backtracking
Dynamic Programming
Linear Programming

1 shuffle
O(n)
O(log2n)
O(1)
O(n^2)

1 shuffle
Bubble Sort
Merge Sort
Quick Sort
Selection Sort

1 shuffle
Insertion Sort
Merge Sort
Quick Sort
Selection Sort

1 shuffle
As programs
As flow charts
As syntax
As pseudo-codes