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 Deep Learner
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Deep Learner
11
answers
1
GATE CSE 2019 | Question: 45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec.
commented
in
CO and Architecture
Feb 7, 2019
15.9k
views
gatecse-2019
numerical-answers
co-and-architecture
cache-memory
2-marks
5
answers
2
GATE 2019
Let U = {1, 2, ..., n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following two statements for |A|. (i) |A| = n*$\small 2^{n-1}$ (ii) |A|= Sigma(k=1 to n) k.(nCk) Which of the following is correct? (a) (i) only (b) (ii) only (c) Both (i) and (ii) (d) None of the above
commented
in
Set Theory & Algebra
Feb 5, 2019
10.9k
views
2
answers
3
Set associative mapping
What is the number of multiplexers required in set associative mapping hardware ? Given set bits are S, tag bits are T and word bits are W.
answered
in
CO and Architecture
Oct 19, 2018
454
views
co-and-architecture
cache-memory
multiplexer
0
answers
4
TOC : Minimum State in Finite Automata ( virtualgate )
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is given by How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5. Ans is 5 or 20?
commented
in
Theory of Computation
Oct 12, 2018
270
views
theory-of-computation
finite-automata
minimal-state-automata
number-of-states
1
answer
5
Test by Bikram | Theory of Computation | Test 1 | Question: 25
If all the strings of a language can be enumerated in $\text{lexicographic}$ order, then this is an example of a _______ language. Regular CFL but need not be regular CSL but need not be a CFL Recursive but need not be a CSL
commented
in
Theory of Computation
Oct 9, 2018
375
views
tbb-toc-1
2
answers
6
Count the no of various Gates required in Carry Generator and look ahead adder
Count the 2 Input And, OR and EX-OR gates required in Carry Generator and Look ahead adder. Note :- In the question it is asking about 2 input, not multiple input, for Multiple input AND gates in n bit carry generator we require (n(n+1))/2 and OR Gates n.
answered
in
Digital Logic
Aug 31, 2018
969
views
digital-logic
carry-generator
look-ahead-adder
0
answers
7
#carry look ahead adder
If only two input and or gates are used in carry look ahead adder What is the time complexity for addition.
asked
in
Digital Logic
Aug 31, 2018
110
views
1
answer
8
Test by Bikram | Operating Systems | Test 2 | Question: 18
Consider a system with five processes $P0$ to $P4$ and three resources $R1$, $R2$ and $R3$, each having $10, \ 5, \ 7$ instances respectively. The system table at time $T0$ ... $P1, P4, P2, P3, P0$ $P3, P1, P2, P4, P0$ $P1, P4, P3, P0, P2$
commented
in
Operating System
Aug 27, 2018
364
views
tbb-os-2
3
answers
9
GATE Overflow | Data Structures | Test 1 | Question: 27
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
commented
in
DS
Jul 27, 2018
391
views
go-ds-1
data-structures
graph-theory
numerical-answers
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.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2