Trending ▼   ResFinder  

UGC NET SEP 2013 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

11 pages, 75 questions, 38 questions with responses, 38 total responses,    0    0
ugc_net
   		+Fave Message
ProfileTimelineUploadsQ & A
 Home > ugc_net >   F Also featured on: abhijay22

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

PAPER-III COMPUTER SCIENCE AND APPLICATIONS Signature and Name of Invigilator 1. (Signature) __________________________ OMR Sheet No. : ............................................... (To be filled by the Candidate) (Name) ____________________________ 2. (Signature) __________________________ (Name) ____________________________ 87 S 1 3 1 Time : 2 /2 hours] Number of Pages in this Booklet : 12 Instructions for the Candidates 1. Write your roll number in the space provided on the top of this page. 2. This paper consists of seventy five multiple-choice type of questions. 3. At the commencement of examination, the question booklet will be given to you. In the first 5 minutes, you are requested to open the booklet and compulsorily examine it as below : (i) To have access to the Question Booklet, tear off the paper seal / polythene bag on the booklet. Do not accept a booklet without sticker-seal / without polythene bag and do not accept an open booklet. (ii) Tally the number of pages and number of questions in the booklet with the information printed on the cover page. Faulty booklets due to pages/questions missing or duplicate or not in serial order or any other discrepancy should be got replaced immediately by a correct booklet from the invigilator within the period of 5 minutes. Afterwards, neither the Question Booklet will be replaced nor any extra time will be given. (iii) After this verification is over, the OMR Sheet Number should be entered on this Test Booklet. 4. Each item has four alternative responses marked (A), (B), (C) and (D). You have to darken the circle as indicated below on the correct response against each item. Example : where (C) is the correct response. 5. Your responses to the items are to be indicated in the OMR Sheet given inside the Booklet only. If you mark at any place other than in the circle in the OMR Sheet, it will not be evaluated. 6. Read instructions given inside carefully. 7. Rough Work is to be done in the end of this booklet. 8. If you write your Name, Roll Number, Phone Number or put any mark on any part of the OMR Sheet, except for the space allotted for the relevant entries, which may disclose your identity, or use abusive language or employ any other unfair means, you will render yourself liable to disqualification. 9. You have to return the original OMR Sheet to the invigilators at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. You are however, allowed to carry duplicate copy of OMR Sheet on conclusion of examination. 10. Use only Blue/Black Ball point pen. 11. Use of any calculator or log table etc., is prohibited. 12. There is no negative marks for incorrect answers. S-87-13 Roll No. (In figures as per admission card) Roll No.________________________________ (In words) [Maximum Marks : 150 Number of Questions in this Booklet : 75 1. 2. - 3. , - - , : (i) - / - / (ii) - / - - (iii) OMR - 4. (A), (B), (C) (D) : (C) 5. OMR OMR , 6. 7. (Rough Work) 8. OMR , , , , , 9. OMR OMR 10. / 11. ( ) 12. 1 P.T.O. COMPUTER SCIENCE AND APPLICATIONS Paper III Note : This paper contains seventy five (75) objective type questions of two (2) marks each. The candidates are required to select the most appropriate answer for each question. All questions are compulsory. 1. Which of the following is a correct predicate logic statement for Every Natural number has one successor ? (A) x y (succ(x, y) ( z succ(x, z) equal (y, z))) (B) x y (succ(x, y) ( z succ(x, z) equal (y, z))) (C) y x (succ(x, y) ( z succ(x, z) equal (y, z))) (D) x y succ (x, y) 2. 6. Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies ______ (A) a forward search that can reduce the difference. (B) a backward search that can reduce the difference. (C) a bidirectional search that can reduce the difference. (D) an operator that can reduce the difference. 7. Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames. Each frame consists of 1000 characters and an overhead of 48 bits per frame. Using synchronous transmission, the total overhead time is ______. (A) 0.05 second (B) 0.1 second (C) 0.2 second (D) 2.0 second 8. Assume that each alphabet can have a value between 0 to 9 in a CROSS +ROADS . cryptoarithmetic problem - - - - - - - DANGER ------- The Blocks World Problem in Artificial Intelligence is normally discussed to explain a _______ (A) Search technique (B) Planning system (C) Constraint satisfaction system (D) Knowledge base system Which of the following is the size of Network bits and Host bits of Class A of IP address ? (A) Network bits 7, Host bits 24 (B) Network bits 14, Host bits 16 (C) Network bits 15, Host bits 16 (D) Network bits 16, Host bits 16 cutoffs are applied to ______ (A) Depth first search (B) Best first search (C) Minimax search (D) Breadth first search 3. 5. Which of the following statement is true ? (i) No two alphabets can have the same numeric value. (ii) Any two alphabets may have the same numeric value. (iii) D = 0 (iv) D = 1 (A) (i) and (iii) (B) (i) and (iv) (C) (ii) and (iii) (D) (ii) and (iv) 4. Which of the following is not a part of an expert system shell ? (A) Knowledge Base (B) Inference Engine (C) Explanation Facility (D) None of the above Paper-III 2 S-87-13 9. Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged ? (A) TCP header length (B) Window size (C) Acknowledgement number (D) Urgent pointer 10. Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth ? (A) 2500 bps (B) 5000 bps (C) 7500 bps (D) 20000 bps 11. Match the following : (a) UDP (i) Message Transfer Protocol (b) OSPF (ii) Bit-oriented Protocol (c) SMTP (iii) Interior Gateway Routing Protocol (d) HDLC (iv) Connectionless Transport Protocol Codes : (a) (b) (c) (d) (A) (iii) (iv) (ii) (i) (B) (iv) (iii) (ii) (i) (C) (iv) (iii) (i) (ii) (D) (iii) (iv) (i) (ii) 12. An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of (A) rows or columns (B) rows + columns (C) rows + columns 1 (D) rows + columns + 1 15. Which of the following is the minimum cost for an assignment problem given below ? Jobs A B C D I 5 3 2 8 II 7 9 2 6 Workers III 6 4 5 7 IV 5 7 7 8 (A) 13 (B) 16 (C) 17 (D) 18 16. Assume, L is regular language. Let statements S1 and S2 be defined as : S1 : SQRT(L) = { x| for some y with |y| = |x|2, xy L}. S2 : LOG(L) = { x| for some y with |y| = 2|x|, xy L}. Which of the following is true ? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct. (C) Both S1 and S2 are not correct. (D) S1 is not correct and S2 is correct. Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet address ? (A) 201.14.78.32 (B) 201.14.78.64 (C) 201.14.78.65 (D) 201.14.78.224 13. 14. If an artificial variable is present in the basic variable of optimal simplex table then the solution is ______ (A) Alternative solution (B) Infeasible solution (C) Unbounded solution (D) Degenerate solution S-87-13 17. A regular grammar for the language L = {anbm | n is even and m is even}is given by (A) S aSb | S1; S1 bS1a | (B) S aaS | S1; S1 bSb | (C) S aSb | S1; S1 S1ab | (D) S aaS | S1; S1 bbS1 | 3 Paper-III 18. 19. 21. Given the following productions of a grammar : S aA| aBB; A aaA | ; B bB| bbC; C B Which of the following is true ? (A) The language corresponding to the given grammar is a set of even number of a s. (B) The language corresponding to the given grammar is a set of odd number of a s. (C) The language corresponding to the given grammar is a set of even number of a s followed by odd number of b s. (D) The language corresponding to the given grammar is a set of odd number of a s followed by even number of b s. Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing machines is countable. Which of the following is true ? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct. (C) (D) S1 is not correct and S2 is correct. 22. The language accepted by the nondeterministic pushdown automaton M= ({q0, q1, q2}, {a, b}, {a, b, z}, , q0, z, {q2}) with transitions Non-deterministic pushdown automaton that accepts the language generated by the grammar: S aSS | ab is (A) (q0, , z) = { (q1, z)}; (q0, a, S) = { (q1, SS)}, (q1, B) } (q0, b, B) = { (q1, )}, (q1, , z) = { (qf, )} (q0 a, z) = { (q1 a), (q2 )}; (B) (q1, b, a) = { (q1, b)} (q0, b, B) = { (q1, )}, { (q2, )} 20. (q1, , z) = { (qf, )} L(abb*a) {a} U L(abb*a) L(ab*a) {a} U L(ab*a) (C) (q0, , z) = { (q1, Sz)}; (q0, a, S) = { (q1, S)}, (q1, B) } (q0, b, ) = { (q1, B)}, (q1, , z) = { (qf, )} The language L = | n 0, m 0} is (A) Context free but not linear (B) Context free and linear (C) Not Context free and not linear (D) Not Context free but linear Paper-III (q0, , z) = { (q1, Sz)}; (q0, a, S) = { (q1, SS)}, (q1, B) } (q1, b, b) ={ (q1 b)}, (q1, a, b) = is (A) (B) (C) (D) Both S1 and S2 are not correct. {an bn am bm (D) (q0, , z) = { (q1, z)}; (q0, a, S) = { (q1, SS)}, (q1, B) } (q0, b, ) = { (q1, B)}, (q1, , z) = { (qf, )} 4 S-87-13 23. Match the following : (a) Dangling (i) Buffer pointer replacement policy (b) Page fault (ii) Variablelength records (c) List (iii) Object representation identifier (d) Toss(iv) Pointerimmediate swizzling Codes : (a) (b) (c) (d) (A) (iii) (iv) (ii) (i) (B) (iv) (iii) (ii) (i) (C) (iv) (iii) (i) (ii) (D) (iii) (iv) (i) (ii) 24. _______ constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation. (A) Logical Integrity (B) Referential Integrity (C) Domain Integrity (D) Data Integrity 25. 26. 27. The SQL expression Select distinct T, branch_name from branch T, branch S where T.assets>S.assets and S.branch_city= Mumbai finds the names of (A) All branches that have greater assets than some branch located in Mumbai. (B) All branches that have greater assets than all branches in Mumbai. (C) The branch that has greatest asset in Mumbai. (D) Any branch that has greater assets than any branch in Mumbai. S-87-13 Let A be the set of comfortable houses given as x1 x2 x3 x4 A = 0.8, 0.9, 0.1, 0.7 and B be the set of affordable houses x1 x2 x3 x4 B = 0.9, 0.8, 0.6, 0.2 Then the set of comfortable and affordable houses is x1 x2 x3 x4 (A) 0.8, 0.8, 0.1, 0.2 x1 x2 x3 x4 (B) 0.9, 0.9, 0.6, 0.7 x1 x2 x3 x4 (C) 0.8, 0.8, 0.6, 0.7 x1 x2 x3 x4 (D) 0.7, 0.7, 0.7, 0.9 Support of a fuzzy set x1 x2 x3 x4 x5 A = 0.2, 0.15, 0.9, 0.95, 0.15 within a universal set X is given as x1 x2 x3 x4 x5 (A) 0.15, 0.15, 0.15, 0.15, 0.15 x1 x2 x3 x4 x5 (B) 0.95, 0.95, 0.95, 0.95, 0.95 (C) {x3, x4} (D) {x1, x2, x3, x4, x5} 28. 29. 5 In a single perceptron, the updation rule of weight vector is given by (A) w(n + 1)=w(n)+ [d(n)-y(n)] (B) w(n + 1)=w(n) [d(n)-y(n)] (C) w(n + 1)=w(n)+ [d(n)-y(n)]* x (n) (D) w(n + 1)=w(n) [d(n)-y(n)]* x (n) ______ refers to the discrepancy among a computed, observed or measured value and the true specified or theoretically correct values. (A) Fault (B) Failure (C) Defect (D) Error Paper-III 30. Which logic family dissipates the minimum power ? (A) DTL (B) TTL (C) ECL (D) CMOS 31. Which of the following electronic component is not found in IC s ? (A) Diode (B) Resistor (C) Transistor (D) Inductor 32. A given memory chip has 14 address pins and 8 data pins. It has the following number of locations. (A) 28 (B) 214 (C) 26 (D) 212 33. 34. 35. 36. 37. At least 183 At least 730 C = 2000 pF RA = 40.4 K , RB = 17.25 K , The number of possible parenthesizations of a sequence of n matrices is (A) O(n) (B) (n Ig n) (C) (2n) (D) None of the above The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is (A) O(n) (B) O(n Ig n) (C) O(n2) (D) None of the above 41. C = 2000 pF RA = 17.25 K , RB = 40.4 K , Given a binary search trees for a set of n=5 keys with the following probabilities : i 0 1 2 3 4 5 pi 0.15 0.10 0.05 0.10 0.20 qi 0.05 0.10 0.05 0.05 0.05 0.10 The expected optimal cost of the search is (A) 2.65 (B) 2.70 (C) 2.75 (D) 2.80 C = 5000 pF (D) RA = 17.25 K , RB = 40.4 K , C = 5000 pF Paper-III there be in a 50% chance born on the 40. An astable multivibrator using the 555 timer to generate a square wave of 5 KHz with 70% duty cycle will have (A) RA = 40.4 K , RB = 17.25 K , (C) How many people must room before there is a that two of them were same day of the year ? (A) At least 23 (B) (C) At least 366 (D) 39. The power dissipation of a flip-flop is 3 mW. The power dissipation of a digital system with 4 flip-flops is given by (A) 34 mW (B) 43 mW (C) 4/3 mW (D) 12 mW (B) The time complexity of recurrence relation T(n) = T(n/3) + T(2n/3) + O(n) is (A) O(Ig n) (B) O(n) (C) O(n Ig n) (D) O(n2 ) 38. The instruction: MOV CL, [BX] [DI] + 8 represents the _____ addressing mode. (A) Based Relative (B) Based Indexed (C) Indexed Relative (D) Register Indexed A binary ripple counter is required to count up to 16383. How many flipflops are required ? (A) 16382 (B) 8191 (C) 512 (D) 14 6 S-87-13 42. 43. 44. Given 0-1 knapsack problem and fractional knapsack problem and the following statements : S1 : 0-1 knapsack is efficiently solved using Greedy algorithm. S2 : Fractional knapsack is efficiently solved using Dynamic programming. Which of the following is true ? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct. (C) Both S1 and S2 are not correct. (D) S1 is not correct and S2 is correct. Equivalence class partitioning approach is used to divide the input domain into a set of equivalence classes, so that if a program works correctly for a value, then it will work correctly for all the other values in that class. This is used _____. (A) to partition the program in the form of classes. (B) to reduce the number of test cases required. (C) for designing test cases in white box testing. (D) all of the above. The failure intensity for a basic model as a function of failures experienced is given as ( )- 0[1 ( )/(V0)] where 0 is the initial failure intensity at the start of the execution, is the average or expected number of failures at a given point in time, the quantity V0 is the total number of failures that would occur in infinite time. Assume that a program will experience 100 failures in infinite time, the initial failure intensity was 10 failures/CPU hr. Then the decrement of failures intensity per failure will be (A) 10 per CPU hr. (B) 0.1 per CPU hr. (C) 0.1 per CPU hr. (D) 90 per CPU hr. S-87-13 45. 46. 7 Improving processing efficiency or performance or restructuring of software to improve changeability is known as (A) Corrective maintenance (B) Perfective maintenance (C) Adaptive maintenance (D) Code maintenance In ____,modules A and B make use of a common data type, but perhaps perform different operations on it. (A) Data coupling (B) Stamp coupling (C) Control coupling (D) Content coupling 47. Consider the following schemas : Branch_Schema = (branch_name, assets, city) Customer_Schema = (cutstomer_name, street, city) Deposit_Schema = (branch_name, account_number, customer_name, balance) Borrow_Schema = (branch_name, loan_number, customer_name, amount) Which of the following tuple relational calculus finds all customers who have loan amount more than ` 12,000 ? (A) {t(customer_name) | t borrow[?] t[amount]>12000} (B) {t |t(customer_name) | t borrow[?] t[amount]>12000} (C) {t |[?] borrow (t(customer_name=s(customer_ name))[?] [amount]>12000} (D) {t |[?] borrow (t(customer_name)[?] s[amount] >12000} 48. Match the following : (a) Create (i) The E-R Model (b) Select (ii) Relationship Model (c) Rectangle (iii) DDL (d) Record (iv) DML Codes : (a) (b) (c) (d) (A) (iii) (iv) (i) (ii) (B) (iv) (iii) (ii) (i) (C) (iv) (iii) (i) (ii) (D) (iii) (iv) (ii) (i) Paper-III 49. Match the following : (i) One to one relationship (a) (ii) Relationship (b) (c) 53. What is the output of the following program ? #include<stdio.h> main( ) { int a, b = 0; static int c[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0}; for (a=0; a<10;++a); if ((c[a]%2)= =0) b+=c[a]; printf( %d ,b); } (A) 15 (B) 25 (C) 45 (D) 20 54. A Program contains the following declarations and initial assignments int i = 8, j = 5; double x = 0.005, y = 0.01; char c= c , d= d ; Determine the value of the following expressions which involve the use of library functions: abs(i-2*j) ; log(exp(x)) ; toupper(d) (A) 2; 0.005; D (B) 1; 0.005; D (C) 2; 0.005; E (D) 1; 0.005; e (iv) Many to one relationship Codes : (a) (A) (iii) (B) (iv) (C) (ii) (D) (iii) 50. Assume that we have constructor function for both Base and Derived classes. Now consider the declaration : main ( ) Base *p = new Derived; In what sequence, the constructor will be executed ? (A) Derived class constructor is followed by Base class constructor. (B) Base class constructor is followed by Derived class constructor. (C) Base class constructor is never called. (D) Derived class constructor is never called. (iii) Many to many relationship (d) 52. (b) (c) (iv) (ii) (iii) (ii) (iii) (iv) (iv) (i) (d) (i) (i) (i) (ii) Sixty (60) reusable components were available for an application. If only 70% of these components can be used, rest 30% would have to be developed from scratch. If average component is 100 LOC and cost of each LOC is ` 14, what will be the risk exposure if risk probability is 80% ? (A) ` 25,200 (B) ` 20,160 (C) ` 25,160 (D) ` 20,400 51. Consider the following two function declarations : (i) int *f( ) (ii) int (*f)( ) Which of the following is true ? (A) Both are identical. (B) The first is a correct declaration and the second is wrong. (C) Both are different ways of declaring pointer to a function. (D) The first declaration is a function returning a pointer to an integer and the second is a pointer to function returning integer. Paper-III 8 S-87-13 55. MPEG involves both spatial compression and temporal compression. The spatial compression is similar to JPEG and temporal compression removes ______ frames. (A) Temporal (B) Voice (C) Spatial (D) Redundant 56. If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission before division ? (A) 1111110000 (B) 1111111010 (C) 111111000 (D) 111111 If user A wants to send an encrypted message to user B. The plain text of A is encrypted with the _______. (A) Public Key of user A (B) Public Key of user B (C) Private Key of user A (D) Private Key of user B 57. 58. 59. 60. 61. 62. S-87-13 The two color systems the HSV and HLS are (A) Hue, Saturation, Value and Hue, Lightness, Saturation. (B) High, Standard, Value and High, Lightness, Saturation. (C) Highly, Saturated, Value and Highly, Lightened, Saturation. (D) Highly, Standard, Value and Hue, Lightness, Saturation. 63. A _____ can forward or block packets based on the information in the network layer and transport layer header. (A) Proxy firewall (B) Firewall (C) Packet filter firewall (D) Message digest firewall Which of the following graphics devices are known as active graphics devices ? (i) Alphanumeric devices (ii) Thumb wheels (iii) Digitizers (iv) Joystics (A) (i) and (ii) (B) (iii) and (iv) (C) (i), (ii) and (iii) (D) (i), (ii), (iii) and (iv) A diametric projection is said to be trimetric projection when (i) two of the three foreshortening factors are equal and third is arbitrary. (ii) all of the three foreshortening factors are equal. (iii) all of the three foreshortening factors are arbitrary. Which of the above is true ? (A) (i) and (ii) (B) (ii) and (iii) (C) (i) only (D) (iii) only Which of the following is/are fundamental method(s) of antialiasing ? (i) Increase of sample rate. (ii) Treating a pixel as a finite area rather than as a point. (iii) Decrease of sample rate. (A) (i) and (ii) (B) (ii) and (iii) (C) (i) only (D) (ii) only The parametric representation of the line segment between the position vectors P1(2, 3) and P2(5, 4) is given as (A) x(t)= 2+7t, y(t) = 3+7t (B) x(t)=2+10t, y(t) = 3+12t (C) x(t)= 2+3t, y(t)=3+t (D) t(x, y) = 14t 64. 9 0 t 0 t 1 0 t 1 0 t 1 Consider the following transformation matrix for rotation(clockwise) : cos sin 0 0 sin cos 0 0 [T] = 0 1 0 0 0 0 0 1 This matrix rotates an object by an angle about : (A) X-axis (B) Y-axis (C) Z-axis (D) All of the above Paper-III 65. 66. 68. Consider the following sequence of operations : (i) Pointer p1 is set to point at a new heap-dynamic variable. (ii) Pointer p2 is assigned p1 s value. (iii) The heap dynamic variable pointed to by p1 is explicitly de-allocated, but p2 is not changed by the operation. This situation leads to which of the following : (A) p1 becomes a dangling pointer (B) p2 becomes a dangling pointer (C) Both p1 and p2 are now dangling pointers (D) Neither p1 nor p2 is now a dangling pointer The programming languages C and C++ are not strongly typed languages because : (A) Both C and C++ allow functions for which parameters are not type checked. (B) Both C and C++ allow functions for which parameters are type checked. (C) Both C and C++ allow functions for which parameters are not type checked and also the union types in these languages are not type checked. (D) Union types in these (C and C++) languages are not type checked. 67. 69. 70. The tracing model in Prolog describes program execution in terms of certain events. These events are (A) call and exit (B) call and fail (C) call, exit and redo (D) call, exit, redo and fail Paper-III 10 Which of the following statements is not correct with reference to distributed systems ? (A) Distributed system represents a global view of the network and considers it as a virtual uniprocessor system by controlling and managing resources across the network on all the sites. (B) Distributed system is built on bare machine, not an add-on to the existing software. (C) In a distributed system, kernel provides smallest possible set of services on which other services are built. This kernel is called microkernel. Open servers provide other services and access to shared resources. (D) In a distributed system, if a user wants to run the program on other nodes or share the resources on remote sites due to their beneficial aspects, user has to log on to that site. A system contains 10 units of resource of same type. The resource requirement and current allocation of these resources for three processes P, Q and R are as follows : P Q R Maximum requirement 8 7 5 Current allocation 4 1 3 Now, consider the following resource requests : (i) P makes a request for 2 resource units. (ii) Q makes request for 2 resources units. (iii) R makes a request of 2 resource units. For a safe state, which of the following options must be satisfied ? (A) Only request (i) (B) Only request (ii) (C) Only request (iii) (D) Request (i) and (ii) Consider the following set of processes with the length of CPU burst time in milliseconds (ms) : Process A B C D E Burst time 6 1 2 1 5 Priority 3 1 3 4 2 Assume that processes are stored in ready queue in following order : A B C D E Using round robin scheduling with time slice of 1 ms, the average turn around time is (A) 8.4 ms (B) 12.4 ms (C) 9.2 ms (D) 9.4 ms S-87-13 71. Consider a main memory with 3 page frames for the following page reference string : 5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4 Assuming that the execution of process is initiated after loading page 5 in memory, the number of page faults in FIFO and second chance replacement respectively are (A) 8 and 9 (B) 10 and 11 (C) 7 and 9 (D) 9 and 8 72. Which of the following shell scripts will produce the output my first script ? (A) for i in my first script { echo i $i} (B) for my first script; do echo n; done (C) for i in my first script; do echo i $i; done (D) for n in my first script; do echo i $i; done 73. The portion of Windows 2000 operating system which is not portable is (A) processor management (B) user interface (C) device management (D) virtual memory management 74. Match the following for Windows Operating System : (a) Hard(i) Starting all processes, ware emulation of different abstraoperating systems, ction security functions, layer transform character based applications to graphical representation. (b) Kernel (ii) Export a virtual memory interface, support for symmetric multiprocessing, administration, details of mapping memory, configuring I/O buses, setting up DMA. (c) Exe(iii) Thread scheduling, cutive interrupt and exception handling, recovery after power failure. (d) Win32 (iv) Object manager, virtual submemory manager, system process manager, plugand-play and power manager. Codes : (a) (b) (c) (d) (A) (i) (iii) (ii) (iv) (B) (iv) (iii) (ii) (i) (C) (ii) (iii) (iv) (i) (D) (iii) (ii) (i) (iv) S-87-13 75. Which of the following statements is not true for UNIX Operating System ? (A) Major strength of UNIX Operating System is its open standards which enabled large number of organizations ranging from academicia to industries to participate in its development. (B) UNIX kernel uses modules with well specified interfaces and provides advantages like simplified testing and maintenance of kernel. It has better extensibility as the kernel is not monolithic. (C) UNIX is kernel based operating system with components management two viz. main process subsystem and file management subsystem. (D) All devices are represented as files which simplify the management of I/O devices and files. The directories structure used is directed acyclic graph. 11 Paper-III Space For Rough Work Paper-III 12 S-87-13

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)


Vishwanath Koli
(34)

Shrutika Kannawar
(2)

Ajeet
(1)

Reshmi Kadam
(1)

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 


Tags : cbse ugc net question papers, UGC NET Solved Sample Question Paper, UGC NET Exam Papers, ugc net past question papers, ugc net syllabus, ugc net specimen, ugc net study material, UGC NET Study Materials FREE, UGC NET Exam Pattern, Free Ugc Net Online Practice Tests, ugc net previous question papers, central board of secondary education,  

© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

ugc_net chat