This document provides instructions for setting a paper on the topic of data structures. It outlines that the paper should have:
1) A compulsory question covering the entire syllabus worth 25 marks.
2) Four units based on the syllabus topics. Each unit should have two questions but students only need to attempt one question per unit worth 12.5 marks each.
3) The units cover topics like algorithms analysis, basic data structures, trees, graphs, searching/sorting techniques, and file organization methods.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
This document provides instructions for setting a paper on the topic of data structures. It outlines that the paper should have:
1) A compulsory question covering the entire syllabus worth 25 marks.
2) Four units based on the syllabus topics. Each unit should have two questions but students only need to attempt one question per unit worth 12.5 marks each.
3) The units cover topics like algorithms analysis, basic data structures, trees, graphs, searching/sorting techniques, and file organization methods.
This document provides instructions for setting a paper on the topic of data structures. It outlines that the paper should have:
1) A compulsory question covering the entire syllabus worth 25 marks.
2) Four units based on the syllabus topics. Each unit should have two questions but students only need to attempt one question per unit worth 12.5 marks each.
3) The units cover topics like algorithms analysis, basic data structures, trees, graphs, searching/sorting techniques, and file organization methods.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
This document provides instructions for setting a paper on the topic of data structures. It outlines that the paper should have:
1) A compulsory question covering the entire syllabus worth 25 marks.
2) Four units based on the syllabus topics. Each unit should have two questions but students only need to attempt one question per unit worth 12.5 marks each.
3) The units cover topics like algorithms analysis, basic data structures, trees, graphs, searching/sorting techniques, and file organization methods.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
Download as doc, pdf, or txt
You are on page 1/ 1
Code No.
: ETCS 211 Paper: Data Structures
INSTRUCTIONS TO PAPER SETTERS:
L 3
T 1
C 4
MAXIMUM MARKS: 75
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 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. However, student may be asked to attempt only 1 question from each unit. Each question should be of 12.5 marks.
UNIT I Fundamentals of algorithm analysis: Big O notations, Time and space complexity of algorithms., Elementary data structures and their applications Arrays: ordered lists, representation of arrays, sparse matrices, linked lists: singly and doubly linked lists, stacks, queues, multiples stacks and queues, Applications: polynomial arithmetic, infix, postfix and prefix arithmetic expression conversion and evaluations. [No. of Hrs: 12] UNIT II Trees: Binary trees: Definition, traversal, threaded binary tree, Counting Binary Tree. Graphs: Representation, traversal, connected components, shortest path and transitive closure, topological sort, activity network, critical path, path enumeration. Dijkstras Algorithm, Floyd Warshalls Algorithm, Minimum Spanning Tree Definitions. [No. of Hrs: 11] UNIT III Searching & Sorting: Binary Search Tree, Insertion & Deletion, AVL Trees, Hash function, Hash table, Internal sort: Radixsort, Insertion sort, Exchange sort, Selection sort, Quicksort, Shellsort, Mergesort, Heaport, External sort: K-way mergesort, balanced mergesort, polyphase mergesort [No. of Hrs: 11] UNIT IV Files: Files, Queries and sequential organization; Cylinder surface indexing, Hashed Indexed, Tree Indexing, B-Trees, Trie Indexing, Sequential file organizational, random file organization, Hashed file organization, Inverted files, cellular partitions. [No. of Hrs: 10] TEXT BOOKS: 1. E. Horowitz and S. Sahani, Fundamentals of Data Structures, Galgotia Booksource Pvt. Ltd, 1999. 2. R. L. Kruse, B. P. Leung, C. L. Tondo, Data Structures and program design in C, PHI, 2000. REFERENCES BOOKS: 1. Schaums outline series, Data Structure, TMH, 2002 2. Y. Langsam et. al., Data Structures using C and C++, PHI, 1999. 3. Yashwant Kanetkar, Data Structure through C, BPB, 2005
