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 Ansaaa24
3
answers
1
comparison
Consider a set of n distinct elements, by comparison Amit wants to find the largest 3 elements in the set. Which of the following is true a) Three largest elements can be determined using O(log ^2 n ) comparison b)O(log ^2 n ) comparison is not sufficient, but can be found using n comparisons c)n + O(1) comparison are needed d)n + O(1) not sufficient , n + O(log n) comparisons required
Consider a set of n distinct elements, by comparison Amit wants to find the largest 3 elements in the set. Which of the following is truea) Three largest elements can be ...
632
views
answered
Sep 29, 2020
Algorithms
time-complexity
algorithms
+
–
3
answers
2
GATE CSE 2018 | Question: 36
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$. For an unrestricted grammar $G$ and a string $w$, whether $w \in L(G)$ Given a Turing machine ... is correct? Only I and II are undecidable Only II is undecidable Only II and IV are undecidable Only I, II and III are undecidable
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$.For an unrestricted grammar $...
16.9k
views
commented
Feb 3, 2020
Theory of Computation
gatecse-2018
theory-of-computation
decidability
easy
2-marks
+
–
5
answers
3
GATE CSE 2018 | Question: 43
Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent ... denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z=$ ______.
Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and ...
19.9k
views
commented
Feb 3, 2020
Algorithms
gatecse-2018
algorithms
graph-algorithms
numerical-answers
2-marks
+
–
14
answers
4
GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
39.2k
views
comment edited
Feb 3, 2020
DS
gatecse-2018
binary-heap
numerical-answers
combinatory
2-marks
+
–
2
answers
5
efficiency
1.1k
views
commented
Jan 17, 2020
16
answers
6
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
54.1k
views
commented
Jan 3, 2020
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
+
–
4
answers
7
GATE CSE 2017 Set 2 | Question: 12
Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$ The decimal value closest to this floating-point number is : $1.45*10^1$ $1.45*10^{-1}$ $2.27*10^{-1}$ $2.27*10^1$
Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$Th...
21.9k
views
commented
Dec 24, 2019
Digital Logic
gatecse-2017-set2
digital-logic
number-representation
floating-point-representation
ieee-representation
+
–
5
answers
8
GATE CSE 2017 Set 2 | Question: 05
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it: ... $\text{P-iii; Q-iv; R-i; S-ii}$ $\text{P-i; Q-iv; R-ii; S-iii}$
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:$$\begin{array}{|l|l|}\hline \text{P. Syntax t...
9.7k
views
commented
Dec 24, 2019
Compiler Design
gatecse-2017-set2
compiler-design
match-the-following
compilation-phases
easy
+
–
3
answers
9
GATE CSE 2017 Set 2 | Question: 41
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted by a Turing machine $M$. Which of the following decision problems are undecidable? Given a ... string $w$, is $w \in L(M)$? I and IV only II and III only II, III and IV only III and IV only
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted ...
8.6k
views
commented
Dec 24, 2019
Theory of Computation
gatecse-2017-set2
theory-of-computation
decidability
+
–
4
answers
10
GATE CSE 2017 Set 2 | Question: 40
Consider the following languages. $L_1 = \{a^p \mid p \text{ is a prime number} \}$ $L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$ $L_3 = \{a^n b^n c^{2n} \mid n \geq 0 \}$ ... not context free $L_3$ is not context free but recursive $L_4$ is deterministic context free I, II and IV only II and III only I and IV only III and IV only
Consider the following languages.$L_1 = \{a^p \mid p \text{ is a prime number} \}$$L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$$L_3 = \{a^n b^n c^{2n} \mid n \geq 0 ...
9.0k
views
commented
Dec 24, 2019
Theory of Computation
gatecse-2017-set2
theory-of-computation
identify-class-language
+
–
3
answers
11
difference between compulsory miss, conflict miss and capacity miss
I want to clearly understand the difference between compulsory miss, conflict miss and capacity miss what I understood is compulsory miss: when a block of main memory is trying to occupy fresh empty line of cache, it ... Because in associative mapping, no block of main memory tries to occupy already filled line. is this correct?
I want to clearly understand the difference between compulsory miss, conflict miss and capacity misswhat I understood iscompulsory miss: when a block of main memory is tr...
18.7k
views
answered
Oct 22, 2019
CO and Architecture
co-and-architecture
cache-memory
misses
+
–
6
answers
12
GATE CSE 2003 | Question: 82, ISRO2009-1
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network? $172.57.88.62$ and $172.56.87.23$ $10.35.28.2$ and $10.35.29.4$ $191.203.31.87$ and $191.234.31.88$ $128.8.129.43$ and $128.8.161.55$
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network?$172.57.88.62$ and $172.56....
29.3k
views
commented
Sep 23, 2019
Computer Networks
gatecse-2003
computer-networks
subnetting
normal
isro2009
+
–
5
answers
13
GATE IT 2004 | Question: 27
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which the Ethernet address of the host is unique is the subnet to which the host belongs the Department network the University network the Internet
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which ...
13.6k
views
commented
Sep 23, 2019
Computer Networks
gateit-2004
computer-networks
lan-technologies
ethernet
normal
+
–
3
answers
14
ISRO2017-21
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$ $60$ ns $30$ ns $150$ ns $70$ ns
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$$60$ ns$30$ ns$150$ ns$70$ ns
13.4k
views
answered
Aug 3, 2019
CO and Architecture
isro2017
co-and-architecture
cache-memory
+
–
6
answers
15
GATE CSE 2002 | Question: 2.25
From the following instance of a relation schema $R(A,B,C)$ ... functionally determine $C$ $B$ does not functionally determine $C$ $A$ does not functionally determine $B$ and $B$ does not functionally determine $C$
From the following instance of a relation schema $R(A,B,C)$, we can conclude that:$$\begin{array}{|l|l|}\hline \textbf{A} & \textbf{B} & \textbf{C} \\\hline \text{1} & \...
17.0k
views
answered
Jun 4, 2018
Databases
gatecse-2002
databases
database-normalization
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register