## Tuesday, 11 November 2014

### UGC NET Computer Science Solved Questions December 2013 Paper 3 - Part 2

41.       The Greibach normal form grammar for the language L={an bn+1|n≥0} is
(A) S→a SB, B→bB|Î»
(B) S→a SB, B→bB|b
(C) S→a SB|b, B→b
(D) S→a Sb|b
42.       Given the following statements:
S1: Every context-sensitive language L is recursive.
S2: There exists a recursive language that is not context sensitive.
Which statement is correct?
(A) S1 is not correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
43.       What is the bit rate for transmitting uncompressed 800x600 pixel colour frames with 8 bits/pixel at 40 frames/second ?
(A) 2.4 Mbps                 (B) 15.36 Mbps
(C) 153.6 Mbps                        (D) 1536 Mbps
Explanation:
The number of bits/sec is just 800x600x40x8 or 153.6 Mbps.
44.       In IPV 4, the IP address 200.200.200.200 belongs to
(A) Class A       (B) Class B
(C) Class C       (D) Class D
45.       Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct re-composition from end to end of the network?
(C) Transport    (D) Application
46.       A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in response to a request? (Note that the speed of light in air is 3,00,000 km/second).
(A) 133.33 m sec          (B) 266.67 m sec
(C) 400.00 m sec         (D) 533.33 m sec
Explanation:
The request has to go up and down, and the response has to go up and down. The total
path length traversed is thus 160.000 km. The speed of light in air and vacuum is
300,000 km/sec, so the propagation delay alone is 160,000/300,000 sec or about 533 msec.
47.       The start and stop bits are used in serial communication for
(A) error detection        (B) error correction
(C) synchronization    (D) slowing down the communication
48.       ..................... is a type of transmission impairment in which the signal loses strength due to the resistance of the transmission medium.
(A) Attenuation                        (B) Distortion
(C) Noise                       (D) Decibel
49.       Match the following:
List-I                                          List-II
a. Indexed Addressing           i. is not used when an operand is
moved from memory into a register
or from a register to memory.
an (optional) offset.
register plus a content offset.
d. Base-Indexed
Addressing                               iv. can only be used to access
is known at compile time.
Codes:
a  b   c   d
(A) ii   i    iv  iii
(B) ii   iv  i    iii
(C) iii  iv  i    ii
(D) iii  i   iv   ii
50.    Which of the following is a design criteria for instruction formats?
(A) The size of instructions
(B) The numbers of bits in the address fields
(C) The sufficient space in the instruction format to express all the operations desired.
(D) All of these
51.    Synchronization is achieved by a timing device called a ................. which generates a periodic train of ..................
(A) clock generator, clock pulse
(B) master generator, clock pulse
(C) generator, clock
(D) master clock generator, clock pulse
52.    Serial access memories are useful in applications where
(A) Data consists of numbers
(B) Short access time is required.
(C) Each stored word is processed differently.
(D) None of these
Explanation:
data naturally needs to flow in and out in serial form.
53.    What will be the output of the following logic diagram?
(A) x OR y         (B) x AND y
(C) x NOR y      (D) x XNOR y
54.    The essential difference between traps and interrupts is
(A) traps are asynchronous and interrupts are synchronous with the program
(B) traps are synchronous and interrupts are asynchronous with the program
(C) traps are synchronous and interrupts are asynchronous with the I/O devices.
(D) None of these.
55.    Consider the following ER diagram:
The minimum number of tables required to represent M, N, P, R1, R2 is
(A) 2       (B) 3
(C) 4       (D) 5
56.    Consider the following schemas:
Branch = (Branch-name, Assets, Branch-city)
Customer = (Customer-name, Bank-name, Customer-city)
Borrow = (Branch-name, loan-number, customer account-number)
Deposit = (Branch-name, Account-number, Customer-name, Balance)
Using relational Algebra, the query that finds customers who have balance more than 10,000 is .................
(A) Ï€customer-name(Ïƒbalance >10000(Deposit))
(B) Ïƒcustomer-name(Ïƒbalance >10000(Deposit))
(C) Ï€customer-name(Ïƒbalance >10000(Borrow))
(D) Ïƒcustomer-name(Ïƒbalance >10000(Borrow))
57.    Find the false statement:
(A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999).
(B) A weak relationship occurs when two relationship types are linked by either Event-Precedent sequence or Condition-Precedent sequence
(C) Conceptual model is not accurate representation of "Universe of interest".
(D) Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's
58.    Consider the table
Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5?
Q.1.        Select S.stuid
From student S
Where not exists
(select * from student e where e course='5' and e marks ≥ s marks)
Q.2.        Select S.stuid
From student S
Where s.marks > any (select distinct marks from student S where s.couse = 5)
(A) Q.1
(B) Q.2
(C) Both Q.1 and Q.2
(D) Neither Q.1 nor Q.2
Explanation:
First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking course 5, that is in second query comparison is between min of marks by student enrolled in course 5 and in query one comparison is between maximum of marks by any student in course 5. So the answer is option D.
59.    Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t. functional dependencies.
List - I                            List - II
a. Decomposition rule                        i. If X→Y and Z→W then {X, Z}→{Y, W}
b. Union rule                            ii. If X→Y and {Y, W}→Z then {X, W}→Z
c. Composition rule                 iii. If X→Y and X→Z then X→{Y, Z}
d. Pseudo transitivity rule      iv. If X→{Y, Z} then X→Y and X→Z
Codes:
a   b   c   d
(A) iii   ii   iv   i
(B) i    iii   iv  ii
(C) ii   i    iii   iv
(D) iv  iii   i   ii
60.    Match the following:
List – I                                                   List - II
a. Secondary Index                             i. Functional Dependency
b. Non-procedural Query                   ii. B-tree
c. Closure of set of Attributes                        iii. Relational Algebraic Operation
d. Natural JOIN                                                iv. Domain Calculus
Codes:
a   b  c   d
(A) i   ii   iv  iii
(B) ii   i   iv  iii
(C) i   iii  iv  ii
(D) ii  iv  i    iii
61.    Which of the following is not true with respect to a trackball and/or spaceball ?
I. A trackball is a two dimensional positioning device while as a spaceball provides six degrees of freedom
II. Unlike the trackball a spaceball does not actually move.
III. A trackball is a three dimensional positioning device while as a spaceball provides six degrees of freedom.
(A) I & II              (B) II & III
(C) II only          (D) III only
62.    Which of the following statement(s) is(are) true?
I. Two successive translations are additive.
II. Two successive rotations are additive.
III. Two successive scaling operations are multiplicative.
(A) I and II         (B) I and III
(C) II and III       (D) All the above.
63.    Given below are three basic rules:
I. Squash and Stretch
II. Slow-in and Slow-out
III. To stage the action properly
These rules are applied in case of
(A) Rendering  (B) Morphing
(C) Animation   (D) All the above
64.    Which of the following points lies on the same side as the origin, with reference to the line 3x+7y=2 ?
(A) (3, 0)            (B) (1, 0)
(C) (0.5, 0.5)      (D) (0.5, 0)
Explanation:
If (0.5, 0) is substituted in the equation, we get 1.5 which is less than 2, then it lies on the same side as that of the origin.
65.    The transformation matrix required for conversion of CMY colour model to RGB colour model is given as

66.    What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2).
I. Translate P1 to origin
II. Scale as required
III. Rotate
IV. Translate to the final position P2.
(A) I,II and III     (B) II,III and IV
(C) I,III and IV   (D) All of the above
67.    In Unix, how do you check that two given strings a and b are equal ?
(A) test \$a -eq \$b
(B) test \$a -equal \$b
(C) test \$a=\$b
(D) Sh -C test \$a==\$b
Explanation:
Tests for a zero-length string:            test -z string
Tests for a nonzero string length:     test -n string
Tests two strings for equality:            test string1 = string2
Tests two strings for inequality:        test string1 != string2
Tests for a nonzero string length:     test string
68.    In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called
(A) NTFS file system   (B) Hardware abstraction layer
(C) Microkernel                        (D) Process Manager
69.    To place a sound into a word document, following feature of windows is used:
(A) Clip board   (B) Task switching
(C) C Win App  (D) OLE
70.    Translation Look-aside Buffer(TLB) is
(A) a cache-memory in which item to be searched is compared one-by-one with the keys.
(B) a cache-memory in which item to be searched is compared with all the keys simultaneously.
(C) an associative memory in which item to be searched is compared one-by-one with the keys.
(D) an associative memory in which item to be searched is compared  with all the keys simultaneously.
71.    Simplest way of deadlock recovery is
(A) Roll back
(B) Preempt resource
(C) Lock one of the processes
(D) Kill one of the processes
72.    The directory structure used in Unix file system is called
(A) Hierarchical directory
(B) Tree structured directory
(C) Directed acyclic graph
(D) Graph structured directory
73.    Which statement is not true about process 0 in the Unix operating system?
(A) Process 0 is called init process.
(B) Process 0 is not created by fork system call.
(C) After forking process 1, process 0 becomes swapper process.
(D) Process 0 is a special process created when system boots.
74.    Which of the following commands would return process_id of sleep command?
(A) Sleep 1 and echo \$?
(B) Sleep 1 and echo \$#
(C) Sleep 1 and echo \$x
(D) Sleep 1 and echo \$!
75.    Possible thread states in Windows 2000 operating system include:
(B) Ready, standby, running, waiting, transition and terminated.
(C) Ready, running, waiting, transition and terminated
(D) Standby, running, transition and terminated.