Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Aks9639
0
votes
1
IDENTIFYING INHERENTLY AMBIGUOS GRAMMAR
How to identify if a grammar is inherently ambiguous grammar ??
How to identify if a grammar is inherently ambiguous grammar ??
755
views
answered
Mar 11, 2019
Theory of Computation
theory-of-computation
+
–
0
votes
2
ME TEST1
Match the following List 1 Link time load time compile time Run time List 2 A. Resolving references B. Relocation C. Token Recognition D. Activation record
Match the followingList 1Link timeload timecompile timeRun timeList 2 A. Resolving references B. Relocation C. Token Recognition D. Activation record
678
views
answered
Mar 10, 2019
Compiler Design
compiler-design
runtime-environment
match-the-following
made-easy-test-series
+
–
0
votes
3
MadeEasy WorkBook: Thoery of Computation - Finite Automata
800
views
answered
Feb 16, 2019
Theory of Computation
made-easy-booklet
theory-of-computation
finite-automata
+
–
0
votes
4
NIELIT 2018-44
Time to Live(TTL) field in the IP datagram is used ______ to optimize throughput to prevent packet looping to reduce delays to prioritize packets
Time to Live(TTL) field in the IP datagram is used ______to optimize throughputto prevent packet loopingto reduce delaysto prioritize packets
1.9k
views
answered
Feb 16, 2019
Computer Networks
nielit-2018
computer-networks
ttl
+
–
1
votes
5
NIELIT 2018-45
______ transport layer protocol is used to support electronic mail SNMP IP SMTP TCP
______ transport layer protocol is used to support electronic mailSNMPIPSMTPTCP
2.2k
views
answered
Feb 16, 2019
Computer Networks
nielit-2018
computer-networks
transport-layer
+
–
0
votes
6
Ace Test Series 2019: CO & Architecture - Hard Disk
474
views
answered
Feb 14, 2019
CO and Architecture
ace-test-series
co-and-architecture
disk
+
–
2
votes
7
Pointers in C programming.
For this statement->printf ("%s",*--*++cpp+3); What will be the order of precedence according to pointer arithmetic?
For this statement->printf ("%s",* *++cpp+3);What will be the order of precedence according to pointer arithmetic?
421
views
answered
Feb 10, 2019
0
votes
8
Grammar doubt
L is regular <=> there exists a linear grammar for L. Which way is it true and which way is it false? Please explain in detail
L is regular <= there exists a linear grammar for L. Which way is it true and which way is it false? Please explain in detail
414
views
answered
Feb 10, 2019
0
votes
9
cfg doubt
Is context free grammar linear grammar?
Is context free grammar linear grammar?
287
views
answered
Feb 10, 2019
0
votes
10
Cfg doubt
S→ aSb/epsilon is this linear grammar? I know it's a cfg but is it linear as well?
S→ aSb/epsilonis this linear grammar? I know it's a cfg but is it linear as well?
262
views
answered
Feb 10, 2019
0
votes
11
Madeeasy
Consider the following problems regarding decidability. I. Given a Turing Machine M, whether L(M) is context free. II. Given a Non-deterministic PDA P, whether there exists a Deterministic Turing Machine M such that both P and M accept the same language. III. Given a ... sure if turing machine will halt or not? or because whatever language accepted by TM is not CFG? as CFG is subset of TM.
Consider the following problems regarding decidability.I. Given a Turing Machine M, whether L(M) is context free.II. Given a Non-deterministic PDA P, whether there exists...
267
views
answered
Feb 8, 2019
0
votes
12
Minor Clarifications
OS: Which process scheduling mechanism gives the optimal average waiting time and throughput, is it SJF or SRTF? Which DISK scheduling algo gives the minimum seek time is it SSTF?
OS:Which process scheduling mechanism gives the optimal average waiting time and throughput, is it SJF or SRTF?Which DISK scheduling algo gives the minimum seek time is i...
396
views
answered
Feb 8, 2019
Operating System
scheduling
+
–
0
votes
13
EMAT in case of page fault
I have read that EMAT when the page fault occurs is =p(PS+MA)+(1-p)(MA) p is the probability of page fault i-p is the probability that page is present in Main Memory PS is the Page fault service time MA is the memory access time but according to me first it ... which is going to take one Memory access So,EMAT should be equals=p(MA+PS+MA)+(1-p)(MA+MA). why it is not so??
I have read that EMAT when the page fault occurs is =p(PS+MA)+(1-p)(MA)p is the probability of page faulti-p is the probability that page is present in Main MemoryPS is t...
1.5k
views
answered
Sep 7, 2018
Operating System
page-fault
operating-system
effective-memory-access
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register