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 pC
8
votes
1
GATE CSE 2016 Set 1 | Question: 23
A database of research articles in a journal uses the following schema. $\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$ The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$ and the following functional dependencies exist in the ... database satisfies, but the old one does not? $\text{1NF}$ $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$
A database of research articles in a journal uses the following schema.$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$The primary key is '$\text{(VOLUME...
16.6k
views
answered
Aug 6, 2018
Databases
gatecse-2016-set1
databases
database-normalization
normal
+
–
0
votes
2
Is the college predictor for 2018 open?
Is the college predictor for 2018 open?
Is the college predictor for 2018 open?
6.1k
views
answered
Feb 16, 2018
0
votes
3
BARC2017
SYN packet is sent through options 1)Bind 2)Socket 3)Listen
SYN packet is sent throughoptions1)Bind2)Socket3)Listen
261
views
answered
Mar 23, 2017
29
votes
4
GATE2016 EC-2: GA-9
$M$ and $N$ start from the same location. $M$ travels $10$ km East and then $10$ km North-East. $N$ travels $5$ km South and then $4$ km South-East. What is the shortest distance (in km) between $M$ and $N$ at the end of their travel? $18.60$ $22.50$ $20.61$ $25.00$
$M$ and $N$ start from the same location. $M$ travels $10$ km East and then $10$ km North-East. $N$ travels $5$ km South and then $4$ km South-East. What is the shortest ...
6.0k
views
answered
Jan 31, 2017
Analytical Aptitude
gate2016-ec-2
direction-sense
analytical-aptitude
+
–
20
votes
5
Operand forwarding in pipeline
A $5$ stage pipelined processor has the following stages: $IF$ : instruction fetch $ID$ : instruction decode $EX$ : execute $MA$ : memory access $WB$ ... No. of cycles needed to execute these instructions using operand forwarding?
A $5$ stage pipelined processor has the following stages:$IF$ : instruction fetch$ID$ : instruction decode$EX$ : execute$MA$ : memory access$WB$ : write back$$\large\colo...
21.0k
views
answered
Jan 25, 2017
CO and Architecture
pipelining
co-and-architecture
operand-forwarding
+
–
6
votes
6
Discussions on Floating Point Represenation
Question 1 Explain What is Denormalized Number Give Example Give Representation in IEEE 754 and excess 64 (if any) Question 2 How to Convert $(12.625)_10$ $(12.625)_10 \Leftrightarrow (1100.101)_2$ to IEEE ... Precision (With Normalization) IEEE 754 Single Precision (Without Normalization) Excess-64 (With Normalization) Excess-64 (Without Normalization)
Question 1 Explain What is Denormalized NumberGive ExampleGive Representation in IEEE 754 and excess 64 (if any)Question 2 How to Convert $(12.625)_10$$(12.625)_10 \Left...
2.8k
views
answered
Jan 25, 2017
CO and Architecture
floating-point-representation
ieee-representation
co-and-architecture
number-representation
+
–
4
votes
7
MadeEasy CBT 2017: Digital Logic - Ieee Representation
1.0k
views
answered
Jan 23, 2017
Digital Logic
made-easy-test-series
cbt-2017
co-and-architecture
ieee-representation
+
–
3
votes
8
MadeEasy CBT 2017: Digital Logic - Digital Counter
Identify the mod value of the given riple counter 5 6 7 8
Identify the mod value of the given riple counter5678
2.8k
views
answered
Jan 23, 2017
Digital Logic
made-easy-test-series
cbt-2017
digital-logic
ripple-counter-operation
+
–
123
votes
9
GATE CSE 2001 | Question: 2.8
Consider the following circuit with initial state $Q_0 = Q_1 = 0$. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times $0.$ Consider the following timing diagrams of X and C. The clock period of $C \geq 40$ nanosecond. Which one is the correct plot of Y?
Consider the following circuit with initial state $Q_0 = Q_1 = 0$. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times $0.$Co...
21.5k
views
answered
Jan 17, 2017
Digital Logic
gatecse-2001
digital-logic
circuit-output
normal
+
–
33
votes
10
GATE CSE 2004 | Question: 61
Consider the partial implementation of a $2-bit$ counter using $T$ flip-flops following the sequence $0-2-3-1-0,$ as shown below. To complete the circuit, the input $X$ should be $Q_2^c$ $Q_2 + Q_1$ $\left(Q_1 + Q_2\right)^c$ $Q_1 \oplus Q_2$
Consider the partial implementation of a $2-bit$ counter using $T$ flip-flops following the sequence $0-2-3-1-0,$ as shown below.To complete the circuit, the input $X$ sh...
19.4k
views
answered
Jan 16, 2017
Digital Logic
gatecse-2004
digital-logic
circuit-output
normal
+
–
39
votes
11
GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasin...
21.2k
views
answered
Jan 15, 2017
Databases
gatecse-2006
databases
sql
normal
+
–
1
votes
12
database explain
366
views
answered
Jan 14, 2017
Databases
databases
bad-question
+
–
8
votes
13
C programming
int i=0; char *a = "abcde\0efgh"; while(a[++i]) printf("%d",*++a - 'a'); the output of the above c code segment?
int i=0; char *a = "abcde\0efgh"; while(a[++i]) printf("%d",*++a - 'a');the output of the above c code segment?
1.1k
views
answered
Jan 10, 2017
Programming in C
programming-in-c
output
pointers
+
–
5
votes
14
How to convert a Decimal Number to IEEE754 Representation ?
How to represnet 1.1 using IEEE 754 Single Precision and Double Precision Number Representation . Please explain in detail
How to represnet 1.1 using IEEE 754 Single Precision and Double Precision Number Representation . Please explain in detail
1.9k
views
answered
Jan 9, 2017
CO and Architecture
floating-point-representation
ieee-representation
+
–
4
votes
15
Minimum and Maximum number of Tuples in the Following Relations
Given R with n tuples S with m tuples n<m then How many minimum and maximum tuples in follwing relations . Please Justify with Reason / Examples R-S S-R R Left Join S R Natural Join S R/S S/R
Given R with n tuples S with m tuples n<m then How many minimum and maximum tuples in follwing relations . Please Justify with Reason / ExamplesR-SS-RR Left Join SR Nat...
9.6k
views
answered
Jan 7, 2017
Databases
databases
+
–
64
votes
16
GATE IT 2005 | Question: 34
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the greatest common divisor of $m$ and $n$. $p(q - 1)$ $pq$ $\left ( p^{2}-1 \right ) (q - 1)$ $p(p - 1) (q - 1)$
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the great...
8.2k
views
answered
Jan 5, 2017
Set Theory & Algebra
gateit-2005
set-theory&algebra
normal
number-theory
+
–
30
votes
17
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...
42.8k
views
answered
Jan 4, 2017
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
4
votes
18
DFS using Stack
Could someone please explain Depth first Search using Stack? I have found different algorithms for handling the visited flag and the way the nodes are pushed. I am having problems in solving these types of questions - Find the nodes or number of nodes that are pushed onto stack more than once? Could someone please help with a small example?
Could someone please explain Depth first Search using Stack? I have found different algorithms for handling the visited flag and the way the nodes are pushed. I am havi...
2.7k
views
answered
Jan 1, 2017
DS
data-structures
stack
descriptive
+
–
2
votes
19
Pipeline GATE2009-28
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 I1 S1 S1 S2 S3 S4 I2 S1 S2 S2 S2 S3 S3 S4 S4 I3 S1 S1 X S2 X S3 X S4 S4 S4 I4 S1 X S2 S2 S3 S3 X S4 S4 I1 S1 S1 S2 X X S3 X S4 I2 S1 X X S2 S2 ... I4 S1 X S2 S2 S3 S3 X S4 S4 Given ans is 23 and my ans 25.Where i'm going wrong? It is also gate previous year question :https://gateoverflow.in/1314/gate2009-28
12345678910111213141516171819202122232425I1S1S1S2S3S4 I2 S1S2S2S2S3S3S4S4 I3 S1S1XS2XS3XS4S4S4 I4 S1XS2S2S3S3XS4S4 ...
2.0k
views
answered
Dec 31, 2016
CO and Architecture
pipelining
co-and-architecture
virtual-gate
+
–
31
votes
20
GATE CSE 2007 | Question: 50
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2n-c$ comparisons, for ... $c$ are needed. At most $1.5n-2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is T...
29.6k
views
answered
Dec 30, 2016
Algorithms
gatecse-2007
algorithms
time-complexity
easy
+
–
34
votes
21
GATE CSE 1996 | Question: 2.12
The recurrence relation $T(1) = 2$ $T(n) = 3T (\frac{n}{4}) +n$ has the solution $T(n)$ equal to $O(n)$ $O (\log n)$ $O\left(n^\frac{3}{4}\right)$ None of the above
The recurrence relation$T(1) = 2$$T(n) = 3T (\frac{n}{4}) +n$has the solution $T(n)$ equal to$O(n)$$O (\log n)$$O\left(n^\frac{3}{4}\right)$ None of the above
7.3k
views
answered
Dec 30, 2016
Algorithms
gate1996
algorithms
recurrence-relation
normal
+
–
0
votes
22
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...
24.3k
views
answered
Dec 26, 2016
Algorithms
gatecse-2003
algorithms
time-complexity
normal
+
–
1
votes
23
Big o Time complexity
What will be upper bound for following function? T(n)=n^2 - n^4 a) O(n^2) b) O(n^3) c) O(n^4) d) None of these I want to understand how the function looks like if it has recurrance of this form?What is meaning of subtraction here if i talk in terms of programming
What will be upper bound for following function?T(n)=n^2 - n^4a) O(n^2)b) O(n^3)c) O(n^4)d) None of theseI want to understand how the function looks like if it has recurr...
736
views
answered
Dec 19, 2016
Algorithms
algorithms
asymptotic-notation
time-complexity
programming-in-c
+
–
6
votes
24
Time complexity and output
#include <stdio.h> #define N 3 int main() { int array[N] = {1,2,3}; int i,j; for ( i=1; i<(1<<N); i++) { for( j=0; j<N; j++) { if((1<<j)&i) { printf("%d", array[j]); } } printf("\n"); } return 0 ... $N = n \;\; , n \; \text{ is a positive integer }$ ? B. What is the output? C. What will be the complexity when $N$ is large.
#include <stdio.h #define N 3 int main() { int array[N] = {1,2,3}; int i,j; for ( i=1; i<(1<<N); i++) { for( j=0; j<N; j++) { if((1<<j)&i) { printf("%d", array[j]); } } p...
1.8k
views
answered
Dec 17, 2016
Programming in C
time-complexity
bitwise
programming-in-c
combinatory
summation
sub-set
binomial-theorem
+
–
0
votes
25
theory of computation
State entry problem is undecidable or partially decidable?
State entry problem is undecidable or partially decidable?
299
views
answered
Dec 15, 2016
Theory of Computation
theory-of-computation
+
–
1
votes
26
SPACE COMPLEXITY
1.1k
views
answered
Dec 15, 2016
Algorithms
space-complexity
sorting
ace-test-series
+
–
Page:
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register