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 rishu_darkshadow
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rishu_darkshadow
5
answers
1
GATE CSE 2005 | Question: 16, ISRO2009-18, ISRO2015-2
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is: $-2^{n-1} \text{ to } (2^{n-1} -1)$ $-(2^{n-1} -1) \text{ to } (2^{n-1} -1)$ $-2^{n-1} \text{ to } 2^{n-1}$ $-(2^{n-1} +1) \text{ to } (2^{n-1} -1)$
answer edited
in
Digital Logic
Mar 23, 2018
9.6k
views
gatecse-2005
digital-logic
number-representation
easy
isro2009
isro2015
3
answers
2
ISRO2017-58
Which of the following is not a life cycle model? Spiral model Prototyping model Waterfall model Capability maturity model
answer edited
in
IS&Software Engineering
Mar 20, 2018
7.3k
views
isro2017
is&software-engineering
non-gate
4
answers
3
GATE CSE 1994 | Question: 3.5
Match the following items ...
comment edited
in
Compiler Design
Feb 10, 2018
5.3k
views
gate1994
compiler-design
grammar
normal
match-the-following
7
answers
4
GATE CSE 2015 Set 1 | Question: 33
Consider the following pseudo code, where $x$ and $y$ are positive integers. begin q := 0 r := x while r ≥ y do begin r := r - y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is $\{ r = qx + y \wedge r < y\}$ ... $\{ y = qx + r \wedge 0 < r < y\}$ $\{ q + 1 < r - y \wedge y > 0\}$
answered
in
Programming in C
Jan 19, 2018
15.4k
views
gatecse-2015-set1
programming
loop-invariants
normal
2
answers
5
GATE CSE 2014 Set 3 | Question: GA-10
Consider the equation: $(7526)_8 − (Y)_8 = (4364)_8$, where $(X)_N$ stands for $X$ to the base $N$. Find $Y$. $1634$ $1737$ $3142$ $3162$
commented
in
Quantitative Aptitude
Jan 19, 2018
5.4k
views
gatecse-2014-set3
quantitative-aptitude
number-theory
normal
digital-logic
4
answers
6
GATE CSE 2014 Set 3 | Question: 17
One of the purposes of using intermediate code in compilers is to make parsing and semantic analysis simpler. improve error recovery and error reporting. increase the chances of reusing the machine-independent code optimizer in other compilers. improve the register allocation.
answered
in
Compiler Design
Jan 19, 2018
9.1k
views
gatecse-2014-set3
compiler-design
intermediate-code
easy
8
answers
7
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
commented
in
Databases
Jan 18, 2018
10.2k
views
gate1998
databases
database-normalization
easy
10
answers
8
GATE CSE 2014 Set 3 | Question: 28
An $IP$ router with a $\text{Maximum Transmission Unit (MTU)}$ of $1500$ bytes has received an $IP$ packet of size $4404\text{ bytes}$ with an $IP$ header of length $20\text{ bytes}$. The values of the relevant fields in the header of the third $IP$ ... $1,$ Datagram Length$: 1500;$ Offset$: 370$ $\text{MF bit}$: $0,$ Datagram Length$: 1424;$ Offset$: 2960$
commented
in
Computer Networks
Jan 18, 2018
21.0k
views
gatecse-2014-set3
computer-networks
ip-packet
normal
6
answers
9
GATE CSE 1996 | Question: 2.8
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one? $L_1.L_2$ $L_1 \cap L_2$ $L_1 \cap R$ $L_1 \cup L_2$
commented
in
Theory of Computation
Jan 13, 2018
6.2k
views
gate1996
theory-of-computation
context-free-language
easy
1
answer
10
UGC NET CSE | November 2017 | Part 3 | Question: 38
Which of the following statement(s) is/are TRUE regarding Java Servelets? A Java Servelet is a server-side component that runs on the web server and extends the capabilities of a server. A servelet can use the user interface classes like AWT or Swing. Only (i) is TRUE Only (ii) is TRUE Both (i) and (ii) are TRUE Neither (i) nor (ii) is TRUE
answered
in
Unknown Category
Jan 4, 2018
726
views
ugcnetcse-nov2017-paper3
1
answer
11
UGC NET CSE | November 2017 | Part 3 | Question: 41
Which of the following statements is/are TRUE regarding JAVA? Constants that cannot be changed are declared using ‘static’ keyword. A class can only inherit one class but can implement multiple interfaces. Only (i) is TRUE Only (ii) is TRUE Both (i) and (ii) are TRUE Neither (i) nor (ii) is TRUE
answered
in
Unknown Category
Jan 4, 2018
1.2k
views
ugcnetcse-nov2017-paper3
1
answer
12
UGC NET CSE | November 2017 | Part 2 | Question: 28
The number of bits used for addressing in Gigabit Ethernet is __________. $32$ bits $48$ bits $64$ bits $128$ bits
answered
in
Unknown Category
Jan 4, 2018
2.8k
views
ugcnetcse-nov2017-paper2
computer-networks
ethernet
8
answers
13
GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$
commented
in
Computer Networks
Dec 26, 2017
18.7k
views
gatecse-2004
computer-networks
ip-addressing
tcp
normal
11
answers
14
GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$
commented
in
DS
Dec 25, 2017
25.8k
views
gateit-2006
data-structures
binary-tree
normal
2
answers
15
GATE CSE 1998 | Question: 1.26
Which of the following statements is true? SLR parser is more powerful than LALR LALR parser is more powerful than Canonical LR parser Canonical LR parser is more powerful than LALR parser The parsers SLR, Canonical CR, and LALR have the same power
commented
in
Compiler Design
Dec 23, 2017
12.6k
views
gate1998
compiler-design
parsing
normal
7
answers
16
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
commented
in
DS
Dec 23, 2017
13.2k
views
gateit-2005
data-structures
normal
binary-search-tree
3
answers
17
GATE CSE 1994 | Question: 1.24
Consider the following heap (figure) in which blank regions are not in use and hatched region are in use. The sequence of requests for blocks of sizes $300, 25, 125, 50$ can be satisfied if we use either first fit or best fit policy (any one) first fit but not best fit policy best fit but not first fit policy None of the above
commented
in
Operating System
Dec 22, 2017
11.7k
views
gate1994
operating-system
page-replacement
normal
1
answer
18
UGC NET CSE | December 2009 | Part 2 | Question: 47
Analysis of large database to retrieve information is called (A) OLTP (B) OLAP (C) OLDP (D) OLPP
commented
in
Databases
Dec 22, 2017
2.1k
views
ugcnetcse-dec2009-paper2
databases
data-mining
4
answers
19
MCQ_Made_easy
Acceptance testing is done by A. Developers B. Customers C. Testers D. All of the above
commented
in
IS&Software Engineering
Dec 14, 2017
4.1k
views
is&software-engineering
software-testing
2
answers
20
MCQ-made_eassay
How many full adder are needed to construct m-bit parallel adder ? A. m/2 B. m C. m-1 D. m+1
commented
in
Digital Logic
Dec 14, 2017
2.8k
views
full-adder
parallel-aader
3
answers
21
ISRO2007-27
Virtual memory is Part of Main Memory only used for swapping A technique to allow a program, of size more than the size of main memory, to run Part of secondary storage used in program execution None of these
commented
in
Operating System
Dec 12, 2017
4.1k
views
isro2007
operating-system
virtual-memory
5
answers
22
GATE CSE 2002 | Question: 2.21
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS? More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I/O, another program is immediately scheduled ... is immediately scheduled for execution. (a) (a) and (b) (a) and (c) (a), (b) and (c)
answered
in
Operating System
Dec 12, 2017
12.6k
views
gatecse-2002
operating-system
normal
process
3
answers
23
GATE CSE 2014 Set 2 | Question: 49
The number of distinct positive integral factors of $2014$ is _____________
commented
in
Set Theory & Algebra
Dec 8, 2017
9.7k
views
gatecse-2014-set2
set-theory&algebra
easy
numerical-answers
number-theory
5
answers
24
GATE CSE 2014 Set 2 | Question: 45
The value of a $\text{float}$ type variable is represented using the single-precision $\text{32-bit}$ floating point format of $\text{IEEE-754}$ standard that uses $1$ $\text{bit}$ for sign, $\text{8 bits}$ for biased exponent and ... . The representation of $X$ in hexadecimal notation is $\text{C1640000H}$ $\text{416C0000H}$ $\text{41640000H}$ $\text{C16C0000H}$
commented
in
Digital Logic
Dec 8, 2017
11.0k
views
gatecse-2014-set2
digital-logic
number-representation
normal
ieee-representation
5
answers
25
GATE CSE 2014 Set 2 | Question: 43
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
commented
in
CO and Architecture
Dec 8, 2017
20.7k
views
gatecse-2014-set2
co-and-architecture
cache-memory
normal
9
answers
26
GATE CSE 2014 Set 2 | Question: 41
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{POP}$ ... instruction. A queue can be implemented where both $\text{ENQUEUE}$ and $\text{DEQUEUE}$ take a single instruction each.
answered
in
DS
Dec 8, 2017
24.5k
views
gatecse-2014-set2
data-structures
stack
easy
1
answer
27
SSC-IMD-2017-01
If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative mapping. Then each word of cache memory shall be 1) 11 bits 2) 21 bits 3) 16 bits 4) 20 bits
commented
in
Operating System
Dec 8, 2017
697
views
operating-system
cache-memory
associative-memory
ssc-imd
6
answers
28
GATE CSE 2014 Set 1 | Question: 9
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in ... to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________
commented
in
CO and Architecture
Dec 8, 2017
18.2k
views
gatecse-2014-set1
co-and-architecture
machine-instruction
instruction-format
numerical-answers
normal
1
answer
29
SSC-IMD-2017-10
The two methods how LRU page replacement policy can be implemented in hardware are : 1) Counters 2) RAM & Registers 3) Stack & Counters 4) Registers
answer selected
in
Operating System
Dec 7, 2017
360
views
ssc-imd
operating-system
1
answer
30
SSC-IMD-2017-09
The primary job of the operating system of a computer is to 1) command resources 2) manage resources 3) provide utilities 4) provide connection
commented
in
Operating System
Dec 7, 2017
671
views
ssc-imd
operating-system
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:...