Course

Outcomes

Ravichand Kancharla
Sr. Advisor, Aassaan eduCare

21/07/18 1
 Course Outcomes
•  Course Outcomes (COs) are clear statements of what
a student should be able to demonstrate upon
comple3on of a course.
•  They should be assessable and measurable
knowledge, skills, abiliGes or aHtudes that students
aIain by the end of the course.
•  It is generally a good idea to idenGfy between four
and six.
•  Synonyms: Course Learning Outcome (CLO) or LO

21/07/18 2
 CLO - Example 1
By the end of the course, student will be able to:
AcGon Word

Design, implement, and test an efficient algorithmic
solu3on for a given computa3onal problem.

21/07/18 3
 CLO - Example 1
By the end of the course, student will be able to:


Design, implement, and test an efficient algorithmic
solu3on for a given computa3onal problem.
.

Learning

21/07/18 4
 Course ObjecGve Vs. Outcome
Course Objec,ves Course Outcomes
Describe what a teacher needs to teach, Describe what students should
and what needs to be planned to teach. demonstrate upon the compleGon of a
course.

Course Objec,ves Course Outcomes

Example: Example:
To prepare students on the concept of At the end of the course, students will be
modulaGon and demodulaGon in able to choose a suitable modulaGon and
communicaGon system. demodulaGon technique for a given
specificaGon.

21/07/18 5
 Old Vs Revised Bloom’s Taxonomy

21/07/18 6
 CogniGve Dimensions

21/07/18 7
 6 Levels
Level Descrip,on Type
Knowledge repeaGng memorized informaGon novice
Comprehension paraphrasing text, explaining concepts in jargon-
free terms
Applica,on applying course material to solve straigh^orward Competent
problems
Analysis solving complex problems, developing process
models and simulaGons, troubleshooGng
equipment and system problems
Synthesis designing experiments, devices, processes, and Proficient
products
Evalua,on choosing from among alternaGves and jusGfying the
choice, opGmizing processes, making judgments
about the environmental impact of engineering
decisions, resolving ethical dilemmas

21/07/18 8
9
 Checklist for COs
–  Are they wriIen using acGon verbs (Blooms
Taxonomy) to specify definite, observable behaviors?
–  Does it has domain learning?
–  Is it covering enGre course syllabus as minimum
requirement?
–  Is it easy to memorize and explainable?
–  Is the count of Course outcomes between 4 & 6?
–  Is Unique numbering used for each CO?
–  Is it S.M.A.R.T? (Specific, Measurable, AIainable, RealisGc, Timely)
“Yes” should be the answer for all above quesGons
21/07/18 10
 CLOs - Few samples

21/07/18 11
 Heat Transfer course
Syllabus
UNIT-I
Introduc,on: Nature of heat flow, conducGon, convecGon, natural and forced convecGon, radiaGon.
Heat transfer by conduc,on in Solids: Fourier’s law, thermal conducGvity, steady state conducGon
in plane wall & composite walls, compound resistances in series, heat flow through a cylinder,
conducGon in spheres.

Possible Course Outcomes

HT.1 Students are able to explain conducGon heat loss for three geometries
HT.1 Students are able to calculate heat loss for plane, cylindrical and spherical geometry
HT.1 Students are able to calculate insulaGon thickness for three geometries
HT.1 Students are able to idenGfy appropriate insulaGon material & thickness for three geometries
HT.1 Students are able to apply Fourier’s law and predict conducGon profiles wall, cylinder & Sphere

21/07/18 12
 Course Title: Digital Logic Circuit Design
DLCD.CO1 Apply knowledge of number systems, codes and
Boolean algebra to the analysis and design digital logic circuits.

DLCD.CO2 IdenGfy, formulate and solve engineering problems in
the area of digital logic circuit design.

DLCD.CO3 Use the techniques, skills and modern engineering tools
such as logic works and VHDL, necessary for engineering pracGse.

DLCD.CO4 To design a digital system, components or process to
meet desired needs within realisGc constraints.
21/07/18 13

Course Title: Design and Analysis of Algorithms
At the end of the course the student will be able to:
C201.1. Use mathema3cal induc3on to prove asympto3c bounds for 3me
complexity.
C201.2. Use asympto3c nota3on to formulate the 3me and space requirements of
algorithms.
C201.3. Prove the 3ght asympto3c lower bound for the running 3me of any
comparison based sor3ng algorithm.
C201.4. Use the Master Theorem to analyze the asympto3c 3me complexity of
divide and conquer algorithms.
C201.5. Use the theory of NP-completeness to determine whether a
computa3onal problem can be solved efficiently.
C201.6. Design, implement, and test an efficient algorithmic solu3on for a given
computa3onal problem.

21/07/18 14

Course Title: Digital Communica:on Systems (C321)
At the end of the course the student will be able to:
C321.1. Determine the minimum number of bits per symbol required to represent
the source and the maximum rate at which reliable communica3on can take place
over the channel.
C321.2. Describe and determine the performance of different waveform coding
techniques for the genera3on of a digital representa3on of the signal.
C321.3. Describe and determine the performance of different error control coding.
schemes for the reliable transmission of digital informa3on over the channel.
C321.4. Describe a mathema3cal model of digital communica3on system, to
provide a frame work for the bit error rate (BER) analysis.
C321.5. Determine the BER performance of different digital communica3on
systems
C321.6. Design digital communica3on systems as per given specifica3ons

21/07/18 15