UGCNET Computer Science June 2015 Paper III

Q1. For the 8-bit word 00111001, the check bits stored with it would be 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory?

(A) 10011001

(B) 00011001

(D) 11000110

Ans .

(B) 00011001

Explanation :
Given 8 bit word 00111001. encoded in d8=0 d7=0 d6=1 d5=1 d4=1 d3=0 d2=0 d1=1.
parity is calculated as 01111 which are written as p8p4p2p1.
p1=1 p2=1 p4=1 p8=0
encode the string as
d8 d7 d6 d5 p8 d4 d3 d2 p4 d1 p2 p1.
001101001111.
check bit at other end is 1101.
c1=1 c2=0 c4=1 c8=1.
xor(1101,0111)=1010 . its decimal conversion is 10. so 10th bit is changed. 10th bit is d6.
so we flip it. and we get 00011001

Q2. Consider a 32 - bit microprocessor , with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that the microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor?

(A) 8x106 bytes/sec

(B) 4x106 bytes/sec

(D) 4x109 bytes/sec

Ans .

(B) 4x106 bytes/sec

Explanation :
Minimum bus cycle duration = 4 clock cycle.
maximum bus cycle rate= 8 MHZ/4= 2M/s where 1 MHZ= 1000000/sec.
maximum data transferred per bus cycle rate= 2bytes.
data transferred rate per second = data transferred per bus cycle* bus cycle rate.= 2bytes*2M/s

Q3. The RST 7 instruction in 8085 microprocessor is equivalent to:

(A) CALL 0010 H

(B) CALL 0034 H

(D) CALL 003C H

Ans .

Explanation :

Q4. The equivalent hexadecimal notation for octal number 2550276 is:

(A) FADED

(B) AEOBE

(D) ACABE

Ans .

Explanation :
010 for 2. 101 for 5 and similarly.
so we organize every thing as.
010101101000010111110.
Now this binary representation is grouped in to 4 to get the Hexadecimal notation.
0 1010 1101 0000 1011 1110 so after converting every group in HEX.
we get ADOBE.

Q5. The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memory read/write employs one machine cycle. For execution of the programs, the system utilizes 90 percent of the CPU time. For block data transfer , an IO device is attached to the system while CPU executes the background programs continuously. What is the maximum IO data transfer rate if programmed IO data transfer technique is used?

(A) 500 Kbytes/sec

(B) 2.2 Mbytes/sec

(D) 250 Kbytes/sec

Ans .

(D) 250 Kbytes/sec

Explanation :
CPU speed 1MIPS=10^6 instruction per sec
1 Cpu instruction =4 machine cycles(Avg)
1 memory read/access = 1 machine cycle
CPU utilization =90%
Programmed I/O
each byte transfer requires 4 cycles (instructions)
in status
check status
Branch
Read/Write data
max data transfer rate CPU speed /4 = 10^6/4=250 kbytes/sec

Q6. The number of flip-flops required to design a modulo-272 counter is:

(A) 8

(B) 9

(D) 11

Ans .

(B) 9

Explanation :
The number of flipflop required to design a Modulo 272 counter is Log2 272. 8 flips flops do the work up to 256. hence we need 9 flip flops to achieve the task.

Q7. Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any attributes of their own. How many minimum number of tables are required to represent this situation in the Relational Model?

(A) 4

(B) 3

(D) 1

Ans .

(B) 3

Explanation :
Let relation R1 is composed of table emp(ssn,name, Superssn). A query like this can be made from single table like. Find the employee ssn, name, super visor ssn, supervisor name from emp table. An ssn will map to a single supervisor and a supervisor can map to many employee.
In many to many relationship like “a student can take many subjects and many students can take a subject”. it needs two table.eg. student(rollno,subject,name) where pk= roll no and subject. and fk = subject. Foreign key map to pk of subjet (Subjetid, Subjname, Roomno). Hence it required 3 tables

Q8. The STUDENT information in a university is stored in the relation STUDENT (Name, Sex, Marks, DEPT_Name) Consider the following SQL Query SELECT DEPT_Name from STUDENT where SEX='M' group by DEPT_Name having avg (Marks)>(SELECT avg (Marks) from STUDENT). It returns the Name of the Department for which:

(A) The Average marks of Male students is more than the average marks of students in the same Department

(B) The average marks of male students is more than the average marks of the students in the University

(D) The average marks of students is more than the average marks of male students in the University

Ans .

(B) The average marks of male students is more than the average marks of the students in the University

Explanation :

Q9. Select the ‘False’ statement from the following statements about Normal Forms:

(A) Lossless preserving decomposition into 3NF is always possible

(B) Lossless preserving decomposition into BCNF is always possible

(D) BCNF is stronger than 3NF

Ans .

(B) Lossless preserving decomposition into BCNF is always possible

Explanation :
Table 1(A,B,C) with FD AB->C and C->B cannot be preserved when decomposition is done

Q10. The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because :

(A) Non key attribute V_name is dependent on V_no which is part of composite key

(B) Non key attribute V_name is dependent on Qty_sup

(D) key attribute V_ord_no is dependent on primary_key unit price

Ans .

(A) Non key attribute V_name is dependent on V_no which is part of composite key

Explanation :
for lossless decomposition .Atleast one of the following dependencies should be in F+.
R1 intersction R2->R1. Eq. 1.
or
R1 intersection R2->R2. Eq2.
when a decompostion satisfies eq 1. given above then that will solve the R1 intersection R2 –>>(R1-R2).
when a decomposition satisfies eq2 given above then that will solve the R1 intersection R2 –>>(R2-R1).

Q11. The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if:
(a) R1⋂ R2→(R1-R2)
(b) R1→R2
(c) R1⋂ R2→(R2-R1)
(d) R2→R1⋂ R2

(A) (a) and (b) happens

(B) (a) and (d) happens

(D) (b) and (c) happens

Ans .

Explanation :

Q12. In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:

(A) The number of blocks used for index, and the size of index

(B) Size of Blocks and size of Address

(D) Size of Block

Ans .

(A) The number of blocks used for index, and the size of index

Explanation :

Q13. Give the number of principal vanishing point(s) along with their direction for the standard perspective transformation:

(A) Only one in the direction K

(B) Two in the directions I and J

(D) Only two in the directions J and K

Ans .

(A) Only one in the direction K

Explanation :

Q14. Consider a triangle A(0, 0), B(1, 1), C(5, 2). The triangle has to be rotated by an angle of 450 about the point P(-1, -1). What shall be the coordinates of the new triangle?

(A) A'=(1, √2-1), B'=(-1, 2√2-1), C'=(3√2-1, (9/2)√2-1)

(B) A'=(1, √2-1), B'=(2√2-1, -1), C'=(3√2-1, (9/2)√2-1)

(D) A'=(√2-1, -1), B'=(-1, 2√2-1), C'=(3√2-1, (9/2)√2-1)

Ans .

Explanation :

Q15. The process of dividing an analog signal into a string of discrete outputs, each of constant amplitude, is called:

(A) Strobing

(B) Amplification

(D) Quantization

Ans .

(D) Quantization

Explanation :

Q16. Which of the following is not a basic primitive of the Graphics Kernel System(GKS) ?

(A) POLYLINE

(B) POLYDRAW

(D) POLYMARKER

Ans .

(B) POLYDRAW

Explanation :
Basic primitive of GKS are Polyline,polymarker, fillarea,text.

Q17. Which of the following statements is/are incorrect ?
(a) Mapping the co-ordinates of the points and lines that form the picture into the appropriate co-ordinates on the device or workstation is known as viewing transformation.
(b) The right handed cartesian co-ordinates system in whose coordinates we describe the picture is known as world coordinate system.
(c) The co-ordinate system that corresponds to the device or workstation where the image is to be displayed is known as physical device co-ordinate system.
(d) Left-handed co-ordinate system in which the display area of the virtual display device corresponds to the unit(|x|) square whose lower left handed corner is at origin of the co-ordinate system, is known as normalized device co-ordinate system.

(A) (a) only

(B) (a) and (b)

(D) (d) only

Ans .

(D) (d) only

Explanation :
In normalized device coordinate system lower left corner corresponds to (0,0) and upper rightcorner corresponds to (1,1).

Q18. Match the following:

(A) (i) (ii) (iii) (iv) (v)

(B) (ii) (iii) (i) (iv) (v)

(D) (iv) (v) (i) (ii) (iii)

Ans .

(A) (i) (ii) (iii) (iv) (v)

Explanation :

Q19. Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have:

(A) 1 final state among 5 states

(B) 4 final states among 5 states

(D) 5 final states among 6 states

Ans .

(D) 5 final states among 6 states

Explanation :

Q20. The regular expression corresponding to the language L where L={x ∈ {0,1}* | x ends with 1 and does not contain substring 00 } is:

(A) (1 + 01)* (10 + 01)

(B) (1 + 01)* 01

(D) (10 + 01)* 01

Ans .

Explanation :
Option A can yield string terminating with 0 hence it fails.
Option D an yield string 1001. Hence it also fails.
Option C. generates all string with length1,2,3,—– terminating with 1 and does not contain 00 substring.

Q21. The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by:
δ(q0, a)=q1 ; δ(q0, b)=q2
δ(q1, a)=q0 ; δ(q1, b)=q3
δ(q2, a)=q3 ; δ(q2, b)=q0
δ(q3, a)=q2 ; δ(q3, b)=q1
the initial and final states of the automata are:

(A) q0 and q0 respectively

(B) q0 and q1 respectively

(D) q0 and q3 respectively

Ans .

(D) q0 and q3 respectively

Explanation :
Accepted words are { ab, ba, aaab,abaa, aaba,bbba—–}
A and b are of odd length. Hence from diagram from the above transitions. option D is correct.

Q22. The clausal form of the disjunctive normal form ¬A∨ ¬B∨ ¬C∨ D is:

(A) A ∧ B ∧ C ⇒ D

(B) A ∨ B ∨ C ∨ D ⇒ true

(D) A ∧ B ∧ C ∧ D ⇒ false

Ans .

(A) A ∧ B ∧ C ⇒ D

Explanation :
~Av(~Bv~C)vD.
~AV ~(B^C)VD.
~(A^B^C)VD.
We know A-> B = ~AV B.
So it turns out to be A^B^C->D.

Q23. Which of the following is false for the programming language PROLOG?

(A) A PROLOG variable can only be assigned to a value once

(B) PROLOG is a Strongly Typed Language.

(D) the scope of a variable in PROLOG is a Single Query

Ans .

(B) PROLOG is a Strongly Typed Language.

Explanation :

Q24. Which one of the following is true?

(A) The resolvent of two Horn clauses is not a Horn clause.

(B) The resolvent of two Horn clauses is a Horn Clause.

(C) If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal.

(D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.

Ans .

(B) The resolvent of two Horn clauses is a Horn Clause.

Explanation :

Q25. Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender?

(A) Broadcasting

(B) Unicasting

(D) Circuit Switching

Ans .

(D) Circuit Switching

Explanation :

Q26. Which of the following control fields in TCP header is used to specify the sender has no more data to transmit?

(A) FIN

(B) RST

(D) PSH

Ans .

(A) FIN

Explanation :

Q27. Which are the two modes of IP security?

(A) Transport and Certificate

(B) Transport and Tunnel

(D) Preshared and Transport

Ans .

(B) Transport and Tunnel

Explanation :

Q28. A message “COMPUTERNETWORK” encrypted(ignore quotes)using columnar transposition cipher with a key “LAYER”. The encrypted message is:

(A) CTTOEWMROPNRUEK

(B) MROUEKCTTPNROEW

(D) UEKPNRMROOEWCTT

Ans .

Explanation :

Q29. Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample requires 8 bits?

(A) 32 kbps

(B) 64 kbps

(D) 256 kbps

Ans .

Explanation :

Q30. The Maximum payload of a TCP segment is

(A) 65,535

(B) 65,515

(D) 65,475

Ans .

Explanation :

Q31. An all-pairs shortest-paths problem is efficiently solved using:

(A) Dijkstra' algorithm

(B) Bellman-Ford algorithm

(D) Floyd-Warshall algorithm

Ans .

(D) Floyd-Warshall algorithm

Explanation :

Q32. The travelling salesman problem can be solved in:

(A) Polynomial time using dynamic programming algorithm

(B) Polynomial time using branch-and-bound algorithm

(D) Polynomial time using backtracking algorithm.

Ans .

Explanation :

Q33. Which of the following is asymptotically smaller?

(A) lg(lg*n)

(B) lg*(lg n)

(D) lg*(n!)

Ans .

(A) lg(lg*n)

Explanation :

Q34. Consider a hash table of size m=100 and the hash function h(k) = floor(m(kA mod 1)) for A = (√5 − 1)/2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table.

(A) 77

(B) 82

(D) 89

Ans .

Explanation :

Q35. Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct?

(A) θ(f(n) * g(n)) = min(f(n), g(n))

(B) θ(f(n) * g(n)) = max(f(n), g(n))

(D) θ(f(n) + g(n)) = max(f(n), g(n))

Ans .

(D) θ(f(n) + g(n)) = max(f(n), g(n))

Explanation :

Q36. The number of nodes of height h in any n - element heap is _____________

(A) h

(B) zh

(D) ceil(n/zh+1)

Ans .

(D) ceil(n/zh+1)

Explanation :

Q37. In Java, when we implement an interface method, it must be declared as:

(A) Private

(B) Protected

(D) Friend

Ans .

Explanation :

Q38. The Servlet Response interface enables a servlet to formulate a response for a client using the method _____________

(A) void log(Exception e, String s)

(B) void destroy()

(D) void setContextType(String Type)

Ans .

(D) void setContextType(String Type)

Explanation :

Q39. Which one of the following is correct?

(A) Java applets cannot be written in any programming language

(B) An applet is not a small program.

(D) Applets are embedded in another applications.

Ans .

(D) Applets are embedded in another applications.

Explanation :

Q40. In XML we can specify the frequency of an element by using the symbols:

(A) + * !

(B) # * !

(D) - * ?

Ans .

Explanation :
+ symbol for one or more time.
* for 0 or more time.
? for zero or more time

Q41. In XML, DOCTYPE declaration specifies to include a reference to __________ file.

(A) Document Type Definition

(B) Document Type Declaration

(D) Document Type language

Ans .

(A) Document Type Definition

Explanation :

Q42. Module design is used to maximize cohesion and minimize coupling. Which of the following is the key to implement this rule?

(A) Inheritance

(B) Polymorphism

(D) Abstraction

Ans .

Explanation :
The basic idea underlying modular design is to organize a complex system (such as a large program, an electronic circuit, or a mechanical device) as a set of distinct components that can be developed independently and then plugged together. Although this may appear a simple idea, experience shows that the effectiveness of the technique depends critically on the manner in which systems are divided into components and the mechanisms used to plug components together. The following design principles are particularly relevant to parallel programming. Ensure that modules hide information.
related functions that can benefit from a common implementation or that are used in many parts of a system.
functionality that is likely to change during later design or deployment.
aspects of a problem that are particularly complex, and/or.
code that is expected to be reused in other programs.
The benefits of modularity do not follow automatically from the act of subdividing a program. The way in which a program is decomposed can make an enormous difference to how easily the program can be implemented and modified. Experience shows that each module should encapsulate information that is not available to the rest of a program. This information hiding reduces the cost of subsequent design changes.

Q43. Verification:

(A) refers to the set of activities that ensure that software correctly implements a specific function.

(B) gives Answer to the question - Are we building the product right ?

(D) both (A) and (B)

Ans .

(D) both (A) and (B)

Explanation :

Q44. Which design metric is used to measure the compactness of the program in terms of lines of code?

(A) Consistency

(B) Conciseness

(D) Accuracy

Ans .

(B) Conciseness

Explanation :

Q45. Requirements prioritization and negotiation belongs to:

(A) Requirements validation

(B) Requirements elicitation

(D) Requirement reviews

Ans .

(B) Requirements elicitation

Explanation :

Q46. Adaptive maintenance is a maintenance which ____________

(A) Correct errors that were not discovered till testing phase.

(B) is carried out to port the existing software to a new environment.

(D) both (B) and (C)

Ans .

(B) is carried out to port the existing software to a new environment.

Explanation :

Q47. A Design concept Refinement is a:

(A) Top-down Approach

(B) Complementary of Abstraction concept

(D) All of the above

Ans .

(D) All of the above

Explanation :

Q48. A software design is highly modular if :

(A) cohesion is functional and coupling is data type.

(B) cohesion is coincidental and coupling is data type.

(D) cohesion is functional and coupling is stamp type.

Ans .

(A) cohesion is functional and coupling is data type.

Explanation :

Q49. Match the following for operating system techniques with the most appropriate advantage:

(A) (iii) (i) (ii) (iv)

(B) (iii) (i) (iv) (ii)

(D) (ii) (iii) (iv) (i)

Ans .

(B) (iii) (i) (iv) (ii)

Explanation :

Q50. Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?

(A) Queues have different priorities.

(B) Each queue may have different scheduling algorithm

(D) This algorithm can be configured to match a specific system under design

Ans .

Explanation :

Q51. What is the most appropriate function of Memory Management Unit (MMU) ?

(A) It is an associative memory to store TLB

(B) It is a technique of supporting multiprogramming by creating dynamic partitions

(D) It is an algorithm to allocate and deallocate main memory to a process

Ans .

Explanation :

Q52. Dining Philosopher's problem is a:

(A) Producer-Consumer problem

(B) Classical IPC problem

(D) Synchronization primitive

Ans .

(B) Classical IPC problem

Explanation :

Q53. In _______________ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.

(A) Index

(B) Linked

(D) Bit Map

Ans .

(B) Linked

Explanation :

Q54. A unix file may be of type:

(A) Regular file

(B) Directory File

(D) Any one of the above

Ans .

(D) Any one of the above

Explanation :

Q55. Match the following:

(A) (iii) (ii) (iv) (i)

(B) (iii) (i) (iv) (ii)

(D) (i) (iii) (iv) (ii)

Ans .

(B) (iii) (i) (iv) (ii)

Explanation :

Q56. Match the following knowledge representation techniques with their applications:

(A) (iii) (iv) (i) (ii)

(B) (iii) (iv) (ii) (i)

(D) (iv) (iii) (ii) (i)

Ans .

(A) (iii) (iv) (i) (ii)

Explanation :

Q57. In propositional logic P↔Q is equivalent to (Where ~ denotes NOT):

(A) ~(P ∨ Q) ∧ ~(Q∨ P)

(B) (~P ∨ Q) ∧ (~Q∨ P)

(D) ~(P ∨ Q)→~(Q∨ P)

Ans .

(B) (~P ∨ Q) ∧ (~Q∨ P)

Explanation :
P<->Q= (P->Q)^(Q->P).
We know A->B is ~AvB.

Q58. Which of the following statements is true for Branch-and-Bound search?

(A) Underestimates of remaining distance may cause deviation from optimal path.

(B) Overestimates can’t cause right path to be overlooked.

(D) All of the above

Ans .

Explanation :

Q59. Match the following with respect to heuristic search techniques:

(A) (i) (iv) (iii) (ii)

(B) (iv) (i) (ii) (iii)

(D) (iv) (ii) (i) (iii)

Ans .

(B) (iv) (i) (ii) (iii)

Explanation :

Q60. Match the following for methods of MIS development:

(A) (i) (iii) (ii) (iv)

(B) (iv) (iii) (i) (ii)

(D) (iii) (i) (iv) (ii)

Ans .

(B) (iv) (iii) (i) (ii)

Explanation :

Q61. A context free grammar for L={w|n0(w)>n1(w)} is given by:

(A) S→0|0S|1SS

(B) S→0S|1S|0SS|1SS|0|1

(D) S→0S|1S|0|1

Ans .

Explanation :

Q62. Given the following two statements:
S1: If L1 and L2 are recursively enumerable languages over ∑, then L1∪ L2 and
L1⋂ L2 are also recursively enumerable.
S2: The set of recursively enumerable languages is countable.
Which of the following is correct?

(A) S1 is correct and S2 is not correct

(B) S1 is not correct and S2 is correct

(D) Both S1 and S2 are correct

Ans .

(D) Both S1 and S2 are correct

Explanation :

(A) G1 is ambiguous and G2 is unambiguous grammars

(B) G1 is unambiguous and G2 is ambiguous grammars

(D) Both G1 and G2 are unambiguous grammars

Ans .

Explanation :
Let the string is aab.
it can be derived by.
S->AB->aAB->aaAB->aaεB->aaεbB->aaεbε.
and
we can derive in this way also.
S->aaB->aabB->aabε.
G1 is ambigious because we have two different tree structure.
Similarly G2.
let w=ab.
then S->A->ab.
and
S->B->abB->abε.
so we get two tree for a same string. so G2 is also ambigious.

Q64. Given the symbols A, B, C, D, E, F , G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is:

(A) 67/30

(B) 70/34

(D) 78/30

Ans .

Explanation :

Q65. The redundancy in images stems from:

(A) pixel decorrelation

(B) pixel correlation

(D) image size

Ans .

(B) pixel correlation

Explanation :

Q66. In a binary Hamming code the number of check digits is r then number of message digits is equal to:

(A) 2r-1

(B) 2r-r-1

(D) 2r+r-1

Ans .

(B) 2r-r-1

Explanation :

Q67. In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of:

(A) rows or columns

(B) rows+columns

(D) rows+columns+1

Ans .

(A) rows or columns

Explanation :

Q68. Consider the following transportation problem:
The initial basic feasible solution of the above transportation problem using Vogel’s Approximation Method(VAM) is given below: The solution of the above problem:

(A) is degenerate solution

(B) is optimum solution

(D) is infeasible solution

Ans .

(B) is optimum solution

Explanation :

Q69. Given the following statements with respect to linear programming problem:
S1: The dual of the dual linear programming problem is again the primal problem
S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution
S3: If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.
Which of the following is true?

(A) S1 and S2

(B) S1 and S3

(B) S2 and S3

(D) S1, S2 and S2

Ans .

(D) S1, S2 and S2

Explanation :

Q70. Consider the two class classification task that consists of the following points:
Class C1: [1 1.5] [1 -1.5]
Class C2: [-2 2.5] [-2 -2.5]
The decision boundary between the two classes using single perceptron is given by:

(A) x1+x2+1.5=0

(B) x1+x2-1.5=0

(D) x1-1.5=0

Ans .

Explanation :

Q71. Let A and B be two fuzzy integers defined as:
A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)}
B={(10,0.5), (11,1), (12,0.5)}
Using fuzzy arithmetic operation given by

(A) {(11,0.8), (13,1), (15,1)}

(B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)}

(D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Ans .

(D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Explanation :
f(A+B)= ((1+10,min(.3,.5)),((1+11),min(.3,1)),(1+12)min(.3,.5).
((2+10, min(.6,.5)),((2+11),min(.6,1)),((2+12)min(.6,.5)),
((3+10, .5),(14,1),(15,.5).
(4+10,.5),(4+11,.7),16(.5)
(5+10,.2),(16,.2),(17,.2)}.
after finding the minimum of A+B, find the max of duplicates.
{(11,.3),(12,max(.3,.5)),(13,max(.3,.6,.5)),(14,max(.5,1,.5)),(15,max(.5,.7,.2)), (16,max(.5,.2)),(17,.2).
so
{(11..3),(12,.5),(13,.6),(14,1),(15,.7),(16..5),(17,.2).

Q72. Suppose the function y and a fuzzy integer number around -4 for x are given as
y=(x-3)2+2
Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around -4) is given by:

(A) {(2,0.6), (3,0.3), (6,1), (11,0.3)}

(B) {(2,0.6), (3,1), (6,1), (11,0.3)}

(D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Ans .

Explanation :

Q73. Match the following for unix system calls:

(A) (ii) (iii) (iv) (i)

(B) (iii) (ii) (iv) (i)

(D) (iv) (iii) (i) (ii)

Ans .

(A) (ii) (iii) (iv) (i)

Explanation :

Q74. WOW32 is a:

(A) Win 32 API library for creating processes and threads.

(B) Special kind of file system to the NT name space.

(D) Special execution environment used to run 16 bit Windows applications on 32 bit machines.

Ans .

(D) Special execution environment used to run 16 bit Windows applications on 32 bit machines.

Explanation :

Q75. The Unix command:
$ vi file1 file2

(A) Edits file1 and stores the contents of file1 in file2

(B) Both files i.e. file1 and file2 can be edited using ‘ex’ command to travel between files

(D) Edits file1 first, saves it and the edits file2

Ans .

(B) Both files i.e. file1 and file2 can be edited using ‘ex’ command to travel between files

Explanation :

upscfever.com

UGCNET Computer Science June 2015 Paper III

UPSCFEVER - POPULAR PAGES

Join The Movement

Discussions and Comments