Home - Ugc Net Computer Science - Previous Year Solved Papers - UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 December 2015

UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 December 2015 Online Exam Quiz

Important questions about UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 December 2015. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 December 2015 MCQ questions with answers. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 December 2015 exam questions and answers for students and interviews.

1. The three outputs x 1 x 2 x 3 from the 8 X 3 priority encoder are used to provide a vector address of the form 101x 1 x 2 x 3 00. What is the second highest priority vector address in hexadecimal if the vector addresses are starting from the one with the highest priority ?

Options

A : BC

B : A4

C : BD

D : AC

2. What will be the output at PORT1 if the following program is executed ? MVI B, 82H MOV A, B MOV C, A MVI D, 37H OUT PORT1 HLT

Options

A : 37H

B : 82H

C : B9H

D : 00H

3. Which of the following 8085 microprocessor hardware interrupt has the lowest priority?

Options

A : RST 6.5

B : RST 7.5

C : TRAP

D : INTR

4. A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes?

Options

A : 0.64

B : 0.96

C : 2.00

D : 0.32

5. A DMA controller transfers 32-bit words to memory using cycle stealing. The words are assembled from a device that transmits characters at a rate of 4800 characters per second. The CPU is fetching and executing instructions at an average rate of one million instructions per second. By how much will the CPU be slowed down because of the DMA transfer?

Options

A : 0.6%

B : 0.12%

C : 1.2%

D : 2.5%

46. Language model used in LISP is __________.

Options

A : Functional programming

B : Logic programming

C : Object oriented programming

D : All of the above

47. In constraint satisfaction problem, constraints can be stated as __________.

Options

A : Arithmatic equations and inequalities that bind the values of variables

B : Arithmatic equations and inequalities that doesn’t bind any restriction over variables

C : Arithmatic equations that impose restrictions over variables

D : Arithmatic equations that discard constraints over the given variables

48. As compared to rental and leasing methods to acquire computer systems for a Management Information System (MIS), purchase method has following advantage:

Options

A : It has high level of flexibility

B : It doesn’t require cash up-front

C : It is a business investment

D : Little risk of obsolescence

49. Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has alphabet X = {0, 1} and associated probabilities {1 / 2, 1 / 2}. The channel matrix is where p is the transition probability. Then the conditional entropy is given by:

Options

A : 1

B : - plog(p) - (1 - p)log(1 - p)

C : 1 + p log(p) + (1 - p)log(1 - p)

D : 0

50. Which of the following is not a lossy compression technique?

Options

A : JPEG

B : MPEG

C : FFT

D : Arithmetic coding

51. Blind image deconvolution is ____________.

Options

A : Combination of blur identification and image restoration

B : Combination of segmentation and classification

C : Combination of blur and non-blur image

D : None of the above

52. A basic feasible solution of a linear programming problem is said to be __________ if at least one of the basic variable is zero.

Options

A : degenerate

B : non-degenerate

C : infeasible

D : unbounded

53. Consider the following conditions: (a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints. (b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns. (c)All the positive allocations must be in independent positions. The initial solution of a transportation problem is said to be a non-degenerate basic feasible solution if it satisfies: Codes:

Options

A : (a) and (b) only

B : (a) and (c) only

C : (b) and (c) only

D : (a), (b) and (c)

54. Consider the following transportation problem:

Options

A : 1450

B : 1465

C : 1480

D : 1520

55. The character set used in Windows 2000 operating system is __________

Options

A : 8 bit ASCII

B : Extended ASCII

C : 16 bit UNICODE

D : 12 bit UNICODE

56. In Unix, the command to enable execution permission for file “mylife” by all is ____________.

Options

A : Chmod ugo + X myfile

B : Chmod a + X myfile

C : Chmod + X myfile

D : All of the above

57. What will be the output of the following Unix command ? $rm chap0[1 - 3]

Options

A : Remove file chap0[1 - 3]

B : Remove file chap01, chap02, chap03

C : Remove file chap\[1 - 3\]

D : None of the above

58. Which of the following statements regarding the features of the object-oriented approach to databases are true? (a)The ability to develop more realistic models of the real world. (b)The ability to represent the world in a non-geometric way. (c)The ability to develop databases using natural language approaches. (d)The need to split objects into their component parts. (e)The ability to develop database models based on location rather than state and behavior. Codes:

Options

A : (a), (b) and (c)

B : (b), (c) and (d)

C : (a), (d) and (e)

D : (c), (d) and (e)

59. Consider the following database table: Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table containt?

Options

A : 5

B : 10

C : 15

D : 50

60. Suppose ORACLE 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)}. Consider the following two SQL queries SQ 1 and SQ 2 : SQ 1 : Select * From R Full Join S On R.B = S.B; SQ 2 : Select * From R Inner Join S On R.B = S.B; The numbers of tuples in the result of the SQL query SQ 1 and the SQL query SQ 2 are given by:

Options

A : 2 and 6 respectively

B : 6 and 2 respectively

C : 2 and 4 respectively

D : 4 and 2 respectively

Ugc Net Computer Science - Previous Year Solved Papers more Online Exam Quiz

Copyright © 2021
Exam-GK-MCQ-Questions.Com | Contact Us | Privacy Policy | Terms of Use | Sitemap | 0.020100116729736