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 debasree88
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by debasree88
2
answers
1
Doubt on Write through
Consider the following specifications: Hit ratio for read = 0.8, Hit ratio for write = 0.9 Block size =2 words, cache of 10 ns is 10 times faster than main memory On any miss entire block is moved from main memory to cache memory 20% references are for write operations What is avg access time with write through using 1) Write allocate 2) No write allocate
commented
in
CO and Architecture
Jun 24, 2020
621
views
co-and-architecture
cache-memory
write-through
1
answer
2
The L2 and L3 cache memories are divided into a blocks of 5 words.
Suppose there is a system which has 3 levels of cache i.e L1, L2 and L3. The access times of L1, L2 and L3 cache memories are 100 ns/word, 150 ns/word, and 250 ns/word respectively. The L2 and L3 cache memories are divided ... are 80% and 90% respectively. What is the average access time? A. 103ns B. 108ns C. 220ns D. 112ns
commented
in
CO and Architecture
Jun 17, 2020
896
views
co-and-architecture
cache-memory
1
answer
3
MadeEasy Test Series 2019: CO & Architecture- Cache Memory
Consider a n-way cache with 'x blocks of 64 words each. The main memory of the system is having 8 million words. Size of the tag field is 16 bits and additional memory required for tags is 1024 bytes. What will be the values of n and x respectively? Answer 256 512
commented
in
CO and Architecture
Jun 17, 2020
1.2k
views
co-and-architecture
cache-memory
made-easy-test-series
2
answers
4
NIELIT 2016 DEC Scientist B (IT) - Section B: 35
What will be the final output of D flip-Flop if the input string is $0010011100$? $1$ $0$ Don’t Care None of the above
commented
in
Digital Logic
May 11, 2020
1.4k
views
nielit2016dec-scientistb-it
digital-logic
sequential-circuit
flip-flop
1
answer
5
Morris Mano Edition 3 Exercise 3 Question 24 (Page No. 112)
A logic circuit implements the following Boolean function: F = A’C + AC’D’ it is found that the circuit input combination A=C=1 can never occur. Find a simpler expression for F using the proper don't-care conditions.
commented
in
Digital Logic
May 1, 2020
2.0k
views
digital-logic
morris-mano
boolean-algebra
simplification
k-map
5
answers
6
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224
commented
in
Computer Networks
Apr 25, 2020
3.3k
views
computer-networks
3
answers
7
MadeEasy Test Series: Computer Networks - Subnetting
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the first host of first subnet (represent last octet) is ________. my question is that whether to take 1st host as '000' ... be 000,so accordingly answer will be 200.99.39.00000001..ANSWER=1 but they had taken 200.99.39.00100001..ANSWER=33
commented
in
Computer Networks
Apr 22, 2020
880
views
made-easy-test-series
computer-networks
subnetting
1
answer
8
Made Easy
What will be subnet for all and also their DBA's???
answer edited
in
Computer Networks
Apr 22, 2020
308
views
made-easy-test-series
computer-networks
subnetting
bad-question
0
answers
9
Consider 2 stations at a distance of 1 km from each other (Aloha)
Consider 2 stations at a distance of 1 km from each other. A station transmits frames of length 100 bits at the rate of 1 Mbps. Velocity of propagation is 2 * 108 m/s. Assume that each station generates frames at an average rate of 10000 frames per second. What is the probability of collision for pure ALOHA and slotted ALOHA ?
commented
in
Computer Networks
Apr 22, 2020
486
views
slotted-aloha
pure-aloha
3
answers
10
Let a cluster of stations share 48 Kbps of pure Aloha channel. Every station outputs frames of length 1024 bits on an average of every 50 seconds. Then what is the maximum value of number of stations?
commented
in
Computer Networks
Apr 22, 2020
4.6k
views
pure-aloha
1
answer
11
A Pure Aloha transmits 200 bits frame on a shared channel of 200 kbps.What is time required to make Collision free?
commented
in
Computer Networks
Apr 22, 2020
5.3k
views
pure-aloha
computer-networks
3
answers
12
What is the effect on line utilization, if we increase the number of frames for a constant message size?
commented
in
Computer Networks
Apr 22, 2020
2.6k
views
computer-networks
sliding-window
2
answers
13
Kenneth Rosen Edition 7 Exercise 2.5 Question 40 (Page No. 177)
Show that if $S$ is a set, then there does not exist an onto function $f$ from $S$ to $P(S),$ the power set of $S$. Conclude that $\mid S\mid < \mid P(S)\mid .$ This result is known as Cantor's theorem. [Hint: Suppose such a function ... $s$ can exist for which $f (s) = T.]$
answered
in
Set Theory & Algebra
Apr 22, 2020
437
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
descriptive
1
answer
14
NIELIT 2016 MAR Scientist B - Section C: 4
In a ripple counter using edge triggered $JK$ flip-flops, the pulse input is applied to the clock input of all flip-flops clock input of one flip-flop $J$ and $K$ inputs of all flip-flops $J$ and $K$ inputs of one flip flop
commented
in
Digital Logic
Apr 18, 2020
1.6k
views
nielit2016mar-scientistb
digital-logic
sequential-circuit
flip-flop
5
answers
15
NIELIT 2016 DEC Scientist B (IT) - Section B: 45
Which will be the equation of simplification of the given K-map? $AB' + B'CD' + A'B'C'$ $AB' + A'B'D' + A'B'C'$ $B'D' + AB' + B'C'$ $B'D' + A'B'C' + AB'$
commented
in
Digital Logic
Apr 18, 2020
904
views
nielit2016dec-scientistb-it
digital-logic
boolean-algebra
k-map
3
answers
16
relation
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$
answered
in
Set Theory & Algebra
Apr 18, 2020
44.0k
views
set-theory&algebra
relations
3
answers
17
B+ Tree Records
answer edited
in
Databases
Apr 15, 2020
1.6k
views
databases
b-tree
bplustrees
2
answers
18
NIELIT 2016 DEC Scientist B (CS) - Section B: 45
What will be the equation of the given K-map? $A’B’D’+C’D+AB’C’$ $B’CD’+AB’C’+A’C’$ $B’D’+C’D$ $C’D+B’CD’$
answered
in
Digital Logic
Apr 15, 2020
503
views
nielit2016dec-scientistb-cs
digital-logic
k-map
minimization
3
answers
19
NIELIT 2016 DEC Scientist B (IT) - Section B: 33
How many inputs are required in Full Adder Circuit? $2$ $3$ More than two inputs None of the above
answered
in
Digital Logic
Apr 15, 2020
701
views
nielit2016dec-scientistb-it
digital-logic
combinational-circuit
adder
2
answers
20
NIELIT 2016 MAR Scientist B - Section C: 3
The output of a sequential circuit depends on present inputs only past inputs only both present and past inputs present outputs only
answered
in
Digital Logic
Apr 15, 2020
647
views
nielit2016mar-scientistb
digital-logic
sequential-circuit
1
answer
21
Morris Mano Edition 3 Exercise 2 Question 18 (Page No. 71)
Show that the Dual of the Exclusive OR is equal to its complement.
answered
in
Digital Logic
Apr 13, 2020
536
views
digital-logic
morris-mano
boolean-algebra
5
answers
22
GATE CSE 2011 | Question: 30
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$ ... always true irrespective of the value of $x$ $P(x)$ being true means that $x$ has exactly two factors other than $1$ and $x$
commented
in
Mathematical Logic
Apr 9, 2020
10.6k
views
gatecse-2011
mathematical-logic
normal
first-order-logic
1
answer
23
B+ tree
The minimum number of keys in a B+ tree is 3. The maximum number of keys in any non root node is ____.
commented
in
Databases
Mar 24, 2020
2.1k
views
4
answers
24
GATE CSE 1997 | Question: 1.10
Heap allocation is required for languages. that support recursion that support dynamic data structure that use dynamic scope rules None of the above
commented
in
Compiler Design
Jan 29, 2020
5.7k
views
gate1997
compiler-design
easy
runtime-environment
1
answer
25
GATE CSE 1997 | Question: 1.8
A language $L$ allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true? A compiler using static memory allocation can be written for $L$ A compiler ... $L$; an interpreter must be used A compiler using dynamic memory allocation can be written for $L$ None of the above
commented
in
Compiler Design
Jan 29, 2020
3.7k
views
gate1997
compiler-design
easy
runtime-environment
3
answers
26
Number of nodes of distinct degree
In a simple connected undirected graph with n nodes(where n≧2), The maximum number of nodes with distinct degrees is n-1 n-2 n-3 2
answered
in
Graph Theory
Oct 31, 2019
2.5k
views
graph-theory
graph-connectivity
3
answers
27
GATE CSE 1993 | Question: 8.2
The proposition $p \wedge (\sim p \vee q)$ is: a tautology logically equivalent to $p \wedge q$ logically equivalent to $p \vee q$ a contradiction none of the above
commented
in
Mathematical Logic
Aug 29, 2019
7.0k
views
gate1993
mathematical-logic
easy
propositional-logic
1
answer
28
How it works. Please give some example.
Consider the following foo function and identify the return value of foo function. int foo (unsigned int n) { int c, x = 0; while (n! = 0) { if (n & 01) x++; n >>= 1; } return x; } (a) It counts the total number of bits ... counts the number of bits which are zero. (c) It counts the number of occurrences of 01. (d) It returns the same value as n'.
answered
in
Programming
Aug 14, 2019
416
views
4
answers
29
C Program Output and Explaination
void fun(int *p) { int q = 10; p = &q; z } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
commented
in
Programming
Jul 26, 2019
1.2k
views
programming-in-c
3
answers
30
increment and decrement operators
#include <stdio.h> void main() { int a = 3; int b = ++a + a++ + --a; printf("Value of b is %d", b); } after compiling on gcc compiler it gives 11.will you explain how is it possible?
commented
in
Programming
Jul 25, 2019
1.4k
views
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...