Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
mcjoshi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by mcjoshi
29
votes
1
answer
1
Doubt regarding minimum FF's required?
In previous two year's a question has been asked for finding number of flip flop's for counting sequence $\color{navy}{0-1-0-2-0-3}$ in 2016 and $\color{navy}{0-0-1-1-2-2-3-3-0-0}$ in 2015. But still, the approach discussed in these questions hasn't arrived at Common answer ( ... $2). 0-1-0-2-0-2-0-3-0-2-...$ $3). 1-2-3-0-0-1-0-2-2-...$
In previous two year's a question has been asked for finding number of flip flop's for counting sequence $\color{navy}{0-1-0-2-0-3}$ in 2016 and $\color{navy}{0-0-1-1-2-2...
2.5k
views
asked
Nov 12, 2016
Digital Logic
digital-logic
digital-counter
+
–
4
votes
1
answer
2
TestBook Test Series: Compiler Design - Syntax Directed Translation
$Q_1 \Rightarrow$ For synthesized attribute, value is only computed when symbol is on the _____ side of production. For inherited attribute, value is computed in productions where symbol is on the _____ side. $1.$ Left, Right $2.$ ... $b).$ Search where the function is called $c).$ Refers to global variable $d).$ None of these
$Q_1 \Rightarrow$ For synthesized attribute, value is only computed when symbol is on the _____ side of production. For inherited attribute, value is computed in producti...
1.3k
views
asked
Nov 11, 2016
Compiler Design
testbook-test-series
compiler-design
syntax-directed-translation
+
–
1
votes
1
answer
3
TestBook Test Series: Compiler Design - Grammar
Which statement is/are true ? $a). $Using a top-down Translation scheme, we can implement any L-attributed definition based on LL(1) grammar. $b).$ Using a bottom-up Translation scheme, we can implement any L-attributed definition ... Translation scheme, we can implement any L-attributed definition based on LR(1) grammar. $d).$ None of above follows
Which statement is/are true ?$a). $Using a top-down Translation scheme, we can implement any L-attributed definition based on LL(1) grammar.$b).$ Using a bottom-up Transl...
603
views
asked
Nov 11, 2016
Compiler Design
testbook-test-series
compiler-design
syntax-directed-translation
+
–
1
votes
1
answer
4
Ace Test Series: Compiler Design - Grammar
887
views
asked
Nov 10, 2016
Compiler Design
ace-test-series
compiler-design
grammar
+
–
2
votes
1
answer
5
Testbook :
$S_1 :$ Recursive decent parser takes more time and less space. $S_2 :$ LL(1) Parser takes more time and more space. $S_3 :$ LL(1) Parser takes less time and less space. $S_4 :$ Recursive descent Parser takes more time and more space. a). (1) and (2) is ... and (3) is correct. Ques2: Consider $2^{nd}$ production as $\tt A \rightarrow Bc|dA|\epsilon$ (I think answer given is wrong)
$S_1 :$ Recursive decent parser takes more time and less space.$S_2 :$ LL(1) Parser takes more time and more space.$S_3 :$ LL(1) Parser takes less time and less space.$S_...
837
views
asked
Nov 10, 2016
Compiler Design
compiler-design
parsing
testbook-test-series
+
–
5
votes
1
answer
6
CD Doubt:
Please Provide valid explanation in support of your answer.
Please Provide valid explanation in support of your answer.
682
views
asked
Nov 9, 2016
Compiler Design
compiler-design
syntax-directed-translation
descriptive
test-series
+
–
2
votes
1
answer
7
Self Doubt
I came across few Compiler Design Doubts, Please provide your cent. $Q_1 :$ Can lexical analyser detect some/any type of errors? I think yes, because while scanning to identify tokens, it may be the cases that a string pattern doesn't match with any keyword (or) ... Left linear) $\color{navy}{A \rightarrow aA}$(Right Linear). What can be said about $\color{navy}{A \rightarrow aAb}$
I came across few Compiler Design Doubts, Please provide your cent.$Q_1 :$ Can lexical analyser detect some/any type of errors?I think yes, because while scanning to iden...
1.0k
views
asked
Nov 1, 2016
Compiler Design
compiler-design
lexical-analysis
variable-scope
+
–
4
votes
1
answer
8
Ace Test Series: Theory Of Computation - Finite Automata
872
views
asked
Oct 17, 2016
Theory of Computation
ace-test-series
theory-of-computation
finite-automata
+
–
4
votes
1
answer
9
MadeEasy Test Series: Theory Of Computation - Regular Expressions
Consider the following statements: S1: Infinite language with finite dependency is always regular. S2: Regular expression 01*0 represent an infinite set of finite strings. Which of the following is True about S1 and S2? a). only S1 is True b). only S2 is True c). both S1 and S2 are True d). both S1 and S2 are False
Consider the following statements:S1: Infinite language with finite dependency is always regular.S2: Regular expression 01*0 represent an infinite set of finite strings.W...
2.5k
views
asked
Oct 17, 2016
Theory of Computation
made-easy-test-series
theory-of-computation
regular-expression
+
–
4
votes
1
answer
10
File system :
Consider a UNIX-like file system implemented with i-nodes that resides on a disk of size $512\text GB$. Each i-node has a total of $15$block addresses consisting of direct and indirect lock addresses. Suppose we configure the file system to use a block size of $32$KB. How many bytes ... all $15$ block addresses in an I-node? a). $15$ Bytes b). $29$ Bytes c). $45$ Bytes d). $75$ Bytes
Consider a UNIX-like file system implemented with i-nodes that resides on a disk of size $512\text GB$. Each i-node has a total of $15$block addresses consisting of direc...
1.2k
views
asked
Oct 11, 2016
Unknown Category
operating-system
inode
file-system
+
–
2
votes
1
answer
11
Semaphores:
Assume that you have a semaphore associated with each item on a doubly linked list. Using No other synchronization primitive, What is the fewest number of semaphore that you must acquire for any operation (lookup, insert, delete) ?
Assume that you have a semaphore associated with each item on a doubly linked list. Using No other synchronization primitive, What is the fewest number of semaphore that ...
1.2k
views
asked
Oct 11, 2016
Operating System
operating-system
semaphore
linked-list
+
–
2
votes
2
answers
12
ACE test series(OS):
Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16$bits. What is the size of outer page table size ? a). $4GB$ b). $8GB$ c). $32MB$ d). $32GB$
Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16...
2.4k
views
asked
Oct 9, 2016
Operating System
test-series
operating-system
memory-management
bad-question
+
–
2
votes
2
answers
13
MadeEasy Test Series: Operating System - File System
Which of the following statements are true? S1 : Using a larger block size in fixed block size file system leads to better disk throughput but poor disk space utilization. S2 : In index allocation of block to a file, the maximum possible size of file ... size of the address of blocks. a).Only S1 b).Only S2 c).Both S1 and S2 d).Neither S1 nor S2
Which of the following statements are true?S1 : Using a larger block size in fixed block size file system leads to better disk throughput but poor disk space utilization....
2.0k
views
asked
Oct 5, 2016
Operating System
made-easy-test-series
operating-system
file-system
+
–
4
votes
1
answer
14
ACE booklet -II, Page no-66,Q.15
In a cache organized memory there exist $30$% of compulsory misses, $10$% capacity misses, $12$% conflict misses. If cache is fully associative Find the average access time? ($t_{c} = 10ns$, $t_{m} = 100ns$) a). $10ns$ b). $40ns$ c). $50ns$ d). $62ns$
In a cache organized memory there exist $30$% of compulsory misses, $10$% capacity misses, $12$% conflict misses. If cache is fully associative Find the average access ti...
932
views
asked
Sep 23, 2016
CO and Architecture
cache-memory
hit-latency
co-and-architecture
+
–
8
votes
2
answers
15
DLC :
Five soldiers A, B, C, D and E volunteer to perform an important military task if their following conditions are satisfied (i) either A or B or both must go (ii) either C or E but both must not go (iii) either both A and C go or neither goes (iv) If D' goes, then ... combination of soldiers who can get the arrangement will be a). $ADE$ b). $BD(C + E)$ c). $AC$ d). $ABCD'E'$
Five soldiers A, B, C, D and E volunteer to perform an important military task if their following conditions are satisfied(i) either A or B or both must go(ii) either C o...
3.2k
views
asked
Sep 20, 2016
Digital Logic
digital-logic
minimal-cover
boolean-algebra
+
–
7
votes
3
answers
16
OS (test series )
Consider a disk with 80 GB. The size of disk block is 8 kB. Number of blocks needed to keep track of free space if the disk is initially empty by using bit map method is _____
Consider a disk with 80 GB. The size of disk block is 8 kB. Number of blocks needed to keep track of free space if the disk is initially empty by using bit map method is ...
1.4k
views
asked
Sep 20, 2016
Operating System
test-series
operating-system
file-system
+
–
1
votes
1
answer
17
MadeEasy Test Series: Operating System - File System
In particular Unix OS, each data block is 256 bits, each node has 4 direct data block addresses and 3 additional addresses: One for single indirect block, one for double indirect block and one for triple indirect block. Each block is addressed with 64-bit. The total size of a file possible in the file system (in k-bits) is________.
In particular Unix OS, each data block is 256 bits, each node has 4 direct data block addresses and 3 additional addresses: One for single indirect block, one for double ...
551
views
asked
Sep 17, 2016
Operating System
made-easy-test-series
operating-system
file-system
+
–
7
votes
1
answer
18
MadeEasy Test Series 2017: Operating System - Process Schedule
As Operating system uses round robin process scheduling algorithm. Consider the execution times for the following processes. ... execution in one cycle only". If this statement is neglected then definitely answer is $5$ ( simple RR algorithm)
As Operating system uses round robin process scheduling algorithm. Consider the execution times for the following processes.$\begin{array}{|c|cl|}\hline \text{Process Id...
631
views
asked
Sep 17, 2016
Operating System
made-easy-test-series
operating-system
process-scheduling
+
–
3
votes
0
answers
19
Logic behind finding delays in combinational Circuits ?
I find it difficult to solve the problems related to finding delays in combinational circuits. What should be the proper approach to solve such questions ? Some questions :Question1 Question2 Question3 Please provide a detailed way to do that.
I find it difficult to solve the problems related to finding delays in combinational circuits. What should be the proper approach to solve such questions ?Some questions ...
573
views
asked
Sep 6, 2016
Digital Logic
digital-logic
combinational-circuit
digital-circuits
+
–
1
votes
3
answers
20
Evaluate the following definite integral ?
Evaluate the following definite integral : $\int \limits_0^1 \log \left(\frac{1}{x} - 1 \right)$
Evaluate the following definite integral :$\int \limits_0^1 \log \left(\frac{1}{x} - 1 \right)$
1.2k
views
asked
Sep 4, 2016
Calculus
integration
calculus
engineering-mathematics
integrals
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register