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
Recent activity by Poonam Gupta 1
2
answers
1
Operating System Paging ISI
A 32-bit machine has a page/frame size of 1 KB. (i) What is the size of the complete first-level (primary) page table for a process? (ii) If page tables are also stored using paging, how many levels of paging will be required?
A 32-bit machine has a page/frame size of 1 KB.(i) What is the size of the complete first-level (primary) page table for a process?(ii) If page tables are also stored usi...
723
views
answered
Apr 17, 2018
Operating System
operating-system
paging
memory-management
+
–
5
answers
2
MadeEasy Test Series: Theory Of Computation - Identify Class Language
If L1 = { a^n | n ≥ 0 } and L2 = { b^n | n ≥ 0 }, Consider then L1 . L2 wil be a) (ab)^n b) a^n b^n c) b^n a^n d)b^m a^n e) { a^m b^n | m ≥ 0, n ≥ 0 } why answer is d why not b ????
If L1 = { a^n | n ≥ 0 } and L2 = { b^n | n ≥ 0 }, Considerthen L1 . L2 wil bea) (ab)^nb) a^n b^nc) b^n a^nd)b^m a^ne) { a^m b^n | m ≥ 0, n ≥ 0 }why answer is d w...
875
views
answered
Mar 22, 2018
Theory of Computation
theory-of-computation
made-easy-test-series
identify-class-language
+
–
1
answer
3
theory of computation
Let $L=\{w \in \{0,1\}^∗\mid \text{number of occurences of }(110)=\text{number of occurences of } (011)\}$ What is $L$?
Let $L=\{w \in \{0,1\}^∗\mid \text{number of occurences of }(110)=\text{number of occurences of } (011)\}$What is $L$?
670
views
answered
Mar 22, 2018
Theory of Computation
theory-of-computation
regular-expression
+
–
2
answers
4
Digital logic design
How many Boolean functions of three variables $\textsf{f(x,y,z)}$ have the property that $\textsf{f(x,y,z)=(f(x’,y’,z’))}$? $64$ $16$ $256$ $8$
How many Boolean functions of three variables $\textsf{f(x,y,z)}$ have the property that $\textsf{f(x,y,z)=(f(x’,y’,z’))}$?$64$$16$$256$$8$
759
views
answered
Mar 20, 2018
Digital Logic
digital-logic
digital-circuits
boolean-algebra
+
–
2
answers
5
Uploading gate score in Barc
Hey everyone..I've opted for both online test as well as as gate score entry in barc entrance.I do not have a very good gate score.So is it necessary to upload it in this case??Any help would be seriously appreciated especially by someone who has been through similar situation.
Hey everyone..I've opted for both online test as well as as gate score entry in barc entrance.I do not have a very good gate score.So is it necessary to upload it in this...
4.3k
views
answered
Mar 20, 2018
1
answer
6
BARC CS 2018
What is the difficulty level of BARC online exam for CS ?
What is the difficulty level of BARC online exam for CS ?
1.5k
views
answered
Mar 20, 2018
3
answers
7
barc test series
Consider the following two ambigious context free grammars. Which of the above ambigious CFG’s has an equivalent unambiguous CFG I only II only Both I and II Neither I nor II
Consider the following two ambigious context free grammars. Which of the above ambigious CFG’s has an equivalent unambiguous CFGI onlyII onlyBoth I and IINeither I nor ...
711
views
answered
Mar 20, 2018
2
answers
8
MadeEasy Test Series: Theory Of Computation
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none
(a^n)^m b^n where n>=0 and m>1 isa) regularb) cflc) csld) none
634
views
answered
Feb 14, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
context-free-language
context-sensitive-languages
+
–
4
answers
9
Regular Expression
Can I write $a^* + b^* = (a + b)^*$ ????
Can I write $a^* + b^* = (a + b)^*$ ????
953
views
answered
Feb 13, 2018
Theory of Computation
regular-expression
theory-of-computation
+
–
1
answer
10
Regular expression
S -> AaB A -> aC | $\epsilon$ B -> aB | bB | $\epsilon$ C -> aCb | $\epsilon$ Is the regular expression for the above is this: a(a + b)* a ( a* + b* )* ?
S - AaBA - aC | $\epsilon$B - aB | bB | $\epsilon$C - aCb | $\epsilon$Is the regular expression for the above is this:a(a + b)* a ( a* + b* )* ?
1.2k
views
answered
Feb 13, 2018
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
11
doubt
How many total numbers of substrings are possible out of the string abbbccd ? can i apply [n(n+1)/2 +1 ] here ?
How many total numbers of substrings are possible out of the string abbbccd ?can i apply [n(n+1)/2 +1 ] here ?
406
views
answered
Sep 24, 2017
Theory of Computation
theory-of-computation
+
–
3
answers
12
Find Regular Expression of this DFA
Whenever there are 2 final states, I don't get how to solve it, kindly explain once and for all in a detailed manner! I'll owe you a lot.
Whenever there are 2 final states, I don't get how to solve it, kindly explain once and for all in a detailed manner! I'll owe you a lot.
3.5k
views
commented
Aug 19, 2017
Theory of Computation
regular-expression
theory-of-computation
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register