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