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 Aegon
1
answer
1
IIT Kanpur admission
What was the last rank in the waitlist group which got admission offer from IIT Kanpur last year? Is there any chance for waitlist rank of around 20?
What was the last rank in the waitlist group which got admission offer from IIT Kanpur last year?Is there any chance for waitlist rank of around 20?
1.2k
views
commented
May 25, 2018
Written Exam
iit-kanpur
admissions
+
–
1
answer
2
IIT Admission Query
IIT Kanpur vs IIT Madras Which one should I choose? Please give me some advice
IIT Kanpur vs IIT MadrasWhich one should I choose? Please give me some advice
993
views
commented
May 24, 2018
IISc/IITs
iit-kanpur
gate2018-admissions
admissions
iit-madras
+
–
1
answer
3
IIT Kanpur
1. Suppose X is a uniform random variable between 0.50 and 1.00. What is the probability that a randomly selected value of X is between 0.55 and 0.60 or between 0.75 and 0.85? A. 0.00 B. 0.15 C. 0.60 D. 0.30
1. Suppose X is a uniform random variable between 0.50 and 1.00. What is the probability that a randomly selected value of X is between 0.55 and 0.60 or between 0.75 and ...
406
views
commented
Apr 13, 2018
0
answers
4
IITH machine learning
Recently, IITH has introduced machine learning as a choice beside general CS. As its newly introduced is it better to give it a first priority than General CS if someone is interested in machine learning? Any comments on this would be appreciated.
Recently, IITH has introduced machine learning as a choice beside general CS. As its newly introduced is it better to give it a first priority than General CS if someone...
844
views
asked
Apr 9, 2018
IISc/IITs
machine-learning
admissions
general
+
–
0
answers
5
Admission Query
Hi, I am 2016 B.Tech pass out.I currently do not have my degree certificate(I will take it from the university in some days). Is it alright to upload my provisional degree certificate in online pg admission forms?
Hi,I am 2016 B.Tech pass out.I currently do not have my degree certificate(I will take it from the university in some days). Is it alright to upload my provisional degree...
283
views
asked
Apr 1, 2018
IISc/IITs
gate2018-admissions
+
–
1
answer
6
IIT ROORKEE
Which marksheet to upload for maths in UG ? I had maths in 3 semesters .
Which marksheet to upload for maths in UG ? I had maths in 3 semesters .
1.4k
views
commented
Mar 26, 2018
1
answer
7
COAP Process for Admission
Hi GO Team, I wanted to know about the COAP process. It would be great if someone can provide the URL, and the procedure. I am not able to fully understand the admission procedure like I understood that we have to apply to different IITs and also ... and interviews will be based on different IITs. It would be great if someone can put some light on this, thanks in advance.
Hi GO Team, I wanted to know about the COAP process.It would be great if someone can provide the URL, and the procedure.I am not able to fully understand the admission pr...
787
views
commented
Mar 23, 2018
Written Exam
gate2018-admissions
+
–
1
answer
8
TOC- regular languages
Let the homomorphism defined over alphabet Σ{0, 1} is h(0) = aa and h(1) = aba, and L = (ab + ba)*a then what is h-1(L)?
Let the homomorphism defined over alphabet Σ{0, 1} is h(0) = aa and h(1) = aba, and L = (ab + ba)*athen what is h-1(L)?
428
views
answer selected
Mar 20, 2018
Theory of Computation
theory-of-computation
+
–
1
answer
9
Suggestion
I am getting 32 marks (sc category) can I get top nit or other nit?
I am getting 32 marks (sc category) can I get top nit or other nit?
401
views
commented
Mar 20, 2018
NITs
gate2018-admissions
mtech
+
–
0
answers
10
ccombination
An entrepreneur needs to assign 5 different tasks to three of his employees. If every employee is assigned atleast 1 task, how many ways can the entrepreneur assign those tasks to his employees? explain in detail....
An entrepreneur needs to assign 5 different tasks to three of his employees. If every employee is assigned atleast 1 task, how many ways can the entrepreneur assign those...
407
views
commented
Jan 14, 2018
Mathematical Logic
discrete-mathematics
combinatory
+
–
7
answers
11
GATE CSE 2005 | Question: 43
Let $f: B \to C$ and $g: A \to B$ be two functions and let $h = f o g$. Given that $h$ is an onto function which one of the following is TRUE? $f$ and $g$ should both be onto functions $f$ should be onto but $g$ need not to be onto $g$ should be onto but $f$ need not be onto both $f$ and $g$ need not be onto
Let $f: B \to C$ and $g: A \to B$ be two functions and let $h = f o g$. Given that $h$ is an onto function which one of the following is TRUE?$f$ and $g$ should both be o...
10.0k
views
commented
Oct 9, 2017
Set Theory & Algebra
gatecse-2005
set-theory&algebra
functions
normal
+
–
6
answers
12
GATE CSE 1997 | Question: 3.1
Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statements is true for $\left(Z, *\right)$? $\left(Z, *\right)$ is a monoid $\left(Z, *\right)$ is an Abelian group $\left(Z, *\right)$ is a group None of the above
Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statement...
13.6k
views
commented
Oct 5, 2017
Set Theory & Algebra
gate1997
set-theory&algebra
group-theory
normal
+
–
6
answers
13
GATE CSE 2014 Set 1 | Question: 9
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in ... to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ ins...
18.4k
views
commented
Feb 7, 2017
CO and Architecture
gatecse-2014-set1
co-and-architecture
machine-instruction
instruction-format
numerical-answers
normal
+
–
4
answers
14
GB Mock 2
943
views
answered
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
+
–
5
answers
15
GATE IT 2007 | Question: 44, ISRO2015-34
A hard disk system has the following parameters : Number of tracks $= 500$ Number of sectors/track $= 100$ Number of bytes /sector $= 500$ Time taken by the head to move from one track to adjacent track $= 1 \ ms$ Rotation speed $= 600 \ rpm$. What is ... time taken for transferring $250$ bytes from the disk ? $300.5 \ ms$ $255.5 \ ms$ $255 \ ms$ $300 \ ms$
A hard disk system has the following parameters :Number of tracks $= 500$Number of sectors/track $= 100$Number of bytes /sector $= 500$Time taken by the head to move from...
23.0k
views
commented
Feb 7, 2017
Operating System
gateit-2007
operating-system
disk
normal
isro2015
+
–
1
answer
16
Automata Theory by HMU
Is L(G) finite, for a given CFG G. Is decidable or undecidable?
Is L(G) finite, for a given CFG G.Is decidable or undecidable?
319
views
asked
Feb 6, 2017
2
answers
17
After 3-clock pulses , what is the content of shift Register
I could not understand here both the outputs point to D3 bit . How to proceed in this scenario ?
I could not understand here both the outputs point to D3 bit . How to proceed in this scenario ?
1.2k
views
commented
Feb 3, 2017
Digital Logic
digital-logic
+
–
2
answers
18
BCNF Decomposition
2.7k
views
answered
Jan 28, 2017
Databases
database-normalization
databases
bcnf-decomposition
+
–
2
answers
19
Compiler Design, Number Of Tokens
The number of tokens in following program? # define M 100 int main ( ) { // declare variables int n = 2020; return n % M; } Your Answer:19 Correct Answer: 16 Status: incorrect
The number of tokens in following program?# define M 100 int main ( ) { // declare variables int n = 2020; return n % M; }Your Answer:19Correct Answer: 16 Status: inco...
5.0k
views
answered
Jan 20, 2017
Compiler Design
compiler-design
compiler-tokenization
+
–
2
answers
20
Gate-2006, CE
There are 25 calculators in a box. Two of them are defective. Suppose 5 calculators are randomly picked for inspection (i.e., each has the same chance of being selected), what is the probability that only one of the defective calculators will be included in the inspection? can we do it by both hypergeometric as well as by binomial distribution?
There are 25 calculators in a box. Two of them are defective. Suppose 5 calculators are randomly picked for inspection (i.e., each has the same chance of being selected),...
3.0k
views
commented
Jan 17, 2017
Probability
usergate2006-ce
probability
engineering-mathematics
usermod
+
–
5
answers
21
Doubt regarding closures
Are (bx)* b and b(xb)* equivalent?
Are (bx)* b and b(xb)* equivalent?
832
views
asked
Jan 17, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
22
Packet switching
Q 30). Consider a route in a store and forward networking going through $9$ intermediate nodes.The packet contains $1100$ bits and are transmitted at $64 \ Kpbs $ . Assume propogation delay over the links are negligible.As packet travels along the route, it ... for the packets to get to the receiver if the nodes transmit on a " first come first served" basis (in ms) ?
Q 30). Consider a route in a store and forward networking going through $9$ intermediate nodes.The packet contains $1100$ bits and are transmitted at $64 \ Kpbs $ . Assu...
2.9k
views
commented
Jan 10, 2017
Computer Networks
network-switching
+
–
0
answers
23
Madeeasy test series
Which of the following statement is correct? a. while a process is blocked on a semaphore's queue. it can be called as busy waiting. b. Circular waiting is a necessary condition for deadlock, but not a sufficient condition. C Mutual ... fregmentation can occure in disk system which does not employ condition for deadlock, but not a sufficient condition. answer with example.
Which of the following statement is correct?a. while a process is blocked on a semaphore's queue. it can be called as busy waiting.b. Circular waiting is a necessary cond...
444
views
commented
Jan 5, 2017
1
answer
24
C Language
How to store ASCII value of a characters in c? Example: main() { char CH='A'; printf("%d",CH ); return 0; } I want to store this o/p in a variable.
How to store ASCII value of a characters in c?Example:main(){char CH='A';printf("%d",CH );return 0;}I want to store this o/p in a variable.
249
views
answered
Jan 4, 2017
1
answer
25
coalescing
198
views
answered
Jan 2, 2017
3
answers
26
GATE CSE 2005 | Question: 85-b
Consider the following floating-point format. Mantissa is a pure fraction in sign-magnitude form. The normalized representation for the above format is specified as follows. The mantissa has an implicit $1$ preceding the binary (radix) point. Assume that only $0's$ are padded in while ... above number $(0.239 \times 2^{13})$ is: $0A\;20$ $11\;34$ $49\;D0$ $4A\;E8$
Consider the following floating-point format. Mantissa is a pure fraction in sign-magnitude form.The normalized representation for the above format is specified as follow...
8.7k
views
commented
Dec 31, 2016
Digital Logic
gatecse-2005
digital-logic
number-representation
floating-point-representation
normal
+
–
2
answers
27
Implicants and prime implicants
For F(x,y,z)=$\sum (1,3,4,5)$ , what is the number of implicants and prime implicants?
For F(x,y,z)=$\sum (1,3,4,5)$ , what is the number of implicants and prime implicants?
1.1k
views
commented
Dec 26, 2016
Digital Logic
digital-logic
k-map
prime-implicants
+
–
3
answers
28
GATE CSE 2007 | Question: 49
Let $w$ be the minimum weight among all edge weights in an undirected connected graph. Let $e$ be a specific edge of weight $w$. Which of the following is FALSE? There is a minimum spanning tree containing $e$ If $e$ is not in a minimum ... edges have the same weight. Every minimum spanning tree has an edge of weight $w$ $e$ is present in every minimum spanning tree
Let $w$ be the minimum weight among all edge weights in an undirected connected graph. Let $e$ be a specific edge of weight $w$. Which of the following is FALSE?There is ...
12.0k
views
commented
Dec 24, 2016
Algorithms
gatecse-2007
algorithms
spanning-tree
normal
+
–
2
answers
29
Maximum depth of recursion tree
Given answer: C Please explain
Given answer: CPlease explain
502
views
commented
Dec 24, 2016
Algorithms
algorithms
time-complexity
test-series
+
–
1
answer
30
Matrix Multiplication
Matrix multiplication is associative and matrix chain multiplication uses following matrices A1 is 30×35 A2 is 35×15 A3 is 15×5 A4 is 5×10 A5 is 10×20 A6 is 20×25 Find the minimum number of multiplications required to compute A1 A2 A3 A4A5A6
Matrix multiplication is associative and matrix chain multiplication uses following matricesA1 is 30×35A2 is 35×15A3 is 15×5A4 is 5×10A5 is 10×20A6 is 20×25Find the...
1.6k
views
commented
Dec 21, 2016
Algorithms
algorithms
matrix-chain-ordering
dynamic-programming
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register