5 2010 /ocw.usu.edu Electrical and Computer Engineering Signals and Systems › › Assessment Methods & Levels (based on Blooms’ Taxonomy) Formative assessment based on Capstone Model (Max. Marks:20) Course Bloom’s Level Tentative Assessment Component Marks Outcome C104.1 Remember Classroom or Online Quiz 2 C104.2 Understand Class Presentation/Power point 4 presentation C104.3 Apply Group Assignment 6 C104.4& Apply Group activities 8 C104.5 Summative assessment based on Continuous and End Semester Examination Continuous Assessment End Semester Bloom’s Level Term End CIA1 CIA2 Examination Assessment Remember 20 20 20 20 Understand 30 30 30 30 50 50 50 50 Analyse - - - - Evaluate - - - - Create - - - - 16CS213 DATA STRUCTURES AND ALGORITHMS 3/0/2/4 Nature of Course :K (Problem Programming) Pre requisites :16CS212 - Linux and Programming in C++ Course Objectives: 1 To stress the importance of Algorithms and Data structures in becoming a more Productive programmer. 2 To understand the Algorithms and Data structures used for solving a problem are much more important than knowing the code for it in some programming language. 3 To provide an insight into the intrinsic nature of the problem as well as possible solution techniques, independent of programming language, programming paradigms, computer hardware or any other implementation technique. Course Outcomes: Upon completion of the course, students shall have ability to C302.1 Identify the suitable data structure for a real world problem [R] C302.2 Select an appropriate design paradigm that solves the problem [U] efficiently C302.3 Write efficient algorithms [AP]
5 /ocw.usu.edu › Electrical and Computer Engineering › Signals and Systems Assessment Methods & Levels (based on Blooms’ Taxonomy) Formative assessment based on Capstone Model (Max. Marks:20) Course Outcome Bloom’s Level Tentative Assessment Component Marks C104.1 Remember Classroom or Online Quiz 2 C104.2 Understand Class Presentation/Power point presentation 4 C104.3 Apply Group Assignment 6 C104.4& C104.5 Apply Group activities 8 Summative assessment based on Continuous and End Semester Examination Bloom’s Level Continuous Assessment End Semester Examination CIA1 CIA2 Term End Assessment Remember 20 20 20 20 Understand 30 30 30 30 50 50 50 50 Analyse - - - - Evaluate - - - - Create - - - - 16CS213 DATA STRUCTURES AND ALGORITHMS 3/0/2/4 Nature of Course :K (Problem Programming) Pre requisites :16CS212 - Linux and Programming in C++ Course Objectives: 1 To stress the importance of Algorithms and Data structures in becoming a more Productive programmer. 2 To understand the Algorithms and Data structures used for solving a problem are much more important than knowing the code for it in some programming language. 3 To provide an insight into the intrinsic nature of the problem as well as possible solution techniques, independent of programming language, programming paradigms, computer hardware or any other implementation technique. Course Outcomes: Upon completion of the course, students shall have ability to C302.1 Identify the suitable data structure for a real world problem [R] C302.2 Select an appropriate design paradigm that solves the problem efficiently [U] C302.3 Write efficient algorithms [AP] 2010
R16%20syllabus.docx