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 Crackca
0
votes
0
answers
1
ToC Test series doubt(ACE)
I am getting A,C and D but the answer given is A,C.
I am getting A,C and D but the answer given is A,C.
276
views
asked
Jan 5, 2022
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
2
#ACE test series
The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} with a single variable is______.
The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} with a single variable is______.
1.2k
views
asked
Jan 1, 2022
Theory of Computation
theory-of-computation
+
–
1
votes
1
answer
3
Gate@Zeal test series
Here each resource have a single instance, we can check whether a given system is safe or not is by checking whether there exists a cycle or not, To detect cycle in the graph, the most efficient algorithm is the DFS, So, Time complexity should be O(m+n), ... approximately equals to the number of vertices. But the answer given is O(m*n^2). Can anyone explain how O(m*n^2)?
Here each resource have a single instance, we can check whether a given system is safe or not is by checking whether there exists a cycle or not, To detect cycle in the g...
1.0k
views
asked
Dec 3, 2021
Operating System
operating-system
test-series
+
–
0
votes
0
answers
4
Operating System Doubt
Page miss is not the same as page fault. Miss means, the page that the CPU looking for is not present in TLB, but it will present in the page table this is called a miss. Page fault means, when we use demand paging then the page for which CPU looking is not present inside MM then it is called a page fault. Please verify someone.
Page miss is not the same as page fault.Miss means, the page that the CPU looking for is not present in TLB, but it will present in the page table this is called a miss.P...
294
views
asked
Nov 30, 2021
Operating System
operating-system
+
–
0
votes
2
answers
5
Gate@Zeal Test series
How to calculate the sizeof(arr2)?
How to calculate the sizeof(arr2)?
527
views
asked
Nov 28, 2021
Programming in C
test-series
+
–
0
votes
1
answer
6
Data structure: hashing
A hash table has spaces for 50 records. Then the probability of collision before the table is 10% full is_______. 10% of 50 = 5, so we need to find the probability of collision before we insert 5 slots. *When hash table empty, prob. of ... no. of slots = 200 then probability = 0.95 Why probability of collision is increasing very rapidly? Please give a detailed explanation.
A hash table has spaces for 50 records. Then the probability of collision before the table is 10% full is_______.10% of 50 = 5, so we need to find the probability of coll...
898
views
asked
Nov 22, 2021
DS
hashing
data-structures
+
–
0
votes
1
answer
7
#timecomplexity
We are having 4 sorted sub-lists of size n/4, What is the time complexity to merge them in a single sorted list?
We are having 4 sorted sub-lists of size n/4, What is the time complexity to merge them in a single sorted list?
308
views
asked
Nov 20, 2021
Algorithms
time-complexity
algorithms
+
–
0
votes
0
answers
8
#DBMS #E-R diagram
Can anyone verify this? What is the minimum number of tables required in the given situation? Assume there are two entities E1 containing attributes A1 and A2 and E2 containing attributes B1 and B2 attributes respectively, and between E1 and E2 relationship is R, which contains attribute C.
Can anyone verify this?What is the minimum number of tables required in the given situation?Assume there are two entities E1 containing attributes A1 and A2 and E2 contai...
417
views
asked
Oct 19, 2021
Databases
databases
er-diagram
+
–
1
votes
2
answers
9
#compiler-design
Which of the following statements are true. Please give a detailed explanation. 1) If the given grammar is not operator grammar then we can’t design an operator precedence table and there doesn’t exist an operator precedence parser. 2) If the given grammar is operator grammar then it is guaranteed that there exists an operator precedence parser.
Which of the following statements are true. Please give a detailed explanation.1) If the given grammar is not operator grammar then we can’t design an operator precede...
781
views
asked
Sep 19, 2021
Compiler Design
compiler-design
operator-grammar
operator-precedence
+
–
3
votes
1
answer
10
#compiler-design
Design predictive parsing table for below grammar. How many multiple entries are there? S → AA | ab A → Bd | ε B → SB | d
Design predictive parsing table for below grammar.How many multiple entries are there?S → AA | abA → Bd | εB → SB | d
625
views
asked
Sep 18, 2021
Compiler Design
compiler-design
parsing
numerical-answers
+
–
0
votes
1
answer
11
#mathematics
What is the difference between Integration and Summation? Which one produces a greater value in the same range?
What is the difference between Integration and Summation?Which one produces a greater value in the same range?
375
views
asked
Sep 14, 2021
Calculus
integration
+
–
0
votes
1
answer
12
#theory-of-computation
If L1 = {a^nb^nc^md^m | n,m>=0} L2 = {a^nb^n | n>=0} L3 = {c^md^m | m>=0} Then L1 – L2.L3(concatenation) is? Regular CSL CFL REL(recursive enumerable)
If L1 = {a^nb^nc^md^m | n,m>=0}L2 = {a^nb^n | n>=0}L3 = {c^md^m | m>=0}Then L1 – L2.L3(concatenation) is?RegularCSLCFLREL(recursive enumerable)
348
views
asked
Sep 13, 2021
Theory of Computation
theory-of-computation
+
–
0
votes
3
answers
13
#linkedlist #pointers #datastructure
Suppose you have a singly Linked List of n nodes and you want to insert a node in the middle of the Linked List, At least how many pointers do you need to handle to perform this task?
Suppose you have a singly Linked List of n nodes and you want to insert a node in the middle of the Linked List, At least how many pointers do you need to handle to perfo...
992
views
asked
Sep 9, 2021
0
votes
0
answers
14
#algorithms #databases
What is the worst-case time complexity to find attribute closure of a set of elements? i.e. Let find attribute closure for {AB}+ R(A,B,C,D,E,F,G,H,I,….. up to k time) { A → BC B → DE D → F F → GHI . . . and so on up to k functional dependencies... } My answer is O(k^k). Please verify someone.
What is the worst-case time complexity to find attribute closure of a set of elements?i.e. Let find attribute closure for {AB}+R(A,B,C,D,E,F,G,H,I,….. up to k time){A �...
159
views
asked
Sep 6, 2021
Algorithms
algorithms
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register