PPSC FPSC KPPSC BPSC SPSC Lecturer Computer Science Test 48

Online Free Taleem is free online MCQ’s test related to Lecturer Computer Science. All the individuals who are going to appear in Lecturer Computer Science written test can attempt these tests in order to prepare for it in best possible way. Our tests of Lecturer of Computer Science include all the important questions and Past Paper of  Lecturer Computer Science, that have extremely high amount of chances for been included in the actual exam which make our test undoubtedly the best source of preparation.


There will be 25 multiple choice question in the test.
Answer of the questions will change randomly each time you start this test.
Practice this test at least 5 times if you want to secure High Marks.
At the End of the Test you can see your Test score and Rating.
If you found any incorrect answer in Quiz. Simply click on the quiz title and comment below on that MCQ. So that I can update the incorrect answer on time.

Please Click Below START  Button to Take this Computer Science Test Online.

Test Instructions:-
Test Name Lecturer Computer Science 
Subject Computer Science Test 48
Test Type MCQs
Total Questions 25
Total Time 20 Minutes
Total Marks 100

You have 20 minutes to pass to the quiz.

Lecturer Computer Science Online Test No. 48

1 / 25

Which normal form is considered adequate for normal relational database design?

2 / 25

The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into employee1 (ID, name) employee2 (name, street, city, salary) This type of decomposition is called

3 / 25

The functional dependency can be tested easily on the materialized view, using the constraints.............

4 / 25

The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is:

5 / 25

There are two functional dependencies with the same set of attributes on the left side of the arrow:



This can be combined as

6 / 25

Functional Dependencies are the types of constraints that are based on:

7 / 25

Suppose relation R(A,B) currently has tuples {(1,2), (1,3), (3,4)} and relation S(B,C) currently has {(2,5), (4,6), (7,8)}.

Then the number of tuples in the result of the SQL query:

Select *

From R Natural Outer Join S; is:

8 / 25

A dependency exist between two columns when:

9 / 25

We can use the following three rules to find logically implied functional dependencies. This collection of rules is called

10 / 25

A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key.

11 / 25

Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under:

12 / 25

What are the desirable properties of a decomposition:

13 / 25

Consider a relation R(A,B,C,D,E) with the following functional dependencies:

ABC -> DE and

D -> AB

The number of superkeys of R is:

14 / 25

R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition.

15 / 25

Which forms has a relation that possesses data about an individual entity:

16 / 25

We can use the following three rules to find logically implied functional dependencies. This collection of rules is called

17 / 25

In the ....................normal form, a composite attribute is converted to individual attributes.

18 / 25

A table on the many side of a one to many or many to many relationship must:

19 / 25

A data type that creates unique numbers for key columns in Microsoft Access is:

20 / 25

Tables in second normal form (2NF):

21 / 25

Which forms are based on the concept of functional dependency:

22 / 25

Which of the following is not a Armstrong‘s Axiom ?

23 / 25

Which is a bottom-up approach to database design that design by examining the relationship between attributes:

24 / 25

Which forms simplifies and ensures that there is minimal data aggregates and repetitive groups:

25 / 25

Which of the following is not a Armstrong‘s Axiom ?

Your score is

The average score is 0%


Leave a Comment

Your email address will not be published. Required fields are marked *

error: Content is protected !!
Scroll to Top