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
Questions by humblefool
5
votes
0
answers
1
Query regarding P NP
I know this questions is already asked but no answers are yet given IS P NP STILL PRESENT IN GATE 2018 SYLLABUS? The Official Syllabus EXCLUDES those topics and according to https://gatecse.in/gate-cse-2016-syllabus/ , the P NP is NOT THERE. But ... verify it. And please dont say, "it is better to read" because although knowledge is good but time is precious :-)
I know this questions is already asked but no answers are yet givenIS P NP STILL PRESENT IN GATE 2018 SYLLABUS? The Official Syllabus EXCLUDES those topics and according ...
959
views
asked
Jan 6, 2018
Theory of Computation
p-np-npc-nph
theory-of-computation
syllabus
+
–
2
votes
0
answers
2
Microprogramming
In horizontal micro-programming the control word is of the following format: Flag bits Control Signal Bits Next Control Word Address I know that the Control Signal bits denote which micro-operation to execute. My question is does 1 bit of control ... that Scenario 2 is the correct one i.e. 1 control signal bit in horizontal microprogramming denotes 1 micro-operation entirely?
In horizontal micro-programming the control word is of the following format:Flag bitsControl Signal BitsNext Control Word AddressI know that the Control Signal bits denot...
719
views
asked
Jan 4, 2018
CO and Architecture
microprogramming
co-and-architecture
horizontal-microprogramming
+
–
0
votes
1
answer
3
Problem regarding mutual exclusion
Process P1 Process P2 P(S1) P(S1) P(S2) P(S2) Critical Section Critical Section V(S2) V(S1) V(S1) V(S2) In one of the Gateoverflow tests, this question was given and it was told that in the above case mutual exclusion is not ... section. As far as the order of unlocking, I dont see a problem there. Can someone please explain why mutual exclusion is not guaranteed?
Process P1Process P2P(S1)P(S1)P(S2)P(S2)Critical SectionCritical SectionV(S2)V(S1)V(S1)V(S2)In one of the Gateoverflow tests, this question was given and it was told that...
910
views
asked
Dec 13, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
semaphore
critical-section
+
–
1
votes
0
answers
4
Inherently Ambiguous Grammar
Is every language that is generated by a NDCFG (Non Deterministic Context Free Grammar) , CSG (Context Sensitive Grammar) and Unrestricted Grammar inherently ambiguous ? I think so because they dont have a DPDA accepting that language. And as far as I ... there are no "parse trees" as such. So how do I determine if the language is inherently ambiguous or not?
Is every language that is generated by a NDCFG (Non Deterministic Context Free Grammar) , CSG (Context Sensitive Grammar) and Unrestricted Grammar inherently ambiguous ?I...
1.4k
views
asked
Nov 17, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
context-free-language
+
–
1
votes
1
answer
5
Minimum DFA Construction
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states....
992
views
asked
Nov 16, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
3
votes
1
answer
6
Cut Sets in graph
Question: Number of cut sets possible a tree with 10 vertices _________ My approach : Number of edges in a tree with 10 vertices = 9. Each of these can be considered as a cut set as deleting one edge necessarily disconnects the graph. Also any combination (I mean ... cut sets = 2^9 - 1 = 511. But the answer is written 9. Apparently they are not considering the super sets. Why?
Question: Number of cut sets possible a tree with 10 vertices _________My approach : Number of edges in a tree with 10 vertices = 9. Each of these can be considered as a...
3.5k
views
asked
Nov 9, 2017
Graph Theory
engineering-mathematics
graph-theory
discrete-mathematics
cut
set-theory&algebra
+
–
0
votes
0
answers
7
Question regarding BCNF Normalization
I came across a statement that says that in BCNF, a prime attribute cannot be transitively dependent on a key. But consider a relation R (A, B, C) where, A --> ABC , B --> ABC , C --> ABC Clearly it is in BCNF and each of A ... > C . Thus, we can tell C(a prime attribute) is transitively dependent on A (a candidate key) !! Where am I making mistake?
I came across a statement that says that in BCNF, a prime attribute cannot be transitively dependent on a key.But consider a relation R (A, B, C) where, A ABC , ...
264
views
asked
Nov 8, 2017
Databases
bcnf-decomposition
bcnf
databases
candidate-key
+
–
0
votes
1
answer
8
Binary Tree construction
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong) Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong)Construct a binary...
1.2k
views
asked
Nov 7, 2017
DS
data-structures
algorithms
binary-search-tree
binary-tree
tree-traversal
+
–
2
votes
2
answers
9
Number of states in a minimal DFA construction
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting language L, then what is the number of states in M ? Is it nm or (n+1)(m+1) ?
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting la...
1.7k
views
asked
Nov 2, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
1
votes
1
answer
10
NIELIT Exam date
I have applied for NIELIT "Scientist B" post through http://apply-delhi.nielit.gov.in/. The last date for submission for online application was 22 September. However I don't know when the exam will be held. Neither the official website nor the internet has ... but they dont reply to any of the emails. If someone could tell me the date of the exam, it would be great.
I have applied for NIELIT "Scientist B" post through http://apply-delhi.nielit.gov.in/. The last date for submission for online application was 22 September. However I do...
602
views
asked
Oct 20, 2017
GATE
nielt
+
–
1
votes
1
answer
11
Number System
How do I calculate (-54)10 in hexadecimal? The way I am doing it currently is that I am first converting (54)10 into hexadecimal which is (34)16. Next I am taking 16's complement. i.e. I am doing (FF)16 - (34)16 + 1, which comes to (CA)16. Thus, (-54)10 = (CA)16. Is this the right way to convert or is there some better method ?
How do I calculate (-54)10 in hexadecimal? The way I am doing it currently is that I am first converting (54)10 into hexadecimal which is (34)16. Next I am taking 16's co...
1.1k
views
asked
Sep 25, 2017
Programming in C
number
system
digital-logic
+
–
0
votes
0
answers
12
Cannot understand a field while filling TIFR Online application
This is regarding TIFR Online application. I am unable to understand what value to enter in a particular field in the online application form for GS-2018. In the section under "Educational Details", there are 5 columns - ... etc). So what should I type in the Class column, provided that it is not accepting empty values ?
This is regarding TIFR Online application. I am unable to understand what value to enter in a particular field in the online application form for GS-2018. In the section ...
440
views
asked
Sep 15, 2017
Written Exam
admissions
general
+
–
8
votes
2
answers
13
OS PAGING William stallings
Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one page. How many levels of page tables required? Also find the size memory ... solution. I am weak in understanding these concepts. Answer for the first one is 3 and for the second one is 8208 bytes.
Consider a virtual memory system with 32-bit virtual addresses and 1 KB pages. Each page table entry requires 32- bits. It is desired to limit the page table size to one ...
9.3k
views
asked
Jul 19, 2017
Operating System
test-series
virtual-memory
operating-system
paging
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register