Register
Filter

Answers by Aakash_

0 votes
1
# Heap sort
Sort The Following Sequence of input using Heap sort. { 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 } Please show the output at every pass because i am getting confused.
Sort The Following Sequence of input using Heap sort.{ 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 }Please show the output at every pass because i am getting confused.
0 votes
2
Gate 2006 Questions
Are Gate 2006 questions really tough? I'm hardly able to solve few questions. How should I approach such questions.
Are Gate 2006 questions really tough?I'm hardly able to solve few questions.How should I approach such questions.
1 votes
3
Made easy test series
1 votes
4
Self Doubt
What is Abstract Syntax Tree(AST)? Difference between AST and parse tree?At which phase of compiler such trees are created? Who is the condensed form of whom?
What is Abstract Syntax Tree(AST)?Difference between AST and parse tree?At which phase of compiler such trees are created?Who is the condensed form of whom?
1 votes
6
Min heap
A min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in array of 1024 indices. The maximum difference between the keys of all the element that can possibly be stored at (n/2)th index of the array is...........
A min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in array of 1024 indices. The maximum difference between the keys of all the element t...
4 votes
9
n bit ripple carry adder
How many gate delays are there in overflow for ripple carry adder?
How many gate delays are there in overflow for ripple carry adder?
6 votes
10
GATE CSE 2006 | Question: 28
A logical binary relation $\odot$ ... $(\sim A\odot B)$ $\sim(A \odot \sim B)$ $\sim(\sim A\odot\sim B)$ $\sim(\sim A\odot B)$
A logical binary relation $\odot$, is defined as follows: $$\begin{array}{|l|l|l|} \hline \textbf{A} & \textbf{B}& \textbf{A} \odot \textbf{B}\\\hline \text{True} & \text...
3 votes
11
Non isomorphic group of order 10
Number of non isomorphic group of order 10
Number of non isomorphic group of order 10
2 votes
12
Decoder output
1 votes
13
Self Doubt: CO & Architecture - Microprogramming
Difference between Horizontal Microprogramming and Vertical Microprogramming Plz explain in detail for GATE point of view only.
Difference between Horizontal Microprogramming and Vertical Microprogramming Plz explain in detail for GATE point of view only.
0 votes
14
Probability - Gravner-51.a
Ten fair dice are rolled. What is the probability that: a) At least one $1$ appears.
Ten fair dice are rolled. What is the probability that:a) At least one $1$ appears.
1 votes
15
Probability - Gravner-54
Let $X$ be the number of Heads in $2$ fair coin tosses. Determine its p.m.f.
Let $X$ be the number of Heads in $2$ fair coin tosses. Determine its p.m.f.
2 votes
17
Multi Threading
1) Do the threads of a process share the same physical and logical address? 2) Are they both accessible by the same address?
1) Do the threads of a process share the same physical and logical address?2) Are they both accessible by the same address?
3 votes
18
Probability - Gravner-56
Let $X$ be a random variable with $P(X=1) =0.2, P(X=2) = 0.3$, and $P(X=3) = 0.5$. What is the expected value of $X$?
Let $X$ be a random variable with $P(X=1) =0.2, P(X=2) = 0.3$, and $P(X=3) = 0.5$. What is the expected value of $X$?
3 votes
19
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
1 votes
20
Asymptotic-notations
f(n)=2(log2 n)2 , g(n)=log2n+1 How to give relation between them?.
f(n)=2(log2 n)2 , g(n)=log2n+1How to give relation between them?.
2 votes
21
recursively enumerable languages
if L1,L2,.... are any recursively enumerable subsets of Σ*, then the union of Li's is Recursive enumerable. whether the above statement is true or false?
if L1,L2,.... are any recursively enumerable subsets of Σ*, then the union of Li's is Recursive enumerable.whether the above statement is true or false?
24 votes
22
GATE CSE 1989 | Question: 13b
Find a solution to the following recurrence equation: $T(n)=\sqrt{n}+T\left(\frac{n}{2}\right)$ $T(1)=1$
Find a solution to the following recurrence equation:$T(n)=\sqrt{n}+T\left(\frac{n}{2}\right)$$T(1)=1$
0 votes
24
UGC NET CSE | June 2008 | Part 2 | Question: 24
Files that are related to input/output and are used to model serial $\text{I/O}$ devices such as terminals, printers and networks are called: regular files character special files directories block special files
Files that are related to input/output and are used to model serial $\text{I/O}$ devices such as terminals, printers and networks are called:regular filescharacter specia...
2 votes
26
Time complexity
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?) T(n)=2T(n/2)+nlogn
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?)T(n)=2T(n/2)+nlogn
2 votes
27
Cyclic group
If (G,*) is a cyclic group of order 81 then number of generators in G is????
If (G,*) is a cyclic group of order 81 then number of generators in G is????
1 votes
28
Masters theorem
Solve using Master's Theorem $T(n)=T(n/2)+$ 2n
Solve using Master's Theorem$T(n)=T(n/2)+$ 2n
Page: