Answers by Rudr Pawan
Register

Answers by Rudr Pawan

Answers by Rudr Pawan
Filter
0 votes
52 views
GATE2016-2-32
I got this question by assuming the size of the block as $2^x$ and then solving, but in the comments here(https://gateoverflow.in/39622/gate2016-2-32), someone mentioned it can be solved by assuming byte-addressable memory. My question is after taking the ... ? Because as far as I know byte addressable means the lowest addressable unit is 1 byte, it says nothing about the block size?
answered in CO & Architecture Nov 4, 2020
52 views
0 votes
367 views
MADE EASY TS
A function f(x,y,z) = x XNOR y XNOR z = 1, then which of the following is always true? x + yz =1 x not equal to (y XOR z) x.y.z =1 x = y XNOR z I’m getting both option b and option d.
answered in Digital Logic Jun 8, 2020
367 views
0 votes
39 views
self doubt on c compiler
int a,b; a=b=1; a= a++ + ++b; b=b++ + ++a; printf("%d,%d",a,b); my ouptput is 5,8… What am i doing wrong??
answered in Programming Apr 12, 2020
39 views
0 votes
46 views
What happens if we are inconsistent while creating Huffman Tree ? (Self Doubt)
answered in Algorithms Apr 10, 2020
46 views
1 vote
562 views
NIELIT-SA-2017-64
If a processor has 32-bit virtual address, 28-bit physical address, 2KB pages. How many bits are required for the virtual, physical page number? 17, 21 21, 17 6, 10 None
answered in CO & Architecture Apr 10, 2020
562 views
2 votes
143 views
Count the tokens
Tell me the answer and number of tokens in the following statement is:- b -= a;
answered in Compiler Design Jan 17, 2020
143 views
1 vote
373 views
gatebook test
A RISC processor has 208 registers, 16 register windows. Each window has 4 inputs, 8 local and 4 output registers. The total number of global registers are ?
answered in CO & Architecture Nov 24, 2019
373 views
0 votes
82 views
Ace academy doubt toc
answered in Theory of Computation Nov 20, 2019
82 views
0 votes
84 views
TOC questions
Give brief ans
answered in Theory of Computation Nov 14, 2019
84 views
0 votes
644 views
GATE FORUM: 2020
Assume a system with 2-levels of paging with the main memory access time of 100ns, and the cache lookup time of 50ns. Assuming a cache hit rate of 90% and if the cache lookup and memory access are assumed to be parallel, what is the average memory access time? ( ... location from main memory? (in nanoseconds) 1. 55 2. 60 3. 180 4. 57 How 2 questions differ and how to approach them?
answered in Operating System Nov 3, 2019
644 views
1 vote
116 views
GATE FORUM: DIGITAL LOGIC
Ans should be $10$ right?
answered in Digital Logic Nov 3, 2019
116 views
0 votes
52 views
#Madeeasy_Algorithms#GATE 2020
answered in Algorithms Nov 3, 2019
52 views
0 votes
30 views
GATE GURU 2020
answered in Digital Logic Nov 3, 2019
30 views
0 votes
37 views
Geeks for geeks DBMS mock
Which protocol is satisfied by following transaction: LOCK – X(A) LOCK – S(B) R(A) R(B) W(A) UNLOCK(A) COMMIT UNLOCK(B) 1. Strict 2PL 2. Rigorous 2PL 3. Conservative 2PL 4. None of the above If i write my doubt , then that will be same as answering the question itself, someone willing to help please comment and I will reply with my doubt
answered in Databases Oct 31, 2019
37 views
1 vote
139 views
Ace Academy Question
Let A and B are two independent events such that P(A)=P(B) and P(A U B)=0.5 then P(A)=?
answered in Probability Oct 23, 2019
139 views
1 vote
63 views
testbook test
We consider the cardinality of an entity at opposite end ,then why it is wrong?
answered in Databases Oct 15, 2019
63 views
1 vote
56 views
#Self Doubt Huffman Coding!
Hello all, I've this trivial doubt in Huffman coding algorithms questions - Mostly there's a question of type - What is the min expected length of the message? Now my doubt is in some questions - after finding expected length of message = no of bits ... t figure out in which case one has to divide and in which case not to divide with total number of characters? Thank you
answered in Algorithms Oct 14, 2019
56 views
0 votes
64 views
MADE EASY FULL LENGTH: DBMS
How can the ans be C? See that here we are applying the inner condition on Adoption table which have different entries, on the other hand the outer query which checks for NOT exists works on ANIMAL table which has different attributes.. So ans should be d right?
answered in Databases Oct 14, 2019
64 views
0 votes
60 views
Algorithm ACE Test Series Test 29 on Recurrence relation
answered in Algorithms Oct 12, 2019
60 views
1 vote
78 views
Difference between logarithmic notations
Can any one please tell what is difference between (log^2)n ,(logn)^2 and loglogn? Are these equal?
answered in Algorithms Oct 12, 2019
78 views
0 votes
95 views
ACE Test Series Asymptotic notation
answered in Algorithms Oct 11, 2019
95 views
2 votes
57 views
Self Doubt Mtech Assignments.
which of the following sequences is serializable. a) $S_a=R_1(x)R_2(x)W_1(x)R_3(x)R_4(x)W_3(x)$ b) $S_b = R_1(x)W_1(x)R_2(x)W_2(x)W_3(x)W_4(x)R_5(x)$ c) $S_c=R_1(x)W_1(x)W_2(x)R_2(x)$
answered in Databases Oct 10, 2019
57 views
2 votes
49 views
Algorithm-self doubt(recurrence)
How to solve recurrence relation $T(n)=O(n)+2T(4n/5)$ Thank-you
answered in Algorithms Oct 9, 2019
49 views
1 vote
40 views
self doubt- proper containment and containment of relation in discrete maths
answered in Set Theory & Algebra Sep 30, 2019
40 views
1 vote
225 views
Self doubt-Relations
True or false? Number of relations which is both symmetric and asymmetric = 1 Number of relations which is both symmetric and anti-asymmetric = $2^{n}$ Number of relations which is both reflexive and anti-asymmetric = $3^{(n^{2}-n)/2}$ Number of relations ... is both reflexive and asymmetric =0 Number of relations which is both asymmetric and anti-asymmetric = $3^{(n^{2}-n)/2}$
answered in Set Theory & Algebra Sep 28, 2019
225 views
0 votes
225 views
Doubt lower and upper bound hasse diagram Rosen book Discrete mathematics
answered in Mathematical Logic Sep 28, 2019
225 views
0 votes
46 views
Increment decrement
answered in Programming Sep 27, 2019
46 views
0 votes
190 views
Self doubt - GATE 2019 Question on cache memory
A certain processor uses a fully associative cache of size 16 kB, The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields ... 1 byte thus making it like 16 words per block where 1 word = 1 byte (byte addressable ). Am I correct?
answered in CO & Architecture Sep 8, 2019
190 views
1 vote
78 views
Round trip time and wrap around time
Is round trip time same as wrap around time in TCP ?
answered in Computer Networks Sep 8, 2019
78 views
1 vote
173 views
Self Doubt: TCP/IP
What is the minimum and maximum number of packets required to be exchanged for connection establishment, data transfer and connection termination in a TCP 3 way handshake?
answered in Computer Networks Aug 26, 2019
173 views
1 vote
129 views
Foreign key - Self Doubt
When it comes to inserting something in a foreign key table, we cant put null values. But when it comes to deleting something from referenced table, we can perform ON DELETE SET NULL operation and make the foreign key value in a particular tuple as NULL. So, a foreign key can’t remain null while inserting but it can be null while deletion. Is my approach correct ?
answered in Databases Aug 23, 2019
129 views
0 votes
48 views
what will be the output
void recursion(int n) { if(n > 0) { recursion(n-2); printf("%d ", n); recursion(n - 2); } } int main() { recursion(6); return 0; }
answered in Programming Aug 18, 2019
48 views
0 votes
65 views
Is Preorder is same as depth first search ?
answered in Programming Aug 17, 2019
65 views
0 votes
125 views
TSPGECET-2019-CSE-13
Depth first search is equivalent to which of the following traversal in Binary trees Pre – Order traversal Level Order traversal In – Order traversal Post – Order traversal
answered in Others Aug 15, 2019
125 views
0 votes
55 views
TSPGECET-2019-CSE-14
Which of the following pairs of traversals help in identifying a labelled binary tree uniquely? preorder and postorder inorder and postorder preorder and inorder level order and postorder
answered in Others Aug 15, 2019
55 views
1 vote
56 views
TSPGECET-2019-CSE-24
A Priority - Queue initially has $5$ elements and is implemented as a Max Heap. The level - order traversal of the heap is: $11, 9, 6, 4, 3.$ Two new elements $2$ and $8$ ... $11, 9, 8, 6, 4, 3, 2$ $11, 9, 8, 3, 4, 2, 6$ $11, 9, 8, 2, 3, 4, 6$
answered in Others Aug 15, 2019
56 views
1 vote
439 views
number system
the value of X,Y,if$(X567)_{8}+(2YX5){_{8}}$ = $(71YX){8}$
answered in Digital Logic Aug 10, 2019
439 views
1 vote
51 views
MST of that graph always contains edges with first minimum and second minimum weight. State true/false.
answered in Algorithms Aug 10, 2019
51 views
1 vote
40 views
Made easy toc workbook
answered in Theory of Computation Aug 10, 2019
40 views
0 votes
68 views
Theory of computation dcfg
Is L(G1)=L(G2) for dcfg is decidable or undecidable? If yes so how?
answered in GATE Aug 3, 2019
68 views
Page:
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun