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