Fundamentals of Data Structures and Algorithms

Data Structure (Syllabus)

Semester & Branch: 3rd sem CSE/IT Teachers Assessment : 10 Marks
Theory: 4 Periods per Week Class Test : 20 Marks
Total Periods: 60 Periods per Semester End Semester Exam : 70 Marks
Examination: 3 Hours TOTAL MARKS : 100 Marks

Objective :

The effectiveness of implementation of any application in computer mainly depends on the that how effectively its information can be stored in the computer. For this purpose various -structures are used. This paper will expose the students to various fundamentals structures arrays, stacks, queues, trees etc. It will also expose the students to some fundamental, I/0 manipulation techniques like sorting, searching etc

1.0 INTRODUCTION: 04

• 1.1 Explain Data, Information, data types
• 1.2 Define data structure & Explain different operations
• 1.3 Explain Abstract data types
• 1.4 Discuss Algorithm & its complexity
• 1.5 Explain Time, space tradeoff

2.0 STRING PROCESSING 03

• 2.1 Explain Basic Terminology, Storing Strings
• 2.2 State Character Data Type,
• 2.3 Discuss String Operations

3.0 ARRAYS 07

• 3.1 Give Introduction about array,
• 3.2 Discuss Linear arrays, representation of linear array In memory
• 3.3 Explain traversing linear arrays, inserting & deleting elements
• 3.4 Discuss multidimensional arrays, representation of two dimensional arrays in memory (row major order & column major order), and pointers
• 3.5 Explain sparse matrices.

4.0 STACKS & QUEUES 08

• 4.1 Give fundamental idea about Stacks and queues
• 4.2 Explain array representation of Stack
• 4.3 Explain arithmetic expression ,polish notation & Conversion
• 4.4 Discuss application of stack, recursion
• 4.5 Discuss queues, circular queue, priority queues.

5.0 LINKED LIST 08

• 5.1 Give Introduction about linked list
• 5.2 Explain representation of linked list in memory