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 Blackcode00
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Blackcode00
9
answers
1
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) _________.
commented
in
DS
Mar 1
21.6k
views
gatecse-2019
numerical-answers
data-structures
binary-tree
2-marks
6
answers
2
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)$
commented
in
Probability
Nov 15, 2021
4.5k
views
tifr2010
probability
conditional-probability
tifr2014
5
answers
3
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)$
commented
in
Mathematical Logic
Nov 12, 2021
7.9k
views
gateit-2007
mathematical-logic
normal
first-order-logic
1
answer
4
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\}$ ... second step $M$ must make? What key property relates the behaviour of $M$ on $w$ to the behaviour of $M'$ on $x$?
commented
in
Theory of Computation
May 14, 2021
2.4k
views
gatecse-2002
theory-of-computation
decidability
normal
turing-machine
descriptive
difficult
2
answers
5
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
commented
in
CO and Architecture
Mar 15, 2021
1.5k
views
nielit2016dec-scientistb-cs
co-and-architecture
addressing-modes
3
answers
6
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 _____________
commented
in
CO and Architecture
Feb 23, 2021
7.0k
views
gatecse-2021-set2
co-and-architecture
pipelining
instruction-execution
numerical-answers
2-marks
2
answers
7
Lexical error
In below line is there any lexical error or not if yes then why? int A=123456789;
commented
in
Compiler Design
Nov 17, 2020
525
views
compiler-design
lexical-analysis
descriptive
1
answer
8
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)
answered
in
DS
Oct 31, 2020
442
views
made-easy-test-series
hashing
probability
1
answer
9
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..........?
commented
in
Computer Networks
Aug 27, 2020
667
views
6
answers
10
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$
commented
in
Computer Networks
Aug 21, 2020
18.5k
views
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
2
answers
11
Ace Test Series: DBMS - Transaction And Serializable
answered
in
Databases
Jul 25, 2020
432
views
ace-test-series
databases
transaction-and-concurrency
serializability
2
answers
12
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$?$
answered
in
CO and Architecture
Jun 25, 2020
448
views
co-and-architecture
pipelining
1
answer
13
Pipeline Made easy
answered
in
CO and Architecture
Jun 21, 2020
195
views
6
answers
14
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.
commented
in
Compiler Design
Jun 6, 2020
13.2k
views
gatecse-2014-set1
compiler-design
parsing
normal
7
answers
15
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
commented
in
Linear Algebra
May 11, 2020
3.4k
views
gateit-2007
cartesian-coordinates
1
answer
16
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?
answered
in
Algorithms
Apr 13, 2020
661
views
made-easy-test-series
algorithms
sorting
3
answers
17
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
commented
in
Theory of Computation
Mar 28, 2020
3.8k
views
isro2014
theory-of-computation
finite-automata
4
answers
18
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$
commented
in
CO and Architecture
Jan 17, 2020
4.5k
views
isro-2020
co-and-architecture
pipelining
normal
1
answer
19
ME-Practice Book COA Q#48
answered
in
CO and Architecture
Nov 21, 2019
123
views
1
answer
20
MadeEasy Test Series: CO & Architecture - Conflict Misses
I have got - 5 compulsory misses for first 5 ref. - 3 conflict misses for last 3 ref.
commented
in
CO and Architecture
Oct 25, 2019
824
views
made-easy-test-series
co-and-architecture
misses
1
answer
21
MadeEasy Subject Test 2019: Operating System - Virtual Memory
answered
in
Operating System
Jul 26, 2019
328
views
made-easy-test-series
operating-system
virtual-memory
paging
page-fault
1
answer
22
calculus question
Question Number 4?
answered
in
Calculus
Jan 5, 2019
173
views
calculus
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....