1) What is 5NF?
a. The database should be in 3NF and all tables can have only one primary key.
b. There should be no cyclic dependencies in a composite key.
c. All attributes within the entity should depend solely on the entity's unique identifier.
d. Tables cannot have multi - valued dependencies on a Primary Key.
b. UML
c. Database model
d. Both b and c above
b. First Come First Served scheduling
c. Shortest remaining time first
d. Static priority scheduling with different priorities for the two processes
b. Request and all required resources be allocated before execution.
c. Release all resources before requesting a new resource.
d. Never request a resource after releasing any resource.
b. 140
c. 50
d. 90
b. complete
c. finite
d. strongly connected
b. Selection sort
c. Quick sort
d. Insertion sort
a. The database should be in 3NF and all tables can have only one primary key.
b. There should be no cyclic dependencies in a composite key.
c. All attributes within the entity should depend solely on the entity's unique identifier.
d. Tables cannot have multi - valued dependencies on a Primary Key.
2) Which of the following is used to define the schema of each database hosted in the DBMS?
a. ER diagramb. UML
c. Database model
d. Both b and c above
3) Consider a uniprocessor computer system that has 2 processes and both of them alternate 10ms CPU bursts with 90ms I / O bursts. Both the processes were created at nearly the same time and can proceed in parallel. What is the scheduling strategy for this system that will result in the least CPU utilization (over a long period of time)?
a. Round Robin scheduling with a time quantum of 5ms b. First Come First Served scheduling
c. Shortest remaining time first
d. Static priority scheduling with different priorities for the two processes
4) Which of the following statements is not valid for deadlock prevention scheme?
a. Number the resources uniquely and never request a lower numbered resource than the last one requested.b. Request and all required resources be allocated before execution.
c. Release all resources before requesting a new resource.
d. Never request a resource after releasing any resource.
5) How many HTML colors are supported by all the browsers?
a. 100b. 140
c. 50
d. 90
6) If every node ' u ' in ' G ' is adjacent to every other node ' v ' in ' G ', A graph is said to be ___________.
a. isolatedb. complete
c. finite
d. strongly connected
7) You have to sort a list L consisting of a sorted list, followed by a few “ random ” elements. Which of the following sorting methods would be especially suitable for such a task?
a. Bubble sort b. Selection sort
c. Quick sort
d. Insertion sort
Answers
1) b
2) c
3) a
4) d
5) b
6) b
7) d
No comments:
Post a Comment