MCA - Semester 2 - Data & File Structure (End Term Paper 2016)The subject covers Algorithm analysis: Trees, Graphs, searching and sorting and files. Fundamentals of algorithm analysis Big ‘O’ notations, Time and space complexity of algorithms, linked lists: singly and doubly linked lists, stacks, queues, double stack, multistacks and multiqueues, deques, polynomial arithmetic, infix, postfix and prefix arithmetic expression conversion and evaluations.
The question paper structure, usually follows the given below pattern:
1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including sub-parts, if any.