Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Blackcode00
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Blackcode00
3
answers
1
GATE CSE 1994 | Question: 27
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$ $S_1$ read n $S_2$ i := 1 $S_3$ if i > n next $S_4$ a(i) := i+1 $S_5$ i := i+1 $S_6$ next : write a(i) Can this graph be converted to a concurrent program using parbegin-parend construct only?
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$$S_1$read n$S_2$i := 1$S_3$if i n next$S_4$a(i) := i+1$S_5$i :=...
6.0k
views
commented
Apr 6, 2023
Operating System
gate1994
operating-system
process-synchronization
normal
descriptive
+
–
3
answers
2
GATE CSE 1991 | Question: 11,a
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] ... j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$.Pi; repeat flag[i] := true; while flag [j] or f...
4.1k
views
answered
Apr 6, 2023
Operating System
gate1991
process-synchronization
normal
operating-system
descriptive
+
–
9
answers
3
GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at ...
30.3k
views
commented
Mar 1, 2022
DS
gatecse-2019
numerical-answers
data-structures
binary-tree
2-marks
+
–
6
answers
4
TIFR CSE 2010 | Part A | Question: 19, TIFR CSE 2014 | Part A | Question: 6
Karan tells truth with probability $\dfrac{1}{3}$ and lies with probability $\dfrac{2}{3}.$ Independently, Arjun tells truth with probability $\dfrac{3}{4}$ and lies with probability $\dfrac{1}{4}.$ Both watch a cricket match. Arjun tells ... $\left(\dfrac{5}{6}\right)$ $\left(\dfrac{6}{7}\right)$
Karan tells truth with probability $\dfrac{1}{3}$ and lies with probability $\dfrac{2}{3}.$ Independently, Arjun tells truth with probability $\dfrac{3}{4}$ and lies with...
5.9k
views
commented
Nov 15, 2021
Probability
tifr2010
probability
conditional-probability
tifr2014
+
–
5
answers
5
GATE IT 2007 | Question: 21
Which one of these first-order logic formulae is valid? $\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall xQ\left(x\right)\right)$ ... $\forall x \exists y P\left(x, y\right)\implies \exists y \forall x P\left(x, y\right)$
Which one of these first-order logic formulae is valid?$\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall ...
10.3k
views
commented
Nov 12, 2021
Mathematical Logic
gateit-2007
mathematical-logic
normal
first-order-logic
+
–
1
answer
6
GATE CSE 2002 | Question: 14
The aim of the following question is to prove that the language $\{M \mid M$ $\text {is the code of the Turing Machine which, irrespective of the input, halts and outputs a}$ $1\}$ ... step $M$ must make? What key property relates the behaviour of $M$ on $w$ to the behaviour of $M'$ on $x$?
The aim of the following question is to prove that the language $\{M \mid M$ $\text {is the code of the Turing Machine which, irrespective of the input, halts and outputs...
3.1k
views
commented
May 14, 2021
Theory of Computation
gatecse-2002
theory-of-computation
decidability
normal
turing-machine
descriptive
difficult
+
–
2
answers
7
NIELIT 2016 DEC Scientist B (CS) - Section B: 53
The addressing mode used in an instruction of the form $ADD\:X\:Y$, is Direct Absolute Indirect Indexed
The addressing mode used in an instruction of the form $ADD\:X\:Y$, isDirectAbsoluteIndirectIndexed
4.6k
views
commented
Mar 15, 2021
CO and Architecture
nielit2016dec-scientistb-cs
co-and-architecture
addressing-modes
+
–
4
answers
8
GATE CSE 2021 Set 2 | Question: 53
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$, $\text{Execute } \textsf{(EX)}$, $\text{Memory Access } \textsf{(MEM)}$ ... $\textit{Speedup} $ achieved in executing the given instruction sequence on the pipelined processor (rounded to $2$ decimal places) is _____________
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$, $\text{Execute } \textsf{(EX)}$, $\te...
15.1k
views
commented
Feb 23, 2021
CO and Architecture
gatecse-2021-set2
co-and-architecture
pipelining
instruction-execution
numerical-answers
2-marks
+
–
2
answers
9
Lexical error
In below line is there any lexical error or not if yes then why? int A=123456789;
In below line is there any lexical error or not if yes then why?int A=123456789;
664
views
commented
Nov 17, 2020
Compiler Design
compiler-design
lexical-analysis
descriptive
+
–
1
answer
10
MadeEasy Test Series: Programming & DS - Hashing
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i) = (3i+5)mod11. 12,44,13,88,23,94,11,39,20,16,5 where to handle the collision chaining is used, after inserting ... in table if 2 new keys inserted into table, what is the probability new items hashed into empty slot?(upto 2 decimal places)
Consider the following keys that are hashed into the hash table in the order given using the hash function H(i) = (3i+5)mod11.12,44,13,88,23,94,11,39,20,16,5where to hand...
618
views
answered
Oct 31, 2020
DS
made-easy-test-series
hashing
probability
+
–
1
answer
11
Made Easy Test Series Computer Network Question
Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 64 Mbps. The propagation speed of the media is 2/3 of the speed of light in vacuum. It is needed to design selective repeat sliding window ... are negligible. Then, the minimum size in bits of the sequence number field has to be..........?
Consider a network connecting two systems located 4000 kilometers apart. Thebandwidth of the network is 64 Mbps. The propagation speed of the media is 2/3 ofthe speed of ...
912
views
commented
Aug 27, 2020
6
answers
12
GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...
23.3k
views
commented
Aug 21, 2020
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
2
answers
13
Ace Test Series: DBMS - Transaction And Serializable
597
views
answered
Jul 25, 2020
Databases
ace-test-series
databases
transaction-and-concurrency
serializability
+
–
2
answers
14
Pipeline Efficiency
The speed up of a pipelined processor is $5.4,$ operating at $2$ GHZ frequency with efficiency $82\%$. What will be no. of stages available in this processor$?$
The speed up of a pipelined processor is $5.4,$ operating at $2$ GHZ frequency with efficiency $82\%$.What will be no. of stages available in this processor$?$
764
views
answered
Jun 25, 2020
CO and Architecture
co-and-architecture
pipelining
+
–
1
answer
15
Pipeline Made easy
314
views
answered
Jun 21, 2020
7
answers
16
GATE CSE 2014 Set 1 | Question: 34
A canonical set of items is given below $S \to L .> R $ $Q \to R.$ On input symbol $<$ the set has a shift-reduce conflict and a reduce-reduce conflict. a shift-reduce conflict but not a reduce-reduce conflict. a reduce-reduce conflict but not a shift-reduce conflict. neither a shift-reduce nor a reduce-reduce conflict.
A canonical set of items is given below$S \to L . R $$Q \to R.$On input symbol $<$ the set hasa shift-reduce conflict and a reduce-reduce conflict.a shift-reduce conflict...
24.3k
views
commented
Jun 6, 2020
Compiler Design
gatecse-2014-set1
compiler-design
parsing
normal
+
–
8
answers
17
GATE IT 2007 | Question: 80
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy-$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ be the line ... or the smallest $y$-coordinate among all the points The difference between $x$-coordinates $P_{a}$ and $P_{b}$ is minimum None of the above
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy-$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the...
5.1k
views
commented
May 11, 2020
Linear Algebra
gateit-2007
cartesian-coordinates
+
–
1
answer
18
MadeEasy Test Series: Algorithms - Sorting
An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best choice for sorting the array A? Quick Sort or Insertion Sort? given answer is the insertion ... k), and it will take O(klogk) in average case and O(k^2) in the worst case. what's wrong in that?
An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best choice...
818
views
answered
Apr 13, 2020
Algorithms
made-easy-test-series
algorithms
sorting
+
–
3
answers
19
ISRO2014-79
Consider the following Deterministic Finite Automaton $M$. Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in $S$ that are accepted by $M$ is 0 1 2 3
Consider the following Deterministic Finite Automaton $M$.Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of str...
4.8k
views
commented
Mar 28, 2020
Theory of Computation
isro2014
theory-of-computation
finite-automata
+
–
4
answers
20
ISRO2020-7
Consider a $5$- segment pipeline with a clock cycle time $20$ ns in each sub operation. Find out the approximate speed-up ratio between pipelined and non-pipelined system to execute $100$ instructions. (if an average, every five cycles, a bubble due to data hazard has to be introduced in the pipeline) $5$ $4.03$ $4.81$ $4.17$
Consider a $5$- segment pipeline with a clock cycle time $20$ ns in each sub operation. Find out the approximate speed-up ratio between pipelined and non-pipelined system...
7.1k
views
commented
Jan 16, 2020
CO and Architecture
isro-2020
co-and-architecture
pipelining
normal
+
–
1
answer
21
ME-Practice Book COA Q#48
214
views
answered
Nov 21, 2019
1
answer
22
MadeEasy Test Series: CO & Architecture - Conflict Misses
I have got - 5 compulsory misses for first 5 ref. - 3 conflict misses for last 3 ref.
I have got - 5 compulsory misses for first 5 ref.- 3 conflict misses for last 3 ref.
1.0k
views
commented
Oct 25, 2019
CO and Architecture
made-easy-test-series
co-and-architecture
misses
+
–
1
answer
23
MadeEasy Subject Test 2019: Operating System - Virtual Memory
465
views
answered
Jul 26, 2019
Operating System
made-easy-test-series
operating-system
virtual-memory
paging
page-fault
+
–
1
answer
24
calculus question
Question Number 4?
Question Number 4?
277
views
answered
Jan 4, 2019
Calculus
calculus
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register