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 kenzou
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by kenzou
3
answers
1
GATE CSE 1999 | Question: 2.10
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and non-privileged) Demand paging
answer edited
in
Operating System
Dec 2, 2018
12.7k
views
gate1999
operating-system
normal
virtual-memory
1
answer
2
GATE CSE 1990 | Question: 1-v
Under paged memory management scheme, simple lock and key memory protection arrangement may still be required if the _________ processors do not have address mapping hardware.
answer edited
in
Operating System
Dec 2, 2018
5.8k
views
gate1990
operating-system
virtual-memory
fill-in-the-blanks
7
answers
3
GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
edited
in
Operating System
Nov 29, 2018
47.6k
views
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
1
answer
4
GATE CSE 1996 | Question: 1.19, ISRO2008-61
A critical section is a program segment which should run in a certain amount of time which avoids deadlocks where shared resources are accessed which must be enclosed by a pair of semaphore operations, $P$ and $V$
edited
in
Operating System
Nov 21, 2018
5.6k
views
gate1996
operating-system
process-synchronization
easy
isro2008
5
answers
5
GATE CSE 2003 | Question: 9
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$? $11100111$ $11100100$ $11010111$ $11011011$
answer edited
in
Digital Logic
Nov 8, 2018
10.3k
views
gatecse-2003
digital-logic
number-representation
normal
4
answers
6
GATE CSE 2002 | Question: 1.16
Sign extension is a step in floating point multiplication signed $16$ bit integer addition arithmetic left shift converting a signed integer from one size to another
answer edited
in
Digital Logic
Nov 8, 2018
6.6k
views
gatecse-2002
digital-logic
easy
number-representation
2
answers
7
GATE CSE 2011 | Question: 13
Which one of the following circuits is NOT equivalent to a $2$-input $XNOR$ (exclusive $NOR$) gate?
answer edited
in
Digital Logic
Nov 5, 2018
5.6k
views
gatecse-2011
digital-logic
normal
digital-circuits
1
answer
8
GATE IT 2008 | Question: 7
The following bit pattern represents a floating point number in IEEE $754$ single precision format $1 \ 10000011 \ 101000000000000000000000$ The value of the number in decimal form is $-10$ $-13$ $-26$ None of the above
edited
in
Digital Logic
Nov 5, 2018
8.6k
views
gateit-2008
digital-logic
number-representation
floating-point-representation
ieee-representation
normal
5
answers
9
GATE CSE 1999 | Question: 2.9
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function? XOR gates, NOT gates $2$ to $1$ multiplexers AND gates, XOR gates Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.
edited
in
Digital Logic
Nov 5, 2018
15.1k
views
gate1999
digital-logic
normal
functional-completeness
multiple-selects
9
answers
10
GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$
answer edited
in
Digital Logic
Nov 4, 2018
16.5k
views
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
3
answers
11
GATE IT 2005 | Question: 11
How many pulses are needed to change the contents of a $8$-bit up counter from $10101100$ to $00100111$ (rightmost bit is the LSB)? $134$ $133$ $124$ $123$
edited
in
Digital Logic
Nov 4, 2018
7.4k
views
gateit-2005
digital-logic
digital-counter
normal
5
answers
12
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$
edited
in
Digital Logic
Oct 31, 2018
21.2k
views
gatecse-2007
digital-logic
normal
isro2011
decoder
6
answers
13
GATE IT 2007 | Question: 40
What is the final value stored in the linear feedback shift register if the input is $101101$? $0110$ $1011$ $1101$ $1111$
answer edited
in
Digital Logic
Oct 31, 2018
6.4k
views
gateit-2007
digital-logic
circuit-output
normal
2
answers
14
GATE CSE 1996 | Question: 1.23
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is $101010\ldots1010$ $100000\ldots 0001$ $111111\ldots 1111$ $011111\ldots1110$
answer edited
in
Digital Logic
Oct 28, 2018
7.5k
views
gate1996
digital-logic
booths-algorithm
normal
5
answers
15
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)$
answer edited
in
Mathematical Logic
Oct 28, 2018
2.1k
views
tifr2016
mathematical-logic
propositional-logic
3
answers
16
GATE CSE 1987 | Question: 12-a
The Boolean expression $A \oplus B \oplus A$ is equivalent to $AB + \overline {A}\;\;\overline B$ $\overline{A}\;B+A\;\overline{B}$ $B$ $\overline{A}$
answer edited
in
Digital Logic
Oct 26, 2018
4.2k
views
gate1987
digital-logic
boolean-algebra
easy
4
answers
17
GATE CSE 1997 | Question: 2-1
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$ $x$ $0$ $1$
answer edited
in
Digital Logic
Oct 26, 2018
5.3k
views
gate1997
digital-logic
normal
boolean-algebra
5
answers
18
GATE CSE 2000 | Question: 2.10
The simultaneous equations on the Boolean variables $x, y, z$ and $w$, $x + y + z = 1 $ $xy = 0$ $xz + w = 1$ $xy + \bar{z}\bar{w} = 0$ have the following solution for $x, y, z$ and $w,$ respectively: $0 \ 1 \ 0 \ 0$ $1 \ 1 \ 0 \ 1$ $1 \ 0 \ 1 \ 1$ $1 \ 0 \ 0 \ 0$
edited
in
Digital Logic
Oct 26, 2018
7.2k
views
gatecse-2000
digital-logic
boolean-algebra
easy
6
answers
19
GATE CSE 1999 | Question: 2.16
The number of full and half-adders required to add $16$-bit numbers is $8$ half-adders, $8$ full-adders $1$ half-adder, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders
edited
in
Digital Logic
Oct 21, 2018
22.3k
views
gate1999
digital-logic
normal
adder
5
answers
20
GATE CSE 1997 | Question: 2.5
An N-bit carry lookahead adder, where $N$ is a multiple of $4$, employs ICs $74181$ ($4$ bit ALU) and $74182$ ( $4$ bit carry lookahead generator). The minimum addition time using the best architecture for this adder is proportional to $N$ proportional to $\log N$ a constant None of the above
edited
in
Digital Logic
Oct 21, 2018
9.6k
views
gate1997
digital-logic
normal
adder
2
answers
21
GATE CSE 2016 Set 1 | Question: 22
Which one of the following is NOT a part of the ACID properties of database transactions? Atomicity Consistency Isolation Deadlock-freedom
answer edited
in
Databases
Oct 21, 2018
10.0k
views
gatecse-2016-set1
databases
transaction-and-concurrency
easy
3
answers
22
GATE CSE 2014 Set 1 | Question: 29
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectively. Which one of them is conflict serializable? $r_1(x)$; $r_2(x)$; $w_1(x)$; $r_3(x)$; $w_2(x)$; $r_2(x)$; ... $r_1(x)$; $w_2(x)$; $w_1(x)$; $r_2(x)$; $w_2(x)$; $r_3(x)$; $r_1(x)$; $w_1(x)$;
answer edited
in
Databases
Oct 21, 2018
8.6k
views
gatecse-2014-set1
databases
transaction-and-concurrency
conflict-serializable
normal
2
answers
23
GATE IT 2005 | Question: 66
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction center A first level architectural design of this segment will result in a set of process modules with an associated invocation sequence ... $T_c$ invokes $p_2.$ $p_2$ invokes $p_1,$ and then invokes $p_3,$ or $p_4,$ or $p_5$
edited
in
IS&Software Engineering
Oct 21, 2018
4.6k
views
gateit-2005
data-flow-diagram
normal
non-gate
2
answers
24
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
answer edited
in
Databases
Oct 18, 2018
19.7k
views
gate1999
databases
sql
easy
1
answer
25
GATE CSE 1999 | Question: 1.19
The relational algebra expression equivalent to the following tuple calculus expression: $\left\{t \mid t \in r \land \left(t[A] = 10 \land t[B]=20\right)\right\}$ is $\sigma_{(A=10 \lor B=20)} (r)$ $\sigma_{(A=10)} (r) \cup \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r) \cap \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r) - \sigma_{(B=20)} (r)$
answer edited
in
Databases
Oct 16, 2018
5.7k
views
gate1999
databases
relational-calculus
normal
3
answers
26
TIFR CSE 2013 | Part B | Question: 19
In a relational database there are three relations: $Customers = C\textsf{(CName)}$, $Shops = S \textsf{(SName)}$, $Buys = B\textsf{(CName, SName)}$ ... $S - \Pi _{\textsf{SName}}((C \times S) - B)$ None of the above
answer edited
in
Databases
Oct 15, 2018
3.3k
views
tifr2013
databases
relational-algebra
5
answers
27
GATE CSE 2002 | Question: 15
A university placement center maintains a relational database of companies that interview students on campus and make job offers to those successful in the interview. The schema of the database is given below: ... students were offered jobs, the name of the degree and the average offered salary of students in this degree program.
answer edited
in
Databases
Oct 15, 2018
5.5k
views
gatecse-2002
databases
normal
descriptive
relational-algebra
sql
2
answers
28
GATE CSE 1996 | Question: 27
A library relational database system uses the following schema USERS (User#, User Name, Home Town) BOOKS (Book#, Book Title, Author Name) ISSUED (Book#, User#, Date) Explain in one English sentence, what each of the following relational algebra queries is ...
answer edited
in
Databases
Oct 15, 2018
5.3k
views
gate1996
databases
relational-algebra
descriptive
4
answers
29
GATE IT 2005 | Question: 82b
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for ... outer loop, the reduction in number of block accesses required for reading the data will be $0$ $30400$ $38400$ $798400$
edited
in
Databases
Oct 14, 2018
16.2k
views
gateit-2005
databases
normal
joins
3
answers
30
GATE IT 2005 | Question: 82a
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for every ... to be used in outer loop, the number of block accesses required for reading the data are $800000$ $40080$ $32020$ $100$
edited
in
Databases
Oct 14, 2018
8.7k
views
gateit-2005
databases
normal
joins
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...