Trending ▼   ResFinder  

UGC NET JUN 2014 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

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

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) ____________________________ Roll No. 2. (Signature) __________________________ (In figures as per admission card) (Name) ____________________________ J 87 Roll No.________________________________ (In words) 1 4 Time : 2 1/2 hours] Number of Pages in this Booklet : 12 Instructions for the Candidates [Maximum Marks : 150 Number of Questions in this Booklet : 75 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 on the edge of this cover page. Do not accept a booklet without sticker-seal 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 such as change of response by scratching or using white fluid, you will render yourself liable to disqualification. 9. You have to return the test question booklet and 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 original question booklet and 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. J-87-14 1 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. P.T.O. COMPUTER SCIENCE & APPLICATIONS Paper III Note : This paper contains seventy five (75) objective type questions of two (2) marks each. All questions are compulsory. 4. Consider a window bounded by the 1. Beam-penetration and shadow-mask lines : x = 0; y= 0; x = 5 and y = 3. are the two basic techniques for The line segment joining ( 1, 0) and producing color displays with a CRT. (4, 5), if clipped against this window Which of the following is not true ? will connect the points I. The beam-penetration is used (A) (0, 1) and (2, 3) with random scan monitors. (B) (0, 1) and (3, 3) II. Shadow-mask is used in raster(C) (0, 1) and (4, 3) scan systems. (D) (0, 1) and (3, 2) III. Beam-penetration method is better than shadow-mask 5. Which of the following color models method. are defined with three primary colors ? IV. Shadow-mask method is better (A) RGB and HSV color models than beam-penetration method. (B) CMY and HSV color models (C) HSV and HLS color models (A) I and II (B) II and III (D) RGB and CMY color models (C) III only (D) IV only 2. 6. In a digital transmission, the receiver clock is 0.1 percent faster than the sender clock. How many extra bits per second does the receiver receive if the data rate is 1 Mbps ? (A) 10 bps (B) 100 bps (C) 1000 bps (D) 10000 bps 7. Line caps are used for adjusting the shape of the line ends to give them a better appearance. Various kinds of line caps used are (A) Butt cap and sharp cap (B) Butt cap and round cap (C) Butt cap, sharp cap and round cap (D) Butt cap, round cap and projecting square cap Given U = {1, 2, 3, 4, 5, 6, 7} A = {(3, 0.7), (5, 1), (6, 0.8)} ~ then A will be : (where ~ complement) (A) {(4, 0.7), (2, 1), (1, 0.8)} (B) {(4, 0.3), (5, 0), (6, 0.2) } (C) {(1, 1), (2, 1), (3, 0.3), (4, 1), (6, 0.2), (7, 1)} (D) {(3, 0.3), (6.0.2)} 3. Given below are certain output primitives and their associated attributes. Match each primitive with its corresponding attributes : List I List II a. Line i. Type, Size, Color b. Fill Area ii. Color, Size, Font c. Text iii. Style, Color, Pattern d. Marker iv. Type, Width, Color Codes : a b c d (A) i ii iii iv (B) ii i iii iv (C) iv iii ii i (D) iii i iv ii Paper-III 8. 2 Consider a fuzzy set old as defined below Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6), (60, 0.8), (70, 1), (80, 1)} Then the alpha-cut for alpha = 0.4 for the set old will be (A) {(40, 0.4)} (B) {50, 60, 70, 80} (C) {(20, 0.1), (30, 0.2)} (D) {(20, 0), (30, 0), (40, 1), (50, 1), (60, 1), (70, 1), (80, 1)} J-87-14 9. Perceptron learning, Delta learning and LMS learning are learning methods which falls under the category of (A) Error correction learning learning with a teacher (B) Reinforcement learning learning with a critic (C) Hebbian learning (D) Competitive learning learning without a teacher 10. Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance 11. 12. 13. 14. The control string in C++ consists of three important classifications of characters (A) Escape sequence characters, Format specifiers and Whitespace characters (B) Special characters, White-space characters and Non-white space characters (C) Format specifiers, White-space characters and Non-white space characters (D) Special characters, White-space characters and Format specifiers J-87-14 3 Which one of the following describes the syntax of prolog program ? I. Rules and facts are terminated by full stop (.) II. Rules and facts are terminated by semicolon (;) III. Variables names must start with upper case alphabets. IV. Variables names must start with lower case alphabets. Codes : (A) I, II (B) III, IV (C) I, III (D) II, IV 15. Match the following with respect to the jump statements : List I List II a. return i. The conditional test and increment portions b. goto ii. A value associated with it c. break iii. Requires a label for operation d. continue iv. An exit from only the innermost loop Codes : a b c d (A) ii iii iv i (B) iii iv i ii (C) iv iii ii i (D) iv iii i ii Match the following with respect to I/O classes in object oriented programming : List I List II a. fopen() i. returns end of file b. fclose() ii. return for any problem report c. ferror() iii. returns 0 d. feof() iv. returns a file pointer Codes : a b c d (A) iv i ii iii (B) iii i iv ii (C) ii iii iv i (D) iv iii i ii Let L be any language. Define even (W) as the strings obtained by extracting from W the letters in the even-numbered positions and even(L) = {even (W) | W L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by Chop(L) = {W | W L, with | | = 2}. If L is regular language then (A) even(L) is regular and Chop(L) is not regular. (B) Both even(L) and Chop(L) are regular. (C) even(L) is not regular and Chop(L) is regular. (D) Both even(L) and Chop(L) are not regular. Paper-III 16. 19. (B) Which one of the following is not a definition of error ? (A) It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically correct value. (B) It refers to the actual output of a software and the correct output. (C) It refers to a condition that causes a system to fail. (D) It refers to human action that results in software containing a defect or fault. 21. Which one of the following is not a key process area in CMM level 5 ? (A) Defect prevention (B) Process change management (C) Software product engineering (D) Technology change management the process of establishing confidence that a program does what it is supposed to do. (C) Match the following : List I List II a. Correctness i. The extent to which a software tolerates the unexpected problems b. Accuracy ii. The extent to which a software meets its specifications c. Robustness iii. The extent to which a software has specified functions d. Completeness iv. Meeting specifications with precision Codes : a b c d (A) ii iv i iii (B) i ii iii iv (C) ii i iv iii (D) iv ii i iii 20. Software testing is (A) the process of establishing that errors are not present. the process of executing a program to show that it is working as per specifications. (D) the process of executing a program with the intent of finding errors. 17. Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The initial failure intensity was 20 failures/CPU hr. Then the current failure intensity will be (A) 5 failures/CPU hr (B) 10 failures/CPU hr. (C) 20 failures/CPU hr. (D) 40 failures/CPU hr. 18. Consider a project with the following functional units : Number of user inputs = 50 Number of user outputs = 40 Number of user enquiries = 35 Number of user files = 06 Number of external interfaces = 04 Assuming all complexity adjustment factors and weighing factors as average, the function points for the project will be (A) 135 (B) (C) (D) 672 Paper-III 675 722 4 J-87-14 22. 23. 24. 25. Consider the following relational schemas for a library database : Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies : I. Title, Author Catalog_no II. Catalog_no Title, Author, Publisher, Year III. Publisher, Title, Year Price Assume (Author, Title) is the key for both schemas. Which one of the following is true ? (A) Both Book and Collection are in BCNF. (B) Both Book and Collection are in 3NF. (C) Book is in 2NF and Collection in 3NF. (D) Both Book and Collection are in 2NF. decomposition such that R1 R2 = then the decomposition is (A) not in 2NF (B) in 2NF but not in 3NF (C) in 3NF but not in 2NF (D) in both 2NF and 3NF 26. 5 Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock : I. 2-phase locking II. Time phase ordering (A) Both I & II (B) II only (C) I only (D) Neither I nor II 28. Match the following : List I List II a. Timeout ordering i. Wait for graph protocol b. Deadlock ii. Roll back prevention c. Deadlock iii. Wait-die scheme detection d. Deadlock iv. Thomas Write recovery Rule Codes : a b c d (A) iv iii i ii (B) iii ii iv i (C) ii i iv iii (D) iii i iv iii Which one of the following is not a Client-Server application ? (A) Internet chat (B) Web browser (C) E-mail (D) Ping 27. Specialization Lattice stands for (A) An entity type can participate as a subclass in only one specialization. (B) An entity type can participate as a subclass in more than one specialization. (C) An entity type that can participate in one specialization. (D) An entity type that can participate in one generalization. J-87-14 Consider the schema R = {S, T, U, V} and the dependencies S T, T U, U V and V S If R = (R1 and R2) be a Match the following : List I List II a. Expert i. Pragmatics systems b. Planning ii. Resolution c. Prolog iii. Means-end analysis d. Natural iv. Explanation language facility processing Codes : a b c d (A) iii iv i ii (B) iii iv ii i (C) i ii iii iv (D) iv iii ii i Paper-III 29. STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ? (A) SHAKEY (B) SRI (C) NLP (D) None of these 34. Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ? 31. 32. 33. Slots and facets are used in (A) Semantic Networks (B) Frames (C) Rules (D) All of these 35. Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm (D) 30 % 60 % 50 % Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 12325634637315363424 3451 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages) : (A) 9 and 6 36. (B) (C) ________predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions. (A) Zero-order (B) First-order (C) Second-order (D) High-order (D) 10 and 6 9 and 7 10 and 7 Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) ________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search Paper-III (B) (C) 30. (A) 80 % Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem. 6 J-87-14 37. _________ maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table 38. A part of Windows 2000 operating system that is not portable is (A) Device Management (B) Virtual Memory Management (C) Processor Management (D) User Interface 39. 40. 42. 43. The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + / J-87-14 7 One of the main features that distinguish microprocessor from micro-computers is (A) words are usually larger in microprocessors. (B) words are shorter in microprocessors. (C) microprocessor does not contain I/O devices. (D) None of the above. 46. 41. Which of the following flip-flops is free from race condition ? (A) T flip-flop (B) SR flip-flop (C) Master-slave JK flip-flop (D) None of the above 45. The advantage of _______ is that it can reference memory without paying the price of having a full memory address in the instruction. (A) Direct addressing (B) Indexed addressing (C) Register addressing (D) Register Indirect addressing A byte addressable computer has a memory capacity of 2m Kbytes and can perform 2n operations. An instruction involving 3 operands and one operator needs a maximum of (A) 3m bits (B) m + n bits (C) 3m + n bits (D) 3m + n + 30 bits 44. Match the following with reference to Unix shell scripts : List I List II a. $? i. File name of the current script b. $# ii. List of arguments c. $0 iii. The number of arguments d. $* iv. Exit status of last command Codes : a b c d (A) iii ii i iv (B) ii iii i iv (C) iv iii i ii (D) i iii i iv The output of a sequential circuit depends on (A) present input only (B) past input only (C) both present and past input (D) past output only The output generated by the LINUX command : $ seq 1 2 10 will be (A) 1 2 10 (B) 1 2 3 4 5 6 7 8 9 10 (C) 1 3 5 7 9 (D) 1 5 10 Paper-III 47. All the classes necessary for windows programming are available in the module : (A) win.txt (B) win.main (C) 48. win.std 51. (D) MFC The pure object oriented programming language with extensive metadata available and modifiable at run time is (A) Small talk (C) Windows 32 API supports (B) (D) Eiffel Java C++ (A) 16-bit Windows (B) (C) 52. 32-bit Windows 64-bit Windows Match the following interfaces of Java. Servlet package : List I (D) All of the above List II a. Servlet Config 49. b. Servlet Context (A) collection of continuous objects that incorporates both data structure and behaviour. ii. Read data from a client c. Servlet Request Superficially the term objectoriented , means that, we organize software as a i. Enables Servlets to log events iii. Write data to a client iv. To get initialization parameters (B) collection of discrete objects that incorporates both discrete structure and behaviour. d. Servlet Response (C) collection of discrete objects that incorporates both data structure and behaviour. Codes : a iv i iii iv i i ii iii The syntax of capturing events method for document object is CaptureEvents(Orgs eventType) (C) Encapsulation (D) Generalisation Paper-III ii (B) Aggregation (C) i (A) CaptureEvents() (A) Association (B) ii (D) iv 53. iv (B) iii The part-whole , or a-part-of , relationship in which objects representing the components of something associated with an object representing the entire assembly is called as d (C) ii 50. c (A) iii (D) collection of objects that incorporates both discrete data structure and behaviour. b CaptureEvents(eventType) (D) CaptureEvents(eventVal) 8 J-87-14 54. 58. 55. 60. Match the following cryptographic algorithms with their design issues : List I List II a. DES i. Message Digest b. AES ii. Public Key c. RSA iii. 56-bit key d. SHA-1 iv. 128-bit key Codes : a b c d (A) ii i iv iii (B) iii i iv ii (C) iii iv ii i (D) iv i ii iii The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table. The initial basic feasible solution of the following transportion problem : Destination D1 D2 D3 Supply Given an image of size 1024 1024 pixels in which intensity of each pixel is an 8-bit quality. It requires _______ of storage space if the image is not compressed. (A) one Terabyte (B) one Megabyte (C) 8 Megabytes (D) 8 Terabytes 56. Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? (A) Alternate optimality (B) Infeasibility (C) Unboundedness (D) All of the above 59. Linking to another place in the same or another webpage require two A (Anchor) tags, the first with the ________ attribute and the second with the _________ attribute. (A) NAME & LINK (B) LINK & HREF (C) HREF & NAME (D) TARGET & VALUE 57. O1 J-87-14 7 4 5 Origins O2 3 3 1 8 O3 5 4 7 7 O4 1 6 2 14 Demand 7 is given as 5 Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9 2 9 18 8 7 2 2 10 then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82 9 Paper-III 61. 65. Given the following equalities : E1 : nK+ + nK lg n = (nK+ ) for all fixed K and , K > 0 and > 0. Given the following statements : S1 : The subgraph-isomorphism problem takes two graphs G1 E2 : n32n + 6n23n = O(n32n) and G2 and asks whether G1 is Which of the following is true ? (A) E1 is correct and E2 is correct. a subgraph of G2. S2 : The set-partition problem takes (B) E1 is correct and E2 is not correct. (C) E1 is not correct and E2 is correct. (D) E1 is not correct and E2 is not correct. as input a set S of numbers and asks whether the numbers can be partitioned into two sets A and A = S A such that x x = x A x A Which of the following is true ? 62. Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30 (A) S1 is NP problem and S2 is P problem. (B) S1 is NP problem and S2 is NP problem. (C) S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem. 63. The solution the recurrence n relation of T(n) = 3T floor 4 + n is (A) O(n2) (C) O(n) 64. of 66. (B) O(nlg n) (D) O(l g n) If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n < m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n Paper-III Suppose that the splits at every level of quicksort are in the proportion (1 ) to , where 0 < < is a constant. The minimum depth of a leaf in the recursion tree is approximately given by (A) lgn lg(1 ) (B) lg (1 ) lgn (C) lgn lg lg (D) lgn 10 J-87-14 67. Ten signals, each requiring 3000 Hz, are multiplexed on to a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel ? Assume that the guard bands are 300 Hz wide. (A) 30,000 (B) 32,700 (C) 33,000 (D) None of the above 68. A terminal multiplexer has six 1200 bps terminals and n 300 bps terminals connected to it. If the outgoing line is 9600 bps, what is the value of n ? (A) 4 (B) 8 (C) 16 (D) 28 69. 74. Match the following : List I List II a. Chomsky i. S b S S | a S | c Normal form b. Greibach ii. S a S b | ab Normal form c. S-grammar iii. S AS | a A SA | b d. LL grammar iv. S a B S B B b Codes : a b c d (A) iv iii i ii (B) iv iii ii i (C) iii iv i ii (D) iii iv ii i 75. Which layers of the OSI reference model are host-to-host layers ? (A) Transport, Session, Presentation, Application (B) Network, Transport, Session, Presentation (C) Data-link, Network, Transport, Session (D) Physical, Data-link, Network, Transport Given the following two grammars : G1 : S AB | aaB A a | Aa B b G2 : S a S b S | b S a S | Which statement is correct ? (A) G1 is unambiguous and G2 is unambiguous. (B) G1 is unambiguous and G2 is ambiguous. (C) G1 is ambiguous and G2 is unambiguous. (D) G1 is ambiguous and G2 is ambiguous. Given the following two languages : L1 = {anbn | n > 1} {a} Which of the following is used in the options field of IPv4 ? (A) Strict source routing (B) Loose source routing (C) time stamp (D) All of the above 70. 73. 71. 72. A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum number of hosts it can handle ? (A) 1024 (B) 2048 (C) 4096 (D) 8192 L2 = {w C wR | w {a, b}*} Which statement is correct ? (A) Both L1 and L2 are not deterministic. (B) L1 is not deterministic and L2 is deterministic. (C) L1 is deterministic and L2 is not deterministic. (D) Both L1 and L2 are deterministic. Four bits are used for packed sequence numbering in a sliding window protocol used in a computer network. What is the maximum window size ? (A) 4 (B) 8 (C) 15 (D) 16 J-87-14 11 Paper-III Space For Rough Work Paper-III 12 J-87-14

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)


Akshay Akshay
(10)

Rajesh Puppala
(7)

Archanamahesh Yenni
(6)

Vishwanath Koli
(6)

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