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 codingo1234
0
votes
0
answers
1
#SELF DOUBT(WEAK ENTITY IN DBMS)
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
246
views
asked
Apr 8, 2019
Databases
databases
self-doubt
+
–
0
votes
0
answers
2
APPLIED AI TEST 2
Consider the following memory Architecture of a Machine in the following Table Virtual Address 54 bits Page size 16K bytes PTE size 4 bytes Assume that there are 8 bits reserved for the Os functions(protection,valid, modified,and Hit/Miss-all overhead bits) other than required by the ... for the application data and code ? 2^26 byte 2^40 bytes 2^38- 2^26 bytes 2^40 - 2^38 bytes
Consider the following memory Architecture of a Machine in the following TableVirtual Address54 bitsPage size16K bytesPTE size4 bytesAssume that there are 8 bits reserved...
394
views
asked
Jan 9, 2019
Operating System
paging
+
–
0
votes
0
answers
3
SELF DOUBT GENERATING FUNCTION
Difference between getting closed form of generating function and closed form of the given sequence ,pls someone explain with an example
Difference between getting closed form of generating function and closed form of the given sequence ,pls someone explain with an example
312
views
asked
Dec 10, 2018
Combinatory
generating-functions
recurrence-relation
+
–
0
votes
0
answers
4
TESTBOOK TEST ,SET THEORY AND ALGEBRA
If irreflexive relations are represented as directed graphs, then the partitions of an equivalence relation manifest in form of __________. 1.Strongly connected component 2.Unilaterally connected component 3.Clique 4.None of these ans given is clique
If irreflexive relations are represented as directed graphs, then the partitions of an equivalence relation manifest in form of __________.1.Strongly connected component2...
177
views
asked
Dec 10, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
+
–
0
votes
1
answer
5
BFS TRAVERSAL
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
379
views
asked
Nov 21, 2018
Programming in C
breadth-first-search
algorithms
graph-algorithms
+
–
1
votes
0
answers
6
signed and unsigned integers
int main() { unsigned int a = 1000; int b = -1; if (a>b) printf("A is BIG! %d\n", a-b); else printf("a is SMALL! %d\n", a-b); return 0; } the answer to this question is "a is small,1001 " ... unsigned integer its value is MAX+ (-MAX+1001)=1001 3.The presence of "%d " in printf has no effect ,the result will be unsigned always
int main(){ unsigned int a = 1000;int b = -1;if (a>b) printf("A is BIG! %d\n", a-b);else printf("a is SMALL! %d\n", a-b); return 0;} the answer to this question is "a is ...
1.2k
views
asked
Nov 20, 2018
Programming in C
programming-in-c
+
–
1
votes
0
answers
7
BINARY MIN HEAP MADE EASY TEST
Consider a binary min heap given below containing integer in [1, 15]. The maximum number of node movement on 5 successive removal of element are ________.
Consider a binary min heap given below containing integer in [1, 15]. The maximum number of node movement on 5 successive removal of element are ________.
1.3k
views
asked
Nov 20, 2018
DS
min
binary-heap
+
–
0
votes
1
answer
8
Context free languages and Regular Languages
Let L be CFL and M a regular language. Language L ⋂ M is always (a) always regular (b) never regular (c) always DCFL (d) always context free language
Let L be CFL and M a regular language. Language L ⋂ M is always(a) always regular (b) never regular(c) always DCFL (d) always context free language
489
views
asked
Aug 20, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
3
votes
1
answer
9
Turing machines and Recursively enumerable languages
If L1 and L2 are Turing-Recognizable then L1 ∪ L2 will be (a) Decidable (b) Turing-recognizable but may not be decidable (c) May not be Turing recognizable (d) None of above
If L1 and L2 are Turing-Recognizable then L1 ∪ L2 will be(a) Decidable(b) Turing-recognizable but may not be decidable(c) May not be Turing recognizable(d) None of abov...
2.2k
views
asked
Aug 20, 2017
Theory of Computation
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
2
votes
1
answer
10
regular languages
Given that a language L = L1 ∪ L2, where L1 and L2 are two other languages. If L is known to be a regular language, then which of the following statements is necessarily TRUE? (a) If L1 is regular then L2 will also be regular (b) If L1 is regular and finite then L2 will be regular (c) If L1 is regular and finite the L2 will also be regular and finite (d) None of these
Given that a language L = L1 ∪ L2, where L1 and L2 are two other languages. If L is known to be a regular language, then which of the following statements is necessaril...
433
views
asked
Aug 20, 2017
Theory of Computation
theory-of-computation
regular-language
+
–
3
votes
1
answer
11
regular languages
A Language is said to be regular iff (a) There exists a Right Linear Regular Grammar for L (b) There exists a Left Linear Regular Grammar for L (c) There exists a nfa with single final state (d) There exists a dfa with single final state (e) There exists a nfa without ԑ - move Which are true? (i) All are true (b) a, b, c are true (c) a, b, c, e are true (d) a, b, d are true
A Language is said to be regular iff(a) There exists a Right Linear Regular Grammar for L(b) There exists a Left Linear Regular Grammar for L(c) There exists a nfa with s...
975
views
asked
Aug 20, 2017
Theory of Computation
theory-of-computation
regular-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
