Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Bikram
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Bikram
2
votes
1
answer
101
Test by Bikram | Algorithms | Test 2 | Question: 20
Consider the following Graph G: The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .
asked
in
Algorithms
May 26, 2017
394
views
tbb-algorithms-2
numerical-answers
0
votes
1
answer
102
Test by Bikram | Algorithms | Test 2 | Question: 19
A hash table of length $7$ uses open addressing with hash function $h(k) = k \text{mod }7$ ... table ? $49,35,75,89,28,16$ $49,28,35,16,75,89$ $75,49,35,89,28,16$ $49,35,28,75,16,89$
asked
in
Algorithms
May 26, 2017
241
views
tbb-algorithms-2
0
votes
3
answers
103
Test by Bikram | Algorithms | Test 2 | Question: 18
The following elements are inserted in sequence to create an AVL tree: $31, 36, 40, 19, 14, 24, 50$ What is the pre-order traversal of the created AVL tree? $36, 19, 14, 31, 24, 40, 50$ $36, 14, 19, 31, 24, 40, 50$ $31, 19, 14, 24, 40, 36, 50$ $31, 19, 14, 24, 36, 40, 50$
asked
in
Algorithms
May 26, 2017
359
views
tbb-algorithms-2
1
vote
1
answer
104
Test by Bikram | Algorithms | Test 2 | Question: 17
Which of the following are TRUE? $n! = \theta ((n + 1)!)$ $\log4 n = \theta ( \log2 n )$ $\sqrt{\log n} = O(\log \log n)$ (i) & (iii) only (i) & (ii) only (ii) only (i),(ii) and (iii)
asked
in
Algorithms
May 26, 2017
456
views
tbb-algorithms-2
0
votes
1
answer
105
Test by Bikram | Algorithms | Test 2 | Question: 16
Consider the following max-heap as given below : 9 / \ 6 8 / \ / \ 3 4 5 7 The number of swaps required to convert the given max-heap into min-heap is ______.
asked
in
Algorithms
May 26, 2017
372
views
tbb-algorithms-2
numerical-answers
0
votes
2
answers
106
Test by Bikram | Algorithms | Test 2 | Question: 15
The length of the longest common subsequence of $L = ( 1,0,0,1,0,1,0,1 )$ and $K =( 0,1,0,1,1,0,1,1,0 )$ is __________.
asked
in
Algorithms
May 26, 2017
327
views
tbb-algorithms-2
numerical-answers
2
votes
2
answers
107
Test by Bikram | Algorithms | Test 2 | Question: 14
Match the following: ... S 1 - S, 2 - R, 3 - Q, 4- R, 5 - S 1 - S, 2 - P, 3 - Q, 4- R, 5 - S
asked
in
Algorithms
May 26, 2017
388
views
tbb-algorithms-2
1
vote
2
answers
108
Test by Bikram | Algorithms | Test 2 | Question: 13
Which one of the following is a topological sort for the above graph? $1, 6, 2, 5, 3, 4$ $4, 5, 6, 3, 2, 1$ $2, 4, 5, 6, 3, 1$ $6, 4, 5, 2, 1, 3$
asked
in
Algorithms
May 26, 2017
233
views
tbb-algorithms-2
0
votes
1
answer
109
Test by Bikram | Algorithms | Test 2 | Question: 12
The time complexity of the function mentioned below is: void f(int k[], int n) { int i; printf("%d",n); for(i=0; i<n; i++) { printf("%d",k[i]); } printf("n"); } $O(n^2)$ $O(n \log n)$ $O(n)$ $O(n^3)$
asked
in
Algorithms
May 26, 2017
226
views
tbb-algorithms-2
1
vote
1
answer
110
Test by Bikram | Algorithms | Test 2 | Question: 11
Let the node P be the starting vertex for Prim's Algorithm as given in the diagram below: In order to construct the Minimum Spanning Tree, which of the following options represents the correct order of edges in which they are added to construct the tree? $4,2,1,7,10$ $4,2,1,6,8$ $4,1 ,2,8,10$ $4,1,2,6,8$
asked
in
Algorithms
May 26, 2017
172
views
tbb-algorithms-2
1
vote
2
answers
111
Test by Bikram | Algorithms | Test 2 | Question: 10
In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication? $7$ and $16$ $18$ and $7$ $10$ and $8$ $7$ and $7$
asked
in
Algorithms
May 26, 2017
377
views
tbb-algorithms-2
0
votes
1
answer
112
Test by Bikram | Algorithms | Test 2 | Question: 9
Linked Lists are not suitable for : Binary Search Polynomial Manipulation Insertion Radix Sort
asked
in
Algorithms
May 26, 2017
184
views
tbb-algorithms-2
0
votes
1
answer
113
Test by Bikram | Algorithms | Test 2 | Question: 8
Assume that the splits at every level of Quick-Sort are in proportion $1-p$ to $p$, where $p (0 < p \leq 0.5 )$ is a constant. The number of elements in an array is $n$. The maximum depth is approximately: $0.5 \ p \ \text{lg } n$ $0.5 \ (1 - p) \ \text{lg } n$ $p (\text{lg }n) / (\text{lg }p)$ $- (\text{lg }n) / \text{lg }(1 - p)$
asked
in
Algorithms
May 26, 2017
445
views
tbb-algorithms-2
0
votes
2
answers
114
Test by Bikram | Algorithms | Test 2 | Question: 7
Which of the following statements is FALSE? Optimal binary search tree construction can be performed efficiently using dynamic programming. Breadth-first search cannot be used to find connected components of a graph. Given the prefix and ... cannot be re-constructed uniquely. Depth-first-search can be used to find the components of a graph.
asked
in
Algorithms
May 26, 2017
254
views
tbb-algorithms-2
0
votes
2
answers
115
Test by Bikram | Algorithms | Test 2 | Question: 6
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". Then, the value of $10^*K$ is __________.
asked
in
Algorithms
May 26, 2017
597
views
tbb-algorithms-2
numerical-answers
0
votes
1
answer
116
Test by Bikram | Algorithms | Test 2 | Question: 5
A problem called Boolean Parenthesis Matching (match all parenthesis in an expression) can be solved by: Greedy Approach Recursion Dynamic Approach Both [B] and [C]
asked
in
Algorithms
May 26, 2017
451
views
tbb-algorithms-2
0
votes
2
answers
117
Test by Bikram | Algorithms | Test 2 | Question: 4
What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph $G(V,E)$ is stored in the form of an adjacency list and binary heap is used? $O (\mid V \mid 2)$ $O (\mid V \mid \log \mid V \mid)$ $O ( ( \mid E \mid+\mid V \mid ) \log \mid V \mid )$ $O( \log \mid V \mid )$
asked
in
Algorithms
May 26, 2017
1.2k
views
tbb-algorithms-2
0
votes
1
answer
118
Test by Bikram | Algorithms | Test 2 | Question: 3
Which of the following algorithms CANNOT be designed without recursion? Tower of Hanoi Fibonacci Series Tree Traversal None of the above
asked
in
Algorithms
May 26, 2017
635
views
tbb-algorithms-2
0
votes
3
answers
119
Test by Bikram | Algorithms | Test 2 | Question: 2
Find the time complexity of the function function( int n) { int i=1; while( i<n) { int j=n; while( j>0) j=j/2; i=2*i; } } $O(\log n)$ $O(n^2 \log n )$ $O(\log 2 n)$ $O( \log n^2 )$
asked
in
Algorithms
May 26, 2017
960
views
tbb-algorithms-2
1
vote
2
answers
120
Test by Bikram | Algorithms | Test 2 | Question: 1
Which of the following theorems can solve all Recurrence Relations? Mater Tehorem Akra-Bazzi Theorem Both [A] and [B] Akra-Bazzi can be applied to some cases but not for all.
asked
in
Algorithms
May 26, 2017
463
views
tbb-algorithms-2
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
43
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...