The course will enable the students to
Course Outcomes (COs):
Learning Outcome (at course level) | Learning and teaching strategies | Assessment Strategies |
The students will: CO 101.Design and execute basic operations of different data structures. CO 102.Solve specific problems using linked list and queues. CO 103.Write and execute programs based on Sorting and Searching Algorithms. CO 104.Analyze the Applications of Stack and Recursion to solve various computational problems. CO 105.Explain Queues and Linked Lists and analyse their dynamic implementations.
| Interactive Lectures, Discussion, Tutorials, Reading assignments, Demonstrations. | Class test, Semester end examinations, Quiz, Solving problems in tutorials, Assignments, Presentation, Individual and group projects . |
Practical based on implementation of following different data structures & related operations on them: