Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Aks9639
5
answers
1
GATE CSE 2018 | Question: 18
The chromatic number of the following graph is _____
The chromatic number of the following graph is _____
12.2k
views
commented
Dec 24, 2019
Graph Theory
graph-theory
graph-coloring
numerical-answers
gatecse-2018
1-mark
+
–
9
answers
2
GATE CSE 2003 | Question: 40
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-degree of $G$ cannot be $3$ $4$ $5$ $6$
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-d...
15.6k
views
commented
Dec 22, 2019
Graph Theory
gatecse-2003
graph-theory
normal
degree-of-graph
+
–
8
answers
3
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$?$\exists y(\ex...
17.3k
views
comment edited
Dec 21, 2019
Mathematical Logic
gatecse-2017-set1
mathematical-logic
first-order-logic
+
–
8
answers
4
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum ...
15.9k
views
commented
Nov 28, 2019
Set Theory & Algebra
gatecse-2014-set2
set-theory&algebra
normal
set-theory
+
–
8
answers
5
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$
10.5k
views
commented
Oct 20, 2019
Databases
gate1998
databases
database-normalization
easy
+
–
8
answers
6
GATE CSE 2014 Set 2 | Question: 21
The maximum number of superkeys for the relation schema $R(E,F,G,H)$ with $E$ as the key is _____.
The maximum number of superkeys for the relation schema $R(E,F,G,H)$ with $E$ as the key is _____.
11.5k
views
commented
Oct 20, 2019
Databases
gatecse-2014-set2
databases
numerical-answers
easy
candidate-key
+
–
3
answers
7
Self Doubts:
Q. An SJF algorithm is simply a priority algorithm where the priority is : A) predicted next cpu burst B) The inverse of the predicted next cpu burst C) the current cpu burst D)anything the user want so in this what will be the ans it's a) or c) ? I confused with these two options.please gives proper explanation.
Q. An SJF algorithm is simply a priority algorithm where the priority is :A) predicted next cpu burst B) The inverse of the predicted next cpu burst C) the current cpu bu...
1.8k
views
answer selected
Oct 17, 2019
Operating System
operating-system
+
–
5
answers
8
CMI2013-A-05
You have $n$ lists, each consisting of $m$ integers sorted in ascending order. Merging these lists into a single sorted list will take time: $O(nm \log m)$ $O(mn \log n)$ $O(m + n)$ $O(mn)$
You have $n$ lists, each consisting of $m$ integers sorted in ascending order. Merging these lists into a single sorted list will take time:$O(nm \log m)$$O(mn \log n)$...
6.8k
views
commented
Oct 17, 2019
Algorithms
cmi2013
algorithms
sorting
+
–
2
answers
9
GATE CSE 1998 | Question: 1.35
There are five records in a database. ... and it contains the values $1, 3, 2, 5$ and $4$. Which one of the fields is the index built from? Age Name Occupation Category
There are five records in a database.$$\begin{array}{|c|c|c|c|} \hline \textbf {Name} & \textbf {Age} & \textbf {Occupation} & \textbf{Category } \\\hline \text{Rama} & ...
9.9k
views
commented
Oct 17, 2019
Databases
gate1998
databases
indexing
normal
+
–
6
answers
10
GATE CSE 2008 | Question: 7
The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity $\Theta(n)$ $\Theta(m)$ $\Theta(m+n)$ $\Theta(mn)$
The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity$\Theta(n)$$\Theta(m)$...
13.4k
views
commented
Sep 29, 2019
Algorithms
gatecse-2008
algorithms
graph-algorithms
time-complexity
normal
+
–
5
answers
11
GATE CSE 2007 | Question: 41
In an unweighted, undirected connected graph, the shortest path from a node $S$ to every other node is computed most efficiently, in terms of time complexity, by Dijkstra’s algorithm starting from $S$. Warshall’s algorithm. Performing a DFS starting from $S$. Performing a BFS starting from $S$.
In an unweighted, undirected connected graph, the shortest path from a node $S$ to every other node is computed most efficiently, in terms of time complexity, byDijkstra�...
18.5k
views
commented
Sep 28, 2019
Algorithms
gatecse-2007
algorithms
graph-algorithms
easy
+
–
2
answers
12
TIFR CSE 2014 | Part B | Question: 3
Consider the following directed graph. Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alphabetical order is to be chosen. Suppose the number of tree edges is $T$, the number of back edges is $B$ and the number of ... $B = 1$, $C = 2$, and $T = 3$. $B = 2$, $C = 2$, and $T = 1$.
Consider the following directed graph.Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alph...
5.3k
views
commented
Sep 28, 2019
Algorithms
tifr2014
algorithms
graph-algorithms
+
–
4
answers
13
GATE CSE 2017 Set 2 | Question: 50
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$ ... message of $100$ characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below:$$\begin{array}{|c|c|...
21.2k
views
commented
Sep 25, 2019
Algorithms
gatecse-2017-set2
huffman-code
numerical-answers
algorithms
+
–
2
answers
14
CMI2015-B-04
You are given $n$ positive integers, $d_1, d_2 \dots d_n$, each greater than $0$. Design a greedy algorithm to test whether these integers correspond to the degrees of some $n$-vertex simple undirected graph $G = (V, E)$. [A simple graph has no self-loops and at most one edge between any pair of vertices].
You are given $n$ positive integers, $d_1, d_2 \dots d_n$, each greater than $0$. Design a greedy algorithm to test whether these integers correspond to the degrees of so...
1.6k
views
comment edited
Sep 25, 2019
Algorithms
cmi2015
descriptive
algorithms
greedy-algorithm
+
–
6
answers
15
TIFR CSE 2016 | Part B | Question: 7
Let $n = m!$. Which of the following is TRUE? $m = \Theta (\log n / \log \log n)$ $m = \Omega (\log n / \log \log n)$ but not $m = O(\log n / \log \log n)$ $m = \Theta (\log^2 n)$ $m = \Omega (\log^2 n)$ but not $m = Ο(\log^2 n)$ $m = \Theta (\log^{1.5} n)$
Let $n = m!$. Which of the following is TRUE?$m = \Theta (\log n / \log \log n)$$m = \Omega (\log n / \log \log n)$ but not $m = O(\log n / \log \log n)$$m = \Theta (\log...
6.1k
views
comment edited
Sep 25, 2019
Algorithms
tifr2016
algorithms
asymptotic-notation
+
–
4
answers
16
GATE CSE 2006 | Question: 14, ISRO2011-14
Which one of the following in place sorting algorithms needs the minimum number of swaps? Quick sort Insertion sort Selection sort Heap sort
Which one of the following in place sorting algorithms needs the minimum number of swaps?Quick sortInsertion sortSelection sortHeap sort
25.4k
views
commented
Sep 24, 2019
Algorithms
gatecse-2006
algorithms
sorting
easy
isro2011
+
–
5
answers
17
GATE CSE 2004 | Question: 29
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of$n$$n^2$$n \log n$$n \log^2n$
33.5k
views
commented
Sep 24, 2019
Algorithms
gatecse-2004
algorithms
sorting
asymptotic-notation
easy
+
–
3
answers
18
GATE CSE 1989 | Question: 2-iii
Match the pairs in the following: ... 2)$} &\text{(s)} & \text{Selection of the $k^{th}$ smallest element in a set of $n$ elements} \\\hline \end{array}$
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$O (n)$} & \tex...
5.4k
views
commented
Sep 22, 2019
Algorithms
gate1989
match-the-following
algorithms
time-complexity
+
–
5
answers
19
GATE CSE 2000 | Question: 2.18
Let $G$ be an undirected connected graph with distinct edge weights. Let $e_{max}$ be the edge with maximum weight and $e_{min}$ the edge with minimum weight. Which of the following statements is false? Every minimum spanning tree of $G$ must ... , then its removal must disconnect $G$ No minimum spanning tree contains $e_{max}$ $G$ has a unique minimum spanning tree
Let $G$ be an undirected connected graph with distinct edge weights. Let $e_{max}$ be the edge with maximum weight and $e_{min}$ the edge with minimum weight. Which of th...
15.6k
views
commented
Sep 22, 2019
Algorithms
gatecse-2000
algorithms
spanning-tree
normal
+
–
5
answers
20
GATE CSE 2015 Set 1 | Question: 43
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E), (E, F), (D, F)\}$. The edge weights of only ... which are in the MST are given in the figure shown below. The minimum possible sum of weights of all $8$ edges of this graph is_______________.
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E...
17.7k
views
commented
Sep 22, 2019
Algorithms
gatecse-2015-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
4
answers
21
TIFR CSE 2014 | Part B | Question: 4
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? cost$(a, b) \geq 6$. cost$(b, e) \geq 5$. cost$(e, f) \geq 5$. cost$(a, d) \geq 4$. cost$(b, c) \geq 4$.
Consider the following undirected graph with some edge costs missing.Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequa...
5.0k
views
commented
Sep 22, 2019
Algorithms
tifr2014
algorithms
graph-algorithms
minimum-spanning-tree
+
–
2
answers
22
GATE CSE 2009 | Question: 35
The running time of an algorithm is represented by the following recurrence relation: $T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{cases}$ Which one of the following represents the time complexity of the algorithm? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
The running time of an algorithm is represented by the following recurrence relation:$T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{...
12.4k
views
commented
Sep 19, 2019
Algorithms
gatecse-2009
algorithms
recurrence-relation
time-complexity
normal
+
–
4
answers
23
GATE CSE 2016 Set 1 | Question: 37
An operator $delete(i)$ for a binary heap data structure is to be designed to delete the item in the $i$-th node. Assume that the heap is implemented in an array and $i$ refers to the $i$-th index of the array. If the heap tree has depth $d$ (number of edges on the path from the root ... $O(d)$ but not $O(1)$ $O(2^d)$ but not $O(d)$ $O(d \ 2^d)$ but not $O(2^d)$
An operator $delete(i)$ for a binary heap data structure is to be designed to delete the item in the $i$-th node. Assume that the heap is implemented in an array and $i$...
15.3k
views
commented
Sep 19, 2019
DS
gatecse-2016-set1
data-structures
binary-heap
normal
+
–
4
answers
24
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
16.2k
views
commented
Sep 17, 2019
DS
gatecse-2015-set2
data-structures
binary-heap
normal
+
–
5
answers
25
GATE CSE 2006 | Question: 10
In a binary max heap containing $n$ numbers, the smallest element can be found in time $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
In a binary max heap containing $n$ numbers, the smallest element can be found in time $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
20.8k
views
comment edited
Sep 17, 2019
DS
gatecse-2006
data-structures
binary-heap
easy
+
–
10
answers
26
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
32.0k
views
commented
Sep 17, 2019
DS
gatecse-2003
data-structures
binary-heap
+
–
7
answers
27
GATE IT 2008 | Question: 43
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k > 0$ which is independent of $n$, the time taken would be? $\Theta(n)$ $\Theta(kn)$ $\Theta(n \log n)$ $\Theta(n^2)$
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k 0$ which is independent of $n$, the time taken would be?$\Theta(n)$$\T...
20.7k
views
commented
Sep 16, 2019
Algorithms
gateit-2008
algorithms
sorting
normal
+
–
3
answers
28
GATE CSE 1991 | Question: 01,vii
The minimum number of comparisons required to sort $5$ elements is ______
The minimum number of comparisons required to sort $5$ elements is ______
8.8k
views
commented
Sep 16, 2019
Algorithms
gate1991
normal
algorithms
sorting
numerical-answers
+
–
5
answers
29
GATE CSE 1987 | Question: 1-xviii
Let $P$ be a quicksort program to sort numbers in ascending order. Let $t_{1}$ and $t_{2}$ be the time taken by the program for the inputs $\left[1 \ 2 \ 3 \ 4\right]$ and $\left[5 \ 4 \ 3 \ 2 \ 1\right]$, respectively. Which of the following holds? $t_{1} = t_{2}$ $t_{1} > t_{2}$ $t_{1} < t_{2}$ $t_{1}=t_{2}+5 \log 5$
Let $P$ be a quicksort program to sort numbers in ascending order. Let $t_{1}$ and $t_{2}$ be the time taken by the program for the inputs $\left[1 \ 2 \ 3 \ 4\right]$ an...
15.1k
views
commented
Sep 16, 2019
Algorithms
gate1987
algorithms
sorting
quick-sort
+
–
2
answers
30
CMI2017-A-08
A $\text{stable sort}$ preserves the order of values that are equal with respect to the comparison function. We have a list of three-dimensional points $[(7, 1, 8),(3, 5, 7),(6, 1, 4),(6, 5, 9),(0, 2, 5),(9, 0, 9)].$ We sort these in ascending order by the second coordinate. Which of the following ... $[(9, 0, 9),(6, 1, 4),(7, 1, 8),(0, 2, 5),(3, 5, 7),(6, 5, 9)]$
A $\text{stable sort}$ preserves the order of values that are equal with respect to the comparison function. We have a list of three-dimensional points$[(7, 1, 8),(3, 5, ...
2.1k
views
commented
Sep 16, 2019
Algorithms
cmi2017
algorithms
sorting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register