Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Genius
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Genius
0
votes
1
GATE CSE 2008 | Question: 46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P...
38.6k
views
answered
Jun 29, 2023
DS
gatecse-2008
data-structures
binary-search-tree
normal
+
–
2
votes
2
GO Classes 2023 | IIITH Mock Test 1 | Question: 63
The arithmetic mean of five different natural numbers is $12$. The largest possible value among the numbers is $12$ $40$ $50$ $60$
The arithmetic mean of five different natural numbers is $12$. The largest possible value among the numbers is$12$ $40$ $50$ $60$
582
views
answered
Apr 16, 2023
Quantitative Aptitude
goclasses2023-iiith-mock-1
goclasses
quantitative-aptitude
arithmetic-mean
1-mark
+
–
0
votes
3
Peter Linz Edition 4 Exercise 3.1 Question 12 (Page No. 76)
Find a regular expression for the complement of the language in $L (r) =$ {$a^{2n}b^{2m+1}: n ≥ 0, m ≥ 0$}.
Find a regular expression for the complement of the language in $L (r) =$ {$a^{2n}b^{2m+1}: n ≥ 0, m ≥ 0$}.
445
views
answered
Mar 4, 2023
Theory of Computation
peter-linz
peter-linz-edition4
regular-expression
theory-of-computation
regular-language
+
–
1
votes
4
GATE CSE 1988 | Question: 15
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $F2=A?$ $F2=B?$ $F2=C?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p,q \in Q; r \in F\}$
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if$F2=A?$$F2=B?$$F2=C?$$...
2.8k
views
answered
Feb 26, 2023
Theory of Computation
gate1988
descriptive
theory-of-computation
finite-automata
difficult
+
–
0
votes
5
GATE CSE 2018 | Question: 10
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is $M$ units if the corresponding memory page is available in memory, and $D$ units if the memory access causes a page fault. It has been experimentally measured that the average ... $(X-M) / D-M)$ $(D-X) / D-M)$ $(X-M) / D-X)$
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is $M$ units if the corresponding memory p...
10.4k
views
answered
Jan 16, 2023
Operating System
gatecse-2018
operating-system
virtual-memory
normal
1-mark
+
–
2
votes
6
GO Classes Test Series 2023 | Linear Algebra | Test | Question: 10
What could be the possible values of $\operatorname{rank}(\mathrm{A})$ as "$a$" varies: $ A=\left[\begin{array}{ccc} 1 & 2 & a\\ -2 & 4 a & 2\\ a & -2 & 1 \end{array}\right] $ For some value ... $a$, rank could be $1$ For some value of $a$, rank could be $2$ For some value of $a$, rank could be $3$
What could be the possible values of $\operatorname{rank}(\mathrm{A})$ as "$a$" varies:$$A=\left[\begin{array}{ccc}1 & 2 & a\\-2 & 4 a & 2\\a & -2 & 1\end{array}\right]$$...
374
views
answered
Jan 5, 2023
Linear Algebra
goclasses2024-la-weekly_quiz
goclasses
linear-algebra
rank-of-matrix
multiple-selects
2-marks
+
–
16
votes
7
GATE CSE 2021 Set 2 | Question: 47
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three. $(0+1(01^*0)^*1)^*$ $(0+11+10(1+00)^*01)^*$ $(0^*(1(01^*0)^*1)^*)^*$ $(0+11+11(1+00)^*00)^*$
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three...
12.2k
views
answered
Oct 31, 2022
Theory of Computation
gatecse-2021-set2
multiple-selects
theory-of-computation
regular-expression
2-marks
+
–
3
votes
8
GATE CSE 2021 Set 1 | Question: 27
The following relation records the age of $500$ employees of a company, where $empNo$ (indicating the employee number) is the key: $empAge(\underline{empNo},age)$ ... Employee numbers of all employees whose age is not the minimum Employee numbers of all employees whose age is the minimum
The following relation records the age of $500$ employees of a company, where $empNo$ (indicating the employee number) is the key:$$empAge(\underline{empNo},age)$$Conside...
6.9k
views
answered
Oct 31, 2022
Databases
gatecse-2021-set1
databases
relational-algebra
2-marks
+
–
3
votes
9
GATE CSE 2008 | Question: 66
A process executes the following code for(i=0; i<n; i++) fork(); The total number of child processes created is $n$ $2^n-1$ $2^n$ $2^{n+1} - 1$
A process executes the following codefor(i=0; i<n; i++) fork();The total number of child processes created is$n$$2^n-1$$2^n$$2^{n+1} - 1$
16.9k
views
answered
Oct 19, 2022
Operating System
gatecse-2008
operating-system
fork-system-call
normal
+
–
0
votes
10
GATE CSE 2021 Set 2 | Question: 17
Consider the following deterministic finite automaton $\text{(DFA)}$ The number of strings of length $8$ accepted by the above automaton is ___________
Consider the following deterministic finite automaton $\text{(DFA)}$The number of strings of length $8$ accepted by the above automaton is ___________
9.3k
views
answered
Oct 15, 2022
Theory of Computation
gatecse-2021-set2
numerical-answers
theory-of-computation
finite-automata
1-mark
+
–
1
votes
11
Programming Quiz
Which one of the following features is supported by 𝐶 ++ but not by JAVA ? (a) Encapsulation (b) Multiple inheritance (c) Concurrency (d) Garbage collection
Which one of the following features is supported by 𝐶 ++ but not by JAVA ?(a) Encapsulation(b) Multiple inheritance(c) Concurrency(d) Garbage collection
943
views
answered
Oct 8, 2022
Object Oriented Programming
object-oriented-programming
+
–
0
votes
12
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 13
Consider two statements below - $\text{S1}:$ For all positive $f(n), f(n) + o(f(n)) = \theta(f(n)).$ $\text{S2}:$ For all positive $f(n), g(n)$ and $h(n),$ if $f(n) = O(g(n))$ ... $\text{S1}$ is True but $\text{S2}$ is False. $\text{S2}$ is True but $\text{S1}$ is False. Both are True. Both are False.
Consider two statements below -$\text{S1}:$ For all positive $f(n), f(n) + o(f(n)) = \theta(f(n)).$$\text{S2}:$ For all positive $f(n), g(n)$ and $h(n),$ if $f(n) = O(g(n...
1.5k
views
answered
Aug 17, 2022
Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
2-marks
+
–
4
votes
13
GO Classes Test Series 2024 | Discrete Mathematics | Test 4 | Question: 12
Consider the set of $4$-digit positive integers. How many of them are odd and don’t have the property that the sum of their digits is even?
Consider the set of $4$-digit positive integers. How many of them are odd and don’t have the property that the sum of their digits is even?
471
views
answered
Aug 7, 2022
Combinatory
goclasses2024-dm-4-weekly-quiz
numerical-answers
goclasses
combinatory
2-marks
+
–
0
votes
14
GO Classes Test Series 2024 | Discrete Mathematics | Test 4 | Question: 11
Consider the set of $4$-digit positive integers. How many of them are even and have distinct digits?
Consider the set of $4$-digit positive integers. How many of them are even and have distinct digits?
284
views
answered
Aug 7, 2022
Combinatory
goclasses2024-dm-4-weekly-quiz
numerical-answers
goclasses
combinatory
2-marks
+
–
0
votes
15
GATE CSE 2002 | Question: 3
Let $A$ be a set of $n(>0)$ elements. Let $N_r$ be the number of binary relations on $A$ and let $N_f$ be the number of functions from $A$ to $A$ Give the expression for $N_r,$ in terms of $n.$ Give the expression for $N_f,$ terms of $n.$ Which is larger for all possible $n,N_r$ or $N_f$
Let $A$ be a set of $n(>0)$ elements. Let $N_r$ be the number of binary relations on $A$ and let $N_f$ be the number of functions from $A$ to $A$Give the expression for $...
4.0k
views
answered
Jul 29, 2022
Set Theory & Algebra
gatecse-2002
set-theory&algebra
normal
descriptive
relations
+
–
0
votes
16
GATE CSE 2007 | Question: 45
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
What is the $\text{time complexity}$ of the following recursive function?int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); ...
31.7k
views
answered
May 20, 2022
Algorithms
gatecse-2007
algorithms
time-complexity
normal
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register