Education and Career Forum

Gujarat Technological University ME 1st Sem- Computer Algorithm Papers cover a wide range of topics from which questions may be asked. As it may be obvious, the paper is numerical based and thus it is very high scoring. Questions can be asked from topics like complexity of numbers, worst case and best case complexity of INSERTION sort, master method for the solving of sums based on the complexity of numbers, difference between Red-Black tree and AVL tree, creation of AVL tree for a sequence of numbers or data given, utilization of augmented data structure with information and rank, different type of Edges in DFS with suitable examples, and so on. These ensure that the paper remains high scoring for the student who has understood the basic concepts well. Other possible topics from which questions may be asked include Prim’s algorithm, time space complexity, difference between parallel algorithms and sequential algorithms.