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 ABHIMANYUSINGH
4
answers
1
GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s?$(0+1 )^ *001...
20.8k
views
comment edited
Sep 9, 2020
Theory of Computation
gatecse-2016-set1
theory-of-computation
regular-expression
normal
+
–
6
answers
2
GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ and the number of segments are given below.$$\small \begin{array}{|c|c|c|}\h...
29.2k
views
commented
Sep 1, 2020
Operating System
gateit-2006
operating-system
memory-management
difficult
+
–
3
answers
3
Made Easy Test Series: Algorithm-Sorting
An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will be the best choice for sorting the array $A?$ $a)$ ... sorts part by part using pivot. So, why not will it be answer?? How do we know it is asking for almost sorted array??
An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will ...
1.9k
views
answered
Oct 24, 2019
Algorithms
algorithms
made-easy-test-series
sorting
+
–
4
answers
4
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.3k
views
commented
Oct 23, 2019
Algorithms
gatecse-2017-set2
huffman-code
numerical-answers
algorithms
+
–
3
answers
5
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$
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...
387
views
commented
Oct 23, 2019
Algorithms
tbb-algorithms-2
+
–
3
answers
6
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 )$
Find the time complexity of the functionfunction( 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...
963
views
commented
Oct 20, 2019
Algorithms
tbb-algorithms-2
+
–
2
answers
7
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.
Which of the following statements is FALSE?Optimal binary search tree construction can be performed efficiently using dynamic programming.Breadth-first search cannot be u...
267
views
commented
Oct 20, 2019
Algorithms
tbb-algorithms-2
+
–
2
answers
8
Test by Bikram | Algorithms | Test 2 | Question: 28
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest paths from node G are _________.
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest pat...
374
views
commented
Oct 17, 2019
Algorithms
tbb-algorithms-2
numerical-answers
+
–
2
answers
9
Test by Bikram | Algorithms | Test 2 | Question: 27
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
495
views
commented
Oct 17, 2019
Algorithms
tbb-algorithms-2
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register