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 sridhar15399
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sridhar15399
1
answer
1
ISI2017-PCB-CS-3-a
Let $R(A,B,C)$ be a relation with primary key $(A)$ and $S(A, D, E)$ a relation with primary key $(A, D)$. Each of the relations has $n$ tuples. If the number of tuples in $R \: \text{ natural join } S$ is $m$, then determine the number of tuples in $R$ $\text{ natural left outer join } S$.
commented
in
Databases
Oct 20, 2021
464
views
isi2017-pcb-cs
databases
relational-algebra
natural-join
2
answers
2
ISI2014-PCB-CS-5
The average memory access time for a microprocessor with first level cache is $3$ clock cycles. If data is present in the cache, it is found in $1$ clock cycle. If data is not found in the cache, $100$ clock cycles are needed to get it from off-chip ... $20 \%$ of the total execution time, respectively. Calculate the overall speed-up of $P$ when it is executed on the new machine.
answered
in
CO and Architecture
Oct 9, 2021
716
views
descriptive
isi2014-pcb-cs
co-and-architecture
cache-memory
2
answers
3
ISI2013-PCB-CS-6a
A block of bits with $n$ rows and $m$ columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an expression for the probability that the error will be detected.
commented
in
Computer Networks
Sep 6, 2021
1.1k
views
descriptive
isi2013-pcb-cs
error-detection
computer-networks
6
answers
4
GATE CSE 2020 | Question: 52
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is _______
answered
in
Graph Theory
Aug 7, 2021
13.5k
views
gatecse-2020
numerical-answers
graph-theory
graph-coloring
2-marks
8
answers
5
GATE CSE 2013 | Question: 26
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if ... planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only
answered
in
Graph Theory
Aug 6, 2021
19.1k
views
gatecse-2013
graph-theory
normal
graph-connectivity
3
answers
6
ternary relationship
Consider the following ER diagram: If A has 100 entities, B has 1000 entities, and C has 10 entities, what is the maximum number of triples of entities that could be in the relationship set for R?
commented
in
Databases
Jul 27, 2021
6.8k
views
ternary-relationship
1
answer
7
GATE CSE 1997 | Question: 76-b
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined attributes are the primary ... makes a copy of $\text{EMP}$ and names it $E$ ($\rho$ is called the rename operator))
commented
in
Databases
Jul 26, 2021
3.2k
views
gate1997
databases
sql
descriptive
normal
4
answers
8
GATE CSE 2017 Set 1 | Question: 42
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ ... -free. The database system is starvation-free, but not deadlock-free. The database system is neither deadlock-free nor starvation-free.
commented
in
Databases
Jul 25, 2021
26.9k
views
gatecse-2017-set1
databases
timestamp-ordering
deadlock-prevention-avoidance-detection
normal
5
answers
9
GATE CSE 2021 Set 1 | Question: 33
Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies. $PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$ Consider the decomposition of the relation $R$ into the ... $D_2$ is a lossless decomposition Both $D_1$ and $D_2$ are lossless decompositions Both $D_1$ and $D_2$ are lossy decompositions
commented
in
Databases
Jul 24, 2021
13.1k
views
gatecse-2021-set1
databases
database-normalization
2-marks
1
answer
10
ISI2015-MMA-26
$\displaystyle{}\underset{n \to \infty}{\lim} \frac{1}{n} \bigg( \frac{n}{n+1} + \frac{n}{n+2} + \cdots + \frac{n}{2n} \bigg)$ is equal to $\infty$ $0$ $\log_e 2$ $1$
commented
in
Calculus
Jul 23, 2021
716
views
isi2015-mma
calculus
limits
non-gate
2
answers
11
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 15 (Page No. 82)
Consider a computer system that has cache memory, main memory (RAM) and disk, and an operating system that uses virtual memory. It takes $1$ nsec to access a word from the cache, $10$ nsec to access a word from the RAM, and ... and main memory hit rate (after a cache miss) is $99\%$, what is the average time to access a word?
answered
in
Operating System
Jul 18, 2021
1.7k
views
tanenbaum
operating-system
virtual-memory
descriptive
2
answers
12
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 30 (Page No. 609)
Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 24 KB and the maximum segment size is 2 KB. How long does it take before the first full window can be sent?
commented
in
Computer Networks
Jul 16, 2021
766
views
computer-networks
tanenbaum
transport-layer
tcp
congestion-control
2
answers
13
Test by Bikram | Computer Organization and Architecture | Test 2 | Question: 20
Suppose there are $m$ instructions to be executed in a program. $p$ is the probability that an instruction is a conditional branch instruction, and $q$ is the probability of a successful branch. Assume the average number of instructions completed in a simple ... $pq (mn -1) + p( 1- q) mn$ $1 +pq ( n - 1)$ $p - pq$
answered
in
CO and Architecture
Jun 22, 2021
562
views
tbb-coa-2
pipelining
co-and-architecture
5
answers
14
GATE CSE 2013 | Question: 28
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence? Instruction fetch Operand fetch Conditional branch Initiation of interrupt service
answered
in
CO and Architecture
Jun 22, 2021
15.0k
views
gatecse-2013
co-and-architecture
microprogramming
normal
1
answer
15
Indexing
Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long,and a record pointer is P R =7 bytes long. A file has r=30,000 EMPLOYEE records of fixed-length. Each record size is fixed 50 bytes. Find out the no. Of block b requires .assuming an unspanned organization.
commented
in
Databases
Apr 27, 2021
960
views
indexing
1
answer
16
PIPELINING
Consider the following sequence of instructions executed on the five-stage pipelined processor: LW $1, 30($6) ADD $2, $4, $2 ADD $1, $3, $5 SW $2, 20($4) ADD $1, $1, $4 Assuming there is no forwarding, calculate the number of clock cycles needed to execute above program ?
commented
in
CO and Architecture
Mar 5, 2021
771
views
pipelining
computer-organisation
3
answers
17
Couting the number of reduce moves
The maximum number of reduce moves that can be taken by a bottom-up parser with no epsilon and unit productions to parse a string of length 3 tokens is ____ ?
commented
in
Compiler Design
Apr 7, 2020
799
views
compiler-design
context-free-grammar
compiler-tokenization
numerical-answers
3
answers
18
Progress guaranteed/Mutual Exclusion/Deadlock or not?
var occupied var blocked Enter Region: { If (occupied) { then blocked= blocked +1 sleep ( ); } else occupied= 1; } Exit Region: { occupied= 0 If (blocked) { then wakeup (process); blocked= blocked – 1; } } True/False (1) Mutual Exclusion is guaranteed? (2) Deadlock free Algorithm? (3) Progress is guaranteed?
commented
in
Operating System
Mar 1, 2020
2.4k
views
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
5
answers
19
GATE CSE 2014 Set 1 | Question: 16
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$? $\{q_0,q_1,q_2\}$ $\{q_0,q_1\}$ $\{q_0,q_1,q_2,q_3\}$ $\{q_3\}$
commented
in
Theory of Computation
Dec 19, 2019
14.8k
views
gatecse-2014-set1
theory-of-computation
finite-automata
easy
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:...