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 Punit Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Punit Sharma
1
vote
1
GATE CSE 2017 Set 2 | Question: 53
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size $32$ bytes. Assume that a direct mapped cache having $512$ cache lines is used with this machine. The size of the tag field in bits is _______
answered
in
CO and Architecture
Dec 16, 2019
7.6k
views
gatecse-2017-set2
co-and-architecture
cache-memory
numerical-answers
3
votes
2
GATE CSE 2010 | Question: 60
The question below consists of a pair of related words followed by four pairs of words. Select the pair that best expresses the relation in the original pair. Unemployed : Worker fallow : land unaware : sleeper wit : jester renovated : house
answered
in
Verbal Aptitude
Dec 2, 2019
3.5k
views
gatecse-2010
verbal-aptitude
word-pairs
normal
0
votes
3
TIFR CSE 2016 | Part B | Question: 1
A Boolean formula is said to be a $tautology$ if it evaluates to TRUE for all assignments to its variables. Which one of the following is NOT a tautology? $(( p \vee q) \wedge (r \vee s)) \Rightarrow (( p \wedge r) \vee q \vee s)$ ... $(( p \vee q ) \wedge ( r \vee s)) \Rightarrow ( p \vee q)$
answered
in
Mathematical Logic
Nov 15, 2018
1.5k
views
tifr2016
mathematical-logic
propositional-logic
4
votes
4
GATE CSE 1995 | Question: 2.5
What values of $A, B, C$ and $D$ satisfy the following simultaneous Boolean equations? $\overline{A} + AB =0, AB=AC, AB+A\overline{C}+CD=\overline{C}D$ $A=1, B=0, C=0, D=1$ $A=1, B=1, C=0, D=0$ $A=1, B=0, C=1, D=1$ $A=1, B=0, C=0, D=0$
answered
in
Digital Logic
Nov 15, 2018
6.5k
views
gate1995
digital-logic
boolean-algebra
easy
0
votes
5
CMI2012-A-10
Consider the following functions $f$ and $g$. f(){ x = x-50; y = y+50; } g( ) { a = a+x; a = a+y; } Suppose we start with initial values of $100$ for $x, 200$ for $y$, and $0$ for $a$, and then execute $f$ and $g$ in parallel - that ... either execute one statement from $f$ or one statement from $g$. Which of the following is not a possible final value of $a$? $300$ $250$ $350$ $200$
answered
in
Operating System
Nov 10, 2018
1.0k
views
cmi2012
operating-system
process-synchronization
2
votes
6
GATE CSE 1998 | Question: 7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$ ... $} \\\hline \end{array}$When will the $20K$ job complete?
answered
in
Operating System
Nov 4, 2018
9.6k
views
gate1998
operating-system
process-scheduling
normal
0
votes
7
GATE CSE 2014 Set 1 | Question: 33
Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using the optimal replacement policy is__________.
answered
in
Operating System
Nov 3, 2018
5.9k
views
gatecse-2014-set1
operating-system
page-replacement
numerical-answers
3
votes
8
GATE CSE 1998 | Question: 2.16
The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run) this program? $\text{12 KB}$ $\text{14 KB}$ $\text{10 KB}$ $\text{8 KB}$
answered
in
Operating System
Nov 3, 2018
6.5k
views
gate1998
operating-system
normal
memory-management
11
votes
9
GATE IT 2008 | Question: 37
Consider the following state diagram and its realization by a JK flip flop The combinational circuit generates J and K in terms of x, y and Q. The Boolean expressions for J and K are : $\overline {x \oplus y}$ and $\overline {x \oplus y}$ $\overline {x \oplus y}$ and $ {x \oplus y}$ $ {x \oplus y}$ and $\overline {x \oplus y}$ $ {x \oplus y}$ and $ {x \oplus y}$
answered
in
Digital Logic
Nov 3, 2018
11.1k
views
gateit-2008
digital-logic
boolean-algebra
normal
digital-counter
7
votes
10
GATE CSE 2012 | Question: 6
The truth table ${\begin{array}{|c|c|c|}\hline \textbf{X}& \textbf{Y}& \textbf{(X,Y)} \\\hline 0& 0& 0 \\ \hline 0& 1&0\\ \hline 1& 0& 1 \\\hline 1& 1& 1 \\\hline \end{array}}$ represents the Boolean function $X$ $X + Y$ $X \oplus Y$ $Y$
answered
in
Digital Logic
Nov 3, 2018
3.4k
views
gatecse-2012
digital-logic
easy
boolean-algebra
0
votes
11
MadeEasy Test Series 2018: Programming & DS - Arrays
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10, The location of A [20] [20] [30] is ________. (Assume the first element is stored at A[1][1][1] and each element take 1 memory location)
answered
in
Programming
Nov 3, 2018
643
views
made-easy-test-series
3-dimensional-array
array
data-structures
0
votes
12
GATE CSE 1995 | Question: 1.8
Which of the following page replacement algorithms suffers from Belady’s anamoly? Optimal replacement LRU FIFO Both (A) and (C)
answered
in
Operating System
Oct 29, 2018
4.2k
views
gate1995
operating-system
page-replacement
normal
2
votes
13
GATE IT 2008 | Question: 44
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation $T(n) = √(2) T(n/2) + √n$, $T(1) = 1$ evaluates to : $√(n) (\log n + 1)$ $√(n) \log n$ $√(n) \log √(n)$ $n \log √n$
answered
in
Algorithms
Oct 27, 2018
13.1k
views
gateit-2008
algorithms
recurrence-relation
normal
0
votes
14
GATE CSE 2001 | Question: 2.25
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which ... (z,w) with z > x is deleted A tuple (z,w) with w < x is deleted The deletion of (x,y) is prohibited
answered
in
Databases
Oct 26, 2018
8.0k
views
gatecse-2001
databases
sql
normal
0
votes
15
GATE CSE 2007 | Question: 44
In the following C function, let $n \geq m$. int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? $\Theta(\log_2n)$ $\Omega(n)$ $\Theta(\log_2\log_2n)$ $\Theta(\sqrt{n})$
answered
in
Algorithms
Aug 18, 2018
21.6k
views
gatecse-2007
algorithms
recursion
time-complexity
normal
1
vote
16
GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$
answered
in
DS
Mar 19, 2018
22.2k
views
gatecse-2003
data-structures
stack
normal
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
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
It's not a standard resource, don't follow them.
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Diagonalization of a MatrixIf there is an...