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 Raju2021
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Raju2021
0
votes
1
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 14 (Page No. 82)
A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute?
answered
in
CO and Architecture
May 30, 2020
1.7k
views
tanenbaum
operating-system
machine-instruction
pipelining
descriptive
0
votes
2
Pipeline Execution time
The instruction pipeline of RISC processor has 200 instructions in which 100 are performing addition, 25 performing division and 75 are performing multiplications, where Excution state for addition take 1 clock cycle, multiplication take 3 clock cycles ... control hazard. The number of clock cycles required for execution of sequence of instructions are ________. Ans. 454
answered
in
CO and Architecture
May 30, 2020
3.4k
views
co-and-architecture
pipelining
0
votes
3
Topic: virtual memory.
Suppose the average page fault service time is 20 milliseconds and memory access time is 200 nanoseconds. Assuming we wish to have less than 10% degradation in memory access when a page fault occurs estimate the value of the fault rate must be less than.
answered
in
Operating System
Apr 28, 2020
811
views
operating-system
virtual-memory
0
votes
4
CFL or CSL
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$ How do we prove that this language is not CFL.
answered
in
Theory of Computation
Apr 7, 2020
1.8k
views
theory-of-computation
context-free-language
context-sensitive-languages
0
votes
5
theory of computtion
find regular expression of 1. S-> 01A/10B A->0B/1 B->1A/0 and 2. A->A00 /A1/0 3. S->baS/aA A->bbA/bb
answered
in
Theory of Computation
Apr 3, 2020
481
views
regular-expression
grammar
0
votes
6
REGULAR EXPRESSION - Inverse homomorphism
Let r = (10 + 0) * 11(0 + 1) * be a regular expression for the regular language L and let h(0) = ab and h(1) = ba a homomorphism. What is a regular expression for h(L)? How about h −1 (L′) if L′ is given by the regular expression r ′ = (ab + a) * bb(a + b) *?
answered
in
Theory of Computation
Mar 27, 2020
744
views
theory-of-computation
regular-expression
regular-language
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:...