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 smsubham
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by smsubham
2
votes
1
ISI2016-MMA-9
Suppose $X$ and $Y$ are two independent random variables both following Poisson distribution with parameter $\lambda$. What is the value of $E(X-Y)^2$ ? $\lambda$ $2 \lambda$ $\lambda^2$ $4 \lambda^2$
answered
in
Probability
Jun 5, 2020
840
views
isi2016-mmamma
probability
random-variable
poisson-distribution
expectation
0
votes
2
Probability- Gravner- 75.a
What is the probability that a Normal random variable differs from its mean $\mu$ by more than $\sigma$ ?
answered
in
Probability
Jun 4, 2020
610
views
gravner
probability
engineering-mathematics
random-variable
normal-distribution
0
votes
3
AceBook
Consider the machine with 64 MB Physical Memory and a 34 bit Virtual Address Space. If the page size is 4KB, the appropriate sizes of conventional and inverted page table sizes are: a) 4M, 4K b)4K, 4M c)4M, 16K d)16K, 4M. soln: is Option C. but my ans is (7MB, 28KB)
answered
in
Operating System
Apr 6, 2020
1.6k
views
memory-management
paging
virtual-memory
1
vote
4
NIELIT 2017 July Scientist B (CS) - Section B: 19
To make the following circuit a tautology ‘?’ marked box should be OR gate AND gate NAND gate EX-OR gate
answered
in
Digital Logic
Apr 3, 2020
1.6k
views
nielit2017july-scientistb-cs
digital-logic
combinational-circuit
1
vote
5
NIELIT 2017 July Scientist B (CS) - Section B: 40
Kadane algorithm is used to find Maximum sum subsequence in an array Maximum sum subarray in an array Maximum product subsequence in an array Maximum product subarray in an array
answered
in
DS
Apr 3, 2020
3.8k
views
nielit2017july-scientistb-cs
data-structures
array
0
votes
6
NIELIT 2017 July Scientist B (CS) - Section B: 39
Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree
answered
in
Algorithms
Apr 3, 2020
6.2k
views
nielit2017july-scientistb-cs
algorithms
easy
dynamic-programming
0
votes
7
NIELIT 2017 July Scientist B (CS) - Section B: 25
Which access method is used for obtaining a record from cassette tape? Direct Sequential Random Parallel
answered
in
Operating System
Apr 3, 2020
910
views
nielit2017july-scientistb-cs
operating-system
disk
1
vote
8
NIELIT 2017 July Scientist B (CS) - Section B: 20
In the following gate network which gate is redundant? Gate no.$1$ Gate no.$2$ Gate no.$3$ Gate no.$4$
answered
in
Digital Logic
Apr 3, 2020
913
views
nielit2017july-scientistb-cs
digital-logic
combinational-circuit
2
votes
9
NIELIT 2017 July Scientist B (CS) - Section B: 17
The digital multiplexer is basically a combination logic circuit to perform the operation AND-AND OR-OR AND-OR OR-AND
answered
in
Digital Logic
Apr 3, 2020
3.6k
views
nielit2017july-scientistb-cs
digital-logic
combinational-circuit
multiplexer
0
votes
10
NIELIT 2017 July Scientist B (CS) - Section B: 16
Which of the following propositions is tautology? $(p\lor q)\to q$ $p\lor (q\to p)$ $p\lor (p\to q)$ Both (B) and (C)
answered
in
Mathematical Logic
Apr 3, 2020
702
views
nielit2017july-scientistb-cs
mathematical-logic
0
votes
11
NIELIT 2017 July Scientist B (CS) - Section B: 13
For the graph shown, which of the following paths is a Hamilton circuit? $ABCDCFDEFAEA$ $AEDCBAF$ $AEFDCBA$ $AFCDEBA$
answered
in
Graph Theory
Apr 3, 2020
2.1k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
1
vote
12
NIELIT 2017 July Scientist B (CS) - Section B: 12
The following graph has no Euler circuit because It has $7$ vertices. It is even-valent (all vertices have even valence). It is not connected. It does not have a Euler circuit.
answered
in
Graph Theory
Apr 3, 2020
2.3k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
euler-graph
1
vote
13
NIELIT 2017 July Scientist B (CS) - Section B: 11
Consider the following graph $L$ and find the bridges,if any. No bridge $\{d,e\}$ $\{c,d\}$ $\{c,d\}$ and $\{c,f\}$
answered
in
Graph Theory
Apr 3, 2020
1.4k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
bridges
1
vote
14
NIELIT 2016 DEC Scientist B (CS) - Section B: 55
Process that periodically checks status of an I/O devices, is known as Cold swapping I/O instructions Polling Dealing
answered
in
CO and Architecture
Apr 2, 2020
637
views
nielit2016dec-scientistb-cs
co-and-architecture
1
vote
15
NIELIT 2016 DEC Scientist B (CS) - Section B: 57
The output of lexical analyzer is: A set of regular expressions Strings of character Syntax tree Set of tokens
answered
in
Compiler Design
Apr 2, 2020
1.7k
views
nielit2016dec-scientistb-cs
compiler-design
lexical-analysis
3
votes
16
NIELIT 2016 DEC Scientist B (CS) - Section B: 58
CPU consists of _______. ALU and Control Unit ALU, Control Unit and Monitor ALU, Control Unit and Hard disk ALU, Control Unit and Register
answered
in
CO and Architecture
Apr 2, 2020
1.0k
views
nielit2016dec-scientistb-cs
co-and-architecture
memory-interfacing
4
votes
17
NIELIT 2016 DEC Scientist B (CS) - Section B: 59
The Decimal equivalent of the Hexadecimal number $(A09D)_{16}$ is $31845$ $41117$ $41052$ $32546$
answered
in
Digital Logic
Apr 2, 2020
917
views
nielit2016dec-scientistb-cs
digital-logic
number-system
3
votes
18
NIELIT 2016 DEC Scientist B (CS) - Section B: 37
The principle of locality of reference justifies the use of Non reusable Cache memory Virtual memory None of the above
answered
in
Operating System
Apr 2, 2020
985
views
nielit2016dec-scientistb-cs
operating-system
cache-memory
0
votes
19
Operator Grammar
Given an Operator Grammar as, E -> E*F / F+E / F F -> F-F / id How to determine associativity in this case? Since Operator grammar can be ambiguous also. Is the above question solved using associativity and precedence of operators we consider in C programming? or it is Different.
answered
in
Compiler Design
Apr 2, 2020
2.9k
views
grammar
compiler-design
operator-grammar
3
votes
20
NIELIT 2016 MAR Scientist C - Section C: 14
If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called decidable undecidable interpretive non-deterministic
answered
in
Theory of Computation
Apr 2, 2020
1.6k
views
nielit2016mar-scientistc
theory-of-computation
identify-class-language
1
vote
21
NIELIT 2016 MAR Scientist C - Section C: 12
$\text{YACC}$ builds up $\text{SLR}$ parsing table Canonical $\text{LR}$ parsing table $\text{LALR}$ parsing table None of these
answered
in
Compiler Design
Apr 2, 2020
1.3k
views
nielit2016mar-scientistc
compiler-design
parsing
3
votes
22
NIELIT 2016 MAR Scientist C - Section C: 8
If there are $32$ segments, each of size $1$ K byte, then the logical address should have $13 \text{ bits}$ $14 \text{ bits}$ $15 \text{ bits}$ $16 \text{ bits}$
answered
in
Operating System
Apr 2, 2020
1.4k
views
nielit2016mar-scientistc
operating-system
memory-management
1
vote
23
NIELIT 2016 MAR Scientist C - Section C: 7
In real-time operating systems, which of the following is the most suitable scheduling scheme? round-robin first-come-first-served preemptive random scheduling
answered
in
Operating System
Apr 2, 2020
1.2k
views
nielit2016mar-scientistc
operating-system
process-scheduling
4
votes
24
NIELIT 2016 MAR Scientist C - Section C: 5
A primary key, if combined with a foreign key creates parent child relationship between the tables that connect them many-to-many relationship between the tables that connect them network model between the tables that connect them none of these
answered
in
Databases
Apr 2, 2020
1.4k
views
nielit2016mar-scientistc
databases
relational-model
0
votes
25
NIELIT 2016 MAR Scientist C - Section C: 4
A functional dependency of the form $x\to y$ is trivial if $y\subseteq x$ $y\subset x$ $x\subseteq y$ $x\subset y\:\text{and}\:y\subset x$
answered
in
Databases
Apr 2, 2020
4.9k
views
nielit2016mar-scientistc
databases
data-dependency
4
votes
26
NIELIT 2016 MAR Scientist C - Section C: 3
Every Boyce-Codd Normal Form (BCNF) decomposition is dependency preserving not dependency preserving need be dependency preserving none of these
answered
in
Databases
Apr 2, 2020
2.4k
views
nielit2016mar-scientistc
databases
dependency-preserving
3
votes
27
NIELIT 2016 MAR Scientist C - Section C: 2
The file manager is responsible for naming files saving files deleting files all of these
answered
in
Operating System
Apr 2, 2020
1.8k
views
nielit2016mar-scientistc
operating-system
file-system
2
votes
28
NIELIT 2016 MAR Scientist C - Section C: 1
The advantage of better testing in software development is in waterfall model prototyping iterative all of these
answered
in
IS&Software Engineering
Apr 2, 2020
1.6k
views
nielit2016mar-scientistc
non-gate
is&software-engineering
0
votes
29
NIELIT 2017 DEC Scientist B - Section B: 6
A stack organized computer has which of the following instructions? zero-address one-address two-address three-address
answered
in
CO and Architecture
Apr 2, 2020
2.9k
views
nielit2017dec-scientistb
co-and-architecture
instruction-format
1
vote
30
NIELIT 2017 DEC Scientist B - Section B: 5
Which of the following is machine independent optimization? Loop optimization Redundancy Elimination Folding All of the option
answered
in
Compiler Design
Apr 2, 2020
8.8k
views
nielit2017dec-scientistb
compiler-design
code-optimization
Page:
1
2
3
4
5
6
...
12
next »
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:...