UGC NET Computer Science Solved Paper II - December 2015 | UGC NET SOLVED PAPER/SMU SOLVED SAMPLE PAPER UGC NET SOLVED PAPER/SMU SOLVED SAMPLE PAPER: UGC NET Computer Science Solved Paper II - December 2015
Contact Us:

If You Have Any Problem, Wanna Help, Wanna Write Guest Post, Find Any Error Or Want To Give Us Feedback, Just Feel Free To Contact Us. We Will Reply You Soon.

Name: *

Email: *

Message: *


LiveZilla Live Help

UGC NET Computer Science Solved Paper II - December 2015

1.       How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women?
(A) 75240          (B) 52492
(C) 41800          (D) 9900
Answer: B
We must choose at least 3 women, so we calculate the case of 3 women, 4 women and 5 women and by addition rule add the results.
12C3 x 20C2 + 12C4 x 20C1 + 12C5 x 20C0 = (12x11x10/3x2x1) x (20x19/2x1)
                                                                            + (12x11x10x9/4x3x2x1) x 20
                                                                            + (12x11x10x9x8/5x4x3x2x1) x 1
                                                                = 220 x 190 + 495 x 20 + 792
                                                                = 52492
2.       Which of the following statement(s) is/are false?
(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree.
(c) A complete graph (Kn) has a Hamilton Circuit whenever n≥3
(d) A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.
(A) (a) only        (B) (b) and (c)
(C) (c) only        (D) (d) only
Answer: D
Bipartite Graph
From the above definitions, we can see that (d) is false. So answer is (D).
3.       Which of the following is/are not true?
(a) The set of negative integers is countable.
(b) The set of integers that are multiples of 7 is countable.
(c) The set of even integers is countable.
(d) The set of real numbers between 0 and 1/2 is countable.
(A) (a) and (c)               (B) (b) and (d)
(C) (b) only                    (D) (d) only
Answer: D
4.       Consider the graph given below:
The two distinct sets of vertices, which make the graph bipartite are:
(A) (v1, v4, v6); (v2, v3, v5, v7, v8)          (B) (v1, v7, v8); (v2, v3, v5, v6)
(C) (v1, v4, v6, v7); (v2, v3, v5, v8)          (D) (v1, v4, v6, v7, v8); (v2, v3, v5)
Answer: C
A simple graph G=(V,E) is called bipartite if its vertex set can be partitioned into two disjoint subsets V=V1V2, such that every edge has the form e=(a,b) where aϵV1 and bϵV2.
Bipartite graphs are equivalent to two-colorable graphs.
1.            Assign Red color to the source vertex (putting into set V1).
2.            Color all the neighbours with Black color (putting into set V2).
3.            Color all neighbour’s neighbour with Red color (putting into set V1).
4.            This way, assign color to all vertices such that it satisfies all the constraints of m way coloring problem where m = 2.
5. While assigning colors, if we find a neighbour which is colored with same color as current vertex, then the graph cannot be colored with 2 colors (ie., graph is not Bipartite).
So answer is option (C).
5.       A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?
(A) (a) and (b)               (B) (b) and (c)
(C) (a) and (c)               (D) (a), (b) and (c)
Answer: D
Caterpillar tree: In graph theory, a caterpillar is a tree in which all the vertices are within distance 1 of a central path.
Theorem: All caterpillars are graceful.
So, (a), (b) and (c) are graceful.

6.       Which of the following arguments are not valid?
(a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”.
(b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”.
(c) If n is a real number such that n>1, then n2>1. Suppose that n2>1, then n>1.
(A) (a) and (c)               (B) (b) and (c)
(C) (a), (b) and (c)        (D) (a) and (b)
Answer: A
(a)                       P: Gora gets the job
                            Q: Gora works hard
                            R: Gora gets promotion
                            S: Gora will be happy
The argument can bet written as
    Therefore       ¬P˅¬Q
(b)           Let       P: Puneet is not guilty
                            Q: Pankaj is telling the truth
The argument can bet written as
    Therefore,      P
Thus by disjunctive syllogism, the argument is valid.
Disjunctive Syllogism:
The disjunctive syllogism rule may be written as:
P˅Q, ¬P Q
It may also be written as:
where P, and Q are propositions expressed in some formal system.
7.       Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions.
(a) ∃m ∀n P(m,n)        (b) n P(1,n)             (c) n P(m,n)
(A) (a)-True; (b)-True; (c)-False         (B) (a)-True; (b)-False; (c)-False
(C) (a)-False; (b)-False; (c)-False     (D) (a)-True; (b)-True; (c)-True
Answer: A
8.       Match the following terms:
List - I                                     List - II
(a) Vacuous proof       (i) A proof that the implication p→q is true
based on the fact that p is false
(b) Trivial proof             (ii) A proof that the implication p→q is true
based on the fact that q is true
(c) Direct proof             (iii) A proof that the implication p→q is true
that proceeds by showing that q must be true when p is true.
(d) Indirect proof          (iv) A proof that the implication p→q is true
that proceeds by showing that p must be false when q is false.
      (a)  (b)   (c)    (d)
(A) (i)   (ii)   (iii)   (iv)
(B) (ii)   (iii)   (i)   (iv)
(C) (iii)   (ii)   (iv)  (i)
(D) (iv)   (iii)   (ii)  (i)
Answer: A
9.       Consider the compound propositions given below as:
(a) p˅~(p˄q)                  (b) (p˄~q)˅~(p˄q)                 (c) p˄(q˅r)
Which of the above propositions are tautologies?
(A) (a) and (c)               (B) (b) and (c)
(C) (a) and (b)               (D) (a), (b) and (c)
Answer: Marks to all
Only (a)
10.    Which of the following property/ies a Group G must hold, in order to be an Abelian group?
(a) The distributive property
(b) The commutative property
(c) The symmetric property
(A) (a) and (b)               (B) (b) and (c)
(C) (a) only                    (D) (b) only
Answer: D

11.       Consider the following program:
    int i, inp;
    float x, term=1, sum=0;
    scanf(“%d %f”,&inp, &x);
The program computes the sum of which of the following series?
(A) x+x2/2+x3/3+x4/4+...           (B) x+x2/2!+x3/3!+x4/4!+...
(C) 1+x2/2+x3/3+x4/4+...           (D) 1+x2/2!+x3/3!+x4/4!+...
Answer: B
12.       Consider the following two statements:
(a) A publicly derived class is a subtype of its base class.
(b) Inheritance provides for code reuse.
Which of the following statements is correct?
(A) Both the statements (a) and (b) are correct
(B) Neither of the statements (a) and (b) are correct
(C) Statement (a) is correct and (b) is incorrect
(D) Statement (a) is incorrect and (b) is correct
Answer: A
13.       Consider a “CUSTOMERS” database table having a column “CITY” filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have “GAR” somewhere in its name, is:
(A) Select *from customers where city=’%GAR%’;
(B) Select *from customers where city=’$GAR$’;
(C) Select *from customers where city like ‘%GAR%’;
(D) Select *from customers where city as ’%GAR’;
Answer: C
14.       Match the following database terms to their functions:
List-I                                       List-II
(a) Normalization                     (i) Enforces match of primary key to foreign key
(b) Data Dictionary                  (ii) Reduces data redundancy in a database
(c) Referential Integrity           (iii) Define view(s) of the database for particular user(s).
(d) External Schema               (iv) Contains metadata describing database structure.
      (a)   (b)   (c)    (d)
(A) (iv)   (iii)   (i)   (ii)
(B) (ii)    (iv)   (i)   (iii)
(C) (ii)   (iv)   (iii)   (i)
(D) (iv)   (iii)   (ii)   (i)
Answer: B
15.       In general, in a recursive and non-recursive implementation of a problem (program):
(A) Both time and space complexities are better in recursive than in non-recursive program
(B) Both time and space complexities are better in non-recursive than in recursive program
(C) Time complexity is better in recursive version but space complexity is better in non-recursive version of the program
(D) Space complexity is better in recursive version but time complexity is better in non-recursive version of the program
Answer: C

16.       A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer):
(A) &A[0][0][0]+w(y*z*q+z*p+r)
(B) &A[0][0][0]+w(y*z*p+z*q+r)
(C) &A[0][0][0]+w(x*y*p+z*q+r)
(D) &A[0][0][0]+w(x*y*q+z*p+r)
Answer: B
17.       In C++, which system-provided function is called when no handler is provided to deal with an exception?
(A) terminate()              (B) unexpected()
(C) abort()                      (D) kill()
Answer: A
18.       Which of the following provides the best description of an entity type?
(A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes)
(B) A value given to a particular attribute (e.g. height-230 cm)
(C) A thing that we wish to collect data about zero or more, possibly real world examples of it may exist.
(D) A template for a group of things with the same set of characteristics that may exist in the real world
Answer: D
19.       Data which improves the performance and accessibility of the database are called:
(A) Indexes                               (B) User Data
(C) Application Metadata       (D) Data Dictionary
Answer: A
20.    A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies:
F={AD→E, BE→F, B→C, AF→G}
Which of the following is a candidate key?
(A) A                   (B) AB
(C) ABC             (D) ABD
Answer: D

21.       Which of the following services is not provided by wireless access point in 802.11 WLAN?
(A) Association                        (B) Disassociation
(C) Error Correction     (D) Integration
Answer: C

22.       Which of the following fields in IPv4 datagram is not related to fragmentation?
(A) Type of service                  (B) Fragment offset
(C) Flags                                   (D) Identification
Answer: A
23.       Four channels are multiplexed using TDM. If each channel sends 100 bytes/second and we multiplex 1 byte per channel, then the bit rate for the link is ...............
(A) 400 bps                   (B) 800 bps
(C) 1600 bps                 (D) 3200 bps
Answer: D
The multiplexer is shown in the Figure.
Each frame carries 1 byte from each channel; the size of each frame, therefore, is 4 bytes, or 32 bits. Because each channel is sending 100 bytes/s and a frame carries 1 byte from each channel, the frame rate must be 100 frames per second. The bit rate is 100 × 32 = 3200 bps.
24.       In a typical mobile phone system with hexagonal cells, it is forbidden to reuse a frequency band in adjacent cells. If 840 frequencies are available, how many can be used in a given cell?
(A) 280               (B) 210
(C) 140              (D) 120
Answer: A
Each cell has six other adjacent cells, in a hexagonal grid. If the central cell uses frequency group A, its six adjacent cells can use B, C, B, C, B, and C respectively. In other words, only 3 unique cells are needed. So the answer is 840/3 = 280 frequencies.
25.       Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5?
(A) 13                 (B) 21
(C) 26                 (D) 33
Answer: Marks to all
p=3, q=13, d=7, e=3, M=5, C=?
C = Mmod n
n = p*q
    = 3*13 = 39
C = 53 mod 39
    = 8
Answer is 8.

26.       A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries:
Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU?
(A) 1024, 3072, 4096, 6144               (B) 1234, 4012, 5000, 6200
(C) 1020, 3012, 6120, 8100               (D) 2021, 4050, 5112, 7100
Answer: C
The pages which are not in main memory are:
Address that will cause page fault
1020 will not cause page fault (1024-2047)
3012 will not cause page fault (3072-4095)
6120 will not cause page fault (4096-5119)
8100 will not cause page fault (6144-7167)
27.       Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also doubled. Further, consider that a normal instruction takes one micro second, but if a page fault occurs, it takes 2001 micro seconds. If a program takes 60 sec to run, during which time it gets 15000 page faults, how long would it take to run if twice as much memory were available?
(A) 60 sec                      (B) 30 sec
(C) 45 sec                     (D) 10 sec
Answer: C
T = Ninstr x 1µs + 15,000 x 2,000 µs = 60s
Ninstr x 1µs = 60,000,000 µs – 15,000,000 µs = 30,000,000 µs
Ninstr = 30,000,000
The number of instruction between two page faults is
Ninstr /NPageFaults = 30,000,000/15,000 = 2,000
If the mean interval between page faults is doubled, the number of instruction between two page faults is also doubled and is 4,000. Now the number of page faults is
30,000,000/4,000 = 7,500
T’            = 30,000,000 µs + 7,500 x 2,000 µs
= 30,000,000 µs + 15,000,000 µs = 45,000,000 µs = 45s
Doubling the memory, doesn’t mean that the program runs twice as fast as on the first system. Here, the performance increase is of 25%.
28.       Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk?
(A) 57 msec      (B) 49 msec
(C) 48 msec      (D) 17 msec
Answer: B
Time in msec to read a block of 1024 bytes (Access time or Disk Latency) = seek time + average rotational delay + transfer time
If there are 16384 bytes per track there are 1024/16384 tracks to be read for this block.
Seek time = 40 msec
Rotational delay = 16 msec
Transfer time    = (sectors_read/sectors per rev.) x rotational delay
                            = (1024/16384) x 16 = 1
average rotational delay = rotational delay/2 = 16/2 = 8
access time       = 40 + 8 + 1 = 49
29.       A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows:

Process A
1 0 2 1 1
1 1 2 1 3
0 0 x 1 1
Process B
2 0 1 1 0
2 2 2 1 0

Process C
1 1 0 1 0
2 1 3 1 0

Process D
1 1 1 1 0
1 1 2 2 1

The smallest value of x for which the above system in safe state is .............
(A) 1                   (B) 3
(C) 2                   (D) 0
Answer: Marks to all
If Process A’s Maximum need is 1 1 2 1 2 instead of 1 1 2 1 3, then answer will be x=1
The needs matrix is as follows:
0 1 0 0 1
0 2 1 0 0
1 0 3 0 0
0 0 1 1 1
If x is 0, available vector will be 0 0 0 1 1, we have a deadlock immediately.
If x is 1, available vector will be 0 0 1 1 1, now, process D can run to completion. When it is finished, the available vector is 1 1 2 2 1.
Now A can run to complete, the available vector then becomes 2 1 4 3 2.
Then C can run and finish, return the available vector as 3 2 4 4 2.
Then B can run to complete. Safe sequence D A C B.
30.    In Unix, the login prompt can be changed by changing the contents of the file ...............
(A) contrab                    (B) init
(C) gettydefs                 (D) inittab
Answer: C

31.       A data cube C, has n dimensions, and each dimension has exactly p distinct values in the base cuboid. Assume that there are no concept hierarchies associated with the dimensions. What is the maximum number of cells possible in the data cube, C?
(A) pn                  (B) p
(C) (2n-1)p+1     (D) (p+1)n
Answer: D
(a) What is the maximum number of cells possible in the base cuboid?
This is the maximum number of distinct tuples that you can form with p distinct values per dimensions.
(b) What is the minimum number of cells possible in the base cuboid?
You need at least p tuples to contain p distinct values per dimension. In this case no tuple shares any value on any dimension.
(c) What is the minimum number of cells possible in the data cube, C?
The minimum number of cells is when each cuboid contains only p cells, except for the apex, which contains a single cell.
(d) What is the maximum number of cells possible (including both base cells and aggregate cells) in the data cube, C?
The argument is similar to that of part (a), but now we have p+1 because in addition to the p distinct values of each dimension we can also choose .
32.       Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the proportion of persons having meningitis is 1/50000, and that the proportion of people having stiff neck is 1/20. Then the percentage of people who had meningitis and complain about stiff neck is:
(A) 0.01%          (B) 0.02%
(C) 0.04%          (D) 0.05%
Answer: B
The computation is based on the simplified Bayes’ formula.
P{B|A} = (P{A|B}·P{B) / P{A}.
P{M|S} = probability that a person had meningitis, conditioned by the existence of stiff neck.
P{S|M} = probability that a person complains about stiff neck, conditioned by the existence of meningitis. = 50%=1/2
P{S} = proportion of people who complain about stiff neck. = 1/20
P{M} = proportion of people who had meningitis. = 1/50,000
P{M|S} = (P{S|M}·P{M}) / P{S} =(1/2 x 1/50,000) / 1/20 = 0.0002 = 0.02%
33.       ................. system is market oriented and is used for data analysis by knowledge workers including Managers, Executives and Analysts.
(A) OLTP                       (B) OLAP
(C) Data System          (D) Market System
Answer: B
34.       .................. allows selection of the relevant information necessary for the data warehouse.
(A) The Top-Down View         (B) Data Warehouse View
(C) Data source View             (D) Business Query View
Answer: A
35.       The hash function used in double hashing is of the form:
(A) h(k, i)=(h1(k)+h2(k)+i)mod m                    (B) h(k, i)=(h1(k)+h2(k)-i)mod m
(C) h(k, i)=(h1(k)+ih2(k))mod m                      (D) h(k, i)=(h1(k)-ih2(k))mod m
Answer: C

36.       In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.
It shows which of the following depth first forest?
(A) {a,b,e} {c,d,f,g,h}                (B) {a,b,e} {c,d,h} {f,g}
(C) {a,b,e} {f,g} {c,d} {h}           (D) {a,b,c,d} {e,f,g} {h}
Answer: C
37.       The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is:
(A) θ(logn h*t)                (B) θ(logt n*h)
(C) θ(logh n)                  (D) θ(logt n)
Answer: D
38.       The inorder traversal of the following tree is:
(A) 2 3 4 6 7 13 15 17 18 18 20
(B) 20 18 18 17 15 13 7 6 4 3 2
(C) 15 13 20 4 7 17 18 2 3 6 18
(D) 2 4 3 13 7 6 15 17 20 18 18
Answer: D
39.       An ideal sort is an in-place-sort whose additional space requirement is ...............
(A) O(log2n)                  (B) O(nlog2n)
(C) O(1)                         (D) O(n)
Answer: C
40.    Which of the following is not a congestion policy at network layer?
(A) Flow Control Policy
(B) Packet Discard Policy
(C) Packet Lifetime Management Policy
(D) Routing Algorithm
Answer: A

41.       Loop unrolling is a code optimization technique:
(A) that avoids tests at every iteration of the loop
(B) that improves performance by decreasing the number of instructions in a basic block.
(C) that exchanges inner loops with outer loops
(D) that reorders operations to allow multiple computations to happen in parallel.
Answer: A
42.       What will be the hexadecimal value in the register ax (32-bit) after executing the following instructions?
Mov al, 15
Mov ah, 15
Xor al, al
Mov cl, 3
Shr ax, cl
(A) 0F00 h         (B) 0F0F h
(C) 01E0 h        (D) FFFF h
Answer: C
43.       Which of the following statements is false?
(A) Top-down parsers are LL parsers where first L stands for left-to-right scan and second L stands for a leftmost derivation.
(B) (000)* is a regular expression that matches only strings containing an odd number of zeroes, including the empty string.
(C) Bottom-up parsers are in the LR family, where L stands for left-to-right scan and R stands for rightmost derivation
(D) The class of context-free languages is closed under reversal. That is, if L is any context-free language, then the language LR={WR:wϵL} is context free.
Answer: B
44.       System calls are usually invoked by using:
(A) A privileged instruction    (B) An indirect jump
(C) A software interrupt          (D) Polling
Answer: C
45.       The ............... transfers the executable image of a C++ program from hard disk to main memory.
(A) Compiler     (B) Linker
(C) Debugger   (D) Loader
Answer: D

46.       In software testing, how the error, fault and failure are related to each other?
(A) Error leads to failure but fault is not related to error and failure
(B) Fault leads to failure but error is not related to fault and failure
(C) Error leads to fault and fault leads to failure
(D) Fault leads to error and error leads to failure
Answer: C
47.       Which of the following is not a software process model?
(A) Prototyping             (B) Iterative
(C) Timeboxing                        (D) Glassboxing
Answer: D
48.       How many solutions are there for the equation x+y+z+u=29 subject to the constraints that x≥1, y≥2, z≥3 and u≥0?
(A) 4960                        (B) 2600
(C) 23751          (D) 8855
Answer: B
49.       A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each?
(A) 32 GB          (B) 64 GB
(C) 16 GB          (D) 1 GB
Answer: C
block = 210
block pointer size = 4B
entries possible in block = 210/22 = 256
direct pointer gives = 10 * 256 = 10 blocks
single indirect gives = 256 * 256 = 28 blocks
double indirect gives = 256 * 256 * 256 = 216 blocks
triple indirect gives = 256 * 256 * 256 * 256 = 224 blocks
total = 10 blocks + 28 blocks + 216 blocks + 224 blocks
= 16843018 blocks = 16843018 * 1024 = 17247250432 ≈ 16 GB
50.    ................. uses electronic means to transfer funds directly from one account to another rather than by cheque or cash?
(A) M-Banking              (B) E-Banking
(C) O-Banking              (D) C-Banking
Answer: B
Like the Post? Share with your Friends:-

Team SB
Posted By: DG Group

Contact Us


Email *

Message *


Latest post

Recent Comment

Copyright © . DG-Mission-UGC-NET. All Rights Reserved.
Designed by :-Way2themes