Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Arpit Dhuriya
9
answers
1
GATE CSE 2003 | Question: 40
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-degree of $G$ cannot be $3$ $4$ $5$ $6$
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-d...
15.9k
views
commented
Jan 25, 2018
Graph Theory
gatecse-2003
graph-theory
normal
degree-of-graph
+
–
5
answers
2
GATE CSE 2005 | Question: 59
Consider the grammar: $E \rightarrow E + n \mid E \times n \mid n$ For a sentence $n + n \times n$, the handles in the right-sentential form of the reduction are: $n, E + n$ and $E + n \times n$ $n, E + n$ and $E + E \times n$ $n, n + n$ and $n + n \times n$ $n, E + n$ and $E \times n$
Consider the grammar:$$E \rightarrow E + n \mid E \times n \mid n$$For a sentence $n + n \times n$, the handles in the right-sentential form of the reduction are:$n, E + ...
16.6k
views
commented
Jan 14, 2018
Compiler Design
gatecse-2005
compiler-design
grammar
normal
+
–
2
answers
3
GATE CSE 1992 | Question: 15.b
Let $S$ be the set of all integers and let $n > 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relation and find its equivalence classes for $n = 5$.
Let $S$ be the set of all integers and let $n 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relat...
3.5k
views
answered
Jan 14, 2018
Set Theory & Algebra
gate1992
set-theory&algebra
normal
relations
descriptive
+
–
2
answers
4
intermediate code
Consider four programming languages viz. C, C++, C# and JAVA and three machines which have different configuration (such as OS, hardware). If someone needs to write a compiler for the above mentioned languages and machines, then the number of compilers required with and without intermediate code phase are --------- and ------ respectively.
Consider four programming languages viz. C, C++, C# and JAVA and three machines which have different configuration (such as OS, hardware). If someone needs to write a com...
2.2k
views
answered
Jan 11, 2018
Compiler Design
intermediate-code
compiler-design
+
–
1
answer
5
set cardinality
940
views
commented
Jan 2, 2018
Set Theory & Algebra
set-theory&algebra
+
–
2
answers
6
Microprogrammed control unit 1
Ques:- Control field of microinstruction contain two groups of control signal group 1 supports none or one of 64 control signals and group 2 supports at most 6 from remaining. What is size of micro operation? (what is the meaning of "from remaining" here?)
Ques:-Control field of microinstruction contain two groups of control signal group 1 supports none or one of 64 control signals and group 2 supports at most 6 from remain...
1.3k
views
answered
Dec 25, 2017
CO and Architecture
co-and-architecture
microprogramming
+
–
2
answers
7
Test series
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are 5 ns, 17 ns, 10 ns, 8 ns ... of this program, the time (in ns) needed to complete the program is ________ . (A) 612 (B) 1854 (C) 1133 (D) 578
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction ...
755
views
answer edited
Dec 25, 2017
CO and Architecture
pipelining
+
–
3
answers
8
Write Trough
Do we consider hierarchical model or simultaneous access model for write through ?
Do we consider hierarchical model or simultaneous access model for write through ?
1.3k
views
commented
Dec 25, 2017
CO and Architecture
cache-memory
co-and-architecture
write-through
+
–
3
answers
9
Dijkstra Algorithm
I think answer should be Option(B). Path:<s,y><y,x><x,t> = 7-3-2=2
I think answer should be Option(B).Path:<s,y><y,x><x,t = 7-3-2=2
1.6k
views
commented
Dec 21, 2017
Algorithms
dijkstras-algorithm
shortest-path
algorithms
made-easy-test-series
+
–
1
answer
10
Testbook Mock Test (DM + Probability)
Ram draws an empty graph of 6 nodes and tosses a fair die for every pair of distinct nodes, if a prime number occurs he draws an edge between the respective pair otherwise he moves on without drawing edge between that pair. What is the probability that after the end of ... a randomly chosen node will have degree 2? (a) 5/16 (b) 1/2 (c) 3/8 (d) None of the above
Ram draws an empty graph of 6 nodes and tosses a fair die for every pair of distinct nodes, if a prime number occurs he draws an edge between the respective pair otherwis...
621
views
answered
Dec 20, 2017
Probability
testbook-mock-test
discrete-mathematics
probability
+
–
1
answer
11
Variance
There are two data sets,each of size 5. The variances of those sets are 4 and 5; means are 2 and 4 respectively. If the sets are combined, what would be variance of combined data? (A) 10/11 (B) 11/13 (C) 11/2 (D) 13/11
There are two data sets,each of size 5. The variances of those sets are 4 and 5; means are 2 and 4 respectively. If the sets are combined, what would be variance of combi...
653
views
answered
Dec 20, 2017
Probability
variance
+
–
2
answers
12
ISRO-DEC2017-5
Let $f(x)=\log|x|$ and $g(x) =\sin x$. If $A$ is the range of $f(g(x))$ and $B$ is the range of $g(f(x))$ then $A\cap B$ is $[-1,0]$ $[-1,0)$ $[-\infty ,0]$ $[-\infty ,1]$
Let $f(x)=\log|x|$ and $g(x) =\sin x$. If $A$ is the range of $f(g(x))$ and $B$ is the range of $g(f(x))$ then $A\cap B$ is$[-1,0]$$[-1,0)$$[-\infty ,0]$$[-\infty ,1]$
3.2k
views
answered
Dec 20, 2017
Set Theory & Algebra
isrodec2017
set-theory&algebra
functions
+
–
3
answers
13
ISRO-DEC2017-3
A bag contains $19$ red balls and $19$ black balls.Two balls are removed at a time repeatedly and discarded if they are of the same colour, but if they are different, black ball is discarded and red ball is returned to the bag ,The probability that this process will terminate with one red ball is $1$ $\dfrac{1}{21}$ $0$ $0.5$
A bag contains $19$ red balls and $19$ black balls.Two balls are removed at a time repeatedly and discarded if they are of the same colour, but if they are different, bla...
4.4k
views
answered
Dec 20, 2017
Probability
isrodec2017
+
–
1
answer
14
TIFR-2015-Maths-B-6
Let $f: [0, 1]\rightarrow \mathbb{R}$ be a fixed continuous function such that $f$ is differentiable on $(0, 1)$ and $f(0) = f(1) = 0$. Then the equation $f(x) = f' (x)$ admits. No solution $x \in (0, 1)$ More than one solution $x \in (0, 1)$ Exactly one solution $x \in (0, 1)$ At least one solution $x \in (0, 1)$
Let $f: [0, 1]\rightarrow \mathbb{R}$ be a fixed continuous function such that $f$ is differentiable on $(0, 1)$ and $f(0) = f(1) = 0$. Then the equation $f(x) = f' (x)$ ...
484
views
answer selected
Dec 19, 2017
Set Theory & Algebra
tifrmaths2015
set-theory&algebra
functions
+
–
1
answer
15
TIFR-2015-Maths-A-7
Let $f$ and $g$ be two functions from $[0, 1]$ to $[0, 1]$ with $f$ strictly increasing. Which of the following statements is always correct? If $g$ is continuous, then $f ∘ g$ is continuous If $f$ is continuous, then $f ∘ g$ is continuous If $f$ and $f ∘ g$ are continuous, then $g$ is continuous If $g$ and $f ∘ g$ are continuous, then $f$ is continuous
Let $f$ and $g$ be two functions from $[0, 1]$ to $[0, 1]$ with $f$ strictly increasing. Which of the following statements is always correct?If $g$ is continuous, then $f...
584
views
answered
Dec 19, 2017
Set Theory & Algebra
tifrmaths2015
functions
continuity
+
–
2
answers
16
counting
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s? I got 382.Is it correct?
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s?I got 382.Is it correct?
4.0k
views
answered
Dec 17, 2017
Combinatory
counting
+
–
3
answers
17
functional dependency
Is the above relation is dependency preserved or not
Is the above relation is dependency preserved or not
1.0k
views
answer selected
Dec 14, 2017
1
answer
18
Dependency Preserving or Not ?
R(ABCD) F={ A→B, B→C, C→D, D→A } Now Decompose this into D={ AB, BC, CD } Dependency is preserved or Not ? Source : http://www.gatecrack.in/following-decomposition-dependency-preserving-not/
R(ABCD)F={ A→B, B→C, C→D, D→A }Now Decompose this into D={ AB, BC, CD }Dependency is preserved or Not ?Source : http://www.gatecrack.in/following-decomposition-d...
657
views
commented
Dec 13, 2017
Databases
dependency-preserving
+
–
4
answers
19
DBMS-Normalisation-Lossless Join Decomposition
1.2k
views
answered
Dec 13, 2017
Databases
databases
decomposition
database-normalization
lossless-join
+
–
1
answer
20
Knapsack
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. P Q R S T U V W Weight 18 12 16 14 16 20 10 15 Profit 34 15 22 16 17 22 18 26 90 80.25 85.50 91.2
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. PQRSTUVWWeight1812161416201015Profit341522161722...
8.3k
views
answer selected
Dec 7, 2017
Algorithms
algorithms
greedy-algorithm
knapsack-problem
+
–
1
answer
21
testbook
474
views
answered
Dec 7, 2017
Theory of Computation
minimum-spanning-tree
+
–
2
answers
22
Graph Theory
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For each edge, delete it from T if that edge belongs to a cycle in T. Assuming all the edge costs are distinct, does this new algorithm correctly compute a MST? a) Yes b) no c) cant say
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For e...
1.4k
views
answered
Dec 7, 2017
Graph Theory
graph-theory
graph-matching
graph-connectivity
minimum-spanning-tree
+
–
2
answers
23
#doubt on heaps and binary search
Consider the process of inserting an element into a max heap, where the max heap is represented by an array.Suppose we perform a binary search on the path from the new leaf to the root to find the position for newly inserted element, the ... logn) as upon applying binary search we wud compare O(logn) elements(neighbours and its own root only) plz clr my confusion
Consider the process of inserting an element into a max heap, where the max heap is represented by an array.Suppose we perform a binary search on the path from the new le...
850
views
commented
Dec 7, 2017
Algorithms
algorithms
data-structures
binary-search
+
–
3
answers
24
Modified Binary Search
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modified search? a) log(n) b) n c) n$\log 9/10(n)$ d) 2nlog(n)
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modi...
1.5k
views
commented
Dec 7, 2017
DS
time-complexity
binary-search
+
–
1
answer
25
DISCRETE
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
400
views
answered
Dec 6, 2017
Graph Theory
vertex-cover
+
–
1
answer
26
num of perfect matching in a tree is 1 . Is it right ? If possible draw diagram buddy.
432
views
answered
Dec 6, 2017
2
answers
27
PERFECT MATCHING IN COMPLETE GRAPH
2.8k
views
answer selected
Dec 6, 2017
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
2
answers
28
If G is an infinite cyclic group then which of the following is not true?
If G is an infinite cyclic group then which of the following is not true? a) G has exactly 2 generators. b) G is isomorphic to (Z,+). c) Every proper sub group of G is finite.
If G is an infinite cyclic group then which of the following is not true?a) G has exactly 2 generators.b) G is isomorphic to (Z,+).c) Every proper sub group of G is fini...
2.6k
views
answered
Dec 6, 2017
1
answer
29
Database 2PL protocol
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?
1.2k
views
answered
Nov 26, 2017
Databases
databases
transaction-and-concurrency
test-series
+
–
1
answer
30
File system OS
One way to use contiguous allocation of disk and not suffer from holes is to compact the disk every time a file is removed. Since all files are contiguous, copying a file requires a seek and rotational delay to read the file, followed by the transfer at full speed. ... of 1MB, how long does it take to read a file into main memory then write it back to the disk at a new location?
One way to use contiguous allocation of disk and not suffer from holes is to compact the disk every time a file is removed. Since all files are contiguous, copying a file...
1.3k
views
commented
Nov 24, 2017
CO and Architecture
co-and-architecture
operating-system
file-system
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register