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