UGC NET DEC 2015 Computer Science Paper – II Modal Exam By Eandhizhai | December 21, 2015 - 4:21 pm |October 1, 2020 Welcome to your UGC NET DECEMBER 2018 Computer Science Paper - II Modal Exam Name Email Phone Number 1. If a packet arrive with an M-bit value is ‘1’ and a fragmentation offset value ‘0’, then it is______ fragment First Last Middle All the above 2. The design issue of Datalink Layer in OSI Reference Model is Framing Connection control Representation of bits Synchronization of bits 3. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal. ABDCEF ADBFEC ABDECF ABFCDE 4. Dijkestra banking algorithm in an operating system, solves the problem of deadlock avoidance context switching deadlock recovery mutual exclusion 5. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be 64 128 160 32 6. The time complexity to build a heap of n elements is O(n) O(nlgn) O(1) O(lgn) 7. Match the following IC families with their basic circuits : a. TTL 1. NAND b. ECL 2. NOR c. CMOS 3. Inverter Code a-3,b-2,c-1 a-2,b-3,c-1 a-1,b-3,c-2 a-1,b-2,c-3 8. The VLF and LF bauds use propagation for communication Sky Space Ground Line of sight 9. In UNIX, which of the following command is used to set the task priority ? PS init nice kill 10. Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88 ? 90, 110, 80, 85, 88 90, 40, 65, 50, 88 65, 140, 80, 70, 88 190, 60, 90, 85, 88 11. The ‘C’ language is None of the above Context free language Context sensitive language Regular language 12. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using : Aging Parity bit Compaction Timer 13. All of the following are examples of real security and privacy risks except Hackers Viruses Spam Identify theft 14. The worst case time complexity of AVL tree is better in comparison to binary search tree for Search and Delete Operations Search and Insert Operations Insert and Delete Operations Search, Insert and Delete Operations 15. B + tree are preferred to binary tree in database because Disk access much slower than memory access Disk data transfer rates are much less than memory data transfer rate Disk capacities are greater than memory capacities Disk are more reliable than memory 16. A station in a network forward incoming packets by placing them on its shortest output queue. What routing algorithm is being used ? Flooding Hot potato routing Delta routing Static routing 17. Emergency fixes known as patches are result of perfective maintenance adaptive maintenance none of the above corrective maintenance 18. A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79 ? 1 7 5 3 19. What is the result of the following expression ? (l&2) + (3&4) 1 3 2 0 20. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? 256.6 KB 83.6 KB 332.8 KB 266.2 KB 21. The amount of uncertainty in a system of symbol is called Entropy Bandwidth Quantum Loss 22. Component level design is concerned with None of the above Flow oriented analysis Both of the above Class based analysis 23. The maturity levels used to measure a process are None of the above Initial, Repeatable, Defined, Managed, Optimized Primary, Secondary, Defined, Managed, Optimized Initial, Stating, Defined, Managed, Optimized 24. The number of bits required for an IPV 6 address is 128 16 32 64 25. The value of the following expression (13 / 4 * 3) % 5 + 1 is 5.75 5 1.4875 2.95 26. A chip having 150 gates will be classified as VLSI LSI SSI MSI 27. In which tree, for every node the height of its left subtree and right subtree differ almost by one Complète Binary Tree AVL tree Binary search tree Threaded Binary Tree 28. RAD stands for______. Rapid Aided Development Rapid and Design Rapid Application Design Rapid Application Development 29. Consider the tree given below : Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree. c & h c & k g, b, c, h, i, m d & h 30. Basis path testing falls under system testing white box testing black box testing unit testing 31. Which API is used to draw a circle ? Round Rect ( ) Ellipse ( ) Pie() Circle () 32. Data security threats include fraudulent manipulation of data encryption and decryption privacy invasion hardware failure 33. Active X controls are Pentium binary programs that can be embedded in ____________ Script pages Word pages URL pages Web pages 34. Which of the following is true ? A relation in BCNF is not in 3NF BCNF and 3NF are same A relation in 3NF is always in BCNF A relation in BCNF is always in 3NF 35. The Mobile Application Protocol (MAP) typically runs on top of which protocol ? SNMP (Simple Network Management Protocol) HTTP (Hyper Text Transfer Protocol) SS7 (Signalling System 7) SMTP (Simple Mail Transfer Protocol) 36. “Black” refers in the “Black-box” testing means I – O is hidden Users are hidden Design is hidden Functions are hidden 37. What is the size of the Unicode character in Windows Operating System? None of the above 32-Bits 16-Bits 8-Bits 38. Which of the following is a bad example of recursion ? Factorial Fibonacci numbers Tree traversal Tower of Hanoi 39. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is 0010110 0101110 0011110 0011100 40. Testing of software with actual data and in actual environment is called Beta testing None of the above Regression testing Alpha testing 41. Match the following with respect to C++ data types : a. User defined type 1. Qualifier b. Built in type 2. Union c. Derived type 3. Void d. Long double 4. Pointer a-2,b-3,c-4,d-1 a-2,b-4,c-3,d-1 a-3,b-4,c-1,d-2 a-1,b-2,c-3,d-4 42. Web Mining is not used in which of the following areas ? Information filtering Online transaction processing Crime fighting on the internet Click stream analysis 43. Match the following : List-I List – II a. Wireless Application Environment i. HTTP b. Wireless Transaction Protocol ii. IP c. Wireless Datagram Protocol iii. Scripts d. Wireless iv. UDP a-ii,b-iii,c-i,d-iv a-i,b-ii,c-iii,d-iv a-iii,b-i,c-iv,d-ii a-iii,b-ii,c-iv,d-i 44. Encryption and Decryption is the responsibility of Layer. Network Physical Application Datalink 45. Linux operating system uses Hand Shaking Highest Penalty Ratio Next Affinity Scheduling Fair Preemptive Scheduling 46. In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains atleast one fish ? 3876 775 200 1001 47. Consider a logical address space of 8 pages of 1024 words mapped with memory of 32 frames. How many bits are there in the physical address ? 13 Bits 11 Bits 9 Bits 15 Bits 48. Optical storage is a medium-speed direct access storage device high-speed sequential access storage device high-speed direct access storage device low-speed direct access storage device 49. A graph is non-planar if and only if it contains a subgraph homomorphic to k3,3 or k6 K3,2 or K5 k3,3 or k5 k2,3 or k6 50. The relationship of data elements in a module is called Granularity Coupling Cohesion Modularity 51. How many edges are there in a forest of t-trees containing a total of n vertices ? nt n*t n+1 n-t Please fill in the comment box below. Be sure to click Submit Quiz to see your results! Time's up Bookmark the permalink.