COURSE DESCRIBTION Sub Code Course Title : CS 1581 : Data Structures

Type of Course : Science/HSS/Professional Core, Elective or Breadth? Course allotted to : ( Faculty details) Reason for allotment of Course : a) Specialization of faculty (Best Suited) b)Attended Courses thro continuing education ( FDP/STTP/Others) c) Handed the course previously with Good results. d) No other alternative Corresponding Lab (if any) Handled by: Ref Details of Course File / Lab Manual: Check list for the contents of the Course File: a) Lesson Plan b) Class Time Table c)Internal evaluation schedule d) Students List e) Course notes f) University Question Papers g) Assignment topics h) Unit-wise questions I) Copies of Assignment Samples j) Copies of Internal Test Performance k) Class Attendance Log Book l) Students performance in internal evaluations m) Details of Remedial & Make-up Classes Note: Attachments i) to m) to be added to the Course file in due course but before close of Delivery Class/Laboratory Schedule: Lecture: 4 hours per week, Discussion: 1(?), Laboratory: 1(?) Textbooks: Reference Books : Additional References: Prerequisites by Course & Topic: 3 years of high school math. Performance of the students in Prerequisites by Course & Topic: Course Objectives: This course is an introduction to computer science, focusing on the disciplines of procedural and data abstraction. It is intended for higher ability students, but it does not require experience with any particular kind of computer or programming language. It does require a minimum level of mathematical sophistication. This course is designed to be an introduction to the science of problem solving through the writing of computer programs. Students will become familiar with multiple computer programming paradigms, including functional, imperative, and object-oriented programming. Programming will initially be undertaken using the powerful, elegant, and highlevel language Scheme. Scheme is simple to learn and helps students learn the principles of procedural and data abstraction that they will carry throughout their programming careers. The course concludes with an introduction to object-oriented programming using C++.

Major Topics Covered in the Course: What is Computer Science? Recursion and Induction Iteration and Invariants Orders of Growth Higher-Order Procedures Compound Data and Data Abstraction Lists and Trees Generic Operations Stacks and Queues Procedural Programming in C++ Object-Oriented Programming in C++ Course Outcomes: 1. Understand the notion of a computational process and how to bring it about (procedural abstraction) a. Describe computational processes with procedures written in high level languages (Scheme and C++). b. Verify procedure correctness (reasoning by induction and testing). c. Predict how long computational processes will take and how much memory they will require (bigand big-O notation). d. Increase the power of computational processes through higher-order procedures. e. Exploit commonality to implement generic operations. 2. Understand how to describe and manipulate various types of data (data abstraction): a. Construct compound data out of atomic data. b. Create and use abstract data types (ADTs). c. Separate ADT use from its implementation (information hiding). d. Associate data with the operations performed on it (encapsulation). 3. Understand how to relate data to the state of the machine executing a computational process (abstractions of state): a. Create and manipulate elementary data structures (lists, trees, stacks, and queues). b. Ensure the modularity of state by organizing computational entities into classes (object-oriented programming). Relationship to Program Outcomes This course is the first course in computer science. Students do not have to have prior programming experience. This course contributes to meeting the following program outcomes: 2. Students can design, develop, and analyze significant software systems. This course introduces students to the basics of software design and analysis. Students learn a variety of data structures, the algorithms associated with them, and how to analyze algorithms. Course outcomes 1, 2, and 3 map to this program outcome. 3. Students understand the fundamentals of computer organization and architecture, data structures and related algorithms, and programming languages. Students are introduced to the functional approach to procedure writing (Scheme), the procedural approach (C), and the object-oriented approach (C++). They are introduced to the efficiency of algorithms through bigand big-O analysis. They manipulate and reason about lists, trees, stacks, and queues. Course outcomes 1-3 map to this program outcome. 4. Students can apply computer science principles and practices to a variety of problems. Problem applications range from graphics (quilting designs), to security (digital signatures), to game playing (Nim), to databases (a movie query system). Course outcomes 1-3 map to this program outcome.

How much % of the PEO(s) are met by delivery of course? What additional actions taken to meet PEO(s) ? (with Details) Additional Theory Lab Classes with pre designed experiments Guest lecturers proposed Individual Assignments/ Group Assignments/ Internet based Assignments Tests: 2 Marks/ 5 marks/10 marks/15 marks / Slip tests Industrial Visits Organizing Seminars by Industry experts Students Seminars Mini Projects When was course last revised? Does content of course meet requirements of students in terms of higher education and Placement? Is it necessary to conduct an Add-On course? Assessment Plan for Course: This course is assessed every other year by the Faculty and a course assessment document covering all of the course outcomes and their effect on the program outcomes is prepared.

COURSE ASSESSMENT Sub Code Course Title : :

Type of Course : Science/HSS/Professional Core, Elective or Breadth? Course allotted to : ( Faculty details) ADGJLSub Codes Assignments BQuizzes EStudents Feedback HSenior assignment evaluations Classroom participation Faculty Name A B C Projects Student seminars Faculty evaluations CFIKTests Laboratory reports Exit interviews Peer evaluations

ASSESSMENT METHODS USED D E F G H I J K L

Details of Assignments given and the compliance Mini-projects carried by students? How many internal tests were organized? Student Participation detail and Performance Details Details of Quiz conducted Student Seminars Student Participation detail and Performance Details Additional theory classes Conducted ( Give topics handled unit wise) Details of Live demos conducted in Laboratory Feedback Details and Action taken on feedback. Details of Add-on Course / Guest lectures / Industrial Visits organized. Faculty feedback on handling the subject for the class. Exit interview details University result analysis details Pass % Class Average Highest mark % Mark Distribution 100% 90 to 100 80 to 90

70 to 80

60 to 70

50 to 60

<50

HODs Comments