GATE CS MCQ on DS and OS asked in IT written interviews

1) Increasing the RAM of a computer typically improves performance because Virtual memory increases Larger RAMs are faster Fewer page faults occur Fewer segmentation faults occur   2) Which of the following page replacement algorithms suffers from Belady’s anomaly? FIFO LRU OPTIMAL MRU   3) The data blocks of a very large file in the … Read more GATE CS MCQ on DS and OS asked in IT written interviews

MCQ on Tree | Binary Tree | Binary Search Tree | AVL Tree

1) A Binary Tree can have Can have 2 children Can have 1 children Can have 0 children All   2) Height of Height of a binary tree is MAX( Height of left Subtree, Height of right subtree)+1 MAX( Height of left Subtree, Height of right subtree) MAX( Height of left Subtree, Height of right … Read more MCQ on Tree | Binary Tree | Binary Search Tree | AVL Tree

MCQ on Stack | Queue | Array | Linked List Data Structures

1) Elements can be retrieved by index in …………….? linked lists linear arrays both of above none of above   2) Efficiency of an algorithm is measured by Time and Capacity complexity Time and Space complexity Speed  and Space complexity Speed  and Capacity complexity 3) Which sorting algorithm is the slowest algorithm for large number … Read more MCQ on Stack | Queue | Array | Linked List Data Structures