When sorting an already ordered sequence, what is the time complexity of the bubble sort algorithm

If we sort the sequence of numbers 47, 891, 3, 11, 27, 69, 26, 8 using the Radix sort algorithm, then after step 1 (sorting by units), what is the resulting sequence

The average-case time complexity of the Quick Sort algorithm is

For a binary search algorithm to work, the array must be

To find an element in a matrix of size $$m \times n$$ , what is the time complexity of the algorithm

The minimum number of comparisons required when searching in an ascending ordered sequence of 256 elements (using the binary search algorithm) is:

The postfix form of the expression A/X + B*C^F is:

The operation of processing each element in the list is known as ......

Each node in a single linked list must contain at least .....

A doubly linked list has _____pointers with each node.

The correct order to permute a second and third note in list l has more than 3 elements [ (1) p=head; (2) head.next=q; (3) q= p.next; (4) p.next= q.next; (5) q.next=p; ]

The postfix form of the expression $$(M+N)*(C*D- E)*F / G$$ is

What does the following function do for a given Linked List with first node as head? void fun1(Node head) { if(head == null) return; System.out.print(head.data + " " ); fun1(head.next); }

What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 void fun(Node start) { if(start == NULL) return; System.out.print (start.data + " "); if(start.next.next != null ) fun(start.next.next); System.out.print (start.data + " "); }

What algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement?

The appropriate algorithm to solve the Knight Tour problem is:

The appropriate algorithm to solve the Merge n files into one file (trộn n file thành 1 file) problem is:

The Merge Sort algorithm is an example for:

For the Travelling salesman problem, if the Brute Force technique is used and the number of the city is 30, the number of tests to find the result is:

In the function remove a node from the linked list, the right order for 3 statements: p= p->next =t (1); q=p (2); delete q (3); is:

The statement used in the function calculating the sum of all nodes in a linked list is:

The statement used in the function calculating the height of a binary tree is:

In the Fibonacci problem, $$F(6)$$ equals what?

Which one of the following is an application of Stack Data Structure?

The largest value in the Binary Search Tree is in position:

The operation that reduces the size of the stack is:

The operation that increases the size of the queue is:

Let LCS(Xi,Yj) represent the length of longest common subsequence. The formula to calculate LCS(Xi,Yj) if X[i] <> Y[j] is:

Consider the following pseudo code. What is the output of the segment code? void fun(int n) {queue q; q.push(0); q.push(1); for (int i = 0; i <= n; i++) int a = q.front(); q.pop(); int b = q.front(); q.pop(); q.push(b); q.push(a + b); cout<

The largest value in the binary tree is in position:

The Karatsuba algorithm (procedure) for multiplication of two n-digit numbers requires a number of elementary operations proportional to:

Following is C like pseudo code of a function that takes a Queue as an argument, and uses a stack S to do processing. void fun(Queue *Q) { Stack S; while (!isEmpty(Q)) { // deQueue (lấy) an item from Q and push the dequeued item to S push(&S, deQueue(Q)); } while (!isEmpty(&S)) { // Pop an item from S and enqueue (thêm) the popped item to Q enQueue(Q, pop(&S)); } } What does the above function do in general?

To find the two numbers with the largest product (có tích lớn nhất) in an array of n integers, using Brute Force technique, the number of pairs to test is:

In order to get the information stored in a AVL Tree in the descending order, one should traverse it in which of the following order?

The time required to insert a node x into a doubly linked list having n nodes is:

Following is C like pseudo code of a function that takes a number as an argument, and uses a stack S to do processing. void fun(int n) { Stack S; while (n > 0) { push(&S, n%2); n = n/2; } while (! isEmpty(&S)) printf("%d ", pop(&S)); } What does the above function do in general?

Assume p point to the head of the linked list ==>3->2->5->7->6->9->NULL. What is the output of the code cout<next->next->next->data;

Assume p point to the head of the linked list ==>3->2->5->7->6->9->NULL. What is the output of the segment code : Node *q=head->next; p->next= q->next; q->next=p; cout<next->data;

The size of matrix A is 4*5 and the size of matrix B is 5*7. The number of multiplication when calculating A*B is:

The size of matrix A is 3*7, matrix B is 7*5 and matrix C is 5*2. The minimum of number of multiplication when calculating A*B*C is:

The statement used in the function calculating the sum of all nodes in a binary tree is:

In the Hanoi Tower problem, if n=5, the number of moves required to solve is:

When inserting the value 8,3,6 into the AVL tree, we will use rotation:

In the Hanoi Tower problem, if n=10, the number of moves required to solve is:

When inserting the values 10, 20, 15 into an AVL tree, which rotation is used?

The Merge Sort algorithm is an example of which algorithmic technique?

Which algorithmic paradigm systematically enumerates all possible candidates for a solution and checks whether each candidate satisfies the problem statement?

Which algorithm is appropriate for finding a path in a maze?

Which algorithm is appropriate to solve the problem of merging n files into a single file?

For the Travelling Salesman Problem, if the Brute Force technique is used and the number of cities is 20, what is the number of tests required to find the result?

Matrix A has size $$2\times 5$$ and matrix B has size $$5\times 7$$ . What is the number of scalar multiplications when calculating $$A\times B$$ ?

Which return statement is used in a function that counts the number of nodes in a binary tree?

For the Travelling Salesman Problem, if the Brute Force technique is used and the number of cities is 5, what is the number of tests required to find the result?

The time complexity of binary search is:

To perform binary search on an array A, which condition must A satisfy?

Given the code: int k=0, n=20; for(int i=1; i<=n; i++) { int j=i; while(j<=n) { k++; j=j*2; } } What is the value of k after the code executes?

Backtracking solves problems by which approach?

In the 8-queens problem, after placing a queen in the first row, what is the minimum number of possibilities to place a queen in the second row?

In the 8-queens problem, after placing a queen in the first row and one queen in the second row, what is the minimum number of possibilities to place a queen in the third row?

Using divide-and-conquer, how many multiplications are needed to compute $$x^{25}$$ ?

According to the Russian peasant multiplication algorithm, when multiplying 13 by 17, what is the value of S after the second iteration?

In the helicopter patrol problem, suppose fuel can values are {3, 5, 1, 4} and the range $$k=2$$ . How many arrangements of the fuel cans satisfy the range constraint?

In the recursive definition of the binomial coefficient, when computing $$C(5,4)$$ , how many times is $$C(3,3)$$ computed as an intermediate call?

What is a similarity between the divide-and-conquer method and dynamic programming?

In the rat-in-a-maze problem, a cell is considered safe when it satisfies how many conditions?

In Sudoku, when placing a number into a cell, how many conditions must be checked?

Which algorithmic approach can produce an incorrect result?

Using the greedy method for optimal file merging, how many total reads occur when merging five files of sizes {13, 10, 4, 8, 3} into a single file?

Into how many groups can probabilistic algorithms be classified?

What is the time complexity of computing the longest palindromic subsequence using dynamic programming?

Which statement is not a characteristic of the brute-force method?

Under divide-and-conquer exponentiation, how many multiplications are needed to compute $$x^{25}$$ ?