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
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.
1.1k
views
answered
Jan 6, 2019
Algorithms
algorithms
binary-heap
heap-sort
sorting
+
–
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.
977
views
answered
Dec 12, 2018
Others
difficult
gate-2006
+
–
1
votes
3
Made easy test series
349
views
answered
Dec 1, 2018
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?
643
views
answered
Nov 25, 2018
Compiler Design
parsing
+
–
2
votes
5
Ace Test Series: Compiler Design - Left Factoring
2.7k
views
answered
Nov 21, 2018
Compiler Design
compiler-design
parsing
ace-test-series
+
–
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...
2.4k
views
answered
Oct 26, 2018
DS
data-structures
binary-heap
numerical-answers
+
–
1
votes
7
UGC NET CSE | January 2017 | Part 2 | Question: 5
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true? $\text{deg}\left ( v \right )\geq \frac{n}{2}$ for each vertex $v\\$ ... $v$ and $w$ are not connected by an edge All of the above
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true?$\text{deg}\...
2.1k
views
answered
Oct 25, 2018
Graph Theory
ugcnetjan2017ii
graph-theory
graph-coloring
+
–
4
votes
8
#Cache
Consider a direct map cache of 8 words, with block 2 words per Block. The following sequence of access to memory block 0,5,2,7,4,0 and 4 is repeated 10 times. Q1) number of compulsory miss? Q2) number of conflict misses? Q3) The number of capacity misses?
Consider a direct map cache of 8 words, with block 2 words per Block. The following sequence of access to memory block 0,5,2,7,4,0 and 4 is repeated 10 times.Q1) number o...
995
views
answered
Oct 8, 2018
CO and Architecture
co-and-architecture
cache-memory
misses
numerical-answers
+
–
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?
1.2k
views
answered
Oct 5, 2018
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...
5.9k
views
answered
Oct 3, 2018
Set Theory & Algebra
gatecse-2006
set-theory&algebra
binary-operation
+
–
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.6k
views
answered
Oct 2, 2018
Set Theory & Algebra
group-theory
group-isomorphism
+
–
2
votes
12
Decoder output
411
views
answered
Oct 1, 2018
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.
4.0k
views
answered
Sep 29, 2018
CO and Architecture
co-and-architecture
microprogramming
horizontal-microprogramming
+
–
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.
207
views
answered
Sep 24, 2018
Probability
gravner
probability
engineering-mathematics
+
–
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.
230
views
answered
Sep 24, 2018
Probability
probability
gravner
engineering-mathematics
+
–
1
votes
16
Probability - Gravner-57
An urn contains $11$ balls, $3$ white , $3$ red, and $5$ blue balls. Take out $3$ balls at random, without replacement. You win $1$ for each red ball you select and lose a $1$ for each white ball you select. Determine the p.m.f. of $X$ , the amount you win.
An urn contains $11$ balls, $3$ white , $3$ red, and $5$ blue balls. Take out $3$ balls at random, without replacement. You win $1$ for each red ball you select and lose ...
217
views
answered
Sep 24, 2018
Probability
probability
gravner
engineering-mathematics
+
–
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?
592
views
answered
Sep 24, 2018
Operating System
operating-system
+
–
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$?
217
views
answered
Sep 24, 2018
Probability
probability
gravner
engineering-mathematics
+
–
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$ ...
20.6k
views
answered
Sep 22, 2018
Probability
gatecse-2017-set1
probability
numerical-answers
normal-distribution
+
–
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?.
434
views
answered
Sep 22, 2018
Algorithms
time-complexity
asymptotic-notation
+
–
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?
593
views
answered
Sep 20, 2018
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$
4.2k
views
answered
Sep 17, 2018
Algorithms
gate1989
descriptive
algorithms
recurrence-relation
+
–
1
votes
23
Which Scheduler work while moving a process from Running state to Wait State ?
Which Scheduler work while moving a process from Running state to Wait State ?
Which Scheduler work while moving a process from Running state to Wait State ?
2.3k
views
answered
Sep 1, 2018
Operating System
process-scheduling
operating-system
+
–
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...
124
views
answered
Jul 31, 2018
Others
ugcnetcse-june2008-paper2
+
–
0
votes
25
me test number of tokens
here i got 44(i count &x and *x as one one) tokens but nas is 53 doubt ----> in general we count 1. *x is one token or two? 2. &x is one token? please tell me i m right or wrong . for this q i think & x are two tokens bcs there is space?
here i got 44(i count &x and *x as one one) tokens but nas is 53 doubt in general we count1. *x is one token or two?2. &x is one token? please tell me i m rig...
384
views
answered
Jul 21, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
numerical-answers
made-easy-test-series
+
–
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
795
views
answered
Jul 16, 2018
Algorithms
time-complexity
master-theorem
+
–
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????
2.0k
views
answered
Jul 16, 2018
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
837
views
answered
Jul 16, 2018
Algorithms
master-theorem
algorithms
time-complexity
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register