Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions and answers
9.3k
views
5
answers
15
votes
GATE CSE 2021 Set 2 | Question: 2
Let $H$ be a binary min-heap consisting of $n$ elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in ... \Theta (1)$\Theta (\log n)$\Theta (n)$\Theta (n \log n)$
Cxdr
9.3k
views
Cxdr
answered
5 hours
ago
DS
gatecse-2021-set2
data-structures
binary-heap
time-complexity
1-mark
+
–
618
views
2
answers
4
votes
GO Classes CS Test Series 2025 | Calculus | Topic Wise Test 3 | Question: 16
The sum of three positive numbers is $12$ and two of them are equal. Find the largest possible product.$86$64$48$72$
Khem Singh
618
views
Khem Singh
answered
6 hours
ago
Calculus
goclasses_2025_cs_em_tw_3
goclasses
calculus
differentiation
maxima-minima
2-marks
+
–
164
views
1
answers
0
votes
self doubt
let suppose address of first index of array is n and size of each block of array is u. then the index of second element is a+u.let suppose the array has m elements. ... array of same size, if it's address of second last element is (n - u).
nothingToDo
164
views
nothingToDo
answered
7 hours
ago
Programming in C
programming-in-c
array
+
–
18.8k
views
4
answers
38
votes
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$ ... $LR(k)$
Amoljadhav
18.8k
views
Amoljadhav
answered
12 hours
ago
Compiler Design
gate1995
compiler-design
grammar
normal
+
–
8.3k
views
6
answers
9
votes
ISRO2017-49
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is$11$12$13$10$
ritiksri8
8.3k
views
ritiksri8
answered
13 hours
ago
Algorithms
isro2017
algorithms
sorting
+
–
18
views
0
answers
0
votes
Go classes linear algebra lecture filling a vector space.
Why does linear combination of 2 linearly independent vectors produce every vector in R^2 ?
Sanidhya_10
18
views
Sanidhya_10
asked
14 hours
ago
Linear Algebra
goclasses
linear-algebra
+
–
8
views
0
answers
0
votes
I have my doubts on choosing Msc integrated CsE and Btech Cse , both in merit im in a struggle
I have always been intrested in IIT couldnt crack them even though i did everything i could i know that might be hard to comorehend but i got some colleges ... with merit seats available and after that i intend to to take Gate for IIt
Loveucifer
8
views
Loveucifer
asked
16 hours
ago
Other Colleges
admission
+
–
11
views
0
answers
0
votes
any idea how to order gate cse 4th edition hardcopy .
rahulparicha
11
views
rahulparicha
asked
20 hours
ago
Study Resources
gateoverflow
+
–
91
views
2
answers
1
votes
pointers in c programming answer the output
#include <stdio.h> int main() { // Write C code here int i=10,*p,**q,***r; p=&i; *p=15; q=&p; **q=20; r=&q; ***r=*p+1; printf("%d",i); return 0; }answer the output as integer _________
nothingToDo
91
views
nothingToDo
answered
1 day
ago
Programming in C
programming-in-c
programming
pointers
numerical-answers
+
–
3.1k
views
3
answers
7
votes
GATE CSE 2024 | Set 2 | Question: 23
Consider the following $\mathrm{C}$ function definition.int f X(char * a) { char * b = a; while (*b) b ++; return b - a; }Which of the following ... in main (), the function call $\mathrm{fX}(\mathrm{c})$ will always return a value
nothingToDo
3.1k
views
nothingToDo
answered
1 day
ago
Programming in C
gatecse2024-set2
programming
programming-in-c
multiple-selects
output
+
–
5.0k
views
3
answers
8
votes
GATE CSE 2024 | Set 2 | Question: 3
Consider the following $\text{C}$ program. Assume parameters to a function are evaluated from right to left.#include <stdio.h> int g( int p) { printf( ... $ program?$20101020$10202010$20102010$10201020$
nothingToDo
5.0k
views
nothingToDo
answered
1 day
ago
Programming in C
gatecse2024-set2
programming
programming-in-c
functions
+
–
4.8k
views
4
answers
18
votes
GATE CSE 1994 | Question: 3.12
Find the inverse of the matrix $\begin{bmatrix} 1 & 0 & 1 \\ -1 & 1 & 1 \\ 0 & 1 & 0 \end{bmatrix}$
Jo_26
4.8k
views
Jo_26
answered
1 day
ago
Linear Algebra
gate1994
linear-algebra
matrix
easy
descriptive
+
–
20
views
0
answers
0
votes
made easy test
Which of the following statements is/are true?A) Graph coloring is a systematic technique for allocating registers and managing register spills.B) ... resolves the shift/reduce conflict arising from the dangling-else ambiguity correctly.
Ayushhh_
20
views
Ayushhh_
asked
1 day
ago
Compiler Design
compiler-design
parsing
made-easy-test-series
true-false
+
–
2.5k
views
3
answers
3
votes
GATE CSE 2024 | Set 1 | Question: 22
Let $A$ and $B$ be non-empty finite sets such that there exist one-to-one and onto functions $\text{(i)}$ from $A$ to $B$ and $\text{(ii)}$ from $A \times A$ to $A \cup B$. The number of possible values of $\text{|A|}$ is ___________.
SaiRajesh
2.5k
views
SaiRajesh
answered
1 day
ago
Set Theory & Algebra
gatecse2024-set1
numerical-answers
set-theory&algebra
functions
+
–
15
views
0
answers
0
votes
Unacademy test series
Consider a system with 4KB page size and 3-level paging is used. The virtual address space is 36 bits and the physical address space is 32 bits. The page table ... 8 bits for page table indexing and each page table fits one page-frame[NAT]
Krick1234
15
views
Krick1234
asked
1 day
ago
Operating System
operating-system
paging
addressing-modes
test-series
+
–
41
views
1
answers
0
votes
fork() system call
How many child processes will be created in the following code: main(){if(!fork()){ if(!fork()) fork();}fork();}
Bhaskar_Saini
41
views
Bhaskar_Saini
answered
1 day
ago
Operating System
operating-system
fork-system-call
+
–
12.9k
views
4
answers
31
votes
GATE CSE 1998 | Question: 1.7
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions:$R_1 \cup R_2$ is an equivalence relation$R_1 \cap R_2$ is an equivalence ... ) is true but assertions (i) is not trueNeither (i) nor (ii) is true
Ayush Kumar_1
12.9k
views
Ayush Kumar_1
answered
2 days
ago
Set Theory & Algebra
gate1998
set-theory&algebra
relations
normal
+
–
3.6k
views
2
answers
0
votes
Michael Sipser Edition 3 Exercise 1 Question 17 (Page No. 86)
Give an $NFA$ recognizing the language $(01 ∪ 001 ∪ 010)^{*}.$Convert this $NFA$ to an equivalent $DFA.$ Give only the portion of the $DFA$ that is reachable from the start state.
Shaik Masthan
3.6k
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
+
–
1.1k
views
1
answers
1
votes
Michael Sipser Edition 3 Exercise 1 Question 15 (Page No. 85)
Give a counterexample to show that the following construction fails to prove $\text{Theorem 1.49,}$ the closure of the class of regular languages under the star operation$.$ ... $N$ does not recognize the star of $N_{1}^{'s}$ language.
Shaik Masthan
1.1k
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
regular-language
+
–
938
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 1 Question 14 (Page No. 85)
Show that if $M$ is a $DFA$ that recognizes language $B,$ swapping the accept and not accept states in $M$ yields a new $DFA$ recognizing the ... of languages recognized by $NFA's$ closed under complement$?$ Explain your answer$.$
Shaik Masthan
938
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
+
–
1.3k
views
1
answers
1
votes
Michael Sipser Edition 3 Exercise 1 Question 13 (Page No. 85)
Let $F$ be the language of all strings over $\{0,1\}$ that do not contain a pair of $1's$ that are separated by an odd number of symbols. Give the state ... helpful first to find a $4$-state $\text{NFA}$ for the complement of $F.)$
Shaik Masthan
1.3k
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
+
–
39
views
0
answers
0
votes
What would be the answer of letter series? aaa_b_a_
In the series aaa_b_a_baaabbbabaabbbbWhich one is the correct answer and why?
tbhaxor
39
views
tbhaxor
asked
2 days
ago
Verbal Aptitude
general-aptitude
+
–
217
views
1
answers
1
votes
GATE Civil 2024 Set 2 | GA Question: 4
If the sum of the first $20$ consecutive positive odd numbers is divided by $20^{2}$, the result is$1$20$2$1 / 2$
r4ritzy
217
views
r4ritzy
answered
2 days
ago
Quantitative Aptitude
gatecivil-2024-set2
quantitative-aptitude
arithmetic-series
+
–
870
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 1 Question 2 (Page No. 83)
Give the formal description of the machines $\text{M1}$ and $\text{M2.}$
Shaik Masthan
870
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
descriptive
+
–
860
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 1 Question 3 (Page No. 83)
The formal description of a $\text{DFA}$ $\text{M}$ is $({q1, q2, q3, q4, q5}, {u, d}, δ, q3, {q3}),$ where $\text{δ}$ is given by the following table. Give the state diagram of this machine.
Shaik Masthan
860
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
state-diagram
descriptive
+
–
1.5k
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 1 Question 1 (Page No. 83)
The following are the state diagrams of two $\text{DFAs,}$ $\text{M1}$, and $\text{M2.}$ Answer the following questions about each of these machines.What ... accept the string $\text{aabb?}$Does the machine accept the string $\epsilon?$
Shaik Masthan
1.5k
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
descriptive
+
–
221
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 0 Question 10 (Page No. 27)
Find the error in the following proof that $2 = 1.$Consider the equation $a = b.$ Multiply both sides by a to obtain $a^{2} = ab.$ Subtract $b^{2}$ from both sides to ... $a$ and $b$ equal $1,$ which shows that $2 = 1.$
Shaik Masthan
221
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
proof
+
–
387
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 0 Question 8 (Page No. 26)
Consider the undirected graph G= (V, E) where V , the set of nodes, is {1, 2, 3, 4} and E, the set of edges, is {{1, 2}, {2, 3}, {1, 3}, {2 ... . What are the degrees of each node? Indicate a path from node 3 to node 4 on your drawing of G.
Shaik Masthan
387
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
graph-theory
easy
+
–
305
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 0 Question 7 (Page No. 26)
For each part, give a relation that satisfies the condition.Reflexive and symmetric but not transitiveReflexive and transitive but not symmetricSymmetric and transitive but not reflexive
Shaik Masthan
305
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
relations
easy
+
–
427
views
2
answers
0
votes
Michael Sipser Edition 3 Exercise 0 Question 4 (Page No. 26)
If A has a elements and B has b elements, how many elements are in A × B? Explain your answer.
Shaik Masthan
427
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
set-theory
easy
+
–
367
views
1
answers
0
votes
Michael Sipser Edition 3 Exercise 0 Question 2 (Page No. 25)
Write formal descriptions of the following sets.a. The set containing the numbers 1, 10, and 100b. The set containing all integers that are greater than 5c ... abae. The set containing the empty stringf. The set containing nothing at all
Shaik Masthan
367
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
easy
+
–
532
views
1
answers
1
votes
Michael Sipser Edition 3 Exercise 0 Question 1 (Page No. 25)
Examine the following formal descriptions of sets so that you understand which members they contain. Write a short informal English description of each set.a. {1, 3, 5, 7, . . . }b ... the reverse of w}f. {n| n is an integer and n = n + 1}
Shaik Masthan
532
views
Shaik Masthan
answered
2 days
ago
Theory of Computation
michael-sipser
theory-of-computation
easy
+
–
53
views
1
answers
0
votes
Recursion
Find Output of below Code#include<stdio.h>int sum(int n) { n = 3; if (n == 2) return 2; return sum(n-1)*n ;}int main() { printf("%d\n", sum(5) ); return 0}
Bhaskar_Saini
53
views
Bhaskar_Saini
answered
2 days
ago
Programming in C
programming-in-c
programming
recursion
output
2-marks
+
–
31
views
1
answers
1
votes
igate booklet question
Consider the following grammar: Prog → {S} S→ Prog X; | Y = z; X →ϵ |S Prog Y → SZ Z→id Determine follow(S) from the above grammar. (A) { } , id} (B) { }, ϵ , id} (C) { },{ id} (D ) { },{ id,ϵ }
Bhaskar_Saini
31
views
Bhaskar_Saini
answered
2 days
ago
Compiler Design
compiler-design
first-and-follow
+
–
31
views
1
answers
0
votes
computer networks | Broadcasting
why the limited broadcasting address is all 1's as all 1's should be the specific ip address of the last host in the network and not the address of all the host in the specific n/w. Please explain
Shubham Sharma 2
31
views
Shubham Sharma 2
answered
2 days
ago
Computer Networks
computer-networks
+
–
21
views
0
answers
0
votes
where can i find gate da questions for practising??
harhith
21
views
harhith
asked
3 days
ago
GATE
gate-preparation
+
–
1.2k
views
2
answers
1
votes
GATE DS&AI 2024 | Question: 4
Consider performing depth-first search (DFS) on an undirected and unweighted graph $G$ starting at vertex $s$. For any vertex $u$ in $G, d[u]$ is the length of the ... , then $(u, v)$ becomes a $\_\_\_\_\_\_\_\_$ edge.treecrossbackgray
Shaik Masthan
1.2k
views
Shaik Masthan
answered
3 days
ago
Algorithms
gate-ds-ai-2024
graph-search
depth-first-search
algorithms
+
–
1.8k
views
2
answers
0
votes
NIELIT 2017 DEC Scientist B - Section B: 49
Which of the following is false?Interrupts which are initiated by an instruction are software interruptsWhen a subroutine is called, the address of the instruction following the ... $1$'s is a binary micro programNone of the options
Bishes
1.8k
views
Bishes
answered
3 days
ago
CO and Architecture
nielit2017dec-scientistb
co-and-architecture
interrupts
instruction-format
+
–
46
views
0
answers
0
votes
DMA
Consider a disk with data transfer rate 50MBPS. It is operated with cycle stealing mode of DMA. Here whenever 64bits information is available it is transferred in 40ns. What is the percentage(%) of time CPU blocked due to DMA?
Navneet2608
46
views
Navneet2608
asked
3 days
ago
CO and Architecture
co-and-architecture
dma
numerical-answers
+
–
7.9k
views
5
answers
23
votes
GATE IT 2007 | Question: 16
The minimum positive integer $p$ such that $3^{p} \pmod {17} = 1$ is$5$8$12$16$
Ayush Kumar_1
7.9k
views
Ayush Kumar_1
answered
4 days
ago
Set Theory & Algebra
gateit-2007
set-theory&algebra
normal
number-theory
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register