COURSE OBJECTIVES, OUTCOMES AND PREREQUISITES

Course Objectives:

• To understand algorithms and their analysis techniques.

• To introduce the concept of data structures using Abstract Data Types (ADTs), including lists, stacks, and queues.

• To design and implement various data structure algorithms.

• To introduce techniques for representing real-world data using appropriate data structures.

• To develop applications using data structure–based algorithms.

• To analyze and compute the time and space complexity of different algorithms.

Course outcome:

• Select appropriate data structures as applied to the specified problem definition.

• Implement operations like searching, insertion, and deletion, traversing mechanism etc., on various data structures.

• Students will be able to implement Linear and Non-Linear data structures.

• Implement appropriate sorting/searching technique for the given problem.

• Design advance data structure using a non-linear data structure.

• Determine and analyze the complexity of given Algorithms.

Prerequisites: Basic knowledge of a programming language is required. 

EVALUATION COMPONENTS

COURSE WORK (100 MARKS)

1. Assignments (20%)  

                 a). Assignments, Quizzes, Class Participation, Course Projects.

2. Mid Sem Examination (30%)        

3. End Sem Examination (50%)

PRACTICAL EXAMINATION (100 MARKS)

1. Lab Attendance (20%), Viva (20%), Continuous Evaluation (20%), Lab Exam (40%).

LECTURE NOTES (CS-1002) 

             Lecture-1: Introduction and Applications of Data Structures  

             Lecture-2: Pointers

             Lecture-3: Arrays

             Lecture-4: Functions

             Lecture-5: Structures

LAB DETAILS (CS-1102)

Lab Sheet-1:  Sec-2A & 2B

Lab Exam 1: Section 2A

Lab Sheet-2:  Sec-2A & 2B

QUIZ DETAILS (CS-1002)

Surprise Quiz-1:  Sec-2A (21 Jan 2026)

Surprise Quiz-1:  Sec-2B (22 Jan 2026)