Consider the following relational schemas for a library database:Boo...
-
-
Ranita Biswas
- 1 year 6 months ago
-
-
-
- 3,149
- Views
Every table with two single-valued attributes is in 1NF, 2NF, 3NF and ...
-
-
Ranita Biswas
- 1 year 6 months ago
-
-
-
- 1
- Likes
-
- 6,126
- Views
Which of the following is TRUE?(A) Every relation in 3NF is also in ...
-
-
Ranita Biswas
- 1 year 6 months ago
-
-
-
- 909
- Views
Relation R has eight attributes ABCDEFGH. Fields of R contain only ato...
-
-
Ranita Biswas
- 1 year 6 months ago
-
-
-
- 1
- Likes
-
- 2,000
- Views
Finding candidate key
-
-
Ranita Biswas
- 1 year 6 months ago
-
-
-
- 2
- Likes
-
- 254
- Views
Finding superkeys, Candidate keys, and primary key
-
-
Ranita Biswas
- 1 year 6 months ago
-
-
-
- 2
- Likes
-
- 234
- Views
Evaluate the integral
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 2
- Likes
-
- 92
- Views
How many 32x16 ROMs with enable will be required to construct a
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 1
- Likes
-
- 603
- Views
Consider the below statements:
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 1
- Likes
-
- 752
- Views
Suppose host A is sending a large file to host B over a TCP connection
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 1
- Likes
-
- 776
- Views
For an undirected graph G = (V,E), the line graph G = (V , E ) is obtained by replacing
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 1
- Likes
-
- 79
- Views
An undirected graph is complete if there is an edge
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 599
- Views
Given that B(x) means “x is a bat”, F(x) means “x is a fly”, and
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 262
- Views
Suppose we constructed the binary search tree shown below
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 104
- Views
Consider the following function that takes as input a sequence A
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 81
- Views
Which of the given languages are regular?
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 87
- Views
Consider a simple system running a single process.
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 1
- Likes
-
- 164
- Views
How many flip-flops will be complemented in a 10-bit binary ripple counter to reach the next count after the following count:
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 3
- Likes
-
- 2,026
- Views
Consider a user level threading library that multiplexes N > 1 user level threads over M ≥ 1 kernel threads.
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 211
- Views
An array of n distinct elements is said to be un-sorted if for every index i such that 2 ≤ i ≤ n − 1
-
-
Sumit Verma
- 2 years 1 month ago
-
-
-
- 2
- Likes
-
- 2,001
- Views