Register
Webpage for Algorithms

Recent questions tagged algorithms

29 votes
5 answers
2191
GATE CSE 2017 Set 2 | Question: 15
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNROP}$ $\text{POQNMR}$
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the ...
User Avatar
25 votes
7 answers
2192
GATE CSE 2017 Set 2 | Question: 03
Match the algorithms with their time complexities: ... $P\rightarrow (iv) \quad Q \rightarrow(iii)\quad r \rightarrow(ii) \quad S\rightarrow(i)$
Match the algorithms with their time complexities:$$\begin{array}{|l|l|}\hline \textbf{Algorithms} & \textbf{Time Complexity} \\\hline \text{P. Tower of Hanoi with $n$...
User Avatar
0 votes
1 answer
2193
Gate 2017 Set 1 minimum Comparisons
Consider an array A of size 31 consisting of 0's followed by number of 1's. In order to find the smallest index i such that A[i]=1 minimum number of comparisons required in worst case by optimal algorithm?
Consider an array A of size 31 consisting of 0's followed by number of 1's. In order to find the smallest index i such that A[i]=1 minimum number of comparisons required ...
User Avatar
2 votes
1 answer
2194
Test by Bikram | Mock GATE | Test 3 | Question: 35
Consider the following set of messages with their frequencies: ... The percentage improvement for total binary stream transmission using Huffman Encoding over simple encoding is _______ %.
Consider the following set of messages with their frequencies: $$\begin{array}{|c|c|c|} \hline \textbf{Message} & \textbf{Frequency} \\ \hline A & 50\: \text{million} \...
User Avatar
1 votes
1 answer
2196
Test by Bikram | Mock GATE | Test 3 | Question: 22
Bubble sort is used to sort the following sequence of numbers: $7 5 3 1 2 9$. What will the sequence be after the 2$^{nd}$ iteration? $1$ $2$ $3$ $5$ $7$ $9$ $3$ $1$ $2$ $5$ $7$ $9$ $5$ $3$ $1$ $2$ $7$ $9$ $3$ $5$ $7$ $1$ $2$ $9$
Bubble sort is used to sort the following sequence of numbers: $7 5 3 1 2 9$.What will the sequence be after the 2$^{nd}$ iteration?$1$ $2$ $3$ $5$ $7$ $9$$3$ $1$ $2$ $5$...
User Avatar
2 votes
1 answer
2198
Linked list time complexity
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is. a) O(n) and O(nlogn) b) O(n) and O(n) c) O(nlogn) and O(nlogn) d) O(nlogn) and O(n)
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is.a) O(n) and O(nlogn)b) O(n) and O(n)c) O(nlogn) ...
User Avatar
0 votes
0 answers
2199
Data Link Layer ,Crc
Is Time complexity of CRC algorithm is O(n)? n=no of bits in data field. crc , implememted in data link layer as trailer, as error detection and correction method,in Hardware.
Is Time complexity of CRC algorithm is O(n)?n=no of bits in data field.crc , implememted in data link layer as trailer, as error detection and correction method,in Hardwa...
User Avatar
2 votes
1 answer
2202
Divide and conquer
Reply with solution @Arjun sir,@habibkhan,@vijaycs
Reply with solution @Arjun sir,@habibkhan,@vijaycs
User Avatar
2 votes
5 answers
2203
Algorithm quicksort
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
User Avatar
2 votes
1 answer
2206
ME test
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ? A) Ω(n2) B) O(n) C) θ(n) D) None
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ?A) Ω(n2)B) O(n)C) θ(n)D) None
User Avatar
2 votes
1 answer
2208
Test series
Minimum time taken to find median of a list of numbers is O(log n) O(n) O(n log n) O (n2)
Minimum time taken to find median of a list of numbers isO(log n)O(n)O(n log n)O (n2)
User Avatar
1 votes
1 answer
2210
Space complexity
Which of the following algorithm have the smallest memory requirement i.e Low space complexity including data space and run time stack for recursive calls. A)insertion sort B)quick sort C)merge sort D)selection sort
Which of the following algorithm have the smallest memory requirement i.e Low space complexity including data space and run time stack for recursive calls.A)insertion sor...
User Avatar
0 votes
1 answer
2212
MadeEasy Subject Test: Algorithms - Graph Algorithms
Will dijiktras's algoritm fail for the graph given in the question (or the question has been framed wrongly)?
Will dijiktras's algoritm fail for the graph given in the question (or the question has been framed wrongly)?
User Avatar
1 votes
1 answer
2214
recurrence realtion
$T(n) = \begin{Bmatrix} T(\frac{n}{k})+T(\frac{3n}{4})+n\ \ \ if\ n\geq2\\ 1 \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ if\ n=1 \end{Bmatrix}$
$T(n) = \begin{Bmatrix} T(\frac{n}{k})+T(\frac{3n}{4})+n\ \ \ if\ n\geq2\\ 1 \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ if\ n=1 \end{Bmatrix}$
User Avatar
Page: