
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

UGC NET SEP 2013 : COMPUTER SCIENCE AND APPLICATIONS PAPER II

7 pages, 50 questions, 45 questions with responses, 57 total responses,

	ugc_net	+Fave Message
	Profile Timeline Uploads Q & 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-II 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) ____________________________ 87 S Roll No.________________________________ (In words) 1 3 1 Time : 1 /4 hours] [Maximum Marks : 100 Number of Pages in this Booklet : 8 Instructions for the Candidates Number of Questions in this Booklet : 50 1. 2. - 3. , - - , : (i) - / - / (ii) - / - - (iii) OMR - 4. (A), (B), (C) (D) : (C) 5. I OMR OMR , 6. 7. (Rough Work) 8. OMR , , , , , 9. OMR OMR 10. / 11. ( ) 12. 1. Write your roll number in the space provided on the top of this page. 2. This paper consists of fifty 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 Paper I 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 1 P.T.O. COMPUTER SCIENCE AND APPLICATIONS Paper II Note : This paper contains fifty (50) 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. A file is downloaded in a home computer using a 56 kbps MODEM connected to an Internet Service Provider. If the download of file completes in 2 minutes, what is the maximum size of data downloaded ? (A) 112 Mbits (B) 6.72 Mbits (C) 67.20 Mbits (D) 672 Mbits 6. The count-to-infinity problem is associated with (A) Flooding algorithm (B) Hierarchical routing algorithm (C) Distance vector routing algorithm (D) Link state routing algorithm 2. In ______ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the outcome of a random number generator. (A) Non-persistent (B) 0-persistent (C) 1-persistent (D) p-persistent 7. The IEEE single-precision and double-precision format to represent floating-point numbers, has a length of ______ and ______ respectively. (A) 8 bits and 16 bits (B) 16 bits and 32 bits (C) 32 bits and 64 bits (D) 64 bits and 128 bits 3. Which of the following substitution technique have the relationship between a character in the plaintext and a character in the ciphertext as one-to-many ? (A) Monoalphabetic (B) Polyalphabetic (C) Transpositional (D) None of the above 8. Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is (A) 2451 (B) 4950 (C) 4851 (D) 9900 9. The amortized time complexity to perform ______ operation(s) in Splay trees is O(Ig n). (A) Search (B) Search and Insert (C) Search and Delete (D) Search, Insert and Delete 10. Suppose that the splits at every level of Quicksort are in proportion 1- to , where 0 < 0.5 is a constant. The number of elements in an array is n. The maximum depth is approximately (A) 0.5 Ig n (B) 0.5 (1 ) Ig n (C) (Ig n)/(Ig ) (D) (Ig n)/Ig (1 ) 4. 5. What is the maximum length of CAT-5 UTP cable in Fast Ethernet network ? (A) 100 meters (B) 200 meters (C) 1000 meters (D) 2000 meters The ______ is a set of standards that defines how a dynamic web document should be written, how input data should be supplied to the program, and how the output result should be used. (A) Hyper Text Markup Language (B) File Transfer Protocol (C) Hyper Text Transfer Protocol (D) Common Gateway Interface Paper-II 2 S-87-13 11. The minimum number of nodes in a binary tree of depth d (root is at level 0) is (A) 2d 1 (B) 2d + 1 1 (C) d + 1 (D) d 16. LL grammar for the language L = {an bm cn+m | m 0, n 0} is (A) S aSc | S1 ; S1 bS1c | The efficient data structure to insert/delete a number in a stored set of numbers is (A) Queue (B) Linked list (C) Doubly linked list (D) Binary tree 13. 17. Regular expression for the language L = { w {0, 1}* | w has no pair of consecutive zeros} is (A) (1 + 010)* (B) (01 + 10)* (C) (1 + 010)* (0 + ) (D) (1 + 01)* (0 + ) 15. Consider the following languages : L1 = {an bl ak | n + l +k>5 } L2 = {an bl ak Assume the statements S1 and S2 given as : S1 : Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite. S2 : There exists an algorithm to determine whether two context free grammars generate the same language. 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. 18. The number of eight-bit strings beginning with either 111 or 101 is ______. (A) 64 (B) 128 (C) 265 (D) None of the above 19. two Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white. (A) 55,440 (B) 1,66,320 (C) 4.790E+08 (D) 39,91,680 |n>5, l >3, k l } Which of the following is true ? (A) L1 is regular language and L2 is not regular language. (B) Both L1 and L2 are regular languages. (C) Both L1 and L2 are not regular languages. (D) L1 is not regular language and L2 is regular language. S-87-13 S aSc | S1| ; S1 bS1c| (D) S aSc | ; S1 bS1c| The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n 4 } is (A) 3 (B) 4 (C) 5 (D) 6 14. S aSc | S1| ; S1 bS1c (C) 12. (B) 3 Paper-II 21. 24. 22. Which one of the following set of gates is best suited for parity checking and parity generation ? (A) AND, OR, NOT (B) NAND, NOR (C) EX-OR, EX-NOR (D) None of the above In which one of the following, continuous process improvement is done ? (A) ISO9001 (B) RMMM (C) CMM (D) None of the above A simple graph G with n-vertices is connected if the graph has (A) (n 1) (n 2)/2 edges (B) more than (n 1) (n 2)/2 edges (C) less than (n 1) (n 2)/2 edges (D) k C(ni, 2) edges i =1 23. Match the following identities/laws to their corresponding name : (a) x + x = x i. Dominance x x=x (b) x + 0 = x ii. Absorption x 1=x (c) x + 1 = 1 iii. Idempotent x 0=0 (d) x (x + y) = x iv. Identity Codes : (a) (b) (c) (d) (A) iii iv i ii (B) iv iii i ii (C) iv iii ii i (D) iii iv ii i 27. Consider the In-order and Post-order traversals of a tree as given below : In-order : j e n k o p b f a c l g m d h i Post-order : j n o p k e f b c l m g h i d a The Pre-order traversal of the tree shall be (A) a b f e j k n o p c d g l m h i (B) a b c d e f j k n o p g l m h i (C) a b e j k n o p f c d g l m h i (D) j e n o p k f b c l m g h i d a If F and G are Boolean functions of degree n. Then, which of the following is true ? (A) F F + G and F G F (B) G F + G and F G G (C) F F + G and F G F (D) G F + G and F G F 26. Consider the following statements : (i) A graph in which there is a unique path between every pair of vertices is a tree. (ii) A connected graph with e = v 1 is a tree. (iii) A graph with e = v 1 that has no circuit is a tree. Which of the above statements is/are true ? (A) (i) & (iii) (B) (ii) & (iii) (C) (i) & (ii) (D) All of the above The quantification !x P(x) denotes the proposition There exists a unique x such that P(x) is true , express the quantification using universal and existential quantifications and logical operators : (A) x P(x) x y ((P(x) P(y)) x = y) (B) x P(x) x y ((P(x) P(y)) x = y) (C) x P(x) x y ((P(x) P(y)) x = y) (D) x P(x) x y ((P(x) P(y)) x = y) 25. 20. Paper-II 4 S-87-13 28. The ______ of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of these components, and the relationship among them. (A) E-R diagram (B) Data flow diagram (C) Software architecture (D) Software design 29. Working software is not available until late in the process in (A) Waterfall model (B) Prototyping model (C) Incremental model (D) Evolutionary Development model 30. 32. 34. Linked Lists are not suitable for _____. (A) Binary Search (B) Polynomial Manipulation (C) Insertion (D) Radix Sort What is the output of the following program segment ? sum(n) { if ( n < 1 ) return n; else return (n + sum(n 1)); } main() { printf( %d , sum(5)); } (A) 10 (B) 16 (C) 15 (D) 14 35. Consider the following characteristics : (i) Correct and unambiguous (ii) Complete and consistent (iii) Ranked for importance and/or stability and verifiable (iv) Modifiable and Traceable Which of the following is true for a good SRS ? (A) (i), (ii) and (iii) (B) (i), (iii) and (iv) (C) (ii), (iii) and (iv) (D) (i), (ii), (iii) and (iv) What is the size of the following Union ? Assume that the size of int = 2, size of float = 4, size of char = 1 union tag { int a; float b; char c; }; (A) 2 (B) 4 (C) 1 (D) 7 Assume that x and y are non-zero positive integers. What does the following program segment perform ? while (x!=0) { if (x>y) x = x-y else y=y-x; printf( %d ,x); (A) Computes LCM of two numbers (B) Computes GCD of two numbers (C) Divides large number with small number (D) Subtracts smaller number from large number Equivalence partitioning is a ______ testing method that divides the input domain of a program into classes of data from which test cases can be derived. (A) White box (B) Black box (C) Regression (D) Smoke 31. 33. S-87-13 5 Paper-II 36. Consider the following program segment : d=0; for(i=1; i<31, ++i) for(j=1; j<31, ++j) for(k=1; k<31, ++k) if ((i+j+k)%3)= = 0); d = d + 1; printf( %d , d); The output will be (A) 9000 (B) 3000 (C) 90 (D) 2700 44. Match the following : List I List - II Process state Reason for transition transition i. Request made a Ready by the process Running is satisfied or an event for which it was waiting occurs. b Blocked ii. Process wishes to wait for Ready some action by another process. c Running iii. The process is dispatched. Blocked d Running iv. The process is preempted. Ready Codes : a b c d (A) iii i ii iv (B) iv i iii ii (C) iv iii i ii (D) iii iii ii i The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is ______. (A) 36 ns (B) 140 ns (C) 122 ns (D) 40 ns Views are useful for _____ unwanted information, and for collecting together information from more than one relation into a single view. (A) Hiding (B) Deleting (C) Highlighting (D) All of the above 40. Thoma s-write rule is ______. (A) Two phase locking protocol (B) Timestamp ordering protocol (C) One phase locking protocol (D) Sliding window protocol The _____ language was originally designed as the Transformation Language for Style Sheet facility. (A) XSTL (B) XML (C) XQuery (D) XPath 39. 43. Usage of Preemption and Transaction Rollback prevents ______. (A) Unauthorised usage of data file (B) Deadlock situation (C) Data manipulation (D) File preemption 38. A method to provide secure transmission of email is called ____. (A) TLS (B) SA (C) IPSec (D) PGP 45. 37. 42. The decision tree classifier is a widely used technique for ______. (A) Classification (B) Association (C) Partition (D) Clustering 41. Cross_tab displays permit users to view ______ of multidimensional data at a time. (A) One dimension (B) Two dimensions (C) Three dimensions (D) Multidimensions Paper-II 6 S-87-13 46. Consider the input/output (I/O) requests made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table : Serial 1 2 3 4 5 No. Track 12 85 40 100 75 No. Time of 65 80 110 100 175 arrival Assume that : Current head position is at track no. 65 Direction of last movement is towards higher numbered tracks Current clock time is 160 milliseconds Head movement time per track is 1 millisecond. 48. 49. 50. (B) XNOR (D) XNAND The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ratio : n tn (A) S = (k + n 1)t p (B) (C) Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one indirect block address and one double indirect block address. The file system has 256 bytes block size and 2 bytes for disk block address. The maximum possible size of a file in this system is (A) 16 MB (B) 16 KB (C) 70 KB (D) 71 KB S-87-13 What type of logic circuit is represented by the figure shown below ? (A) XOR (C) XAND look is a variant of SCAN diskarm scheduling algorithm. In this algorithm, if no more I/O requests are left in current direction, the disk head reverses its direction. The seek times in Shortest Seek First (SSF) and look disk-arm scheduling algorithms respectively are : (A) 144 and 123 milliseconds (B) 143 and 123 milliseconds (C) 149 and 124 milliseconds (D) 256 and 186 milliseconds 47. Which of the following set of Unix commands will always display WELCOME ? (A) export title=WELCOME; Echo $title (B) title = WELCOME; export $ title ; sh c echo $title (C) title = WELCOME; export title ; sh c echo $title (D) title = WELCOME; echo $title n tn S = (k + n + 1)t n tn S = (k n + 1)t (D) S = p p (k + n 1)tp n tn Where n no. of tasks tn time of completion of each task k no. of segments of pipeline tp clock cycle time S speed up ratio 7 Paper-II Space For Rough Work Paper-II 8 S-87-13

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

Ashish
(15)

dudiki
(13)

karunanidhan
(11)

sairaga
(6)

Formatting page ...

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,

ugc_net chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: