UGCNET Computer Science January 2017 Paper III

Q1. Which of the following is an interrupt according to temporal relationship with system clock?

(A) Maskable interrupt

(B) Periodic interrupt

(D) Synchronous interrupt

Ans .

(D) Synchronous interrupt

Explanation :

Q2. Which of the following is incorrect for virtual memory?

(A) Large programs can be written

(B) More I/O is required

(D) Faster and easy swapping of process

Ans .

(B) More I/O is required

Explanation :

Q3. The general configuration of the microprogrammed control unit is given below: What are blocks B and C in the diagram respectively?

(A) Block address register and cache memory

(B) Control address register and control memory

(D) Control address register and random access memory

Ans .

(B) Control address register and control memory

Explanation :

Q4. Match the following:

(A) iv iii i ii

(B) iv i iii ii

(D) iv iii ii i

Ans .

(3) Identical with average revenue

Explanation :

Q5. In 8085 microprocessor , the digit 5 indicates that the microprocessor needs

(A) -5 volts, +5 volts supply

(B) +5 volts supply only

(D) 5 MHz clock

Ans .

(B) +5 volts supply only

Explanation :

Q6. In 8085, which of the following performs: load register pair immediate operation?

(A) LDAX rp

(B) LHLD addr

(D) INX rp

Ans .

Explanation :

Q7. Consider following schedules involving two transactions:
S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)
Which of the following statement is true?

(A) Both S1 and S2 are conflict serializable.

(B) S1 is conflict serializable and S2 is not conflict serializable.

(D) Both S1 and S2 are not conflict serializable.

Ans .

Explanation :

Q8. Which one is correct w.r .t. RDBMS?

(A) primary key ⊆ super key ⊆ candidate key

(B) primary key ⊆ candidate key ⊆ super key

(D) super key ⊆ primary key ⊆ candidate key

Ans .

(B) primary key ⊆ candidate key ⊆ super key

Explanation :

Q9. Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows:

(A) pk(R2)→pk(R1)

(B) pk(R1)→pk(R2)

(D) pk(R1)→R1∩R2

Ans .

Explanation :

Q10. For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are:
A→C
B→D
The relation R is in ................

(A) First normal form but not in second normal form

(B) Both in first normal form as well as in second normal form

(D) Both in second normal form as well as in third normal form

Ans .

(A) First normal form but not in second normal form

Explanation :

Q11. Consider the following relation: The above query is for following:

(A) Find the highest paid employee who earns more than the average salary of all employees of his company.

(B) Find the highest paid employee who earns more than the average salary of all the employees of all the companies.

(D) Find all employees who earn more than the average salary of all employees of their company.

Ans .

(D) Find all employees who earn more than the average salary of all employees of their company.

Explanation :

Q12. If following sequence of keys are inserted in a B+ tree with K(=3) pointers:
8, 5, 1, 7, 3, 12, 9, 6
Which of the following shall be correct B+ tree?

(A)

(B)

(C)

(D)

Ans .

(A) smily face

Explanation :

Q13. Which of the following statement(s) is/are correct?

(A) Persistence is the term used to describe the duration of phosphorescence.

(B) The control electrode is used to turn the electron beam on and off.

(D) All of the above.

Ans .

(D) All of the above.

Explanation :

Q14. A segment is any object described by GKS commands and data that start with CREATE SEGMENT and Terminates with CLOSE SEGMENT command. What functions can be performed on these segments?

(A) Translation and Rotation

(B) Panning and Zooming

(D) Translation, Rotation, Panning and Zooming

Ans .

(D) Translation, Rotation, Panning and Zooming

Explanation :

Q15. Match the following:

(A) i ii iii iv

(B) i iii ii iv

(D) iv ii i iii

Ans .

(A) i ii iii iv

Explanation :

Q16. Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct?

(A) Compute d = 3 – 2r (where r is radius)

(B) Stop if x > y

(D) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Ans .

(D) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Explanation :

Q17. Which of the following is/are side effects of scan conversion?
a. Aliasing
b. Unequal intensity of diagonal lines
c. Over striking in photographic applications
d. Local or Global aliasing

(A) a and b

(B) a, b and c

(D) a, b, c and d

Ans .

(D) a, b, c and d

Explanation :

Q18. Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line.

(A) [(0, 0), (1, 1), (2, 1), (3, 2)]

(B) [(0, 0), (1, 1.5), (2, 2), (3, 3)]

(D) [(0, 0), (1, 2), (2, 2), (3, 2)]

Ans .

(A) [(0, 0), (1, 1), (2, 1), (3, 2)]

Explanation :

Q19. Which of the following are not regular?
(A) Strings of even number of a’s.
(B) Strings of a’s, whose length is a prime number.
(C) Set of all palindromes made up of a’s and b’s.
(D) Strings of a’s whose length is a perfect square.

(A) (A) and (B) only

(B) (A), (B) and (C) only

(D) (B) and (D) only

Ans .

Explanation :

Q20. Consider the languages L1 = ϕ, and L2 = {1}. Which one of the following represents
L1* U L2* L1* ?

(A) {ε}

(B) {ε,1}

(D) 1*

Ans .

(D) 1*

Explanation :

Q21. Given the following statements :
(A) A class of languages that is closed under union and complementation has to be closed under intersection.
(B) A class of languages that is closed under union and intersection has to be closed under complementation. Which of the following options is correct?

(A) Both (A) and (B) are false.

(B) Both (A) and (B) are true.

(D) (A) is false, (B) is true.

Ans .

Explanation :

Q22. Let G = (V ,T,S,P) be a context-free grammar such that every one of its productions is of the form A→v, with |v| = K>1. The derivation tree for any W ϵ L(G) has a height h such that

(A)

(B)

(C)

(D)

Ans .

(D) smily face

Explanation :

Q23. Given the following two languages:
L1 = {anbn|n≥0, n≠100}
L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)}
Which of the following options is correct?

(A) Both L1 and L2 are not context free language.

(B) Both L1 and L2 are context free language.

(D) L1 is not context free language, L2 is context free language.

Ans .

Explanation :

Q24. A recursive function h, is defined as follows:
h(m)=k, if m=0
= 1, if m=1
= 2h(m-1) + 4h(m-2),
if m≥2 If the value of hD. is 88 then the value of k is:

(A) 0

(B) 1

(D) -1

Ans .

Explanation :

Q25. Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is ..................

(A) nP(1-P)n-1

(B) nP

(D) nP(1-P)n-1

Ans .

(A) nP(1-P)n-1

Explanation :

Q26. Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is

(A) 20

(B) 10

(D) 40

Ans .

(B) 10

Explanation :

Q27. Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be:

(A) (1+x) is factor of G(x)

(B) (1-x) is factor of G(x)

(D) x is factor of G(x)

Ans .

(A) (1+x) is factor of G(x)

Explanation :

Q28. In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ................

(A) 2 bytes

(B) 1 byte

(D) 5 bytes

Ans .

(D) 5 bytes

Explanation :

Q29. In RSA public key cryptosystem suppose n=p*q where p and q are primes. (e,n) and (d,n) are public and private keys respectively. Let M be an integer such that 0 less than M less than n and ɸ(n)=(p-1)(q-1).
Which of the following equations represent RSA public key cryptosystem?
I. C≡Me (mod n), M≡(C)d(mod n)
II. ed≡1(mod n)
III. ed≡(mod ɸ(n))
IV . C≡Me (mod ɸn), M≡Cd(mod ɸn)

(A) I and II

(B) I and III

(D) I and IV

Ans .

(B) I and III

Explanation :

Q30. A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs.

A. 1

(B) 2

(D) 4

Ans .

(B) 2

Explanation :

Q31. The asymptotic upper bound solution of the recurrence relation given by
T(n)= 2T(n/2)+n/log n is:

(A) O(n2)

(B) O(n log n)

(D) O(log log n)

Ans .

Explanation :

Q32. Any decision tree that sorts n elements has height ..............

(A) Ω(log n)

(B) Ω(n)

(D) Ω(n2)

Ans .

Explanation :

Q33. Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case.

(A) OA.

(B) O(log n)

(D) O(n log n)

Ans .

(B) O(log n)

Explanation :

Q34. The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is <5,10,3,12,5> is

(A) 630

(B) 580

(D) 405

Ans .

(D) 405

Explanation :

Q35. Dijkstra’s algorithm is based on

(A) Divide and conquer paradigm

(B) Dynamic Programming

(D) Backtracking paradigm

Ans .

Explanation :

Q36. Match the following with respect to algorithm paradigms:

(A) iii i ii iv

(B) ii i iv iii

(D) iii ii i iv

Ans .

(D) iii ii i iv

Explanation :

Q37. Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements?
I. Abstraction allows us to focus on what something does without considering the complexities of how it works.
II. Encapsulation allows us to consider complex ideas while ignoring irrelevant detail that would confuse us.

(A) Neither I nor II is correct.

(B) Both I and II are correct.

(D) Only I is correct

Ans .

(A) Neither I nor II is correct.

Explanation :

Q38. Given the array of integers ‘array’ shown below:

(A) 20:20

(B) 18:18

(D) 20:18

Ans .

Explanation :

Q39. Consider the following JAVA program: What does this program print?

(A) 59

(B) 95

(D) 99

Ans .

(B) 95

Explanation :

Q40. Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE?
I. An abstract class is one that is not used to create objects.
II. An abstract class is designed only to act as a base class to be inherited by other classes.

(A) Only l

(B) Only II

(D) Both l and II

Ans .

(D) Both l and II

Explanation :

Q41. Which of the following HTML code will affect the vertical alignment of the table content?

(A)

(B)

(C)

(D)

Ans .

(B) smily face

Explanation :

Q42. What can you say about the following statements?
I. XML tags are case-insensitive.
II. In JavaScript, identifier names are case-sensitive.
III. Cascading Style Sheets (CSS) cannot be used with XML.
IV . All well-formed XML documents must contain a document type definition.

(A) only I and II are false.

(B) only III and IV are false.

(D) only II and IV are false.

Ans .

Explanation :

Q43. Which of the following statement(s) is/are TRUE with regard to software testing?
I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance.
II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived.

(A) only I

(B) only II

(D) neither I nor II

Ans .

(A) only I

Explanation :

Q44. Which of the following are facts about a top-down software testing approach?
I. Top-down testing typically requires the tester to build method stubs.
II. Top-down testing typically requires the tester to build test drivers.

(A) only I

(B) Only II

(D) Neither I nor II

Ans .

(A) only I

Explanation :

Q45. Match the terms related to Software Configuration Management (SCM) in List-I with the descriptions in List-II.

(A) B C A

(B) C A B

(D) B A C

Ans .

(D) B A C

Explanation :

Q46. A software project was estimated at 352 Function Points (FP). A four person team will be assigned to this project consisting of an architect, two programmers, and a tester . The salary of the architect is Rs.80,000 per month, the programmer Rs.60,000 per month and the tester Rs.50,000 per month. The average productivity for the team is 8 FP per person month. Which of the following represents the projected cost of the project?

(A) Rs.28,16,000

(B) Rs.20,90,000

(D) Rs.27,50,000

Ans .

(D) Rs.27,50,000

Explanation :

Q47. Complete each of the following sentences in List-I on the left hand side by filling in the word or phrase from the List-II on the right hand side that best completes the sentence:

(A) B D A C

(B) B D C A

(D) D B A C

Ans .

(D) D B A C

Explanation :

Q48. A software company needs to develop a project that is estimated as 1000 function points and is planning to use JAVA as the programming language whose approximate lines of code per function point is accepted as 50. Considering a=1.4 as multiplicative factor , b=1.0 as exponention factor for the basic COCOMO effort equation and c=3.0 as multiplicative factor , d=0.33 as exponention factor for the basic COCOMO duration equation, approximately how long does the project take to complete?

(A) 11.2 months

(B) 12.2 months

(D) 10.2 months

Ans .

(B) 12.2 months

Explanation :

Q49. A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively:

(A) 14 and 15

(B) 14 and 29

(D) 16 and 32

Ans .

Explanation :

Q50. Consider a disk queue with I/O requests on the following cylinders in their arriving order:
6,10,12,54,97,73,128,15,44,110,34,45
The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is:

(A) 172

(B) 173

(D) 228

Ans .

(B) 173

Explanation :

Q51. Match the following for Unix rue system:

(A) iii i ii iv

(B) iii i iv ii

(D) iv iii i ii

Ans .

(B) iii i iv ii

Explanation :

Q52. Some of the criteria for calculation of priority of a process are:
a. Processor utilization by an individual process.
b. Weight assigned to a user or group of users.
c. Processor utilization by a user or group of processes.
In fair share scheduler , priority is calculated based on:

(A) only (a) and (b)

(B) only (a) and (c)

(D) only (b) and (c)

Ans .

Explanation :

Q53. One of the disadvantages of user level threads compared to Kernel level threads is

(A) If a user level thread of a process executes a system call, all threads in that process are blocked.

(B) Scheduling is application dependent.

(D) The library procedures invoked for thread management in user level threads are local procedures.

Ans .

(A) If a user level thread of a process executes a system call, all threads in that process are blocked.

Explanation :

Q54. Which statement is not correct about “init” process in Unix?

(A) It is generally the parent of the login shell.

(B) It has PID 1.

(D) Init forks and execs a ‘getty’ process at every port connected to a terminal.

Ans .

Explanation :

Q55. Consider following two rules R1 and R2 in logical reasoning in Artificial Intelligence (AI): R1 : From α ᴝ β R2 : From α ᴝ β

(A) Only R1 is correct.

(B) Only R2 is correct.

(D) Neither R1 nor R2 is correct.

Ans .

(D) Neither R1 nor R2 is correct.

Explanation :

Q56. Consider the following AO graph: ͉Which is the best node to expand next by AO* algorithm?

(A) A

(B) B

(D) B and C

Ans .

(D) B and C

Explanation :

Q57. In Artificial Intelligence (AI), what is present in the planning graph?

(A) Sequence of levels

(B) Literals

(D) Heuristic estimates

Ans .

(A) Sequence of levels

Explanation :

Q58. What is the best method to go for the game playing problem?

(A) Optimal Search

(B) Random Search

(D) Stratified Search

Ans .

Explanation :

Q59. Which of the following statements is true?

(A) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is satisfiable.

(B) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is valid.

(D) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄S is inconsistent.

Ans .

(B) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is valid.

Explanation :

Q60. The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of the following?

(A) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))

(B) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))

(D) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))

Ans .

(B) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))

Explanation :

Q61. Given the following two statements:
A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear.
B. L = {an bn} U {an b2n} is linear, but not deterministic context free language.
Which of the following options is correct?

(A) Both (A) and (B) are false.

(B) Both (A) and (B) are true.

(D) (A) is false, (B) is true.

Ans .

(B) Both (A) and (B) are true.

Explanation :

Q62. Which of the following pairs have different expressive power?

(A) Single-tape-turing machine and multi-dimensional turing machine.

(B) Multi-tape turing machine and multi-dimensional turing machine.

(D) Deterministic finite automata and Non-deterministic finite automata.

Ans .

Explanation :

Q63. Which of the following statements is false?

(A) Every context-sensitive language is recursive.

(B) The set of all languages that are not recursively enumerable is countable.

(D) The families of recursively enumerable and recursive languages are closed under reversal.

Ans .

(B) The set of all languages that are not recursively enumerable is countable.

Explanation :

Q64. Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error .

(A) t + 1

(B) t

(D) t/2

Ans .

(B) t

Explanation :

Q65. A t-error correcting q-nary linear code must satisfy: Where M is the number of code words and X is

(A) qn

(B) qt

(D) q-t

Ans .

(B) qt

Explanation :

Q66. Names of some of the Operating Systems are given below:
(a) MS-DOS
(b) XENIX
(c) OS/2
In the above list, following operating systems didn’t provide multiuser facility.

(A) (a) only

(B) (a) and (b) only

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

Ans .

(A) (a) only

Explanation :

Q67. From the given data below:
a b b a a b b a a b
which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)?

(A) a b

(B) b b

(D) b a a b

Ans .

Explanation :

Q68. With respect to a loop in the transportation table, which one of the following is not correct?

(A) Every loop has an odd no. of cells and at least 5.

(B) Closed loops may or may not b square in shape.

(D) Every loop has an even no. of cells and at least four.

Ans .

(A) Every loop has an odd no. of cells and at least 5.

Explanation :

Q69. At which of the following stage(s), the degeneracy do not occur in transportation problem?
(m, n represents number of sources and destinations respectively)
(a) While the values of dual variables ui and vj cannot be computed.
(b) While obtaining an initial solution, we may have less than m + n -1 allocations.
(c) At any stage while moving towards optimal solution, when two or more occupied cells with the same minimum allocation become unoccupied simultaneously.
(d) At a stage when the no. of +ve allocation is exactly m + n - 1.

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

(B) (a), (c) and (d)

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

Ans .

Explanation :

Q70. Consider the following LPP:
Min. Z = x1+x2+x3
Subject to 3x1 + 4x3 ≤ 5
5x1 + x2 + 6x3 =7
8x1 + 9x3 ≥ 2
x1, x2, x3 ≥ 0
The standard form of this LPP shall be:

(A) Min. Z = x1 + x2 + x3 + 0x4 + 0x5
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 =7;
8x1 + 9x3 - x5 = 2;
x1, x2, x3, x4, x5 ≥ 0

(B) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 -1(x6)-1(x7)
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 +x6 = 7;
8x1 + 9x3 - x5 + x7 = 2;
x1 to x7 ≥0

(C) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 = 7;
8x1 + 9x3 - x5 + x6 = 2;
x1 to x6 ≥ 0

(D) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6+ 0x7
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 + x6 = 7;
8x1 + 9x3 - x5 + x7 = 2;
x1 to x7 ≥ 0

Ans .

(A) Min. Z = x1 + x2 + x3 + 0x4 + 0x5
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 =7;
8x1 + 9x3 - x5 = 2;
x1, x2, x3, x4, x5 ≥ 0

Explanation :

Q71. Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to the elements of universe z using max-min composition is given by:

(A)

(B)

(C)

(D)

Ans .

Explanation :

Q72. A neuron with 3 inputs has the weight vector [0.2 -0.1 0.1]T and a bias θ = 0. If the input vector is X = [0.2 0.4 0.2]T then the total input to the neuron is:

(A) 0.20

(B) 1.0

(D) -1.0

Ans .

Explanation :

Q73. Which of the following neural networks uses supervised learning?
(a) Multilayer perceptron
(b) Self organizing feature map
(c) Hopfield network

(A) (a) only

(B) (b) only

(D) (a) and (c) only

Ans .

(A) (a) only

Explanation :

Q74. Unix command to change the case of first three lines of file “shortlist” from lower to upper

(A) $ tr ‘[a-z]’ ‘[A-Z]’ shortlist | head-3

(B) $ head-3 shortlist | tr ‘[a-z]’ ‘[A-Z]’

(D) $ tr shortlist head-3 ‘[a-z]’ ‘[A-Z]’

Ans .

(B) $ head-3 shortlist | tr ‘[a-z]’ ‘[A-Z]’

Explanation :

Q75. Match the following vi commands in Unix:

(A) ii iii i iv

(B) iv iii ii i

(D) iii i iv ii

Ans .

(D) iii i iv ii

Explanation :

upscfever.com

UGCNET Computer Science January 2017 Paper III

UPSCFEVER - POPULAR PAGES

Join The Movement

Discussions and Comments