Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Tauhin Gangwar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Tauhin Gangwar
0
answers
1
push down automata
How many states will the pda for a^n b^n c^m d^m have?? I know it can be drawn using 5 states as given everywhere. But i think it can be drawn using 4 states also. can anyone tell??
commented
in
Theory of Computation
Aug 15, 2020
1.2k
views
3
answers
2
NIELIT 2016 MAR Scientist B - Section B: 16
A box contains $10$ screws, $3$ of which are defective. Two screws are drawn at random with replacement. The probability that none of two screws is defective will be $100\%$ $50\%$ $49\%$ None of these.
answer edited
in
Probability
Jul 21, 2020
659
views
nielit2016mar-scientistb
engineering-mathematics
probability
1
answer
3
Jump instruction
Question Part- I If the program below, the number of times the FIRST and SECOND JNZ instruction cause the control to be transferred to LOOP respectively MVI H,02H MVI L,05H LOOP : DCR L FIRST : JNZ LOOP DCR H SECOND : JNZ LOOP A. 5 and 2 B. 21 and ... the FIRST and SECOND JNZ instruction cause the control to be transferred to LOOP respectively 5 and 2 260 and 1 259 and 1 6 and 1
commented
in
CO and Architecture
Nov 21, 2019
4.3k
views
co-and-architecture
microprogramming
control-unit
3
answers
4
propositional logic
which of the following is tautology? (¬P^(P->q))->¬q ¬(p->q)->¬q [(¬p^q)^[q->(p->q)]]->¬r Both (B) and(C) please explain in detail how to check for especially for condition (C) Because “r” is only in RHS but not in LHS of this implication.
comment edited
in
Mathematical Logic
Jan 30, 2019
640
views
propositional-logic
discrete-mathematics
mathematical-logic
first-order-logic
engineering-mathematics
1
answer
5
geeksquiz
Is this grammar is left factored if yes ??? plz explain how
answer selected
in
Theory of Computation
Jan 17, 2018
353
views
left-factoring
0
answers
6
all npcomplete
2 problems A and B both are known to be NP-COMPLETE ? Is it possible that we can reduce A to B ??
commented
in
Theory of Computation
Dec 14, 2017
281
views
7
answers
7
GATE CSE 2014 Set 2 | Question: 37
Consider two strings $A$="qpqrr" and $B$="pqprqrp". Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ be the number of such longest common subsequences between $A$ and $B$. Then $x +10y=$ ___.
commented
in
Algorithms
Dec 11, 2017
12.9k
views
gatecse-2014-set2
algorithms
normal
numerical-answers
dynamic-programming
7
answers
8
GATE CSE 2006 | Question: 17
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves it in linear time using ... pass of the array solves it using divide and conquer in time $\Theta (n\log n)$ solves it in time $\Theta( n^2)$
commented
in
Algorithms
Dec 8, 2017
13.0k
views
gatecse-2006
algorithms
normal
algorithm-design
2
answers
9
Congest oSlow start
What is the effective throughput for transferring a 1600 KB file when TCP using slow start congestion control technique. Given round trip time 20 ms and Maximum segment size 800 bytes. Assume there are no packet losses, unlimited bandwidth, and receiver window size. Assume slow start begins initially with a congestion window size of 1. Answer given = 8MBPS.
answer selected
in
Computer Networks
Dec 7, 2017
740
views
computer-networks
tcp
congestion-control
1
answer
10
NYU computer science Assignment 9
Consider a system with a virtual address size of 64MB (2^26), a physical memory of size 2GB (2^31), and a page size of 1K (2^10). Under the target workload, 32 processes (2^5) are running; half of the processes are smaller than 8K ... )? What is the size of a single bottom-level page table entry (and why)? Compute the total space overhead for the entire system.
answer edited
in
CO and Architecture
Nov 29, 2017
594
views
co-and-architecture
2
answers
11
Maximum and Minimum number in 16 bit Floating Point
16 bit Floating Point Representation $(-1)^{sign}*(1.M)*2^{Exp - 63}$ Sign = 1 bit Exponent = 7 bit Mantissa = 8 bit 1) Max positive number 2) Min positive number. 3) Max negative number. 4) Min negative number. 5) What is meant by precision.
commented
in
CO and Architecture
Nov 28, 2017
2.8k
views
floating-point-representation
ieee-representation
co-and-architecture
computer
computer-networks
digital-logic
2
answers
12
UGC NET CSE | December 2014 | Part 2 | Question: 09
The range of representable normalized numbers in the floating point binary fractional representation in a $32$-bit word with $1$-bit sign, $8$-bit excess $128$ biased exponent and $23$-bit mantissa is : $2^{-128}$ to $(1-2^{-23}) \times 2^{127}$ ... $2^{23}$ $2^{-129}$ to $(1-2^{-23}) \times 2^{127}$
comment edited
in
Digital Logic
Nov 27, 2017
3.4k
views
ugcnetcse-dec2014-paper2
digital-logic
floating-point-representation
2
answers
13
b tree
what are b trees..explain in simplest way
answer edited
in
Databases
Nov 18, 2017
653
views
1
answer
14
OS-question
if c has value =0 initially ....i am getting MAX=2 and minimum =-2..is it correct??
commented
in
Operating System
Nov 16, 2017
748
views
process-synchronization
3
answers
15
ISRO-2013-9
In an array of $2N$ elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be from its position if the array were 1-ordered? $1$ $2$ $N/2$ $2N - 1$
commented
in
DS
Oct 21, 2017
7.6k
views
isro2013
array
1
answer
16
what is hit ratio?
In a 2 level memory, if the level 1 memory is 5 times faster than level 2 and its access time is 10ns less than avg access time.Let the level 1 memory access time is 20ns. (a.)0.7 (b.)0.75 (c.)0.86 (d.)0.96
commented
in
CO and Architecture
Jul 13, 2017
2.5k
views
2
answers
17
Output of Code
#include <stdio.h> int main() { int a; char *x; x= (char *) &a; a=512; x[0]=1; x[1]=2; printf("%d\n",a); return 0; }
commented
in
Programming
Jun 30, 2017
675
views
programming-in-c
non-gate
1
answer
18
Normalisation
It is said that if a relation is in bcnf then it is also in 3nf. Then why a lossless and non-dependency preserving decomposition qualifies to be in bcnf but not in 3nf. I am not getting it. Please clear my concept.
commented
in
Databases
Jun 9, 2017
531
views
5
answers
19
Number of moves of smallest disc in tower of Hanoi
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16) Answer given: $2^{16}$ = 65536 Please explain
commented
in
DS
Jun 9, 2017
2.8k
views
algorithms
programming
recursion
0
answers
20
michael sipser Chapter 1, 3rd edition, question8 a , regular languages
give the state diagram of NFAs recognizing the union of the following languages a.) {w |w begins with a 1 and ends with a 0 } b.} {w | w contains at least three 1s } This is how i have solved it. is this correct ?
commented
in
Theory of Computation
Jun 6, 2017
444
views
theory-of-computation
finite-automata
1
answer
21
BFS algorithm simple question
BFS algo is applied on graph as well as Binary tree. So, is it different for both graph and Binary tree? As on youtube some people showing BFS on graph and some on Binary tree. Kindly clarify, thanks!
answer selected
in
Algorithms
Jun 6, 2017
773
views
algorithms
breadth-first-search
2
answers
22
Self doubt in Binary search Algo
The average successful search time taken by binary search on a sorted array of $10$ items? $2.6$ $2.7$ $2.8$ $2.9$ Answer is $2.9$ My doubt:- But when I am using $log_2n$ for $n = 10$ it is not equal to $2.9$, and $log_210 = 3.3219$ ?
commented
in
Algorithms
Jun 6, 2017
9.0k
views
algorithms
binary-search
time-complexity
3
answers
23
Self doubt
You are asked to sort 15 randomly generated numbers. One should prefer— (a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sort I think the answer should be c or d crct me???
commented
in
Algorithms
Jun 6, 2017
1.4k
views
algorithms
sorting
merge-sort
heap-sort
11
answers
24
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
commented
in
Databases
Jan 6, 2017
30.7k
views
gatecse-2009
databases
b-tree
normal
3
answers
25
MadeEasy Workbook: CO & Architecture - Pipelining
Below is the screenshot of the question. I found that answer of the Q.10 is 7 and I unable to understand Q.11. Please correct me in Q.10 and Please explain Q.11 meaning and answer.
comment reshown
in
CO and Architecture
Dec 28, 2016
2.9k
views
made-easy-booklet
co-and-architecture
pipelining
5
answers
26
GATE CSE 2007 | Question: 51
Consider the following C program segment: int IsPrime (n) { int i, n; for (i=2; i<=sqrt(n);i++) if(n%i == 0) {printf("Not Prime \n"); return 0;} return 1; } Let $T(n)$ denote number of times the $for$ loop is executed by the program on input $n$. Which of ... $T(n) = O(n) \: \text{ and } T(n) = \Omega(\sqrt{n})$ None of the above
commented
in
Algorithms
Dec 23, 2016
11.3k
views
gatecse-2007
algorithms
time-complexity
normal
2
answers
27
Regular Languages
if this is regular and its Regular expression can be written as [(0+1)*0(0+1)*0]+ [(0+1)*1(0+1)*1] then it will also include those strings where first W2 second W2 are different. I am not getting this somebody please clear this doubt.
commented
in
Theory of Computation
Dec 23, 2016
619
views
1
answer
28
DAG compilers
How to find unnecessary production while optimising DAG. for ex- a = b * c d = b e = d * c b = e f = b + c g = f + d How many production need to be removed and how to find them . ?
commented
in
Compiler Design
Dec 22, 2016
2.0k
views
compiler-design
code-optimization
directed-acyclic-graph
1
answer
29
find the output
# include<stdio.h> int main() { char g1[7] = 4567 , *q; q = g1 + 1; *q = 0'; printf( %s , g1); } --------------------------------------------- i really getting confused.i thought that it will produce error because ... 4067. how will i get to know that it is allowed or not.?because here string is getting modified. is g1[1]='a' allowed here. can someone please clarify this ?
commented
in
Programming
Dec 21, 2016
319
views
programming-in-c
5
answers
30
ISRO2014-55
An IP packet has arrived with the first $8$ bits as $0100 0010.$ Which of the following is correct? The number of hops this packet can travel is $2$ The total number of bytes in header is $16$ bytes The upper layer protocol is ICMP The receiver rejects the packet
commented
in
Computer Networks
Sep 18, 2016
5.9k
views
isro2014
computer-networks
ip-packet
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...