ComputerSciencePaperIIIJune2015

UGC NET Previous Year Papers

COMPUTER SCIENCE AND APPLICATIONS

Paper III – June 2015

1.    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

(C) 00111000              

(D) 11000110

Ans: (B)

 

2. 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) 8×106 bytes/sec                

(B) 4×106 bytes/sec

(C) 16×106 bytes/sec              

(D) 4×109 bytes/sec

Ans: (B)

 

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

(A) CALL 0010 H        

(B) CALL 0034 H

(C) CALL 0038 H        

(D) CALL 003C H

Ans: (C)

 

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

(A) FADED      

(B) AEOBE

(C) ADOBE      

(D) ACABE

Ans: (C)

 

5. 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

(C) 125 Kbytes/sec     

(D) 250 Kbytes/sec

Ans: (D)

 

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

(A) 8      

(B) 9

(C) 27    

(D) 11

Ans: (B)

 

7. 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 donot have any attributes of their own. How many minimum numbers of tables are required to represent this situation in the Relational Model?

(A) 4      

(B) 3

(C) 2      

(D) 1

Ans: (B)

 

8. 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

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

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

Ans: (B)

 

9. 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

(C) Any relation with two attributes is in BCNF

(D) BCNF is stronger than 3NF

Ans: (B)

 

10. 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

(C) key attribute Qty_sup is dependent on primary_key unit price

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

Ans: (A)

 

11. 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

(C) (a) and (c) happens         

(D) (b) and (c) happens

Ans: (C)        

 

12. 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

(C) Size of Index

(D) Size of Block

Ans: (A)

 

13. 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

(C) Three in the directions I, J and K

(D) Only two in the directions J and K

Ans: (A)

 

14. 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,  \sqrt{2} -1), B’=(-1, 2 \sqrt{2}-1), C’=(3 \sqrt{2} -1, (9/2) \sqrt{2} -1)

(B) A’=(1,  \sqrt{2} -1), B’=(2 \sqrt{2} -1, -1), C’=(3 \sqrt{2} -1, (9/2) \sqrt{2} -1)

(C) A’=(-1,  \sqrt{2} -1), B’=(-1, 2 \sqrt{2} -1), C’=(3 \sqrt{2} -1, (9/2) \sqrt{2} -1)

(D) A’=( \sqrt{2} -1, -1), B’=(-1, 2 \sqrt{2} -1), C’=(3 \sqrt{2} -1, (9/2) \sqrt{2} -1)

Ans: (C)

 

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

(A) Strobing                 

(B) Amplification

(C) Conditioning         

(D) Quantization

Ans: (D)

 

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

(A) POLYLINE             

(B) POLYDRAW

(C) FILL AREA            

(D) POLYMARKER

Ans: (B)

 

17. 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 co-ordinate 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)

(C) (c) only       

(D) (d) only

Ans: (D)

 

18. Match the following:

List-I

List-II

(a)  Flood Gun

(b)  Collector    

(c)  Ground 

(d)  Phosphorus grains       

(e) Writing Gun System

 

(i) An electron gun designed to flood the entire screen with electrons.

(ii) Partly energised by flooding gun, stores the charge generated by the writing gun

(iii) Used to discharge the collector

(iv) Used in memory-tube display and similar to those used in standard CRT

(v) Used in memory-tube display and basically the same as the electron gun used in a conventional CRT.

Codes:

      (a)     (b)       (c)        (d)       (e)

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

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

(C)  (iii)   (i)        (ii)        (v)       (iv)

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

Ans: (A)

 

19. 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

(C) 1 final state among 6 states

(D) 5 final states among 6 states

Ans: (D)

 

20. 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

(C) (1 + 01)* (1 + 01)               

(D) (10 + 01)* 01

Ans: (C)

 

21. 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

(C) q0 and q2 respectively     

(D) q0 and q3 respectively

Ans: (D)

 

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

(A) A ∧ B ∧ C ⇒ D                   

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

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

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

Ans: (A)

 

23. 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.

(C) The scope of a variable in PROLOG is a single clause or rule.

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

Ans: (B)

 

24. 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)

 

25. 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

(C) Packet Switching 

(D) Circuit Switching

Ans: (D)

 

26. 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

(C) SYN            

(D) PSH

Ans: (A)

 

27. Which are the two modes of IP security?

(A) Transport and Certificate

(B) Transport and Tunnel

(C) Certificate and Tunnel    

(D) Preshared and Transport

Ans: (B)

 

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

(A) CTTOEWMROPNRUEK             

(B) MROUEKCTTPNROEW

(C) OEWPNRCTTUEKMRO             

(D) UEKPNRMROOEWCTT

Ans: (C)

 

29. 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

(C) 128 kbps    

(D) 256 kbps

Ans: (C)

 

30. The Maximum payload of a TCP segment is

(A) 65,535        

(B) 65,515

(C) 65,495        

(D) 65,475

Ans: (C)

 

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

(A) Dijkstra’ algorithm             

(B) Bellman-Ford algorithm

(C) Kruskal Algorithm            

(D) Floyd-Warshall algorithm

Ans: (D)

 

32. The travelling salesman problem can be solved in:

(A) Polynomial time using dynamic programming algorithm

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

(C) Exponential time using dynamic programming algorithm or branch-and-bound algorithm.

(D) Polynomial time using backtracking algorithm.

Ans: (C)

 

33. Which of the following is asymptotically smaller?

(A) lg(lg*n)       

(B) lg*(lgn)

(C) lg(n!)           

(D) lg*(n!)

Ans: (A)

 

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

(A) 77    

(B) 82

(C) 88    

(D) 89

Ans: (C)

 

35. 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))

(C) θ(f(n) + g(n)) = min(f(n), g(n))

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

Ans: (D)

 

36. The number of nodes of height h in any n – element heap is …………..

(A) h                  

(B) zh

(C) ceil(n/zh)    

(D) ceil(n/zh+1)

Ans: (D)

 

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

(A) Private        

(B) Protected

(C) Public         

(D) Friend

Ans: (C)

 

38. 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()

(C) int getServerPort()

(D) void setContextType(String Type)

Ans: (D)

 

39. 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.

(C) An applet can be run on its own.

(D) Applets are embedded in another applications.

Ans: (D)

 

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

(A) + * !              

(B) # * !

(C) + * ?            

(D) – * ?

Ans: (C)

 

41. In XML, DOCTYPE declaration specifies to include a reference to ………… file.

(A) Document Type Definition         

(B) Document Type Declaration

(C) Document Transfer Definition   

(D) Document Type language

Ans: (A)

 

42. 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

(C) Encapsulation      

(D) Abstraction

Ans: (C)

 

43. 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 ?

(C) requires execution of software

(D) both (A) and (B)

Ans: (D)

 

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

(A) Consistency          

(B) Conciseness

(C) Efficiency              

(D) Accuracy

Ans: (B)

 

45. Requirements prioritization and negotiation belongs to:

(A) Requirements validation

(B) Requirements elicitation

(C) Feasibility Study              

(D) Requirement reviews

Answer: B

 

46. 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.

(C) improves the system performance.

(D) both (B) and (C)

Ans: (B)

 

47. A Design concept Refinement is a:

(A) Top-down Approach        

(B) Complementary of Abstraction concept

(C) Process of elaboration    

(D) All of the above

Ans: (D)

 

48. 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.

(C) cohesion is sequential and coupling is content type.

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

Ans: (A)

 

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

List-I

List-II

(a)   Spooling 

(b)   Multi-programming

(c)   Time sharing     

(d)Distributed computing 

(i) Allows several jobs in memory to improve CPU utilization

(ii) Access to shared resources among geographically dispersed computers in a transparent way

(iii) overlapping I/O and computations

(iv) Allows many users to share a computer simultaneously by switching processor frequently

Codes:

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

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

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

(C) (iv)    (iii)       (ii)         (i)

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

Ans: (B)

 

50. 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

(C) Processes are permanently assigned to a queue

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

Ans: (C)

 

51. 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

(C) It is a chip to map virtual address to physical address

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

Ans: (C)

 

52. Dining Philosopher’s problem is a:

(A) Producer-Consumer problem    

(B) Classical IPC problem

(C) Starvation problem                      

(D) Synchronization primitive

Ans: (B)

 

53. 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

(C) Contiguous                       

(D) Bit Map

Ans: (B)

 

54. A unix file may be of type:

(A) Regular file                       

(B) Directory File

(C) Device File            

(D) Any one of the above

Ans: (D)

 

55. Match the following:

List-I

List-II

(a) Intelligence

(b) Knowledge 

(c) Information 

(d) Data

(i) Contextual, tacit, transfer needs learning

(ii) Scattered facts, easily transferrable

(iii) Judgemental

(iv) Codifiable, endorsed with relevance and purpose

Codes:

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

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

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

(C)  (i)     (ii)        (iii)       (iv)

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

Ans: (B)

 

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

List-I

List-II

(a)  Frames

(b) Conceptual dependencies

(c) Associative networks

(d) Scripts

(i) Pictorial representation of objects, their attributes and relationships

(ii) To describe real world stereotype events

(iii) Record like structures for grouping closely related knowledge

(iv) Structures and primitives to represent sentences

Codes:

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

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

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

(C) (iv)    (iii)       (i)        (ii)

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

Ans: (A)

 

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

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

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

(C) (P∨Q)∧(Q∨P)         

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

Ans: (B)

 

58. 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.

(C) Dynamic programming principle can be used to discard redundant partial paths.

(D) All of the above

Ans: (C)

 

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

List-I

List-II

(a) Steepest-accent Hill Climbing    

(b) Branch-and-bound

(c) Constraint satisfaction

(d)   Means-end-analysis 

(i) Keeps track of all partial paths which can be candidate for further exploration

(ii) Discover problem state(s) that satisfy a set of constraints

(iii) Detects difference between current state and goal state

(iv) Considers all moves from current state and selects best move

Codes:

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

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

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

(C)  (i)     (iv)       (ii)       (iii)

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

Ans: (B)

 

60. Match the following for methods of MIS development:

List-I

List-II

(a) Joint Application Design(JAD)   

(b) Computer Aided Software Engg

(c) Agile development

(d) Component based technology 

(i) Delivers functionality in rapid iteration measured in weeks and needs frequent communication, development, testing and delivery

(ii) Reusable applications generally with one specific function. It is closely linked with idea of web services and service oriented architecture.

(iii) Tools to automate many tasks of SDLC

(iv) A group based tool for collecting user requirements and creating system design. Mostly used in analysis and design stages of SDLC

Codes:

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

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

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

(C) (iii)    (iv)        (i)        (ii)

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

Ans: (B)

 

61. 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

(C) S→0|0S|1SS|S1S|SS1   

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

Ans: (C)

 

62. 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

(C) Both S1 and S2 are not correct

(D) Both S1 and S2 are correct

Ans: (D)

 

63. Given the following grammars:

G1:       S→AB|aaB

A→aA|ϵ

            B→bB|ϵ

G2:       S→A|B

A→aAb|ab

            B→abB|ϵ

Which of the following is correct?

(A) G1 is ambiguous and G2 is unambiguous grammars

(B) G1 is unambiguous and G2 is ambiguous grammars

(C) Both G1 and G2 are ambiguous grammars

(D) Both G1 and G2 are unambiguous grammars

Ans: (C)

 

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

(A) \frac{67}{{30}}          

(B) \frac{70}{{34}}

(C) \frac{76}{{30}}         

(D) \frac{78}{{30}}

Ans: (C)

 

65. The redundancy in images stems from:

(A) pixel decorrelation                       

(B) pixel correlation

(C) pixel quantization            

(D) image size

Ans: (B)

 

66. 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

(C) 2r-r+1          

(D) 2r+r-1

Ans: (B)

 

67. 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

(C) rows+columns-1  

(D) rows+columns+1

Ans: (A)

 

68. Consider the following transportation problem:
ugc-net-Previous-Year-Papers-computer-science-applications-paper-iii-june-2015-1.Forthe 8-bit

The initial basic feasible solution of the above transportation problem using Vogel’s Approximation Method(VAM) is given below:
ugc-net-Previous-Year-Papers-computer-science-applications-paper-iii-june-2015-1.Forthe 8-bit '

 The solution of the above problem:

(A) is degenerate solution    

(B) is optimum solution

(C) needs to improve             

(D) is infeasible solution

Ans: (B)

 

69. 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 object
ive 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  

(C) S2 and S3   

(D) S1, S2 and S3

Ans: (D)

 

70. 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

(C) x1+1.5=0                

(D) x1-1.5=0

Ans: (C)

 

71. 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)}

(C) {(11,0.3), (12,0.5), (13,0.6), (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)

 

72. 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 (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)}

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

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

Ans: (C)

 

73. Match the following for unix system calls:

List-I

List-II

(a)   exec

(b)   brk

(c)   wait  

(d)   fork

 (i) Creates a new process

(ii) Invokes another program overlaying memory space with a copy of an executable file

(iii) To increase or decrease the size of data region

(iv) A process synchronizes with termination of child process

Codes:

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

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

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

(C) (iv)    (iii)       (ii)         (i)

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

Ans: (A)

 

74. WOW32 is a:

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

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

(C) Kernel – mode objects accessible through Win32 API

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

Ans: (D)

 

75. 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 the files

(C) Both files can be edited using the ‘mv’ command to move between the files

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

Ans: (B)

 

  ———————————