GATE Computer Science | Complete Paper Solution | Data Structures and Algorithm | GATE 2015- SET-3

In this video, I have discussed the GATE computer science and engineering paper solution based on data structures and algorithm. In this video, I have explained all questions of gate 2015. The questions are as follows: 1. Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are _________. 2. Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is __________ 3. While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is 4. The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is (A) 284 (B) 213 (C) 142 (D) 71 5. Consider the following array of elements. 〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉. The minimum number of interchanges needed to convert it into a max-heap is (A) 4 (B) 5 (C) 2 (D) 3 6. Assume that a merge sort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes? (A) 256 (B) 512 (C) 1024 (D) 2048 I have created this free of cost YouTube channel for computer science and information technology students. Through this channel, I have tried to explain some important topics in a simple way. This channel is very helpful for computer science engineering students who may be from GATE, NET, M.TECH, B.Tech, BCA, BSC, MCA, MSC etc. In this channel, I am trying to cover previous years solved GATE questions, Data Structures, Algorithm Design, Operating System, Data Base Management System(DBMS), Theory of computation (TOC), compiler design, C programming etc. My Channel URL: http://www.youtube.com/c/NargishGupta My Website URL: https://www.nargishgupta.com #gate2015 #gate #gatecse #computerscience #nargishgupta