Education and Career Forum

While studying the computer languages it is necessary to have a thorough understanding of the data structure. Each language has its own data structure and at an advanced level understanding the data structure of a particular computer language can go a long way in clearing one’s idea about a language. Some of the topics dealt with in this paper are polymorphism and the different types of polymorphism supported in C++, conversion of infix expression to a postfix form using stack, difference between binary tree and binary search tree, difference between a stack and a queue, memory representation of lower triangular matrix, complexity of the quick sort algorithm, technique used in quick sort using an unsorted list of elements, Kruskal’s algorithm to find the minimal spanning tree, algorithm for quick sort, method for stimulating a queue using stacks, pseudo routines for push, pop to manipulate the stacks, function to print a given input string in reverse order using recursion. The first part which is for 40 marks has only objective type of questions. There are 10 MCQs, 10 match the columns, 10 true and False and 10 fill in blanks type questions. The second part has only subjective questions of 15 marks each.