Friday, 27 January 2017

CBSE UGC NET Computer Science Paper III Solved January 2017 - Part 8

71.       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:
Answer: 3
72.       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:
(1) 0.20
(2) 1.0
(3) 0.02
(4) -1.0
Answer: 3
73.       Which of the following neural networks uses supervised learning?
(A) Multilayer perceptron
(B) Self organizing feature map
(C) Hopfield network
(1) (A) only
(2) (B) only
(3) (A) and (B) only
(4) (A) and (C) only
Answer: 1
74.       Unix command to change the case of first three lines of file “shortlist” from lower to upper
(1) $ tr ‘[a-z]’ ‘[A-Z]’ shortlist | head-3
(2) $ head-3 shortlist | tr ‘[a-z]’ ‘[A-Z]’
(3) $ tr head-3 shortlist ‘[A-Z]’ ‘[a-z]’
(4) $ tr shortlist head-3 ‘[a-z]’ ‘[A-Z]’
Answer: 2
75.       Match the following vi commands in Unix:
List-I                  List-II
a.            :w        i. saves the file and quits
editing mode
b.                        :x         ii. escapes unix shell
c.             :q         iii. saves file and remains
in editing mode
d.            :sh       iv. quits editing mode and
no changes are saved to
the file
Codes:
     a   b  c  d
(1) ii   iii  i  iv
(2) iv  iii  ii  i
(3) iii  iv  i  ii
(4) iii  i   iv ii
Answer: 4


CBSE UGC NET Computer Science Paper III Solved January 2017 - Part 7

61.       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?
(1) Both (A) and (B) are false.
(2) Both (A) and (B) are true.
(3) (A) is true, (B) is false.
(4) (A) is false, (B) is true.
Answer: 2
62.       Which of the following pairs have different expressive power?
(1) Single-tape-turing machine and multi-dimensional turing machine.
(2) Multi-tape turing machine and multi-dimensional turing machine.
(3) Deterministic push down automata and non-deterministic pushdown automata.
(4) Deterministic finite automata and Non-deterministic finite automata.
Answer: 3
63.       Which of the following statements is false?
(1) Every context-sensitive language is recursive.
(2) The set of all languages that are not recursively enumerable is countable.
(3) The family of recursively enumerable languages is closed under union.
(4) The families of recursively enumerable and recursive languages are closed under reversal.
Answer: 2
64.       Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error.
(1) t + 1
(2) t
(3) t - 2
(4) t/2
Answer: 2
65.       A t-error correcting q-nary linear code must satisfy:
Where M is the number of code words and X is
(1) qn
(2) qt
(3) q-n
(4) q-t
Answer: 1

66.       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.
(1) (a) only
(2) (a) and (b) only
(3) (b) and (C) only
(4) (a), (b) and (c)
Answer: Marks to all
67.       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)?
(1) a b
(2) b b
(3) b a
(4) b a a b
Answer: 4
68.       With respect to a loop in the transportation table, which one of the following is not correct?
(1) Every loop has an odd no. of cells and at least 5.
(2) Closed loops may or may not b square in shape.
(3) All the cells in the loop that have a plus or minus sign, except the starting cell, must be occupied cells.
(4) Every loop has an even no. of cells and at least four.
Answer: 1
69.       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.
(1) (a), (b) and (c)
(2) (a), (c) and (d)
(3) (a) and (d)
(4) (a), (b), (c) and (d)
Answer: 3
70.    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:
(1) 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
(2) 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
(3) 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
(4) 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
Answer: 1


CBSE UGC NET Computer Science Paper III Solved January 2017 - Part 6

51.       Match the following for Unix rue system:
List-I                  List-II
a. Boot block     i. Information about file system,
free block list, free inode list etc.
b. Super block ii. Contains operating system files
as well as program and data files
created by users.
c. Inode block   iii. Contains boot program and
partition table.
d. Data block    iv. Contains a table for every file in
the file system. Attributes of files
are stored here.
Codes:
     a   b  c   d
(1) iii   i   ii   iv
(2) iii   i   iv  ii
(3) iv  iii  ii   i
(4) iv  iii  i    ii
Answer: 2
52.       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:
(1) only (a) and (b)
(2) only (a) and (c)
(3) (a), (b) and (c)
(4) only (b) and (c)
Answer: 3
53.       One of the disadvantages of user level threads compared to Kernel level threads is
(1) If a user level thread of a process executes a system call, all threads in that process are blocked.
(2) Scheduling is application dependent.
(3) Thread switching doesn’t require kernel mode privileges.
(4) The library procedures invoked for thread management in user level threads are local procedures.
Answer: 1
54.       Which statement is not correct about “init” process in Unix?
(1) It is generally the parent of the login shell.
(2) It has PID 1.
(3) It is the first process in the system.
(4) Init forks and execs a ‘getty’ process at every port connected to a terminal.
Answer: 3
55.       Consider following two rules R1 and R2 in logical reasoning in Artificial Intelligence (AI):
(1) Only R1 is correct.
(2) Only R2 is correct.
(3) Both R1 and R2 are correct.
(4) Neither R1 nor R2 is correct.
Answer: 4

56.       Consider the following AO graph:
Which is the best node to expand next by AO* algorithm?
(1) A
(2) B
(3) C
(4) B and C
Answer: 1
57.       In Artificial Intelligence (AI), what is present in the planning graph?
(1) Sequence of levels
(2) Literals
(3) Variables
(4) Heuristic estimates
Answer: 1
58.       What is the best method to go for the game playing problem?
(1) Optimal Search
(2) Random Search
(3) Heuristic Search
(4) Stratified Search
Answer: 3
59.       Which of the following statements is true?
(1) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is satisfiable.
(2) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is valid.
(3) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄¬S is consistent.
(4) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄S is inconsistent.
Answer: 2
60.    The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of the following?
(1) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))
(2) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))
(3) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(Rᴠ¬P))
(4) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))
Answer: 2