Register

Textbook

347 views
1 votes
1 votes

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

587
views
2 answers
0 votes
Pratik.patil asked Aug 31, 2023
587 views
Ace DBMS Textbook
Consider a relation R(A,B,C,D,E,F,G) and the following functional dependencies: (B->D, D->E, AB->C, AE-F, C -> A, F -> G } and choose the ... prime attributes(B) Only B and C are prime attributes(C) Only A, B and F are prime attributes
User Avatar
556
views
1 answers
0 votes
Ray Tomlinson asked Aug 19, 2023
556 views
Computer Organisation Textbook Questions
Consider the case memory which has 0.8 and 0.9 hit ratio for read and write operation. Whenever there exist here miss either read or write 2 ... find average access time for write operation,3. average access time overall and throughput.
User Avatar
374
views
1 answers
0 votes
Aniket1710 asked Jul 11, 2023
374 views
Ace textbook
What is the time complexity of best algorithm that decides whether a given directedgraph represented as adjacency Matrix contains a sink or not ?(a)O(V^2)(b)O(VlogV)(c)O(V^2logV)(d)O(V)
User Avatar
251
views
0 answers
0 votes
zshaikh asked May 10, 2023
251 views
Exercise 1.30 from the textbook "Introduction to the Theory of Computation" by Michael Sipser (3rd edition).
For the following regular expression:a+|(ab)+Over the alphabet:{a,b}Give an epsilon-NFA that recognizes the same language.
User Avatar
Link Copied!