UGCNET Computer Science July 2016 Paper III

Q1. Which of the following is a sequential circuit?

(A) Multiplexer

(B) Decoder

(D) Full adder

Ans .

Explanation :

Q2. 8085 microprocessor has ............. hardware interrupts.

(A) 2

(B) 3

(D) 5

Ans .

(D) 5

Explanation :
There are 5 different hardware interrupts
these are RST 5.5, RST 6.5, RST 7.5, INTR, TRAP

Q3. Which of the following in 8085 microprocessor performs HL = HL + DE ?

(A) DAD D

(B) DAD H

(D) DAD SP

Ans .

(A) DAD D

Explanation :
DAD D instruction Add 16 bits register pair with H2 register.

Q4. The Register that stores all interrupt requests is:

(A) Interrupt mask register

(B) Interrupt service register

(D) Status register

Ans .

Explanation :
Interrupt request register (IRR) holds all requests of interrupt.

Q5. The ............... addressing mode is similar to register indirect addressing mode, except that an offset is added to the contents of the register . The offset and register are specified in the instruction.

(A) Base indexed

(B) Base indexed plus displacement

(D) Displacement

Ans .

(B) Base indexed plus displacement

Explanation :
Here option A is also correct if exact condition is not given otherwise option B is correct.

Q6. In ............. method, the word is written to the block in both the cache and main memory, in parallel.

(A) Write through

(B) Write back

(D) Direct mapping

Ans .

(A) Write through

Explanation :
Write through method change the content of memory from cache to main memory or main memory to hard disk etc. in parallel

Q7. Which of the following statements concerning Object-Oriented databases is FALSE?

(A) Objects in an object-oriented database contain not only data but also methods for processing the data.

(B) Object-oriented databases store computational instructions in the same place as the data.

(D) Object-oriented databases store more types of data than relational databases and access that data faster.

Ans .

Explanation :

Q8. In distributed databases, location transparency allows for database users, programmers and administrators to treat the data as if it is at one location. A SQL query with location transparency needs to specify:

(A) Inheritances

(B) Fragments

(D) Local formats

Ans .

(B) Fragments

Explanation :

Q9. Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S:
I. πA,B(R⋈ S)
II. R⋈ πB(S)
III. R∩(πA(R) Χ πB(S))
IV . πA,R.B(R Χ S) where R.B refers to the column B in table R.
One can determine that:

(A) I, III and IV are the same query.

(B) II, III and IV are the same query.

(D) I, III and III are the same query.

Ans .

(D) I, III and III are the same query.

Explanation :
πA,B(R⋈ S), R⋈ πB(S), R∩(πA(R) Χ πB(S)) returns rows from R where R.B=S.B Whereas πA,R.B(R Χ S) where R.B refers to the column B in table R returns R itself.

Q10. Which of the following statements is TRUE?
D1: The decomposition of the schema R(A,B,C) into R1(A,B) and R2(A,C) is always lossless.
D2: The decomposition of the schema R(A,B,C,D,E) having AD→B, C→DE, B→AE, AE→C into R1(A,B,D) and R2(A,C,D,E) is lossless.

(A) Both D1 and D2

(B) Neither D1 and D2

(D) Only D2

Ans .

(B) Neither D1 and D2

Explanation :
D1 is wrong because no functional dependencies is specified.

Q11. Consider the following ORACLE relations:
R(A,B,C) = {<1,2,3>, <1,2,0>, <1,3,1>, <6,2,3>, <1,4,2>, <3,1,4>}
S(B,C,D) = {<2,3,7>, <1,4,5>, <1,2,3>, <2,3,4>, <3,1,4>}

Consider the following two SQL queries SQ1 and SQ2:
SQ1: SELECT R.B, AVG(S.B)
FROM R, S
WHERE R.A = S.C AND S.D < 7
GROUP BY R.B;
SQ2: SELECT DISTINCT S.B, MIN (S.C)
FROM S
GROUP BY S.B
HAVING COUNT (DISTINCT S.D) > 1;
If M is the number of tuples returned by SQ1 and N is the number of tuples returned by SQ2 then

(A) M=4, N=2

(B) M=5, N=3

(D) M=3, N=3

Ans .

(A) M=4, N=2

Explanation :

Q12. Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique?

(A) Only the joining attributes are sent from one site to another and then all of the rows are returned.

(B) All of the attributes are sent from one site to another and then only the required rows are returned.

(D) All of the attributes are sent from one site to another and then only the required rows are returned.

Ans .

Explanation :

Q13. Consider the Breshenham’s circle generation algorithm for plotting a circle with centre (0,0) and radius ‘r’ units in first quadrant. If the current point is (x1,y1) and decision parameter is pi then what will be the next point (xi+1,yi+1) and updated decision parameter pi+1 for pi ≥ 0

(A) xi+1 = xi + 1 yi+1 = yi pi+1 = pi + 4xi + 6

(B) xi+1 = xi + 1 yi+1 = yi - 1 pi+1 = pi + 4(xi - yi) + 10

(D) xi+1 = xi - 1 yi+1 = yi pi+1 = pi + 4xi + 10

Ans .

(B) xi+1 = xi + 1 yi+1 = yi - 1 pi+1 = pi + 4(xi - yi) + 10

Explanation :

Q14. A point P(5,1) is rotated by 900 about a pivot point (2,2). What is the coordinate of new transformed point P’ ?

(A) (3,5)

(B) (5,3)

(D) (1,5)

Ans .

(A) (3,5)

Explanation :

Q15. Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper right-hand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates:
Line AB: A(-6,2) and B(-1,8)
Line CD: C(-1,5) and D(4,8)
Line EF: E(-2,3) and F(1,2)
Which of the following line(s) is/are candidate for clipping?

(A) AB

(B) CD

(D) AB and CD

Ans .

(D) AB and CD

Explanation :

Q16. In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of the viewer is projected to a broken line of infinite extent. This is known as ...................

(A) View confusion

(B) Vanishing point

(D) Perspective foreshortening

Ans .

Explanation :

Q17. Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further , Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............

(A) x’ = x + Shx . (y - yref) y’ = y

(B) x’ = x y’ = y . Shx

(D) x’ = Shy . y y’ = y . (x - xref)

Ans .

Explanation :

Q18. Which of the following statement(s) is/are correct with reference to curve generation?
I. Hermite curves are generated using the concepts of interpolation.
II. Bezier curves are generated using the concepts of approximation.
III. The Bezier curves lies entirely within the convex hull of its control points.
IV . The degree of Bezier curve does not depend on the number of control points.

(A) I, II and IV only

(B) II and III only

(D) I, II and III only

Ans .

(D) I, II and III only

Explanation :

Q19. Given the following statements:
(a) To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition.
(b) To implement ADT, a programming language requires some primitive operations that are built in the language processor.
(c) C++, Ada, Java 5.0, C#2005 provide support for parameterised ADT.
Which one of the following options is correct?

(A) (a), (b) and (c) are false.

(B) (a) and (b) are true; (c) are false.

(D) (a), (b) and (c) are true.

Ans .

(D) (a), (b) and (c) are true.

Explanation :

Q20. Match the following types of variables with the corresponding programming languages:

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

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

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

Ans .

C or A

Explanation :
Stack dynamic in Fortran 77, Explicit heap dynamic for all objects of JAVA Implicit heap dynamicsfor all variables in APL but Pascal does not contain static variable So option (A) is most appropriate. else option C is correct

Q21. Which of the following is false regarding the evaluation of computer programming languages?

(A) Application oriented features

(B) Efficiency and Readability

(D) Hardware maintenance cost

Ans .

(D) Hardware maintenance cost

Explanation :

Q22. The symmetric difference of two sets S1 and S2 is defined as
S1ΘS2 = {x|xϵS1 or xϵS2, but x is not in both S1 and S2}
The nor of two languages is defined as
nor (L1,L2) = {w|w ∉ L1 and w|w ∉ L2}
Which of the following is correct?

(A) The family of regular languages is closed under symmetric difference but not closed under nor.

(B) The family of regular languages is closed under nor but not closed under symmetric difference.

(D) The family of regular languages are not closed under both symmetric difference and nor.

Ans .

Explanation :

Q23. The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is:

(A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)*

(B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)*

(D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Ans .

(D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Explanation :

Q24. Consider the following two languages:
L1 = {0i1j | gcd(i,j)=1}
L2 is any subset of 0*.
Which of the following is correct?

(A) L1 is regular and L2* is not regular

(B) L1 is not regular and L2* is regular

(D) Both L1 and L2* are not regular languages

Ans .

(B) L1 is not regular and L2* is regular

Explanation :
Both languagesare not regular but L2* becomes gcd of two numbers can't be determined by DFA or regular expression subset of 0* is ap where p is prime number which is also not regular language but (ap)* is regular So any language over single E then Kleen star of that language becomes regular language.

Q25. If link transmits 4000 frames per second and each slot has 8 bits, the transmission rate of circuit of this TDM is ...............

(A) 64 Kbps

(B) 32 Mbps

(D) 64 Mbps

Ans .

Explanation :
If one slot holds only a single frame then
4000 frames/sec means 4000 slots/sec and each having 8 bits
thus bit rate = 4000*8=32000 bits/sec= 32 Kbps.

Q26. Given the following statements:
(a) Frequency Division Multiplexing is a technique that can be applied when the bandwidth of a link is greater than combined bandwidth of signals to be transmitted.
(b) Wavelength Division Multiplexing (WDM) is an analog multiplexing Technique to combine optical signals.
(c) WDM is a Digital Multiplexing Technique.
(d) TDM is a Digital Multiplexing Technique.
Which of the following is correct?

(A) (a), (b), (c) and (d) are true.

(B) (a), (b), (c) and (d) are false.

(D) (a), (b) and (d) are true; (c) is false.

Ans .

(D) (a), (b) and (d) are true; (c) is false.

Explanation :

Q27. A pure ALOHA Network transmit 200 bit frames using a shared channel with 200 Kbps bandwidth. If the system (all stations put together) produces 500 frames per second, then the throughput of the system is ..............

(A) 0.384

(B) 0.184

(D) 0.586

Ans .

(B) 0.184

Explanation :
Frame size=200 bit
data rate= 200 Kbps
Tx delay=2000/(2000*103)= 10-3 sec = 1ms
Frame generation rate=500/sec
no. of slots in a sec =1000
i.e. 500 frames/ 1000slots
or 1 frame/2 slots
In pure aloha this load results in max throughput of 0.184

Q28. Match the following:

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

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

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

Ans .

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

Explanation :

Q29. Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................

(A) 1.636 Kbps

(B) 1.636 Mbps

(D) 3.272 Kbps

Ans .

Marks Given to all

Explanation :

Q30. Encrypt the plain text Message “EXTRANET” using Transposition cipher technique with the following key: Using ‘Z’ as bogus character .

(A) TAXERTZENZ

(B) EXTRANETZZ

(D) EXTZRANZETZ

Ans .

(A) TAXERTZENZ

Explanation :

Q31. The number of different binary trees with 6 nodes is .............

(A) 6

(B) 42

(D) 256

Ans .

Explanation :

Q32. Let A[1...n] be an array of n distinct numbers. If iA[j], then the pair (i,j) is called an inversion of A. What is the expected number of inversions in any permutation on n elements?

(A) θ(n)

(B) θ(lg n)

(D) θ(n2)

Ans .

(D) θ(n2)

Explanation :

Q33. Which one of the following array represents a binary max-heap?

(A) [26, 13, 17, 14, 11, 9, 15]

(B) [26, 15, 14, 17, 11, 9, 13]

(D) [26, 15, 13, 14, 11, 9, 17]

Ans .

Explanation :

Q34. Match the following:

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

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

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

Ans .

Explanation :
The complexity of Huffman, optimal polygon, activity selection & cluster sort are θ(nlog n), θ(n2), θ(n) and θ(n2) in worst case (However same options contain big oh for other cases)

Q35. Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined?

(A) 925, 221, 912, 245, 899, 259, 363, 364

(B) 3, 400, 388, 220, 267, 383, 382, 279, 364

(D) 3, 253, 402, 399, 331, 345, 398, 364

Ans .

Explanation :

Q36. A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles.

(A) n-2, n-1

(B) n-3, n-2

(D) n-2, n-2

Ans .

(B) n-3, n-2

Explanation :
For 5 vertex polynomial
3 chords and 4 triangles.
So (n-2 , n-1)

Q37. Implicit return type of a class constructor is:

(A) not of class type itself

(B) class type itself

(B) a destructor of class type

(D) a destructor not of class type

Ans .

(B) class type itself

Explanation :

Q38. It is possible to define a class within a class termed as nested class. There are ............ types of nested classes.

(A) 2

(B) 3

(D) 5

Ans .

(B) 3

Explanation :

Q39. Which of the following statements is correct?

(A) Aggregation is a strong type of association between two classes with full ownership.

(B) Aggregation is a strong type of association between two classes with partial ownership.

(D) Aggregation is a weak type of association between two classes with full ownership.

Ans .

Explanation :

Q40. Which of the following statements is correct?

(A) Every class containing abstract method must not be declared abstract.

(B) Abstract class cannot be directly initiated with ‘new’ operator.

(D) Abstract class contains definition of implementation.

Ans .

B,C

Explanation :

Q41. Which of the following statements is not correct?

(A) HTML is not screen precise formatting language.

(B) HTML does not specify a logic.

(D) HTML is a programming language.

Ans .

(D) HTML is a programming language.

Explanation :
HTML is a markup language.

Q42. When one object reference variable is assigned to another object reference variable then

(A) a copy of the object is created.

(B) a copy of the reference is created.

(D) it is illegal to assign one object reference variable to another object reference variable.

Ans .

(B) a copy of the reference is created.

Explanation :

Q43. A server crashes on the average once in 30 days, that is, the Mean Time Between Failures (MTBF) is 30 days. When this happens, it takes 12 hours to reboot it, that is, the Mean Time to Repair (MTTR) is 12 hours. The availability of server with these reliability data values is approximately:

(A) 96.3%

(B) 97.3%

(D) 99.3%

Ans .

Explanation :
Server is not available for 12 hours after each 30 days
So 30*24+12= total hours
30*24= available hours
availablity=(30*24)/ (30*24+12)
=60/61
=.9836
=98.3%

Q44. Match the software maintenance activities in List-I to its meaning in List-II.

(A) (b) (d) (c) (a)

(B) (b) (c) (d) (a)

(D) (a) (d) (b) (c)

Ans .

(B) (b) (c) (d) (a)

Explanation :

Q45. Match each application/software design concept in List-I to its definition in List-II.

(A) (b) (a) (d) (c)

(B) (c) (d) (a) (b)

(D) (d) (a) (c) (b)

Ans .

Explanation :

Q46. Software safety is quality assurance activity that focuses on hazards that

(A) affect the reliability of a software component

(B) may cause an entire system to fail.

(D) prevent profitable marketing of the final product

Ans .

(B) may cause an entire system to fail.

Explanation :

Q47. Which of the following sets represent five stages defined by Capability Maturity Model (CMM) in increasing order of maturity?

(A) Initial, Defined, Repeatable, Managed, Optimized.

(B) Initial, Repeatable, Defined, Managed, Optimized.

(D) Initial, Repeatable, Managed, Defined, Optimized.

Ans .

(B) Initial, Repeatable, Defined, Managed, Optimized.

Explanation :

Q48. The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to complete the project using the effort formula of basic COCOMO given below:
E = a(KLOC)b
Assume that the values of a and b are 2.5 and 1.0 respectively.

(A) 25 person months

(B) 75 person months

(D) 72.5 person months

Ans .

Explanation :
LOC/FP=50= LOC/500
LOC=500*50=25,000
LO person-month/FP
=2.5*25
=62.5 person months

Q49. In UNIX, processes that have finished execution but have not yet had their status collected are known as ................

(A) Sleeping processes

(B) Stopped Processes

(D) Orphan Processes

Ans .

Explanation :

Q50. In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process?

(A) Heap

(B) Stack

(D) Both Heap and Stack

Ans .

Explanation :

Q51. Which of the following information about the UNIX file system is not correct?

(A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks.

(B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data.

(D) All the files and directories are stored in data blocks.

Ans .

Explanation :
File and directories are stored in inode block instead of data block.

Q52. Which of the following option with reference to UNIX operating system is not correct?

(A) INT signal is sent by the terminal driver when one types (Control-C) and it is a request to terminate the current operation.

(B) TERM is a request to terminate execution completely. The receiving process will clean up its state and exit.

(D) KILL is a blockable signal.

Ans .

(D) KILL is a blockable signal.

Explanation :
KILL is a blockable signal because KILL removes complete process.

Q53. A Multicomputer with 256 CPUs is organized as 16x16 grid. What is the worst case delay (in hops) that a message might have to take?

(A) 16

(B) 15

(D) 30

Ans .

(D) 30

Explanation :

Q54. Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs?

(A) 49 msec

(B) 80 msec

(D) 100 msec

Ans .

(B) 80 msec

Explanation :
A signal 3K RPC generaly takes 1.5 * 32 + 1 msec
i.e
49 ms 32 1K RPC takes 1.5 * 32 + 1 * 32 = 80 ms

Q55. Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes.

(A) 2

(B) 4

(D) 6

Ans .

(A) 2

Explanation :
Hee 0*10* needs 3 states but option is not available so we can assume (wrongly) that dead state is not available, so most appropriate option is (A).

Q56. Let L = {0n1n | n≥0} be a context free language.
Which of the following is correct?

(A) L’ is context free and Lk is not context free for any k≥1

(B) L’ is not context free and Lk is context free for any k≥1

(D) Both L’ and Lk is for any k≥1 are not context free.

Ans .

Explanation :
L' is CFG and Lk K>=1 becomes LLk which is also CFG.

Q57. Given a Turing Machine
M = ({q0,q1,q2,q3}, {a,b}, {a,b,B}, δ, B, {q3})
Where δ is a transition function defined as
δ(q0,a) = (q1,a,R)
δ(q1,b) = (q2,b,R)
δ(q2,a) = (q2,a,R)
δ(q2,b) = (q3,b,R)
The language L(M) accepted by the Turing Machine is given as:

(A) aa*b

(B) abab

(D) aba*

Ans .

Explanation :

Q58. Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I(x;y) is the information transmission.
Which of the following does not define the channel capacity of a discrete memoryless channel?

(A) max I(x;y) p(x)

(B) max [(H(y) – H(y|x))] p(x)

(D) max H(x|y) p(x)

Ans .

(D) max H(x|y) p(x)

Explanation :
Chennel capacity of discrete memoryless channel is defined by
C= max I(x;y) p(x)
= max [H(y)-H(y/x)] p(x)
=max [H(x)-H(x/y)] p(x)
So option (D) is not channel capacity.

Q59. Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information?

(A) 2 bits per symbol

(B) 1.75 bits per symbol

(D) 1.25 bits per symbol

Ans .

(B) 1.75 bits per symbol

Explanation :
3*1/8 + 3*1/8 + 2*1/4 +1*1/2
=(3+3+4+4)/8
=14/8
=1.75

Q60. Which of the following is used for the boundary representation of an image object?

(A) Quad Tree

(B) Projections

(D) Chain codes

Ans .

(D) Chain codes

Explanation :

Q61. The region of feasible solution of a linear programming problem has a ............... property in geometry, provided the feasible solution of the problem exists.

(A) concavity

(B) convexity

(D) polyhedron

Ans .

(B) convexity

Explanation :

Q62. Consider the following statements:
(a) Revised simplex method requires lesser computations than the simplex method.
(b) Revised simplex method automatically generates the inverse of the current basis matrix.
(c) Less number of entries are needed in each table of revised simplex method than usual simplex method.
Which of these statements are correct?

(A) (a) and (b) only

(B) (a) and (c) only

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

Ans .

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

Explanation :

Q63. The following transportation problem: has a solution The above solution of a given transportation problem is

(A) infeasible solution

(B) optimum solution

(D) unbounded solution

Ans .

(B) optimum solution

Explanation :

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

(A)

(B)

(C)

(D)

Ans .

(B) smily face

Explanation :

Q65. Compute the value of adding the following two fuzzy integers:
A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)}
B = {(0.5,11), (1,12), (0.5,13)}
Where fuzzy addition is defined as
μA+B(z) = maxx+y=z (min(μA(x), μB(x)))
Then, f(A+B) is equal to

(A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)}

(B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)}

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

Ans .

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

Explanation :

Q66. A perceptron has input weights W1 = -3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2?

(A) -2.65

(B) -2.30

(D) 1

Ans .

Explanation :
W1*x1 +w2*x2
-3.9*13 + 1.1*2.2
-5.07+2.42
-2.65 less than T=0.3
Thus 0

(A) It runs the word count program to count the number of lines in its input, a, writing the result to b, as a foreground process.

(B) It runs the word count program to count the number of lines in its input, a, writing the result to b, but does it in the background.

(D) It copies the ‘ l ’ numbers of lines of program from file, a, and stores in file b.

Ans .

(B) It runs the word count program to count the number of lines in its input, a, writing the result to b, but does it in the background.

Explanation :

Q68. Which of the following statement is not correct with reference to cron daemon in UNIX O.S?

(A) The cron daemon is the standard tool for running commands on a pre-determined schedule.

(B) It starts when the system boots and runs as long as the system is up.

(D) Crontab for individual users are not stored.

Ans .

(D) Crontab for individual users are not stored.

Explanation :
Crontab can be stored for individual users too.

Q69. In Unix, files can be protected by assigning each one a 9-bit mode called rights bits. Now, consider the following two statements:
I. A mode of 641 (octal) means that the owner can read and write the file, other members of the owner’s group can read it, and users can execute only.
II. A mode of 100 (octal) allows the owner to execute the file, but prohibits all other access.
Which of the following options is correct with reference to above statemenrs?

(A) Only I is correct

(B) Only II is correct

(D) Both I and II are incorrect

Ans .

Explanation :

Q70. Consider the statement,
"Either -2 ≤ x ≤ -1 or 1 ≤ x ≤ 2"
The negation of this statement is

(A) x less than -2 or 2 less than x or -1 less than x less than 1

(B) x less than -2 or 2 less than x

(D) x ≤ -2 or 2 ≤ x or -1 less than x less than 1

Ans .

(A) x less than -2 or 2 less than x or -1 less than x less than 1

Explanation :

Q71. Which of the following is characteristic of an MIS?

(A) Provides guidance in identifying problems, finding and evaluating alternative solutions, and selecting or comparing alternatives.

(B) Draws on diverse yet predictable data resources to aggregate and summarize data.

(D) Has as its goal the efficiency of data movement and processing and interfacing different TPS.

Ans .

(B) Draws on diverse yet predictable data resources to aggregate and summarize data.

Explanation :

Q72. How does randomized hill-climbing choose the next move each time?

(A) It generates a random move from the moveset, and accepts this move.

(B) It generates a random move from the whole state space, and accepts this move.

(C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function.

(D) It generates a random move from the whole state space, and accepts this move only if this move improves the evaluation function.

Ans .

(C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function.

Explanation :

Q73. Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning?

(A) I

(B) HI

(D) GHI

Ans .

(B) HI

Explanation :

Q74. Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state which of the following state cannot be reached?