UGC NET DEC 2015 Computer Science Paper – III Modal Exam By Eandhizhai | December 25, 2015 - 3:02 pm |October 1, 2020 Welcome to your UGC NET JULY 2018 Computer Science Paper - III Modal Exam Name Email Phone Number 1. Consider the following statements about a perception : I. Feature detector can be any function of the input parameters. II. Learning procedure only adjusts the connection weights to the output layer. Identify the correct statement out of the following I is true and II is true I is true and II is false I is false and II is false I is false and II is true 2. In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables, then the possible number of basic solutions are 6 8 10 12 3. Converting a primitive type data into its corresponding wrapper class object instance is called Boxing Wrapping Instantiation Autoboxing 4. The start and stop bits are used in serial communication for error detection error correction synchronization slowing down the communication 5. Everything below the System call interface and above the physical hardware is known as______. Bus Kernel Shell Stub 6. Which of the following points lies on the same side as the origin, with reference to the line 3x + 7y = 2 ? (3,0) (1,0) (0.5,0.5) (0.5,0) 7. A_______complete subgraph and a subset of vertices of a___________graph G = (V, E) are a clique and a vertex cover respectively. minimal, minimal minimal, maximal maximal, minimal maximal, maximal 8. Which of the following commands would return processed of sleep command ? Sleep 1 and echo $? Sleep 1 and echo $# Sleep 1 and echo $x Sleep 1 and echo $! 9. Given the following statements : s1 : Every context-sensitive language L is recursive. S2 : There exists a recursive language that is not context sensitve. Which statement is correct ? S1 is not correct and S2 is not correct. S1 is not correct and S2 is correct. S1 is correct and S2 is not correct. S1 is correct and S2 is correct. 10. ________is a type of transmission impairment in which the signal looses strength due to the resistance of the transmission medium. Attenuation Distortion Noise Decibel 11. The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next outgoing data frame is known as Bit stuffing Piggy backing Pipelining Broadcasting 12. What is the bit rate for transmitting uncompressed 800 x 600 pixel colour frames with 8 bits/pixel at 40 frames/second ? 2.4 Mbps 15.36 Mbps 24 Mbps 153.6 Mbps 13. How many characters per second (7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is asynchronous ? (Assuming 1 start bit and 1 stop bit) 300 320 340 400 14. An A* algorithm is a heuristic search technique which is like a depth-first search where most promising child is selected for expansion generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost. saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion none of the above 15. Match the following : List – I List – II a. Context free grammar i. Linear bounded automaton b. Regular grammar ii. Pushdown automaton c. Context sensitive grammar iii. Turing machine d. Unrestricted grammar iv. Deterministic finite automaton a-i,b-ii,c-iii,d-iv a-iii,b-i,c-iv,d-ii a-ii,b-iv,c-i,d-iii a-iv,b-ii,c-iii,d-i 16. Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ? Windows Vista Windows 2000 Windows NT Windows 98 17. A _________ point of a fuzzy set A is a point x ∈ X at which μA(x) = 0.5 core support crossover α-cut 18. Using RSA algorithm, what is the value of cipher text C, if the plain text M = 5 and p = 3, q = 11 & d = 7 ? 15 26 33 37 19. Temporal cohesion means ? Coincidental cohesion Cohesion between temporary variables Cohesion between local variables Cohesion with respect to time 20. Maximum possible value of reliability is ? 0 1 10 100 21. If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A* algorithm gives an optimal solution if h* is equal to h h* overestimates h h* underestimates h none of these 22. In IPV4, the IP address 200.200.200.200 belongs to Class A Class B Class C Class D 23. The compiler converts all operands upto the type of the largest operand is called Type Promotion Type Evaluation Type Conversion Type Declaration 24. What is the propagation time if the distance between the two points is 48,000 ? Assume the propagation speed to be 2.4 × 108 metre/second in cable. 0.5 ms 20 ms 50 ms 200 ms 25. Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be 4,5 5,4 3,1 13,8 26. The grammar ‘G1’ S -> OSO| ISI | 0|1|∈ and the grammar ‘G2’ is S -> as |asb| X, X -> Xa | a. Which is the correct statement ? G1 is ambiguous, G2 is unambiguous G1 is unambiguous, G2 is ambiguous Both G1 and G2 are ambiguous Both G1 and G2 are unambiguous 27. When a programming Language has the capacity to produce new data type, it is called as ? Overloaded Language Extensible Language Encapsulated Language Abstraction Language 28. Identify the following activation function : Φ(V) = Z + 1 / 1 + exp(-X * V + Y) Z, X, Y are parameters Step function Ramp function Gaussian function Sigmoid function 29. Functions defined with class name are called as Friend function Constructor Inline function Static function 30. Which method is called first by an applet program ? start( ) run() init() begin() 31. The factors that determine the quality of a software system are correctness, reliability efficiency, usability, maintain-ability testability, portability, accuracy, error tolerances, expandability, access control, audit All of the above 32. If a relation with a Schema R is decomposed into two relations R1 and R2 such that (R1∪R2) = R1 then which one of the following is to be satisfied for a lossless joint decomposition (→ indicates functional dependency) R1 ∩ R2 → R1 and R1∩ R2 → R2 (R1 ∩ R2) → R1 or R1∩ R2 → R2 R1∩ R2 → R1 R1∩ R2 → R2 33. If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is Optimum Infeasible Unbounded Degenerate 34. How many tokens will be generated by the scanner for the following statement ? x = x * (a + b) – 5; 7 10 11 12 35. The behaviour of the document elements in XML can be defined by Using document object Registering appropriate event handlers Using element object All of the above 36. Eco System is a Frame work- for Building a Computer System Building Internet Market Building Offline Market Building Market 37. 58 lamps are to be connected to a single electric outlet by using an extension board each of which has four outlets. The number of extension boards needed to connect ail the light is 19 20 28 29 38. Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ? 4, 254, 403, 400, 332, 346, 399, 365 926, 222, 913, 246, 900, 260, 364, 365 927, 204,913, 242, 914, 247, 365 4, 401, 389, 221, 268, 384, 383, 280, 365 39. How many disk blocks are required to keep list of free disk blocks in a 16 GB hard disk with 1 kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in 32 bits. 1024 blocks 16794 blocks 20480 blocks 1048576 blocks 40. In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called NTFS file system Hardware abstraction layer Microkernel Process Manager 41. Match the following : List – I List – II a. Application layer i. TCP b. Transport layer ii. HDLC c. Network layer iii. HTTP d. Data link layer iv. BGP a-i,b-ii,c-iii,d-iv a-iv,b-iii,c-ii,d-i a-ii,b-iv,c-i,d-iii a-iii,b-i,c-iv,d-ii 42. Match the following with respect to programming languages : List -I List – II a. Structured Language i. JAVA b. Non-structured Language ii. BASIC c. Object Oriented Language iii. PASCAL d. Interpreted Language iv. FORTRAN a-i,b-ii,c-iii,d-iv a-iii,b-i,c-iv,d-ii a-iii,b-iv,c-i,d-ii a-iv,b-ii,c-iii,d-i 43. Which once of the following is not a software myth? Once we write the program and get it to work, our job is done. Project requirements continually change, but change can be easily accommodated because software is flexible. If we get behind schedule, we can add more pro grammers and catch up. If an organization does not understand how to control software projects internally, it will invariably struggle when it outsources software projects 44. Which of the following is not a field in TCP header ? Sequence number Fragment offset Checksum Window size 45. In Win32, which function is used to create Windows Applications ? WinAPP Win Main WinVoid Win API 46. The Z-buffer algorithm is used for Hidden surface removal of objects. The maximum number of objects that can be handled by this algorithm shall Depend on the application Be arbitrary no. of objects Depend on the memory availability Depend on the processor 47. In Unix, how do you check that two given strings a and b are equal ? test $a -eq $b test Sa -equal $b test $a = Sb Sh -C test $a = = $b 48. Regular expression for the complement of language L = {a n b m | n ≥ 4, m ≤ 3} is (a + b)* ba(a + b)* a* bbbbb* (λ + a + aa + aaa)b* + (a + b)* ba(a + b)* None of the above 49. One weakness of boundary value analysis and equivalence partitioning is they are not effective they do not explore combinations of input circumstances they explore combinations of input circumstances none of the above 50. Two graphs A and B are shown below : Which one of the following statement is true? A is planar and B is not. Both A and B are planar. Neither A nor B is planar 51. The power set of AUB, where A = {2,3, 5,7} and B = {2,5, 8,9} is 16 32 64 128 52. Which one of the following is not a source code metric ? Halstead metric Function point metric Complexity metric Length metric 53. Match the following : List – I List – II a. Tablet, Joystick i. Continuous devices b. Light Pen, Touch Screen ii. Direct devices c. Locator, Keyboard iii. Logical devices d. Data Globe, Sonic Pen iv. 3D interaction devices a-i,b-ii,c-iii,d-iv a-i,b-iii,c-ii,d-iv a-ii,b-iv,c-i,d-iii a-iv,b-ii,c-iii,d-i 54. Which of the following computing models is not an example of distributed computing environment ? Cloud computing Parallel computing Peer-to-peer computing Cluster computing 55. The Default Parameter Passing Mechanism is called as Call by Reference Call by Value Call by Address Call by Name 56. Find the false statement: In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption The symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. Public key algorithms use two different keys for Encryption and Decryption 57. Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C which have peak demands of 3,4 and 6 respectively. For what value of m deadlock will not occur ? 7 13 10 9 58. Match the following : List-I List – II a. Indexed Addressing i. is not used when an operand is moved from memory into a register or from a register to memory. b. Direct Addressing ii. Memory address is computed by adding up two registers plus an (optional) offset. c. Register Addressing iii. Addressing memory by giving a register plus a content offset. d. Base-Indexed Addressing iv. can only be used to access global variables whose address is known at compile time. a-i,b-ii,c-iii,d-iv a-iii,b-iv,c-i,d-ii a-ii,b-iv,c-iii,d-i a-iv,b-ii,c-iii,d-i 59. For n devices in a network, ________ number of duplex-mode links are required for a mesh topology n(n + 1) n (n – 1) n(n + 1)/2 n(n – 1)/2 60. Which of the following flags are set when ‘JMP’ instruction is executed ? SF and CF AF and CF All flags No flag is set 61. Important advantage of using new and delete operators in C++ is Allocation of memory Frees the memory previously allocated Initialization of memory easily Allocation of memory and frees the memory previously allocated 62. Which of the following concepts means adding new concepts to a program as it runs Data hiding Dynamic binding Dynamic loading Dynamic typing 63. Given below are three basic rules: I. Squash and Stretch II.Slow-in and Slow-out III.To stage the action properly These rules are applied in case of ? Rendering Morphing Animation All the above 64. Match the following : List – I List – II a. Bucket sort i. O(n3lgn) b. Matrix chain multiplication ii. O(n3) c. Huffman codes iii. O(nlgn) d. All pairs shortest paths iv. O(n) a-i,b-ii,c-iii,d-iv a-iii,b-i,c-iv,d-ii a-ii,b-iv,c-i,d-iii a-iv,b-ii,c-iii,d-i 65. If A and B are two fuzzy sets with membership functions UA(x) = {0.2,0.5,0.6,0.1,0.9} UB(x) = {0.1,0.5,0.2,0.7,0.8} Then the value of UA∩B will be {0.2,0.5,0.6,0.7,0.9} {0.2,0.5,0.2,0.1,0.8} {0.1,0.5,0.6,0.1,0.8} {0.1,0.5,0.2,0.1,0.8} 66. A technique used to approximate halftones without reducing spatial resolution is known as _________. Halftoning Dithering Error diffusion None of the above 67. Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure) θ(n logn) O(n log logn) Ω(n logn) Ω(n3/2) 68. Which is the protocol for performing RPCs between applications in a language and system independent way? Hyper Text Transmission Protocol (HTTP) Simple Object Access Protocol (SOAP) Simple network Management Protocol (SNMP) Simple Mail Transfer Protocol (SMTP) 69. Function points can be calculated by UFP * CAF UFP * FAC UFP * Cost UFP * Productivity 70. Match the following with respect to relationship between objects and classes: List -I List -II a. State diagram i. Useful for both abstract modelling and for designing actual program b. Object diagram ii. Describes object classes c. Class diagram iii. Useful for documenting test cases d. Instance diagram iv. Describing the behaviour of a single class of objects. a-iv,b-i,c-ii,d-iii a-iii,b-i,c-iv,d-ii a-ii,b-iv,c-i,d-iii a-iv,b-ii,c-iii,d-i 71. How many solutions do the following equation have x1 + x2 + x3 = 11 where x1 ≥ 1, x2 ≥ 2, x3 ≥ 3 C(7,11) C(11,3) C(7,5) C(14, 11) 72. Match the following : List-I List-II a. Critical region i. Hoares Monitor b. Wait/signal ii. Mutual exclusion c. Working set iii. Principal of locality d. Dead lock iv. Circular wait a-ii,b-i,c-iii,d-iv a-iii,b-i,c-iv,d-ii a-ii,b-iv,c-i,d-iii a-iv,b-ii,c-iii,d-i 73. The aspect ratio of an image is defined as The ratio of width to its height measured in unit length The ratio of height to width measured in number of pixels The ratio of depth to width measured in unit length The ratio of width to depth measured in number of pixels 74. What will be the output of the following logic diagram ? x OR y x AND y x XOR y x XNOR y 75. Consider an imaginary disk with 40 cylinders. A request come to read a block on cylinder 11. While the seek to cylinder 11 is in progress, new requests come in for cylinders 1, 36, 16, 34, 9 and 12 in that order. The number of arm motions using shortest seek first algorithm is 60 61 111 112 Please comment about this exam / your suggestions are most welcome. Be sure to click Submit Quiz to see your results! Time's up Bookmark the permalink.
