5. A.M. Natarajan, P. Balasubramani, A. Tamilarasi, Operations Research, Pearson Education, 2005. Semester III BCA3CJ201 - Data Structures using C Course Outcomes (CO) Page 49 of 241 Programme BCA Course Code BCA3CJ201 Course Title Data Structures using C Type of Course Major Semester III Academic Level 200 - 299 Course Details Credit Lecture per week Tutorial per week Practical per week Total Hours 4 3 - 2 75 Pre-requisites 1. Fundamental Mathematics Concepts: Set, Functions, Logic 2.
CSC2CJ101 – Fundamentals of Programming Course Summary This course explores implementations of linked list and array-based data structures, delving into the inner workings of basic data structures including lists, stacks, queues, trees, and graphs. CO CO Statement Cognitive Level* Knowledge Category# Evaluation Tools used CO1 Differentiate basic data structures (arrays, linked lists, stacks, queues) based on their characteristics, operations, and real-world applications. U C Instructor- created exams / Quiz CO2 Perform basic operations (e.g., insertion, deletion, search) on fundamental data structures using a chosen programming language.
Ap P Practical Assignment / Observation of Practical Skills CO3 Identify the properties and applications of advanced data structures (trees, graphs). Ap P Seminar Presentation / Group Tutorial Work CO4 Investigate the properties of various searching and sorting Techniques U C Practical Assignment / Seminar CO5 Demonstrate critical thinking and problem-solving skills by applying data structures and algorithms to address complex computational challenges. Ap P Viva Voce/ Observation of Practical Skills CO6 Implement and analyse different data structure algorithms (to solve practical problems. Ap P Case study/ Project