Home - Ugc Net Computer Science - Previous Year Solved Papers - UGC NET COMPUTER SCIENCE SOLVED PAPERS 2017-19 - UGC NET Computer Science November 2017 Paper 3

UGC NET COMPUTER SCIENCE SOLVED PAPERS 2017-19 - UGC NET Computer Science November 2017 Paper 3 Online Exam Quiz

Important questions about UGC NET COMPUTER SCIENCE SOLVED PAPERS 2017-19 - UGC NET Computer Science November 2017 Paper 3. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2017-19 - UGC NET Computer Science November 2017 Paper 3 MCQ questions with answers. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2017-19 - UGC NET Computer Science November 2017 Paper 3 exam questions and answers for students and interviews.

1. In 8085 microprocessor which of the following flag(s) is (are) affected by an arithmetic operation ?

Options

A : AC flag Only

B : CY flag Only

C : Z flag Only

D : AC, CY, Z flags

2. In 8085 microprocessor the address bus is of __________ bits.

Options

A : 4

B : 8

C : 16

D : 32

4. Which of the following addressing mode is best suited to access elements of an array of contiguous memory locations ?

Options

A : Indexed addressing mode

B : Base Register addressing mode

C : Relative address mode

D : Displacement mode

5. Which of the following is correct statement ?

Options

A : In memory - mapped I/O, the CPU can manipulate I/O data residing in interface registers that are not used to manipulate memory words.

B : The isolated I/O method isolates memory and I/O addresses so that memory address range is not affected by interface address assignment.

C : In asynchronous serial transfer of data the two units share a common clock.

D : In synchronous serial transmission of data the two units have different clocks.

46. Consider the method mcq ( ):

Options

A : (16, 3, 5)

B : (8, 5, 3)

C : (8, 3, 5)

D : (16, 4, 4)

47. A simple stand - alone software utility is to be developed in ’C’ programming by a team of software experts for a computer running Linux and the overall size of this software is estimated to be 20,000 lines of code. Considering (a, b) = (2.4, 1.05) as multiplicative and exponention factor for the basic COCOMO effort estimation equation and (c, d) = (2.5, 0.38) as multiplicative and exponention factor for the basic COCOMO development time estimation equation, approximately how long does the software project take to complete ?

Options

A : 10.52 months

B : 11.52 months

C : 12.52 months

D : 14.52 months

48. In Software Configuration Management (SCM), which of the following is a use-case supported by standard version control systems? (a) Managing several versions or releases of a software (b) Filing bug reports and tracking their progress (c) Allowing team members to work in parallel (d) Identifying when and where a regression occurred

Options

A : Only (a), (c), and (d)

B : Only (a), (b), and (c)

C : Only (a), (b), and (d)

D : Only (b), (c), and (d)

49. Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :

Options

A : 6.5

B : 7.5

C : 6.75

D : 7.75

50. Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then __________ page replacement algorithm has minimum number of page faults.

Options

A : FIFO

B : LIFO

C : LRU

D : Optimal

51. User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads. Which of the following statements is/are true ? (a) (i) The Many - to - one model maps many user threads to one kernel thread (ii) The one - to - one model maps one user thread to one kernel thread (iii) The many - to - many model maps many user threads to smaller or equal kernel threads (b) (i) Many - to - one model maps many kernel threads to one user thread (ii) One - to - one model maps one kernel thread to one user thread (iii) Many - to - many model maps many kernel threads to smaller or equal user threads

Options

A : (a) is true; (b) is false

B : (a) is false; (b) is true

C : Both (a) and (b) are true

D : Both (a) and (b) are false

52. Consider a system with five processes P 0 through P 4 and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T 0 we have the following allocation.

Options

A : (1), (2) and (3)

B : (1) and (3)

C : (3) and (4)

D : All are correct.

53. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are __________ if the disk head is initially at 53.

Options

A : 224

B : 248

C : 236

D : 240

54. The Bounded buffer problem is also known as __________.

Options

A : Producer - consumer problem

B : Reader - writer problem

C : Dining Philosophers problem

D : Both (2) and (3)

55. In Artificial Intelligence (AI), which agent deals with happy and unhappy state?

Options

A : Simple reflex agent

B : Model based agent

C : Learning agent

D : Utility based agent

56. If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?

Options

A : O(b+m)

B : O(bm)

C : O(b m )

D : O(m m )

57. Let P, Q, R and S be Propositions. Assume that the equivalences P ⇔ (Q ∨ ¬ Q) and Q ⇔ R hold. Then the truth value of the formula (P ∧ Q) ⇒ ((P ∧ R) ∨ S) is always:

Options

A : True

B : False

C : Same as truth table of Q

D : Same as truth table of S

58. “If X, then Y unless Z” is represented by which of the following formulae in propositional logic?

Options

A : (X ∧ Y) → ¬ Z

B : (X ∧ ¬ Z) → Y

C : X → (Y ∧ ¬ Z)

D : Y → (X ∧ ¬ Z)

59. Consider the following two well-formed formulas in prepositional logic. F 1 : P ⇒ ¬ P F 2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P) Which of the following statements is correct?

Options

A : F 1 is Satisfiable, F 2 is valid

B : F 1 is unsatisfiable, F 2 is Satisfiable

C : F 1 is unsatisfiable, F 2 is valid

D : F 1 and F 2 both are Satisfiable

60. Standard planning algorithms assume environment to be __________.

Options

A : Both deterministic and fully observable

B : Neither deterministic nor fully observable

C : Deterministic but not fully observable

D : Not deterministic but fully observable

61. Which of the following statements is not correct?

Options

A : Every recursive language is recursively enumerable.

B : L = {0 n 1 n 0 n │n=1, 2 , 3, ....} is recursively enumerable

C : Recursive languages are closed under intersection.

D : Recursive languages are not closed under intersection

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.02128005027771