COMPUTER SCIENCE STUDY MATERIAL FOR NET EXAM

1. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by.

Number of processes in memory

 2. The goal of structured programming is to.

 Be able to infer the flow of control from the program text.

3. Consider a basic block

a = b+c

c = a+d

d = b+c

e = d-b

a = e+b

Maximum number of nodes and edges in DAG generated for the above block is.

8 Nodes and 10 Edges.

Click Here to View Solution

4. Which number does not belong to the series below?

2, 5, 10, 17, 26, 37, 50, 64.

64

Explanation:

2

2+3=5

5+5=10

10+7=17

17+9=26

26+11=37

37+13=50

50+15=65

So the odd man is 64.

5. The concept of pipelining is most effective in improving performance if the tasks being performed in different stages.

Require about the same amount of time

6. Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl’ s law is.

3.22

Explanation:

Formula for Amadahl’s Law:

S(N)=1/(1-P)+P/N

where N refers to the no of processors, and P refers to the proportion that can be parallelized.

The proportion of the program that can be made parallel, P = 70%=>70/100=0.7 

Apply the values using the formula,

Size of processor=64 bit processor

 1/(1-0.7)+0.7/64 = 1/0.3+0.0109375=1/0.310975

(Apply Bodmas rule-Brackets of Division Multiplication,Addition,Subtraction)
=3.215
=3.22

Buy UGC NET Books Here at Lowest Prices

7. The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is.

Dirty read problem

8. If the pixels of an image are shuffled then the parameter that may change is.

Covariance

9. The quantiser in an image-compression system is a lossy element which exploits the.

 Psychovisual redundancy

10. The transform which possesses the highest ‘energy compaction’ property is.

Karhunen-Loeve transform

11. Universal building block gates are.

Nand  Gate

Nor gate

12. If a code is ‘t’ error detecting, the minimum hamming distance should be equal to :

t+1

13. The data mining algorithm which uses squared error score function is:

Back propagation algorithm

14. The data mining algorithm which uses cross-validated loss function.

CART algorithm   

Tip:

Squared error score function-Back propogation algorithm

Cross validated loss function-Cart Algorithm

15. The number of integers between 1 and 250 that are divisible by 2,5 and 7 is .


3

Explanation:

 There are only 3 integers between 1 and 250 that are divisible by 2,5 and 7 namely  70,140 and 210. Therefore the answer is 3.

16. Optical storage is a.

 Low-speed direct access storage device

17. The amount of uncertainty in a system of symbol is called.

Entropy

18. Design recovery from source code is done during.
Reverse engineering

19. What deletes the entire file except the file structure.

ZAP

20. Handoff is the mechanism that.
Transfer an ongoing call from one base station to another

21.Enterprise Resource Planning (ERP).

Automate and integrates the majority of business processes.

22. In order that a code is  error correcting, the minimum Hamming distance should be :

2t+1

Tip:

Always remember that for error detection in Minimum Hamming distance,

The formula is t+1

For error correction, it is 2t+1

23. A compiler that runs on one machine and produces code for a different machine is called

Cross compilation

24. What are the major data structures used by Network and hierarchical model.

Network model-Graph

Hierarchical Model-Trees

25. What is a trigger.

Triggers are set of statements that gets executed automatically by the system as side effect for modification to the database.

All the best for UGC NET Exam.

With Best Compliments from Computer Science Learning Centre

NetComputerScience.in