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 bhaskar_raksahb21
6
answers
1
GATE CSE 2016 Set 2 | Question: 15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is...
34.4k
views
commented
May 22, 2021
DS
gatecse-2016-set2
data-structures
linked-list
time-complexity
normal
algorithms
+
–
5
answers
2
GATE CSE 1998 | Question: 3b
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed integer)
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed...
8.9k
views
commented
Apr 20, 2021
Theory of Computation
gate1998
theory-of-computation
regular-expression
easy
descriptive
+
–
6
answers
3
GATE CSE 2021 Set 2 | Question: 1
Let $G$ be a connected undirected weighted graph. Consider the following two statements. $S_1$: There exists a minimum weight edge in $G$ which is present in every minimum spanning tree of $G$. $S_2$: If every edge in $G$ has distinct weight, then $G$ has a ... are true $S_1$ is true and $S_2$ is false $S_1$ is false and $S_2$ is true Both $S_1$ and $S_2$ are false
Let $G$ be a connected undirected weighted graph. Consider the following two statements.$S_1$: There exists a minimum weight edge in $G$ which is present in every minimum...
11.9k
views
commented
Feb 26, 2021
Algorithms
gatecse-2021-set2
algorithms
graph-algorithms
minimum-spanning-tree
1-mark
+
–
1
answer
4
Number of decoders
How many 2 to 4 Line decoders are required to construct a 5 to 32 line decoder?
How many 2 to 4 Line decoders are required to construct a 5 to 32 line decoder?
6.9k
views
commented
Feb 10, 2021
Digital Logic
decoder
digital-logic
+
–
2
answers
5
GATE2017 EC-2: GA-9
The number of $3$-digit numbers such that the digit $1$ is never to the immediate right of $2$ is $781$ $791$ $881$ $891$
The number of $3$-digit numbers such that the digit $1$ is never to the immediate right of $2$ is$781$$791$$881$$891$
4.7k
views
answered
Oct 3, 2020
Quantitative Aptitude
gate2017-ec-2
quantitative-aptitude
combinatory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register