Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Hot questions
0
votes
0
answers
19471
Cormen Edition 3 Exercise 6.5 Question 4 (Page No. 165)
Why do we bother setting the key of the inserted node to $-\infty$ in line $2$ of MAX-HEAP-INSERT when the next thing we do is increase its key to the desired value?
Why do we bother setting the key of the inserted node to $-\infty$ in line $2$ of MAX-HEAP-INSERT when the next thing we do is increase its key to the desired value?
akash.dinkar12
280
views
akash.dinkar12
asked
Jun 27, 2019
Algorithms
cormen
algorithms
binary-heap
descriptive
+
–
0
votes
0
answers
19472
UGC NET CSE | June 2019 | Part 1 | Question: 14
Michaelangelo is famous for having successfully interpreted the human body. His great achievement is that of the painting of David whose hands reach out as a sign of human capability and potential. It is assumed that ... structure To retroactively diagnose famous artists and public figures of conditions that were not prevalent during their time
Michaelangelo is famous for having successfully interpreted the human body. His great achievement is that of the painting of David whose hands reach out as a sign of huma...
Arjun
265
views
Arjun
asked
Jul 2, 2019
Others
ugcnetcse-june2019-paper1
general-awareness
passage-reading
+
–
1
votes
2
answers
19473
Continuity and Differentiability
If the function f(x) =[(x-2)3 /a] sin(x-2) + acos(x-2), [.] denotes greatest integer function, is continuous & differentiable in (4,6) then find ‘a’ range: (A) a ϵ (-∞,∞) (B) a ϵ [64, ∞) (C) a ϵ [128, ∞) (D) Not defined
If the function f(x) =[(x-2)3 /a] sin(x-2) + acos(x-2), [.] denotes greatest integer function, is continuous & differentiable in (4,6) then find ‘...
Sonu Kumar 1
1.8k
views
Sonu Kumar 1
asked
Sep 6, 2017
0
votes
0
answers
19474
Cormen Edition 3 Exercise 6.4 Question 2 (Page No. 160)
Argue the correctness of HEAPSORT using the following loop invariant: At the start of each iteration of the for loop of lines $2–5$,the subarray $A[1..i]$ is a max-heap containing the $i$ smallest elements of $A[1..n] $, and the subarray $A[i+1..n]$ contains the $n- i$ largest elements of $A[1..n]$, sorted.
Argue the correctness of HEAPSORT using the following loop invariant:At the start of each iteration of the for loop of lines $2–5$,the subarray $A[1..i]$ is a max-heap ...
akash.dinkar12
380
views
akash.dinkar12
asked
Jun 27, 2019
Algorithms
cormen
algorithms
binary-heap
heap-sort
descriptive
+
–
33
votes
3
answers
19475
GATE CSE 2014 Set 2 | Question: 22
Given an instance of the STUDENTS relation as shown as below ... $(\text{StudentName, StudentAge})$ to be a key for this instance, the value $X$ should NOT be equal to______.
Given an instance of the STUDENTS relation as shown as below$$\begin{array}{|c|c|c|c|c|} \hline \textbf {StudentID} & \textbf{StudentName} & \textbf{StudentEmail} & \text...
go_editor
7.3k
views
go_editor
asked
Sep 28, 2014
Databases
gatecse-2014-set2
databases
numerical-answers
easy
candidate-key
+
–
0
votes
1
answer
19476
Follow Set Self Doubt
X->aABe B->c | d A->a What will be the follow of A here? {c, d, $} or {c, d, e, dollar}
X->aABeB->c | dA->aWhat will be the follow of A here?{c, d, $} or {c, d, e, dollar}
aditi19
476
views
aditi19
asked
Jun 8, 2019
Compiler Design
compiler-design
first-and-follow
+
–
3
votes
1
answer
19477
GATE2017 CE-1: GA-4
If the radius of a right circular cone is increased by $50\%$ its volume increases by $75\%$ $100\%$ $125\%$ $237.5\%$
If the radius of a right circular cone is increased by $50\%$ its volume increases by$75\%$$100\%$$125\%$$237.5\%$
Milicevic3306
1.5k
views
Milicevic3306
asked
Mar 26, 2018
Quantitative Aptitude
gate2017-ce-1
general-aptitude
quantitative-aptitude
percentage
geometry
+
–
3
votes
2
answers
19478
UGC NET CSE | Junet 2015 | Part 3 | Question: 30
The minimum payload of a TCP segment is 65,535 65,515 65,495 65,475
The minimum payload of a TCP segment is65,53565,51565,49565,475
go_editor
4.1k
views
go_editor
asked
Jul 31, 2016
Computer Networks
ugcnetcse-june2015-paper3
computer-networks
tcp
+
–
0
votes
1
answer
19479
Linear Algebra (Self Doubt)
Let $A$ be a $n \times n$ square matrix whose all columns are independent. Is $Ax = b$ always solvable? Actually, I know that $Ax= b$ is solvable if $b$ is in the column space of $A$. However, I am not sure if it is solvable for all values of $b$.
Let $A$ be a $n \times n$ square matrix whose all columns are independent. Is $Ax = b$ always solvable?Actually, I know that $Ax= b$ is solvable if $b$ is in the column s...
Debargha Bhattacharj
680
views
Debargha Bhattacharj
asked
Jun 6, 2019
Linear Algebra
linear-algebra
+
–
0
votes
0
answers
19480
UGC NET CSE | June 2019 | Part 1 | Question: 46
In post independence India, which one of the following committee/commission’s report deals with all levels of education in India? Sargeant Commission Hartog Committee Kothari Commission Radhakrishnan Commission
In post independence India, which one of the following committee/commission’s report deals with all levels of education in India?Sargeant CommissionHartog CommitteeKoth...
Arjun
244
views
Arjun
asked
Jul 2, 2019
Others
ugcnetcse-june2019-paper1
general
general-awareness
+
–
2
votes
1
answer
19481
GATE2010 TF: GA-1
Which of the following options is the closest in meaning to the word below$:$ Ephemeral effeminate ghostlike soft short-lived
Which of the following options is the closest in meaning to the word below$:$Ephemeraleffeminateghostlikesoftshort-lived
admin
680
views
admin
asked
May 13, 2019
Verbal Aptitude
general-aptitude
verbal-aptitude
gate2010-tf
meaning
+
–
1
votes
1
answer
19482
Syllabus of operating system
Are following part of gate syllabus? 1- Thread scheduling 2- multiple processor scheduling 3- real time scheduling like earliest deadline first scheduling
Are following part of gate syllabus?1- Thread scheduling2- multiple processor scheduling3- real time scheduling like earliest deadline first scheduling
bts1jimin
392
views
bts1jimin
asked
Oct 18, 2018
Operating System
operating-system
syllabus
+
–
5
votes
1
answer
19483
The least number of states in DFA
L= set of all strings of a's and b's with exactly 5 a's and 7 b's if DFA M accepts L. The least number of states in M is ------------------
L= set of all strings of a's and b's with exactly 5 a's and 7 b'sif DFA M accepts L. The least number of states in M is
debanjan sarkar
11.9k
views
debanjan sarkar
asked
Sep 30, 2016
Theory of Computation
minimal-state-automata
theory-of-computation
finite-automata
+
–
0
votes
0
answers
19484
Admission in iiitm kerala
Hello I have not performed well in the gate this year, I am not getting any IIT. Although I applied in IIITMK, Kerala does anyone know how good it is to do masters there.? because it is not possible for me to took gap this year. please help thanks in advance
Hello I have not performed well in the gate this year, I am not getting any IIT. Although I applied in IIITMK, Kerala does anyone know how good it is to do masters there....
JPranavc
466
views
JPranavc
asked
Jun 11, 2019
Other Colleges
admissions
iiit
+
–
45
votes
3
answers
19485
GATE IT 2004 | Question: 32
Let $A$ be an $n \times n$ ...
Let $A$ be an $n \times n$ matrix of the following form.$$A = \begin{bmatrix}3&1&0&0&0&\ldots&0&0&0\\1&3&1&0&0&\ldots&0&0&0\\0&1&3&1&0&\ldots&0&0&0\\0&0&1&3&1&\ldots&0&0&...
Ishrat Jahan
8.0k
views
Ishrat Jahan
asked
Nov 2, 2014
Linear Algebra
gateit-2004
linear-algebra
matrix
normal
+
–
0
votes
1
answer
19486
carl hamacher(chapter 2 )
in the underline statement it is given that higher performance can be achieved if each instruction occupy one word???how it is true??what happen when two instruction occupy in single word???
in the underline statement it is given that higher performance can be achieved if each instruction occupy one word???how it is true??what happen when two instruction occu...
BASANT KUMAR
502
views
BASANT KUMAR
asked
Aug 11, 2018
4
votes
3
answers
19487
Test by Bikram | Mock GATE | Test 1 | Question: 49
Consider two machines, machine $A$ and machine $B$. Machine $B$ runs floating-point instructions $n$ times faster than machine $A$. Consider a program that takes $100$ $seconds$ to run on machine $A$, and spends half of its time in ... $A$) then the value of $n$ is _________ (In case of fractional value of $n$ give nearest higher positive integer).
Consider two machines, machine $A$ and machine $B$. Machine $B$ runs floating-point instructions $n$ times faster than machine $A$.Consider a program that takes $100$ $se...
Bikram
1.3k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
speedup
co-and-architecture
+
–
1
votes
0
answers
19488
Ullman (TOC) Edition 3 Exercise 3.4 Question 2 (Page No. 122)
Prove or disprove each of the following statements about regular expressions. $(R+S)^{*}=R^{*}+S^{*}$ $(RS+R)^{*}R=R(SR+R)^{*}$ $(RS+R)^{*}RS=(RR^{*}S)^{*}$ $(R+S)^{*}S=(R^{*}S)^{*}$ $S(RS+S)^{*}R=RR^{*}S(RR^{*}S)^{*}$
Prove or disprove each of the following statements about regular expressions.$(R+S)^{*}=R^{*}+S^{*}$$(RS+R)^{*}R=R(SR+R)^{*}$$(RS+R)^{*}RS=(RR^{*}S)^{*}$$(R+S)^{*}S=(R^{*...
admin
1.3k
views
admin
asked
Apr 3, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
regular-expression
+
–
2
votes
2
answers
19489
UGC NET CSE | Junet 2015 | Part 3 | Question: 64
Given the symbols A, B, C, D, E, F, G and H with the probabilities$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$ and $\frac{12}{30}$respectively. The average Huffman code size in bits per symbol is $\frac{67}{30}$ $\frac{70}{34}$ $\frac{76}{30}$ $\frac{78}{30}$
Given the symbols A, B, C, D, E, F, G and H with the probabilities$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$ and $...
go_editor
6.1k
views
go_editor
asked
Aug 2, 2016
Algorithms
ugcnetcse-june2015-paper3
algorithms
greedy-algorithms
huffman-code
+
–
1
votes
1
answer
19490
TIFR-2014-Maths-A-5
Let $a_{n}=(n+1)^{100} e^{-\sqrt{n}}$ for $n \geq 1$. Then the sequence $(a_{n})_{n}$ is Unbounded Bounded but does not converge Bounded and converges to $1$ Bounded and converges to $0$
Let $a_{n}=(n+1)^{100} e^{-\sqrt{n}}$ for $n \geq 1$. Then the sequence $(a_{n})_{n}$ isUnboundedBounded but does not converge Bounded and converges to $1$Bounded and con...
makhdoom ghaya
475
views
makhdoom ghaya
asked
Dec 14, 2015
Set Theory & Algebra
tifrmaths2014
convergence
non-gate
+
–
Page:
« prev
1
...
969
970
971
972
973
974
975
976
977
978
979
...
3225
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register