emester iii, course hand-out - rajagiritech.ac.in · r1 computer architecture a quantitative...
TRANSCRIPT
Semester III, Course Hand-Out
Department of CSE, RSET 2
RAJAGIRI SCHOOL OF ENGINEERING AND
TECHNOLOGY (RSET)
VISION
TO EVOLVE INTO A PREMIER TECHNOLOGICAL AND RESEARCH INSTITUTION,
MOULDING EMINENT PROFESSIONALS WITH CREATIVE MINDS, INNOVATIVE
IDEAS AND SOUND PRACTICAL SKILL, AND TO SHAPE A FUTURE WHERE
TECHNOLOGY WORKS FOR THE ENRICHMENT OF MANKIND
MISSION
TO IMPART STATE-OF-THE-ART KNOWLEDGE TO INDIVIDUALS IN VARIOUS
TECHNOLOGICAL DISCIPLINES AND TO INCULCATE IN THEM A HIGH DEGREE
OF SOCIAL CONSCIOUSNESS AND HUMAN VALUES, THEREBY ENABLING
THEM TO FACE THE CHALLENGES OF LIFE WITH COURAGE AND CONVICTION
Semester III, Course Hand-Out
Department of CSE, RSET 3
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING (CSE), RSET
VISION
TO BECOME A CENTRE OF EXCELLENCE IN COMPUTER SCIENCE &
ENGINEERING, MOULDING PROFESSIONALS CATERING TO THE RESEARCH
AND PROFESSIONAL NEEDS OF NATIONAL AND INTERNATIONAL
ORGANIZATIONS.
MISSION
TO INSPIRE AND NURTURE STUDENTS, WITH UP-TO-DATE KNOWLEDGE IN
COMPUTER SCIENCE & ENGINEERING, ETHICS, TEAM SPIRIT, LEADERSHIP
ABILITIES, INNOVATION AND CREATIVITY TO COME OUT WITH SOLUTIONS
MEETING THE SOCIETAL NEEDS.
Semester III, Course Hand-Out
Department of CSE, RSET 4
B.TECH PROGRAMME
PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Graduates shall have up-to-date knowledge in Computer Science & Engineering along
with interdisciplinary and broad knowledge on mathematics, science, management
and allied engineering to become computer professionals, scientists and researchers.
2. Graduates shall excel in analysing, designing and solving engineering problems and
have life-long learning skills, to develop computer applications and systems, resulting
in the betterment of the society.
3. Graduates shall nurture team spirit, ethics, social values, skills on communication and
leadership, enabling them to become leaders, entrepreneurs and social reformers.
PROGRAMME OUTCOMES (POs)
Graduates will be able to achieve
a. An ability to apply mathematical foundations, algorithmic principles, and computer
science theory in the modelling and design of computer-based systems.
b. An ability to identify, analyse, formulate and solve technical problems by applying
principles of computing and mathematics relevant to the problem.
c. An ability to define the computing requirements for a technical problem and to
design, implement and evaluate a computer-based system, process or program to
meet desired needs.
d. An ability to learn current techniques, skills and modern engineering tools necessary
for computing practice.
e. An ability to carry out experiments, analyse results and to make necessary
conclusions.
f. An ability to take up multidisciplinary projects and to carry out it as per industry
standards.
g. An ability to take up research problems and apply computer science principles to
solve them leading to publications.
h. An ability to understand and apply engineering solutions in a global and social
context.
i. An ability to understand and practice professional, ethical, legal, and social
responsibilities as a matured citizen.
j. An ability to communicate effectively, both written and oral, with a range of
audiences.
Semester III, Course Hand-Out
Department of CSE, RSET 5
k. An ability to engage in life-long learning and to engage in continuing professional
development.
l. An ability to cultivate team spirit and to develop leadership skills thereby moulding
future entrepreneurs.
INDEX
SCHEME: B.TECH 3RD SEMESTER 6
MA201 Linear Algebra & Complex Analysis 7
COURSE INFORMATION SHEET 7
CS201 Discrete Computational Structures 13
COURSE INFORMATION SHEET 13
COURSE PLAN 18
CS203 Switching Theory and Logic Design 21
COURSE INFORMATION SHEET 21
COURSE PLAN 26
CS205 Data Structures 28
COURSE INFORMATION SHEET 28
COURSE PLAN 34
CS207 Electronics Devices & Circuits 36
COURSE INFORMATION SHEET 36
HS200 Business Economics 42
COURSE INFORMATION SHEET 42
CS231 Data Structures Lab 50
COURSE INFORMATION SHEET 50
COURSE PLAN 58
CS233 Electronics Circuits Lab 59
COURSE INFORMATION SHEET 59
Semester III, Course Hand-Out
Department of CSE, RSET 6
SCHEME: B.TECH 3RD SEMESTER
(Computer Science & Engineering)
Kerala Technological University Revised Scheme for B.Tech Syllabus Revision 2015
Course Code Course Name L-T-P Credits Exam Slot
MA201 Linear Algebra & Complex Analysis
3-1-0 4 A
CS201 Discrete Computational Structures
3-1-0 4 B
CS203 Switching Theory and Logic Design
3-1-0 4 C
CS205 Data Structures 3-1-0 4 D
CS207 Electronics Devices & Circuits
3-0-0 3 E
HS210/HS200 Life Skills/Business Economics
2-0-2/3-0-0 3 F
CS231 Data Structures Lab
0-0-3 1 S
CS233 Electronics Circuits Lab
0-0-3 1 T
Total Credits = 24 Hours: 28/29
Cumulative Credits= 71
Semester III, Course Hand-Out
Department of CSE, RSET 7
MA201 Linear Algebra & Complex Analysis
COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH YEAR: JAN 2014 – JUNE 2014
COURSE: HIGH PERFORMANCE COMPUTING SEMESTER: VIII CREDITS: 4
COURSE CODE: CS010 801 COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H
COURSE AREA/DOMAIN: COMPUTER HARDWARE CONTACT HOURS: 3+2 (Tutorial) hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME:
SYLLABUS:
UNIT DETAILS HOURS
I
Introduction to parallel processing - Trends towards parallel processing - Parallelism in
uniprocessor - Parallel computer structures-Architecture classification schemes
,Amdahl’s
law,Indian contribution to parallel processing.
15
II Principles of pipelining and vector processing - Linear pipelining - Classification of
pipeline processors - General pipelines - Instruction and Arithmetic pipelines –Design
of Pipelined instruction unit-Principles of Designing Pipeline Processors- Instruction
prefetch and branch handling- Data Buffering and Busing Structure-Internal
forwarding and register tagging- Hazard detection and Resolution,Dynamic pipelines
and Reconfigurability
15
III Array processors - SIMD array processors - Interconnection networks - Static vs
dynamic
networks - mesh connected networks - Cube interconnection networks - Parallel
algorithms for array processors - SIMD matrix multiplication-Parallel sorting on array
processors - Associative array processing - Memory organization.
15
IV Multiprocessor architectures and Programming - Loosely coupled and Tightly coupled
multiprocessors - Interconnection networks - Language features to exploit parallelism
–Inter process communication mechanism-Process synchronisation mechanisms,
synchronization with semaphores.
15
V Dataflow computers - Data driven computing and Languages, Data flow computers
architectures - Static data flow computer , Dynamic data flow computer ,Data flow
design
alternatives.
15
TOTAL HOURS 60
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T Computer Architecture & Parallel Processing - Kai Hwang & FayeA.Briggs,Mc Graw Hill R1 Computer architecture A quantitative approach - John L Hennessy and David A.Patterson-
ELSEVIER, Fourth Edition R2 Elements of Parallel computing - V. Rajaraman - PHI
R3 Super Computers - V. Rajaraman - Wiely arstern
R4 Parallel Processing for Super Computers & AI Kai Hwange & Douglas Degneot Mc Graw Hill R5 Highly parallel computing - George S. Almasi,Allan Gottlieb. - Benjamin Cumings Publishers. R6 HIgh Performance Computer Architecture - Harold S. Stone, Addison Wesley. R7 Advanced Computing- Vijay P.Bhatkar, Asok V.Joshi, Arirban Basu, Asok K.Sharma.
Semester III, Course Hand-Out
Department of CSE, RSET 8
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
CS010
304
COMPUTER ORGANISATION ARCHITECTURE III
COURSE OBJECTIVES:
1 To design a powerful and cost-effective computer system
2 To provide the basic concepts of parallel processing on high performance computers.
COURSE OUTCOMES:
SNO DESCRIPTION PO
MAPPING
PROGRAMME: ENGINEERING DEGREE: BTECH
COURSE: LINEAR ALGEBRA&COMPLEX
ANALYSIS
SEMESTER: 3 CREDITS: 4
COURSE CODE: MA201
REGULATION:
COURSE TYPE: CORE /ELECTIVE / BREADTH/
S&H
COURSE AREA/DOMAIN: CONTACT HOURS: 3+1 (Tutorial) hours/Week.
CORRESPONDING LAB COURSE CODE : LAB COURSE NAME:
SYLLABUS:
UNIT DETAILS HOURS
I Complex Differentiation
Limit, continuity and derivative of complex functions
Analytic functions,Cauchy –Riemann equation,Laplaces equation,Harmonic functions
Harmonic conjugate
9
II Conformal Mapping
Geometry of Analytic functions,conformal mapping,Mapping w=z^2,conformality of w=e^z
The mapping w=z+1/z Properties of w=1/z
Circles and straight lines,extended complex plane,fixed points
Special linear fractional transformation,cross ratio, cross ratio property-mapping of disks and
half planes
Conformal mapping by w=sinz,w=cosz
10
III Complex Integration
Definition of Complex Line integrals,first evaluation method,second evaluation
method ,cauchys integral theorem,Independencce of path, cauchys integral theorem
for multy connected domains, cauchys integral formula-Derivatives of analytic
finctions,application of Derivatives of analytic finctions,Taylor and Maclaurin series
Power series as Taylor series,laurents series
10
IV
Residue theorem
Singlarities,Zeros,Poles,Essential
singularity,Zeros of an analytic
functions,Residue integration
method,formulas,several
singularities inside the contour
residue theorem,Evalution of
9
Semester III, Course Hand-Out
Department of CSE, RSET 9
real integral
V Linear system of equations
Linear system of equations,Coefficient matrix,Augmented matrix,Gauss Elimination
and back substitution,Elementary row operations,Row equivalent systems,Gauss
elimination –three possible cases,Row echelon form and information from it,Linear
independence –rank of a matrix,vector SpaceDimension-basis,Vector space
R^3,Solution of linear systems,Fundamental theorem of non homogeneous linear
systems, homogeneous linear systems
9
VI Matrix Eigen value Problem
Determination of Eigen values and Eigen vectors,Eigen space,Symmetric
,skewsymmetric and Orthogonal matrices-Simple properties,Basis of Eigen vectors,
Similar matrices,Diagonalisation of a matrix,Principal axis theorem Quadratic forms
9
TOTAL HOURS 52
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T Erin Kreyszig:Advanced Engineering Mathematics,10th edition.wiley
R Dennis g Zill&Patric D ShanahanA first course in complex analysis with applications-Jones &Bartlet
publishers
R B.S Grewal-Higher Engineering mathematics,Khanna publishers,New Delhi
R Lipschutz,Linear Algebra,3e(Schaums Series)McGraww Hill Education India2005
R Complex variables introduction and applications-second edition-Mark.J.Owitz-Cambridge publication
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
Higher secondary level mathematics To develop basic ideas on matrix operations,
calculus, complex numbers etc
COURSE OBJECTIVES:
1 To equip the students with methods of solving a general system of linear equations
2 To familarize them with the concept of Eigen value and Diagonalisation of a matrix which have many
application in engineering
3 To understand the basic theory of functionsof a complex variable and conformal transformations
COURSE OUTCOMES:
CO1 Students will understand about complex numbers and functions
CO2 Students will get an idea of Conformal mapping
CO3 Students will understand the integration of complex functions
CO4 Students will gain knowledge of various singularities and series expansions
CO5 Students will be able to find the rank of a matrix and solution of equations using matrix theory
CO6 Students will understand the matrix Eigen value problems
Semester III, Course Hand-Out
Department of CSE, RSET 10
PO MAPPING
CO mapping with PO, PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7
PO8
PO9 PO10
PO11
PO12
PSO1
PSO2
PSO3
CO1 3
CO2 3
CO3 3 1 3
CO4 3 3
CO5 3 3
CO6 3 1 3
EC010 804 L02
3 1.666667
3 #DIV/0!
#DIV/0!
#DIV/0!
######
Mapping to be done based on extent of correlation between specific CO and PO. Refer SAR Format, June 2015 for details.
* Average of the correlation values of each CO mapped to the particular PO/PSO, corrected to the nearest whole number
Justification for the correlation level assigned in each cell of the table above.
PO1 PO2 PO3 PO4
PO5
PO6 PO7
PO8
PO9
PO10
PO11
PO12
PSO1
PSO2
PSO3
CO1
Fundamental knowlegde in
complex analysis will help to analyze the Engineering
problems ver easily
CO2
Basic knowledge in Conformal mapping will help to model
various problems in engineering
fields
Complex analysis
may address various society related
problems
CO3
Complex integration will help to simplify problems with
high complexity in Engineering
Complex integratio
n will help to design
solutions to various complex engineeri
ng
Semester III, Course Hand-Out
Department of CSE, RSET 11
problems
CO4
Singularities and Series
expansions will help to enrich the analysis of
Engineering problems
Singulariti
es and Series
expansions will help to design
solutions to various complex engineeri
ng problems
CO5
Matrix theory will give a thorough
knowledge in the application
problems
Will able to
analyse various
methods of
solutions of
equations
CO6
Eigen value, Eigen vectors and related theories will
help to design several
engineering problems
The solutions
for various
engineering
problems requires Matrix theory
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
SLNO DESCRIPTION PROPOSED
ACTIONS
1 Basic concepts on complex analsis Reading,
Assignments
2 Application of complex analysis in solving various Engineering problems Reading
3 Importance of matrix application in different fields of our society Reading
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN
Semester III, Course Hand-Out
Department of CSE, RSET 12
Application of analytic functions in Engineering
Application of Complex integration in Engineering
Advanced matrix operations
Some applications of eigen values
WEB SOURCE REFERENCES:
1 http://www.math.com/
2 https: www.math.umn.edu/~olver/pdn.html
3 http://www. .mheducation.co.in
4 http://tutorial.math.lamar.edu/
5 http://nptel.ac.in/
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
☐ CHALK & TALK ☐ STUD.
ASSIGNMENT
☐ WEB RESOURCES
☐ LCD/SMART
BOARDS
☐ STUD. SEMINARS ☐ ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL
EXAMS
☐ UNIV.
EXAMINATION
☐ STUD. LAB
PRACTICES
☐ STUD. VIVA ☐ MINI/MAJOR
PROJECTS
☐ CERTIFICATIONS
☐ ADD-ON COURSES ☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
☐ ASSESSMENT OF COURSE OUTCOMES (BY
FEEDBACK, ONCE)
☐ STUDENT FEEDBACK ON FACULTY
(TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY
EXT. EXPERTS
☐ OTHERS
Prepared by Approved by
(Jaya Abraham) (HOD)
Semester III, Course Hand-Out
Department of CSE, RSET 13
CS201 Discrete Computational Structures
COURSE INFORMATION SHEET CS 201:DISCRETE COMPUTATIONAL STRUCTURES
PROGRAMME:COMPUTER SCIENCE AND
ENGINEERING
DEGREE: BTECH
COURSE: DISCRETE COMPUTATIONAL
STRUCTURES
SEMESTER: III CREDITS: 4
COURSE CODE: CS 201
REGULATION: 2015
COURSE TYPE: CORE
COURSE AREA/DOMAIN: Logic Development CONTACT HOURS: 3+1(Tutorial) hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME:
SYLLABUS:
UNIT DETAILS HOURS
I Review of elementary set theory : Algebra of sets – Ordered pairs and Cartesian products – Countable and Uncountable sets Relations :- Relations on sets –Types of relations and their properties – Relational matrix and the graph of a relation – Partitions – Equivalence relations - Partial ordering- Posets – Hasse diagrams - Meet and Join – Infimum and Supremum Functions :- Injective, Surjective and Bijective functions - Inverse of a function- Composition
10
II Review of Permutations and combinations, Principle of inclusion exclusion, Pigeon Hole Principle, Recurrence Relations: Introduction- Linear recurrence relations with constant coefficients– Homogeneous solutions – Particular solutions – Total solutions Algebraic systems:- Semigroups and monoids - Homomorphism, Subsemigroups and submonoids
9
III Algebraic systems (contd…):- Groups, definition and elementary properties, subgroups, Homomorphism and Isomorphism, Generators - Cyclic Groups, Cosets and Lagrange’s Theorem Algebraic systems with two binary operations- rings, fields-sub rings, ring homomorphism
8
IV Lattices and Boolean algebra :- Lattices –Sublattices – Complete lattices – Bounded Lattices - Complemented Lattices – Distributive Lattices – Lattice Homomorphisms. Boolean algebra – sub algebra, direct product and homomorphisms
10
V Propositional Logic:- Propositions – Logical connectives – Truth tables Tautologies and contradictions – Contra positive – Logical equivalences and implications Rules of inference: Validity of arguments.
8
Semester III, Course Hand-Out
Department of CSE, RSET 14
VI Predicate Logic:- Predicates – Variables – Free and bound variables – Universal and Existential Quantifiers – Universe of discourse. Logical equivalences and implications for quantified statements – Theory of inference : Validity of arguments. Proof techniques: Mathematical induction and its variants – Proof by Contradiction – Proof by Counter Example – Proof by Contra positive.
9
TOTAL HOURS 54
TEXT/REFERENCE BOOKS:
Text Books 1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw–Hill Pub.Co.Ltd, New Delhi, 2003. 2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”, 4/e, Pearson Education Asia, Delhi, 2002.
References: 1. Liu C. L., “Elements of Discrete Mathematics”, 2/e, McGraw–Hill Int. editions, 1988. 2. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”, Pearson Education Pvt Ltd., New Delhi, 2003 3. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, 5/e, Tata McGraw – Hill Pub. Co. Ltd., New Delhi, 2003. 4. Richard Johnsonbaugh, “Discrete Mathematics”, 5/e, Pearson Education Asia, New Delhi, 2002. 5. Joe L Mott, Abraham Kandel, Theodore P Baker, “Discrete Mathematics for Computer Scientists and Mathematicians”, 2/e, Prentice-Hall India, 2009.
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
Maths they studied at school level
COURSE OBJECTIVES:
1 To introduce mathematical notations and concepts in discrete mathematics that is essential for computing
2 To train on mathematical reasoning and proof strategies.
3 To cultivate analytical thinking and creative problem solving skills
COURSE OUTCOMES:
Semester III, Course Hand-Out
Department of CSE, RSET 15
SiNO DESCRIPTION Blooms’
Taxonomy
Level
C201.1 Students will be able to identify and apply operations on discrete structures such as sets, relations and functions in different areas of computing
Apply
(level 3 )
C201.2 Students will be able to verify the validity of an argument using propositional and predicate logic.
Validate
(level 4)
C201.3 Students will be able to construct proofs using direct proof, proof by contraposition, proof by contradiction and proof by cases, and by mathematical induction.
Construct
(level 5)
C201.4 Students will be able to solve problems using algebraic structures.
Solve/Apply
(level 3 )
C201.5 Students will be able to solve problems using counting techniques and combinatorics.
Solve/Apply
(level 3 )
C201.6 Students will be able to apply recurrence relations to solve problems in different domains.
Apply
(level 3 )
CO-PO AND CO-PSO MAPPING
P
O
1
PO
2
PO
3
PO
4
PO
5
PO
6
PO
7
PO
8
PO
9
PO1
0
PO1
1
PO1
2
PSO
1
PSO
2
PSO
3
C201.1 3 2 1 - _ _ _ _ _ _ _ _ 3 _ _
C201.2 3 3 1 - _ _ _ _ _ _ _ _ 3 _ _
C201.3 3 3 - _ _ _ _ _ _ _ _ - _ _
C201.4 3 2 - _ _ _ _ _ _ _ _ _ 3 _ _
C201.5 3 2 2 _ _ _ _ _ _ _ _ - _ _
C201.6 3 2 2 - _ _ _ _ _ _ 3 _ _
C201
overall
3 3
JUSTIFICATIONS FOR THE MAPPING
Mapping LOW/MEDIUM/HIGH Justification
CS201.1-PO1 H The concepts of discrete structures can be used to solve various
complex engineering problems
CS201.1-PO2 M The knowledge about the discrete computational structures will
help them to reach conclusions about the complexity and
methodologies for solving real life problems
CS201.1-PO3 L Discrete structures can aid in the representation of various real life
Semester III, Course Hand-Out
Department of CSE, RSET 16
problems
CS201.2-PO1 H The validity of facts can be verified using predicate and
propositional logic
CS201.2-PO2 H The real life events can be represented and verified using
Mathematical logic
CS201.2-PO3 L Reasoning is made possible for engineering problems
CS201.3 -PO1 H The reasoning and inferences made by them can be substantiated
by the various proof techniques
CS201.3-PO2 H The proof techniques can be used to verify the complex
engineering solutions
CS201.4-PO1 H Algebraic structures can be used to visualize the complex
engineering problems involving sets of data
CS201.4-PO2 M The similarity and characteristics of data can be analyzed using
algebraic principles
CS201.5-PO1 H The arrangement and combinations of data to be taken for
different problems can be identified
CS201.5-PO2 M Counting techniques can be used to reach conclusions in the
problems involving huge data
CS201.6-PO1 H It can be used to compare and contrast the complexity of
algorithms that were developed
CS201.6-PO2 M It helps to analyze the complexity and choose the best method for
the particular problem
CS201.6-PO3 M All algorithms can be compared using a single measure to identify
the amount of computations involved in them so that the optimal
one can be identified
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
Si
NO
DESCRIPTION PROPOSED
ACTIONS
RELEVANCE
WITH POs
RELEVANCE
WITH PSOs
1 Graph Theory and its applications Seminar 1 1
2 Applications of lattice, mathematical logic etc in the
field of computer Science and Information Technology
Guest Lecture 1,2,3 1,2
3 Plotting graph for a function Class
lecturing
along with the
topic of
function
1
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
Si
NO
DESCRIPTION PROPOSED
ACTIONS
RELEVANCE WITH
POs
RELEVANCE WITH
PSOs
1 Different types of numbers and
their properties
Class Assignment 1,3 3
Semester III, Course Hand-Out
Department of CSE, RSET 17
WEB SOURCE REFERENCES:
1 http://web.stanford.edu/class/cs103x/cs103x-notes.pdf
2 https://www.tutorialspoint.com/discrete_mathematics/discrete_mathematics_recurrence_relation.htm
3 http://nms.lu.lv/wp-content/uploads/2016/04/21-linear-recurrences.pdf
4 http://wwwhome.cs.utwente.nl/~infrieks/MHMI/2005.jk.pdf
5 http://nicolas.thiery.name/macs358/Notes/AlgebraicStructures.pdf
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
CHALK & TALK STUD.
ASSIGNMENT
WEB
RESOURCES
LCD/SMART
BOARDS
STUD.
SEMINARS
☐ ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS STUD.
SEMINARS
TESTS/MODEL
EXAMS
UNIV.
EXAMINATION
STUD. LAB
PRACTICES
STUD. VIVA ☐ MINI/MAJOR
PROJECTS
☐ CERTIFICATIONS
☐ ADD-ON
COURSES
☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY
FEEDBACK, ONCE)
STUDENT FEEDBACK ON FACULTY
(TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY
EXT. EXPERTS
☐ OTHERS
Prepared by Approved by
Meenu Mathew Shimmi Asokan
HOD, CSE
Semester III, Course Hand-Out
Department of CSE, RSET 18
COURSE PLAN
SL
NO TOPICS MODULE
DAY 1 problem spaces and search MODULE 1
DAY 2 production systems MODULE 1
DAY 3 Problem characteristics MODULE 1
DAY 4 Searching Strategies MODULE 1
DAY 5 Generate and Test MODULE 1
DAY 6 Heuristic Search Techniques MODULE 1
DAY 7 Hill climbing MODULE 1
DAY 8 issues in hill climbing MODULE 1
DAY 9 Introduction to Python- Lists Dictionaries & Tuples in Python MODULE 1
DAY
10 Python implementation of Hill Climbing MODULE 1
DAY
11 Best First Search MODULE 2
DAY
12 Implementation in Python OR Graphs MODULE 2
DAY
13 The A * Algorithm MODULE 2
DAY
14 Problem Reduction MODULE 2
DAY
15 AND-OR Graphs, The AO* algorithm MODULE 2
DAY
16 Constraint Satisfaction MODULE 2
DAY
17 Games as search problem MODULE 2
DAY
18 MINIMAX search procedure MODULE 2
DAY
19 Alpha–Beta pruning MODULE 2
DAY
20 Using Predicate logic MODULE 3
DAY
21 representing facts in logic MODULE 3
DAY
22 functions and predicates MODULE 3
DAY
23 Conversion to clause form MODULE 3
DAY Resolution in propositional logic MODULE 3
Semester III, Course Hand-Out
Department of CSE, RSET 19
24
DAY
25 Resolution in predicate logic MODULE 3
DAY
26 Unification, Question Answering MODULE 3
DAY
27 forward and backward chaining MODULE 3
DAY
28 Rote Learning MODULE 4
DAY
29 Learning by Advice MODULE 4
DAY
30 Learning in Problem Solving MODULE 4
DAY
31 By Parameter Adjustment with Macro Operators, Chunking, MODULE 4
DAY
32 Learning from Examples MODULE 4
DAY
33 Winston’s Learning Program, Version Spaces MODULE 4
DAY
34 Positive & Negative Examples MODULE 4
DAY
35 Candidate Elimination MODULE 4
DAY
36 Decision Trees MODULE 4
DAY
37 ID3 Decision Tree Induction Algorithm MODULE 4
DAY
38 Concept of a Fuzzy number MODULE 5
DAY
39 Operations on Fuzzy Sets MODULE 5
DAY
40 Typical Membership Functions MODULE 5
DAY
41 Discrete Fuzzy Sets MODULE 5
DAY
42 Representing and using Domain Knowledge MODULE 5
DAY
43 Reasoning with knowledge MODULE 5
DAY
44 Expert System Shells MODULE 5
DAY
45 Support for explanation- examples MODULE 5
DAY Knowledge acquisition-examples MODULE 5
Semester III, Course Hand-Out
Department of CSE, RSET 21
CS203 Switching Theory and Logic Design
COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH (JULY- DECEMBER 2016)
COURSE: SWITCHING THEORY & LOGIC DESIGN SEMESTER: III CREDITS: 4
COURSE CODE: CS203
REGULATION: 2016
COURSE TYPE: CORE
COURSE AREA/DOMAIN: COMPUTER HARDWARE CONTACT HOURS: 3+1 (Tutorial) hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME:
SYLLABUS:
MODULE DETAILS HOURS
I Number systems – Decimal, Binary, Octal and Hexadecimal – conversion from one
system to another –representation of negative numbers – representation of BCD
numbers – character representation – character coding schemes – ASCII – EBCDIC etc.
Addition, subtraction, multiplication and division of binary numbers (no algorithms).
Addition and subtraction of BCD, Octal and Hexadecimal numbers. Representation of
floating point numbers – precision – addition, subtraction, multiplication and division
of floating point numbers.
10
II Introduction — Postulates of Boolean algebra – Canonical and Standard Forms — logic
functions and gates methods of minimization of logic functions — Karnaugh map
method and Quin McClusky method Product-of-Sums Simplification — Don’t-Care
Conditions.
9
III Combinational Logic: combinational Circuits and design Procedure — binary adder and
subtractor — multi—level NAND and NOR circuits — Exclusive-OR and Equivalence
Functions. Implementation of combination logic: parallel adder, carry look ahead
adder, BCD adder, code converter, magnitude comparator, decoder, multiplexer,
demultiplexer, parity generator.
10
IV Sequential logic circuits: latches and flip-flops – edge triggering and level-triggering —
RS, JK, D and T flipflops — race condition — master-slave flip-flop. Clocked sequential
circuits: state diagram — state reduction and assignment — design with state
equations.
8
V Registers: registers with parallel load - shift registers universal shift registers –
application: serial adder. Counters: asynchronous counters — binary and BCD ripple
counters — timing sequences — synchronous counters — up-down counter, BCD
counter, Johnson counter — timing sequences and state diagrams.
8
VI Memory and Programmable Logic: Random-Access Memory (RAM)—Memory
Decoding—Error Detection and Correction — Read only Memory (ROM),
Programmable Logic Array (PLA). HDL: fundamentals, combinational logic, adder,
multiplexer. Arithmetic algorithms: Algorithms for addition and subtraction of binary
and BCD numbers, algorithms for floating point addition and subtraction.
8
Semester III, Course Hand-Out
Department of CSE, RSET 22
TOTAL HOURS 52
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T Mano M. M., Digital Logic & Computer Design, 4/e, Pearson Education, 2013. [Chapters: 1, 2, 3, 4, 5, 6, 7].
T Floyd T. L., Digital Fundamentals, 10/e, Pearson Education, 2009. [Chapters: 5, 6].
T M. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2007. [Chapter 10.1, 10.2, 10.5, 10.6, 10.7].
T Harris D. M. and, S. L. Harris, Digital Design and Computer Architecture, 2/e, Morgan Kaufmann Publishers, 2013 [Chapter 4.1, 4.2]
R Tokheim R. L., Digital Electronics Principles and Applications, 7/e, Tata McGraw Hill, 2007.
R
Mano M. M. and M. D Ciletti, Digital Design, 4/e, Pearson Education, 2008.
R Rajaraman V. and T. Radhakrishnan, An Introduction to Digital Computer Design, 5/e, Prentice Hall India Private Limited, 2012.
R Leach D, Malvino A P, Saha G, Digital Principles and Applications, 8/e, McGraw Hill Education, 2015.
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
COURSE OBJECTIVES:
1 To impart an understanding of the basic concepts of Boolean algebra and digital systems.
2 To impart familiarity with the design and implementation of different types of practically used sequential circuits.
3 To provide an introduction to use Hardware Description Language.
COURSE OUTCOMES:
Sl No DESCRIPTION
Blooms’
Taxonomy
Level
C203.1 Apply the basic concepts of Boolean algebra for the simplification and implementation of logic functions using suitable gates namely NAND, NOR etc.
Understand
(Level 2)
C203.2 Design simple Combinational Circuits such as Adders, Subtractors, Code Convertors, Decoders, Multiplexers, and Magnitude Comparators etc.
Apply
(Level 3)
Semester III, Course Hand-Out
Department of CSE, RSET 23
C203.3 Analyze and Design simple and commonly used Sequential Circuits viz. different types of Counters, Shift Registers, Serial Adders and Sequence Generators.
Apply
(Level 3)
C203.4 Use Hardware Description Language for describing simple logic circuits.
Apply
(Level 3)
C203.5 Explain and illustrate algorithms for addition/subtraction operations on Binary, BCD and Floating Point Numbers.
Analyze
(Level 4)
CO-PO AND CO-PSO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
C203.1 3 2 1 _ _ _ _ _ _ _ _ _ 1 _ _
C203.2 _ 2 3 2 _ _ _ _ _ _ _ _ 1 _ _
C203.3 _ 2 3 2 _ _ _ _ _ _ _ _ _ _ 2
C203.4 _ 1 1 1 _ _ _ _ _ _ _ _ _ 1 _
C203.5 1 _ 1 _ _ _ _ _ _ _ _ _ 2 _ _
C203 2 2 3 2 _ _ _ _ _ _ _ _ 2 1 2
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
SLNO DESCRIPTION PROPOSED
ACTIONS
1 Applications of multiplexer and demultiplexer Assignments
2 Applications of decoder and encoder Assignments
3 Advances in digital IC’s. Seminars
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/
GUEST LECTURER/NPTEL ETC
JUSTIFICATIONS FOR CO-PO MAPPING
MAPPING LOW/MEDIUM/HIGH JUSTIFICATION
C203.1-PO1 H Knowledge of Boolean algebra helps the students in circuit designing.
C203.1-PO2 M Analysis of logic circuits provides students a better understanding of
digital circuits.
C203.1-PO3 L Help the students in design of simple digital circuits using gates.
C203.1-PSO1 L Acquire skills to easily simplify Boolean functions.
C203.2-PO2 M Analysis of the combinational circuits to provide simple conclusions.
C203.2-PO3 H Designing of complex combinational circuits is achieved.
C203.2-PO4 M Ability to choose a simplified circuit for implementing a combinational
circuit using an appropriate simplification method.
C203.2-PSO1 L Knowledge of Boolean algebra help in design of efficient circuits.
Semester III, Course Hand-Out
Department of CSE, RSET 24
C203.3-PO2 M Having knowledge in Boolean function, students could develop
sequential circuits.
C203.3-PO3 H Knowledge of Flip flops could be used to reduce the complexity of the
sequential circuits.
C203.3-PO4 M Having the knowledge in various sequential circuit design principles
students could analyze the problem and come to a conclusion on which
design principle to be used.
C203.3-PSO3 M Choosing the appropriate method to implement the sequential circuit
will help in designing efficient circuits.
C203.4-PO2 L Knowledge of hardware description language to understand the
concept of simple circuits.
C203.4-PO3 L Having knowledge of hardware description language helps students to
design logic circuits.
C203.4-PO4 L Having knowledge of hardware description language students to
analyze complex circuits.
C203.4-PSO2 L Students will be able to implement and test the circuits.
C203.5-PO1 L Knowledge in Engineering fundamentals to help the students to do
mathematical calculations using various algorithms.
C203.5-PO3 L Apply the algorithms on various number systems.
C203.5-PSO1 M Developing new algorithms for various numbers system
manipulations.
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
1 Realization of combinational and sequential logic circuits.
2 Design of small logical circuits beyond the scope of assignment.
3 Programmable logic design.
WEB SOURCE REFERENCES:
1 http://nptel.iitm.ac.in/video.php?subjectId=117106086
2 http://www.asic-world.com/digital/tutorial.html
3 http://www.technologystudent.com/elec1/dig1.htm
4 http://cusatbtechguru.blogspot.in/2012/06/eecs-303-digital-electronics-lecture.html
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
CHALK & TALK STUD. ASSIGNMENT WEB RESOURCES LCD/SMART BOARDS
STUD. SEMINARS ☐ ADD-ON COURSES
Semester III, Course Hand-Out
Department of CSE, RSET 25
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS STUD. SEMINARS TESTS/MODEL
EXAMS
UNIV. EXAMINATION
☐ STUD. LAB
PRACTICES
☐ STUD. VIVA ☐ MINI/MAJOR
PROJECTS
☐ CERTIFICATIONS
☐ ADD-ON COURSES ☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY
FEEDBACK, ONCE)
STUDENT FEEDBACK ON FACULTY (TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT.
EXPERTS
☐ OTHERS
Prepared by Approved by
Ms. Sminu Izudheen/Ms. Jisha Mary Jose Ms. Shimmi Asokan
(Faculty) (HOD)
Semester III, Course Hand-Out
Department of CSE, RSET 26
COURSE PLAN
Sl.No Module Planned
1 1 Introduction to Switching Theory and Logic Design
2 1 Number systems-decimal, binary, octal, hexadecimal
3 1 Conversion from one system to another, representation of negative numbers
4 1 Representation of BCD numbers
5 1 Character representations-character coding schemes
6 1 Operations on binary numbers-addition, subtraction, multiplication, division
7 1 Addition and subtraction of BCD numbers
8 1 Addition and subtraction of octal, hexadecimal numbers
9 1 Representation of floating point numbers-precision
10 1 Tutorial on module 1, Operations on floating point numbers
11 2 Introduction to Boolean Algebra
12 2 Postulates and axioms of Boolean algebra
13 2 Canonical and standard forms
14 2 Tutorial on module 2, Logic functions and gates
15 2 Methods of minimisation of logic functions
16 2 Karnaugh map method
17 2 Quine McClusky method
18 2 Product of sums simplification
19 2 Don't care conditions
20 2 Tutorial on module 2
21 3 Combinational circuits and design procedure
22 3 Binary adder and subtractor
23 3 Multi level, NAND and NOR circuits
24 3 Exclusive OR and Equivalence functions
25 3 Implementation of combination logic: parallel adders
26 3 Carry look ahead adder
27 3 BCD adder
28 3 Code converters
29 3 Magnitude comparator
30 3 Decoders, Multiplexers
31 3 Demultiplexer, parity generator
32 4 Sequential logic circuits: latches and flipflops
33 4 Edge triggered and level triggered flipflops and latches
Semester III, Course Hand-Out
Department of CSE, RSET 27
34 4 RS, JK, D, T flipflops
35 4 Race condition and master slave flipflops
36 4 Clocked sequential circuits
37 4 State diagrams
38 4 State reduction and assignment
39 4 Design with state equations
40 4 Tutorial on module 4
41 5 Counters
42 5 Asynchronous counters-binary and BCD ripple counters
43 5 Timing sequences
44 5 Synchronous counters
45 5 Up-down counters
46 5 BCD counters
47 5 Johnson counter
48 5 Timing sequences and state diagrams
49 5 Timing sequences and state diagrams
50 5 Tutorial on module 5
51 6 Memory and programmable logic
52 6 Random access memory (RAM)
53 6 Memory decoding
54 6 Error detection and correction
55 6 Read only memory (ROM)
56 6 Programmable Logic Array (PLA)
57 6 HDL: fundamentals
58 6 HDL: combinational logic, adder, multiplexer
59 6 Arithmetic algorithms: algorithms for addition, subtraction of binary numbers
60 6 Arithmetic algorithms: algorithms for addition, subtraction of BCD numbers
61 6 Algorithm for addition, subtraction of floating point numbers
62 6 Tutorial on module 6
63 6 Model question paper discussions
Semester III, Course Hand-Out
Department of CSE, RSET 28
CS205 Data Structures
COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE AND
ENGINEERING
DEGREE: BTECH
COURSE: DATA STRUCTURES
SEMESTER: III CREDITS: 4
COURSE CODE: CS205
REGULATION: 2016
COURSE TYPE: CORE
COURSE AREA/DOMAIN: PROGRAMMING CONTACT HOURS: 3+1(Tutorial) hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY):CS
231
LAB COURSE NAME: DATA STRUCTURES LAB
SYLLABUS:
UNIT DETAILS HOURS
I Introduction to programming methodologies – structured approach, stepwise
refinement techniques, programming style, documentation – analysis of
algorithms: frequency count, definition of Big O notation, asymptotic analysis of
simple algorithms. Recursive and iterative algorithms
9
II Abstract and Concrete Data Structures- Basic data structures – vectors and arrays.
Applications, Linked lists:- singly linked list, doubly linked list, Circular linked
list, operations on linked list, linked list with header nodes, applications of linked
list: polynomials,.
9
III Applications of linked list (continued): Memory management, memory allocation
and de-allocation. First-fit, best-fit and worst-fit allocation schemes
Implementation of Stacks and Queues using arrays and linked list, DEQUEUE (double ended
queue). Multiple Stacks and Queues, Applications.
9
IV String: - representation of strings, concatenation, substring searching and deletion.
Trees: - m-ary Tree, Binary Trees – level and height of the tree, complete-binary
tree representation using array, tree traversals (Recursive and non-recursive),
applications. Binary search tree – creation, insertion and deletion and search
operations, applications.
10
V Graphs – representation of graphs, BFS and DFS (analysis not required)
applications.
Sorting techniques – Bubble sort, Selection Sort, Insertion sort, Merge sort, Quick
sort, Heaps and Heap sort. Searching algorithms (Performance comparison
expected. Detailed analysis not required)
9
VI Linear and Binary search. (Performance comparison expected. Detailed analysis
not required)Hash Tables – Hashing functions – Mid square, division, folding,
10
Semester III, Course Hand-Out
Department of CSE, RSET 29
digit analysis, collusion resolution and Overflow handling techniques TOTAL HOURS 56
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T/R
T/R
R
R
R
R
R
R
R
R
Samanta D., Classic Data Structures, Prentice Hall India, 2/e, 2009.
Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with
C, 2/e, Cengage Learning, 2005.
Horwitz E., S. Sahni and S. Anderson, Fundamentals of Data Structures in C, University
Press (India), 2008.
Aho A. V., J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson
Publication,1983.
Tremblay J. P. and P. G. Sorenson, Introduction to Data Structures with Applications, Tata
McGraw Hill, 1995.
Peter Brass, Advanced Data Structures, Cambridge University Press, 2008
Lipschuts S., Theory and Problems of Data Structures, Schaum’s Series, 1986.
Wirth N., Algorithms + Data Structures = Programs, Prentice Hall, 2004.
Hugges J. K. and J. I. Michtm, A Structured Approach to Programming, PHI, 1987.
Martin Barrett, Clifford Wagner, And Unix: Tools For Software Design, John Wiley, 2008
reprint.
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
B101-05
Introduction to Computing and
Problem Solving
Fundamentals of C programming
language
Fundamentals of Python programming
Bridge Course
S1
Semester III, Course Hand-Out
Department of CSE, RSET 30
COURSE OBJECTIVES:
1 To impart a thorough understanding of linear data structures such as stacks, queues and their
applications.
2 To impart a thorough understanding of non-linear data structures such as trees, graphs and
their applications.
3 To impart familiarity with various sorting, searching and hashing techniques and their
performance comparison.
4 To impart a basic understanding of memory management.
COURSE OUTCOMES:
Students will be able to
C205.1 compare different programming methodologies and define asymptotic notations
to analyze performance of algorithms.
C205.2 use appropriate data structures like arrays, linked list, stacks and queues to
solve real world problems efficiently.
C205.3 represent and manipulate data using nonlinear data structures like trees and
graphs to design algorithms for various applications.
C205.4 illustrate and compare various techniques for searching and sorting.
C205.5 illustrate various hashing techniques.
CO-PO AND CO-PSO MAPPING
PO
1
PO
2
PO
3
PO
4
PO
5
PO
6
PO
7
PO
8
PO
9
P0
10
PO
11
PO
12
PSO
1
PSO
2
PSO
3
C205.1 - - 2 2 - - - - - - - - 2 1 1
C205.2 1 - 3 - - - - - - - - - 3 - -
C205.3 2 - 3 2 - - - - - - - - 3 1 -
C205.4 1 - 2 3 - - - - - - - - 2 - 1
C205.5 1 - - - - - - - - - - - 1 - -
C205
CS
205(overa
ll level)
- 3 3 1 - - - - - - - - 2 - 2
Semester III, Course Hand-Out
Department of CSE, RSET 31
JUSTIFICATIONS FOR CO-PO MAPPING
Mapping LOW/MEDIUM/HIGH Justification
C205.1-PO3 M The knowledge in programming methodologies helps in designing
solutions for complex engineering problems.
C205.1-PO4 M The knowledge of asymptotic notations helps in analysis of
performance of solutions to complex problems
C205.1-PSO1 M The knowledge in programming methodologies and asymptotic
notations help in designing solutions and analyzing its complexity.
C205.1-PSO2 L This knowledge helps to design good and efficient algorithms.
C205.1-PSO3 L These concepts are fundamental to CS and can be used in research
and other innovative ideas.
C205.2-PO1 L The knowledge of arrays, linked lists, stacks and queues can be
applied to solve complex engineering problems.
C205.2-PO3 H The knowledge of arrays, linked lists, stacks and queues can be
applied to design solutions to complex engineering problems.
C205.2-PSO1 H The knowledge of arrays, linked lists, stacks and queues can be
applied to design solutions to complex engineering problems in
multidisciplinary areas. They belong to the core concepts of CS.
C205.3-PO1 M The knowledge of non linear data structures like trees and graphs
can be applied to solve complex engineering problems.
C205.3-PO3 H This knowledge can be used to design efficient solutions to
complex problems.
C205.3-PO4 M This knowledge helps in representation, analysis and
interpretation of data to provide valid conclusions.
C205.3-PSO1 H The knowledge of non linear data structures like trees and graphs
can be applied to design solutions to complex engineering
problems.
C205.3-PSO2 L This knowledge helps in designing efficient algorithms using
appropriate data structure.
C205.4-PO1 L This basic knowledge of sorting and searching can be used in
solutions to complex engineering problems.
C205.4-PO3 M This basic knowledge of sorting and searching can be used in
designing solutions to complex engineering problems.
C205.4-PO4 H This concept is fundamental in conducting investigations and
interpretations of data.
C205.4-PSO1 M This basic knowledge of sorting and searching can be used in
designing solutions to complex multidisciplinary engineering
problems.
C205.4-PSO3 L The concept of sorting and searching are fundamental to the CS
discipline and can be used research and other innovative ideas.
C205.5-PO1 L The knowledge of various hashing techniques can be applied in
designing solutions to complex engineering problems.
C205.5-PSO1 L The knowledge of various hashing techniques can be applied in
Semester III, Course Hand-Out
Department of CSE, RSET 32
designing solutions to complex multidisciplinary engineering
problems.
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSIONAL REQUIREMENTS:
SNO DESCRIPTION PROPOSED
ACTIONS
1 Circular Queue Learning
Material
provided.
2 Towers of Hanoi Problem(Example of recursion) Learning
Material
provided.
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST
LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
1 AVL Trees
WEB SOURCE REFERENCES:
1 http://nptel.ac.in/courses/106103069
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
CHALK & TALK STUD.
ASSIGNMENT
WEB
RESOURCES
LCD/SMART
BOARDS
STUD.
SEMINARS
☐ ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS ☐ STUD.
SEMINARS
TESTS/MODEL
EXAMS
UNIV.
EXAMINATION
STUD. LAB
PRACTICES
STUD. VIVA ☐ MINI/MAJOR
PROJECTS
☐ CERTIFICATIONS
☐ ADD-ON
COURSES
☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY
FEEDBACK, ONCE)
STUDENT FEEDBACK ON FACULTY
(TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY
EXT. EXPERTS
☐ OTHERS
Prepared by Approved by
Semester III, Course Hand-Out
Department of CSE, RSET 34
COURSE PLAN
Sl.No Module Planned
1 1 Introduction to Programming methodologies, Structured approach
2 1 Stepwise refinement techniques, Programming style and documentation
3 1 Analysis of algorithms-Space Complexity with examples
4 1 Time Complexity-Frequency Count with examples
5 1 Analysis of simple algorithms-Tutorial
6 1 Asymptotic Analysis -Introduction and Definition of Big-Oh notation
7 1 Asymptotic Analysis of simple algorithms
8 1 Recursive and Iterative algorithms
9 2 Abstract and Concrete Data Structures, Basic Data Structures- Introduction to Vectors and Arrays
10 2 Arrays-Insertion and Deletion
11 2 Application-Sparse Matrix Representation and transpose
12 2 Sparse Matrix Addition
13 2 Introduction to Linked Lists-Singly linked lists
14 2 Singly Linked List-Operations
15 2 Singly Linked List Operations-contd...
16 2 Circular linked list
17 2 Doubly Linked Lists
18 2 Doubly Linked List-Operations
19 2 Applications of Linked Lists-Polynomial Representation
20 2 Polynomial addition
21 2 Linked LIst with header nodes
22 2 Tutorial on Linked Lists
23 3 Introduction to stack and queue Stack using array
24 3 Queuue using array
25 3 Stack and Queue using Linked Lists
26 3 Infix to Postfix conversion
27 3 Postfix Expression Evaluation
28 3 Tutorial on Infix to Postfix conversion and evaluation
Semester III, Course Hand-Out
Department of CSE, RSET 35
29 3 Multiple stacks and Queues
30 3 Implementation of multiple stacks and queues.
31 3 Double Ended Queue using Linked Lists
32 3 Memory Management
33 3 Memory Management
34 4 Strings-Representation, concatenation, Search for substring
35 4 Substring search and deletion
36 4 Introduction to trees-Binary Tress, Terminology
37 4 Binary Tree representation using arrays
38 4 Binary tree operations using Linked list
39 4 Binary Tree Operations -contd..
40 4 Binary Search Tree-Introduction Search
41 4 BST Insertion
42 4 BST Deletion
43 4 Tree Traversals
44 4 Tree Traversal-contd..
45 4 Tutorial on Trees
46 5 Sorting-Bubble, Selection Sorts
47 5 Sorting-Insertion, Quick Sort Introduction
48 5 Recursive Quick Sort
49 5 Merge Sort-Introduction
50 5 Merge Sort-contd...
51 5 Introduction to heaps and heap Sort
52 5 Heap Sort contd..
53 5 Graphs-Terminology and Representation
54 5 Graph Traversals-DFS and BFS
55 5 Graph-Applications
56 5 Tutorial on Graphs
57 6 Linear Search and Binary search
58 6 Binary Search contd..
59 6 Hash Tables
Semester III, Course Hand-Out
Department of CSE, RSET 36
60 6 Hashing Functions-Mid Square, Division
61 6 Hashing functions contd..-Folding, Digit Analysis
62 6 Collision Resolution Techniques
63 6 Overflow Handling Techniques
64 6 Tutorial on Hashing
CS207 Electronics Devices & Circuits
COURSE INFORMATION SHEET
PROGRAMME: Computer Science &
Engineering.
DEGREE: BTECH
COURSE: ELECTRONIC DEVICES &
CIRCUITS
SEMESTER: S3 CREDITS: 3
COURSE CODE: CS207
REGULATION: 2016
COURSE TYPE: CORE /ELECTIVE /
BREADTH/ S&H
COURSE AREA/DOMAIN: ELECTRONICS CONTACT HOURS: 3+1 (Tutorial)
hours/Week.
CORRESPONDING LAB COURSE CODE
(IF ANY): CS233
LAB COURSE NAME:Electronic Circuits Lab
SYLLABUS:
UNIT DETAILS HOURS
I
Wave shaping circuits: Sinusoidal and non-sinusoidal wave shapes,
Principle and working of RC differentiating and integrating circuits,
Conversion of one non-sinusoidal wave shape into another. Clipping circuits -
Positive, negative and biased clipper. Clamping circuits - Positive, negative
and biased clamper. Voltage multipliers- Voltage doubler and tripler. Simple
sweep circuit using transistor as a switch.
5
II Regulated power supplies: Review of simple zener voltage regulator, Shunt
and series voltage regulator using transistors, Current limiting and fold back
protection, 3 pin regulators-78XX and 79XX, IC 723 and its use as low and
high voltage regulators, DC to DC conversion, Circuit/block diagram and
working of SMPS.
Field effect transistors: JFET – Structure, principle of operation and
7
Semester III, Course Hand-Out
Department of CSE, RSET 37
characteristics, Comparison with BJT. MOSFET- Structure, Enhancement
and Depletion types, principle of operation and characteristics.
III
Amplifiers: Introduction to transistor biasing, operating point, concept of
load line, thermal stability, fixed bias, self bias, voltage divider bias.
Classification of amplifiers, RC coupled amplifier - voltage gain and
frequency response. Multistage amplifiers - effect of cascading on gain and
bandwidth.
Feedback in amplifiers - Effect of negative feedback on amplifiers.
MOSFET Amplifier- Circuit diagram and working of common source
MOSFET amplifier.
7
IV Oscillators: Classification, criterion for oscillation, analysis of Wien bridge
oscillator, Hartley and Crystal oscillator.
Non-sinusoidal oscillators: Astable, monostable and bi-stable multivibrators
using transistors (Only design equations and working of circuit are required,
Analysis not required).
5
V Operational amplifiers: Differential amplifier, characteristics of op-
amps(gain, bandwidth, slew rate, CMRR, offset voltage, offset current),
comparison of ideal and practical opamp(IC741), applications of op-amps-
scale changer, sign changer, adder/summing amplifier, subtractor, integrator,
differentiator,
Schmitt trigger, Wien bridge oscillator.
8
VI. Integrated circuits: Active filters – Low pass and high pass (first and second
order) active filters using op-amp with gain (No analysis required).
D/A and A/D convertors – important specifications, Sample and hold circuit.
Binary weighted resistor and R-2R ladder type D/A convertors. (concepts
only).
Flash, dual slope and successive approximation type A/D convertors.
Circuit diagram and working of Timer IC555, astable and monostable
multivibrators using 555.
8
TOTAL HOURS 60 hrs.
TEXT/REFERENCE BOOKS:
Text Books:
1. David A Bell, Electronic Devices and Circuits, Oxford University Press, 2008
2. Salivahanan S. and V. S. K. Bhaaskaran, Linear Integrated Circuits, Tata McGraw Hill, 2008
References :
1. Neamen D., Electronic Circuits, Analysis and Design, 3/e, TMH, 2007
2. Robert Boylestad and L Nashelsky, Electronic Devices and Circuit Theory, Pearson.
Semester III, Course Hand-Out
Department of CSE, RSET 38
3. Bogart T. F., Electronic Devices Circuits, 6/e, Pearson, 2012.
4. Maini A. K. and V. Agrawal, Electronic Devices and Circuits, Wiley India, 2011.
5. K.Gopakumar, Design and Analysis of Electronic Circuits, Phasor Books, Kollam, 2013
6. Millman J. and C. Halkias, Integrated Electronics, 2/e, McGraw-Hill, 2010.
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
BE101 -
04
Introduction to Electronics
Engineering
Students should know about basic
electronics components like BJT,
diode, Resistor etc&its working of
diodes in circuits and in rectifiers.
1st
Year
COURSE OBJECTIVES:
SNO DESCRIPTION
1 To introduce to the students the fundamental concepts of electronic devices and
circuits for engineering applications.
2 To develop the skill of analysis and design of various analog circuits using
electronic devices
3 To provide comprehensive idea about working principle, operation and applications
of electronic circuits
4 To equip the students with a sound understanding of fundamental concepts of
operational amplifiers
5 To expose to the diversity of operations that operational amplifiers can perform in a
wide range of applications
6 To expose to a variety of electronic circuits/systems using various analog ICs
COURSE OUTCOMES:
1 To understand applications of diodes and transistors
2 To understand working of voltage regulators and FET
3 To provide insight into the working , analysis and design of basic analog circuits using
BJT and MOSFET
4 Ability to analyze different types of operational amplifiers
5 Understand different types of integrated circuits.
CO-PO-PSO MAPPING:
CO No. Programme Outcomes (POs)
Programme-specific Outcomes (PSOs)
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
Semester III, Course Hand-Out
Department of CSE, RSET 39
1 3 3 3 2 2 2 2 1 3 3 1
2 3 3 3 2 2 2 2 1 3 3 1
3 3 3 3 2 2 2 2 1 3 3 1
4 3 3 3 2 2 2 2 1 3 3 1
5 3 3 3 2 2 2 2 1 3 3 1
CS207 3 3 3 2 2 2 2 1 3 3 1
JUSTIFICATION FOR CO-PO-PSO CORRELATION:
PO1 PO2 PO3 PO4 PO5 PO6
PO9
PO10
PSO1 PSO2 PSO3
CO1
Working of RC
circuits/clipper & clamper circuits require
mathematical
background
Working of RC
circuits/ clipper & clamper circuits – require
mathematical
background
Design of
diode applicat
ion circuits
Design/problems of
clipper/clamper
Circuit Implemen
taion using
PSPICE
Can impleme
nt circuit
for daily life
applications
Micro
Project
seminars
Implementation & Design of analog Circuits
Implementation & Design of analog Circuits using PSPICE
Group Assignm
ent, Seminar
and Study of system
upgradation
CO2
Analysis of voltage regulator circuits require
mathematical
background
Analysis of
voltage regulator circuits
Design of
circuit –regulat
or circuits
Design / Design/prob
lemsof regulator circuits
Circuit Implemen
taion using
PSPICE
Can impleme
nt circuit
for daily life
applications
Micro
Project
seminars
Implementation & Design of
analog Circuits
Implementation & Design of
analog Circuits using
PSPICE
Group Assignm
ent, Seminar
and Study of system
upgradation
CO3
Analysis of BJT & MOSFET
amplifiers require
mathematical
background
Analysis of BJT & MOSFET amplifier
s
Design of
circuit –amplifi
er-MOSFET & BJT
Design / Design/prob
lemsof circuit
amplifier-MOSFET&
BJT
Circuit Implemen
taion using
PSPICE
Can impleme
nt circuit
for daily life
applications
Micro
Project
seminars
Implementation & Design of
analog Circuits
Implementation & Design of
analog Circuits using
PSPICE
Group Assignm
ent, Seminar
and Study of system
upgradation
CO4
Analysis of
operational
amplifiers
Analysis of
operational
amplifiers
Design of opamp circuits
Opamp circuit
design/pblm
Circuit Implemen
taion using
PSPICE
Can impleme
nt circuit
for daily life
applications
Micro
Project
Seminar
Implementation & Design of
analog Circuits
Implementation & Design of
analog Circuits using
PSPICE
Group Assignm
ent, Seminar
and study of system
upgradation
CO5
Integrated
circuits/D/A and
A/D converts -analysis
Integrated
circuits/D/A and
A/D converts -analysis
Circuit design - Integrat
ed circuits
/D/A and A/D
convert
Circuit design/probl
ems Integrated
circuits/D/A and A/D converts
Circuit Implemen
taion using
PSPICE
Can impleme
nt circuit
for daily life
applications
Micro
Project
Seminar
Implementation & Design of
analog Circuits
Implementation & Design of
analog Circuits using
PSPICE
Group Assignm
ent, Seminar
and Study of system
upgradation
Semester III, Course Hand-Out
Department of CSE, RSET 40
s
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
SNO DESCRIPTION PROPOSED
ACTIONS
1 Differential Amplifier using BJT
Lecture
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY
VISIT/GUEST LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
S
No:
DESCRIPTION PO MAPPING
1 To learn TINA TI software by simulating the
circuits in the syllabus and this will help the
students to perform well in the lab also.
DESIGN AND ANALYSIS TOPICS:
Sl. No. DESCRIPTION PO MAPPING
1 Design & analysis of RC coupled amplifier
WEB SOURCE REFERENCES:
1 cc.ee.ntu.edu.tw/~lhlu/eecourses/Electronics1/Electronics_Ch4.pdf
2 www.techpowerup.com/articles/overclocking/voltmods/21
3 www.electronics-tutorials.ws › RC Networks
4 www.pa.msu.edu/courses/2014spring/PHY252/Lab4.pd
5 www.iet.ntnu.no/courses/ttt4100/oppg1_eng.pdf
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
☑ CHALK & TALK ☑ STUD.
ASSIGNMENT
☑ WEB
RESOURCES
☐ LCD/SMART
BOARDS
STUD. SEMINARS ☐ ADD-ON
COURSES
Semester III, Course Hand-Out
Department of CSE, RSET 41
ASSESSMENT METHODOLOGIES-DIRECT
☑ ASSIGNMENTS STUD. SEMINARS ☑ TESTS/MODEL
EXAMS
☑ UNIV.
EXAMINATION
☐ STUD. LAB
PRACTICES
☐ STUD. VIVA ☐ MINI/MAJOR
PROJECTS
☐
CERTIFICATIONS
☐ ADD-ON
COURSES
☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
☑ ASSESSMENT OF COURSE OUTCOMES
(BY FEEDBACK, ONCE)
☑ STUDENT FEEDBACK ON FACULTY
(TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS
BY EXT. EXPERTS
☐ OTHERS
Prepared by Approved by
NITHIN BABU Dr. Jobin K Antony (Faculty)
(HOD)
Semester III, Course Hand-Out
Department of CSE, RSET 42
HS200 Business Economics
COURSE INFORMATION SHEET
PROGRAMME: COMPUTER SCIENCE &
ENGINEERING , ELECTRONICS AND
COMMUNICATION ENGINEERING
DEGREE: B.TECH
COURSE: BUSINESS ECONOMICS SEMESTER: 3 CREDITS: 3
COURSE CODE: HS200
REGULATION: 2017
COURSE TYPE: CORE
COURSE AREA/DOMAIN:
APPLIED ECONOMICS
CONTACT HOURS: 3-0-0
CORRESPONDING LAB COURSE CODE (IF
ANY): NIL
LAB COURSE NAME: NA
SYLLABUS: UNIT DETAILS HOURS
I
Business Economics and its role in managerial decision making-
meaning-scope-relevance-economic problems-scarcity Vs choice (2
Hrs)-Basic concepts in economics-scarcity, choice, resource
allocation- Trade-off-opportunity cost-marginal analysis- marginal
utility theory, Law of diminishing marginal utility -production
possibility curve (2 Hrs)
4
II
Basics of Micro Economics I Demand and Supply analysis - equilibrium-
elasticity (demand and supply) (3 Hrs.) -Production
concepts-average product-marginal product-law of variable
proportions- Production function-Cobb Douglas function-problems
(3 Hrs.)
6
FIRST INTERNAL EXAM
III
Basics of Micro Economics II Concept of costs-marginal, average,
fixed, variable costs-cost curves-shut down point-long run and short
run (3 Hrs.)- Break Even Analysis-Problem-Markets-Perfect
Competition, Monopoly and Monopolistic Competition, Oligopoly - Cartel
and collusion (3 Hrs.)
8
IV
Basics of Macro Economics - Circular flow of income-two sector
and multi-sector models- National Income Concepts-Measurement
methods -problems-Inflation, deflation (4 Hrs.)-Trade cycles-Money -
stock and flow concept-Quantity theory of money-Fischer’s Equation
and Cambridge Equation -velocity of circulation of money-credit
9
Semester III, Course Hand-Out
Department of CSE, RSET 43
control methods-SLR, CRR, Open Market Operations-Repo and
Reverse Repo rate-emerging concepts in money-bit coin (4 Hrs.)
SECOND INTERNAL EXAM
V
Business Decisions I-Investment analysis-Capital Budgeting-NPV,
IRR, Profitability Index, ARR, Payback Period (5 Hrs.)- Business
decisions under certainty-uncertainty-selection of alternatives-risk
And sensitivity- cost benefits analysis-resource management (4 Hrs.).
VI
Business Decisions II Balance sheet preparation-principles and
Interpretation- forecasting techniques (7 Hrs.)-business financing
sources of capital- Capital and money markets-international
financing-FDI, FPI, FII-Basic Principles of taxation-direct tax,
Indirect tax-GST (2 hrs.)
9
TOTAL HOURS 36
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T Geetika, Piyali Ghosh and Chodhury, Managerial Economics, Tata McGraw Hill, 2015
T Gregory Mankiw, Principles of Macroeconomics, Cengage Learning, 2006
R1 Dornbusch, Fischer and Startz, Macroeconomics, McGraw Hill, 11th edition, 2010
R2 T.N.Hajela.Money, Banking and Public Finance. Anne Books. New Delhi
R3 C Rangarajan, Indian Economy, Essays on monetary and finance, UBS
R4 I.M .Pandey, Financial Management, Vikas Publishing House. New Delhi
COURSE OBJECTIVES:
1 To familiarize the prospective engineers with elementary Principles of Economics and Business Economics.
2 To acquaint the students with tools and techniques that are useful in their profession in Business Decision Making which will enhance their employability;
3 To apply business analysis to the “firm” under different market conditions;
4 To apply economic models to examine current economic scenario and evaluate policy options for addressing economic issues
5 To gain understanding of some Macroeconomic concepts to improve their ability to understand the business climate;
6 To prepare and analyse various business tools like balance sheet, cost benefit analysis
Semester III, Course Hand-Out
Department of CSE, RSET 44
and rate of returns at an elementary level
COURSE OUTCOMES:
SNO DESCRIPTION 1 Students will be able to understand business economic concepts 2 Students will be able to nurture the idea of start-ups
3 Students will be able to analyse the basic macro – economic concepts and monetary theory
4 Students will be able to build up decision making skill under uncertain business climate
5 Students will be able to develop their professional skills by combining their technical knowledge with appropriate economic models
6 Students will be able to understand the basics of financial accounting and relevance of accounting principles
CORSE OUTCOME AND PROGRAMME OUTCOME MAPPING
CO-PO MAPPING
CO/PO
PO
1
PO
2
PO
3
PO
4
PO
5
PO
6
PO
7
PO
8
PO
9
PO 10
PO 11
PO 12
CO 1 1 3
CO 2 3 3 3 3
CO 3 1
CO 4 3 2 2
CO 5 2 3
CO 6 2 2 2
SNO DESCRIPTION
1 Students will be able to understand business economic concepts
2 Students will be able to nurture the idea of start-ups
Semester III, Course Hand-Out
Department of CSE, RSET 45
3 Students will be able to analyse the basic macro – economic concepts and monetary theory
4 Students will be able to build up decision making skill under uncertain business climate
5 Students will be able to develop their professional skills by combining their technical
knowledge with appropriate economic models
6 Students will be able to understand the basics of financial accounting and relevance of
accounting principles
CO/PO
PO 1
PO 2
PO 3
PO 4
PO 5
PO 6
PO 7
PO 8
PO 9
PO 10
PO 11
PO 12
CO 1
Knowledge
about basic
economics
concepts
related to
micro and
macro
economics
and model
building in
tally with
engineering
economics
(Module I,
II, III)
Basic
economic
principles
with simple
application
analysis
under
different
conditions.
Production
functions
and Different
types of
market
conditions
acquainted
(Module II,
III)
CO 2
Problems
introduced in
such a way
that students
start thinking
of solutions at
their best.
This calls for
group
decisions
where he/she
will share
ideas among
the respective
peer group.
They start
thinking
beyond pure
engineering
since
problems are
interconnected
Simple to
Complex
problems are
verified by
themselves
hence effective
interactions
are made
possible.
(Module I, V)
Economic
concepts
introduced
are
applicable
under
different
situations.
Hence
conceptual
application
and
Solutions can
be easily
identified
(Module
I,II,V,VI)
The
concepts
and models
introduced
are handy
and weighs
huge
application.
Cobb-
Douglas
Production
function,
Technical
aspects in
Production,
Decision
tree etc.
(Module
I,II,V,VI)
Semester III, Course Hand-Out
Department of CSE, RSET 46
(Module I, V)
CO/PO
PO 1
PO 2
PO 3
PO 4
PO 5
PO 6
PO 7
PO 8
PO 9
PO 10
PO 11
PO 12
CO 3
Cost
analysis
and
Decision
analysis
pertains to
resource
constraints.
Hence the
decision
would be
made by
considering
societal
resource
constraints.
(Module II,
V)
CO 4
Investment
analysis,
Capital
Budgeting,
Business
decisions
under
certainty and
uncertainty
calls for
analysis and
interpretation
of data to
find solutions
to complex
problems
(Module V)
Business
decision under
certainty and
uncertainty
calls for
discussion
among the
students and
arriving at a
feasible
conclusion.
Contradictions
arises due to
different levels
of thinking.
This calls for a
systematic
analysis and
presentation
of the
problem.
(Module IV,V)
Improves
decision
making
skill,
interaction
and
systematic
analysis of
the
problem.
An
experience
that can be
carried to
the future
where
students
deal with
real life
business
situations.
(All
Modules)
CO/PO
PO 1
PO 2
PO 3
PO 4
PO 5
PO 6
PO 7
PO 8
PO 9
PO 10
PO 11
PO 12
CO 5
Knowledge
on Simple
economic
concept
applicable
in a business
climate.
PPC, CDF,
Decisions
under
certainty
and
uncertainty
is a
mapping of
feasible
Semester III, Course Hand-Out
Department of CSE, RSET 47
Opportunity
costs,
Decision
tree etc
(Module II,
V).
solutions
and
identifying
the best
outcome.
Outcomes
decided
calls for
modeling
and
prediction
(Module
V, VI)
CO 6
Account
keeping calls
for interaction
among
different
departments
and also
knowledge
about the
same. This
facilitates
team work
and group
discussions
(Module V,
VI).
Project
management
involves the
student to
demonstrate
knowledge
about
different
departments
in a firm and
approach to
each
departmental
problems
form a multi
–
disciplinary
approach.
(Module V,
VI)
The
continuous
practicing
of technical
economic
concepts
and its
applications
leads to an
experience
(Module V,
VI)
Semester III, Course Hand-Out
Department of CSE, RSET 48
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
SNO DESCRIPTION PROPOSED
ACTIONS
1 Tax, Indian Economy-some facts about Indian Economy Seminars, Talks,
web sources 2 Relevant Economic problems like 1930 and 2008 recession Talks, web 3 International Economics-WTO-BOP Seminar, FM course
4 India’s Economic relation with other countries Seminar, Web
sources
5. Stock Exchange Market Seminar, Web
sources. 6 Cost Engineering Class Lectures
Proposed Actions: Topics beyond Syllabus/Assignment/Industry Visit/Guest Lecturer/Nptel Etc
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
1 Current Economic policies by RBI and Government of India. 2 Dollar – Rupee Scenario 3 BREXIT 4 Carbon Credit
WEB SOURCE REFERENCES:
1 www.rbi.org 4 www. comtrade.org
2 www.asi.org 5 www.euroasiapub.org/ijrim/june2012/
3 www.wto.org 6 www.startupmission.kerala.gov.in
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
☐ CHALK & TALK ☐ STUD. ASSIGNMENT ☐ WEB RESOURCES ☐LCD/SMART
BOARDS
☐ STUD. SEMINARS ☐ ADD-ON COURSES ☐ ICT ENABLED
CLASSES
ASSESSMENT METHODOLOGIES-DIRECT
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL ☐ UNIV.
Semester III, Course Hand-Out
Department of CSE, RSET 49
EXAMS EXAMINATION
☐ STUD. LAB
PRACTICES
☐ STUD. VIVA ☐ MINI/MAJOR
PROJECTS
☐ CERTIFICATIONS
☐ ADD-ON
COURSES
☐ OTHERS ☐ GROUP
DISCUSSION(IV)
ASSESSMENT METHODOLOGIES-INDIRECT
☐ ASSESSMENT OF COURSE OUTCOMES (BY
FEEDBACK, ONCE)
☐ STUDENT FEEDBACK ON FACULTY
(TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS
BY EXT. EXPERTS
☐ OTHERS
Prepared by Approved by
Lekshmi Vijayakumar & Saritha V Dr. Antony T Varghese
(Faculty) (HOD)
Semester III, Course Hand-Out
Department of CSE, RSET 50
CS231 Data Structures Lab
COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH
COURSE: DATA STRUCTURES LAB SEMESTER: III CREDITS: 1
COURSE CODE: CS231
REGULATION: 2016
COURSE TYPE: CORE
COURSE AREA/DOMAIN: PROGRAMMING, DATA
STRUCTURES AND ALGORITHMS
CONTACT HOURS: 3 Lab hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): NIL LAB COURSE NAME:NA
SYLLABUS:
List of Exercises/Experiments : (Minimum 12 are to be done)
1. Implementation of Stack and Multiple stacks using one dimensional array. **
2. Application problems using stacks: Infix to post fix conversion, postfix and pre-fix evaluation,
MAZE problem etc. **
3. Implementation of Queue, DEQUEUE and Circular queue using arrays.
4. Implementation of various linked list operations. **
5. Implementation of stack, queue and their applications using linked list.
6. Implementation of trees using linked list
7. Representation of polynomials using linked list, addition and multiplication of polynomials. **
8. Implementation of binary trees using linked lists and arrays- creations, insertion, deletion and
traversal. **
9. Implementation of binary search trees – creation, insertion, deletion, search
10. Application using trees
11. Implementation of sorting algorithms – bubble, insertion, selection, quick (recursive and non-
recursive), merge sort (recursive and non-recursive), and heap sort.**
12. Implementation of searching algorithms – linear search, binary search.**
13. Representation of graphs and computing various parameters (in degree, out degree etc.) -
adjacency list, adjacency matrix.
14. Implementation of BFS, DFS for each representation.
15. Implementation of hash table using various mapping functions, various collision and overflow
resolving schemes.**
Semester III, Course Hand-Out
Department of CSE, RSET 51
16. Implementation of various string operations.
17. Simulation of first-fit, best-fit and worst-fit allocations.
18. Simulation of a basic memory allocator and garbage collector using doubly linked list.
** mandatory.
LAB CYCLE
Day 1-Arrays
1. Write a menu driven program to perform the following operations on an array
(i) Insertion
a. Insert new element at the beginning.
b. Insert new element after a specified element.
(ii) Deletion
a. Delete a specified element.
b. Delete an element from a specified position.
(iii) Display
2. Write a menu driven program to implement (i) sparse matrix transpose (ii) sparse matrix
addition.
Day2-Linked List
3. Write a menu driven C program to implement a singly linked list and perform the
following operations on it:
(i) Insertion
a. at the beginning
Semester III, Course Hand-Out
Department of CSE, RSET 52
b. at the end
c. after a specified node.
(ii) Deletion
a. at the beginning
b. at the end
c. a specified node.
(iii) Display the linked list.
Day 3-Application of Linked list
4. Write a C program to perform polynomial addition and multiplication using linked list.
5. Write a menu driven C program to implement a doubly linked list and perform the
following operations on it:
(iv) Insertion (at the beginning, at the end, after a specified node).
(v) Deletion (at the beginning, end of a specified node).
(vi) Display (Forward and Backward).
Day 4-Stack, Queue
6. Write a menu driven C program to implement stack using one dimensional array. Perform the
operations on the stack (i) Push (ii) Pop (iii) Peep (ii) Is empty (iv) Isfull (v) Display.
7. Write a menu driven C program to implement multiple stacks using one dimensional array and
perform the following operations on both the stacks. (i) Push (ii) Pop (iii) Peep (ii) Is empty (iv)
Isfull (v) Display.(Enter option 1 to perform operations on Stack 1 and 2 to perform operation on
stack 2)
8. Write a menu driven C program to implement stack and queue using singly linked list.
Day 5-Applications of stack
9. Write a menu driven C program to covert infix to postfix expression and evaluate it using
stack.
10. Write a menu driven C program to implement circular queue using arrays.
11. Write a menu driven C program to implement DEQUEUE using arrays.
Day6
12. Write a menu driven C program to implement a binary tree using linked list and perform
the following operations on it
i) Insert a new node.
Semester III, Course Hand-Out
Department of CSE, RSET 53
ii) Delete a specified node.
iii) Search a specified node.
Day 7
13. Write a menu driven C program to implement a binary tree using arrays and perform the
following operations on it
iv) Insert a new node.
v) Delete a specified node.
vi) Search a specified node.
14. Write a menu driven C program to implement a binary search tree using linked list and
perform the following operations on it
(i) Insertion.
(ii) Deletion.
(iii) Traversals.
(iv) Search for a specified node.
(v) Height of the tree.
(vi) Mirror image of the tree.
Day8
15. Write a menu driven C program to perform the following operations on a directed graph
(i) In degree of a particular node
(ii) Out degree of a particular node
(iii) DFS
(iv) BFS
(v) Display (using Adjacency List and Adjacency Matrix).
16. Write a menu driven C program to implement the following sorting and searching
operations:
Bubble Sort (ii) Insertion Sort (iii) Selection Sort (iv )Linear Search (v) Binary Search
Day 9
17. Write a menu driven C program to perform
(i) Recursive Quick Sort.
(ii) Non-recursive Quick Sort.
Day 10
18. Write a menu driven C program to perform
(i) Recursive Merge Sort.
Semester III, Course Hand-Out
Department of CSE, RSET 54
(ii) Non recursive Merge Sort.
Day 11
19. Write a C program to implement Heap Sort.
Day 12
20. Write a menu driven C program to implement hash table and the following collision
resolution techniques-(i) Linear Probing (ii) Quadratic Probing
21. Write a C program for string concatenation, substring replacement and substring deletion.
22. Write a C program to simulate first fit, best fit and worst fit allocations using singly
linked list. Nodes in the linked list denote the size of memory.
23. Write a C program to simulate a memory allocator and garbage collector using doubly
linked list.
Hint for Pgm 22 and 23 : Free space is maintained as a linked list of nodes with each node
having the starting byte address and the ending byte address of a free block. Each memory
request consists of the process-id and the amount of storage space required in bytes. Allocated
memory space is again maintained as a linked list of nodes with each node having the process-
id, starting byte address and the ending byte address of the allocated space.
When a process finishes (taken as input) the appropriate node from the allocated list should be
deleted and this free disk space should be added to the free space list. [Care should be taken to
merge contiguous free blocks into one single block. This results in deleting more than one node
from the free space list and changing the start and end address in the appropriate node]. For
allocation use first fit, worst fit and best fit.
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
1 Horowitz ,Sahni & Anderson Freed, Fundamentals of Data Structures in C, 2nd ed., Universities Press, Hyderabad, 2009
2 Seymour Lipschutz, Data Structures , Schaum’s Outlines, Tata McGraw Hill , New Delhi, 2006
3 Samanta D., Classic Data Structures, Prentice Hall India, 2/e, 2009.
4 Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with C, 2/e,
Semester III, Course Hand-Out
Department of CSE, RSET 55
Cengage Learning, 2005.
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
B101-
05
Introduction to Computing and
Problem Solving
Fundamentals of C programming language
Fundamentals of Python programming
Bridge Course
S1
COURSE OBJECTIVES:
1 To implement basic linear and non-linear data structures and their major operations.
2 To implement applications using these data structures.
3 To implement algorithms for various sorting techniques
COURSE OUTCOMES:
Students will be able to
SNO DESCRIPTION
CS 231.1 appreciate the importance of structure and abstract data type, and their basic
usability in different applications
CS 231.2 analyze and differentiate different algorithms based on their time complexity.
CS 231.3 implement linear and non-linear data structures using linked lists.
CS 231.4 understand and apply various data structure such as stacks, queues, trees, graphs,
etc. to solve various computing problems.
CS 231.5 implement various kinds of searching and sorting techniques, and decide when to
choose which technique.
CS 231.6 identify and use a suitable data structure and algorithm to solve a real world
problem
CO-PO AND CO-PSO MAPPING
PO
1
PO
2
PO
3
PO
4
PO
5
PO
6
PO
7
PO
8
PO
9
P0
10
PO
11
PO
12
PSO
1
PSO
2
PSO
3
CS231.1 2 - - - - - - - - - - - 1 - -
CS231.2 - - 3 2 - - - - - - - - 3 - -
CS231.3 2 - 3 - - - - - - - - - 3 - -
CS231.4 1 - 2 3 - - - - - - - - 2 - 1
CS231.5 1 2 2 1 - - - - - - - - 1 - 2
CS231.6 - - 3 2 - - - - - - - - 2 - 2
Semester III, Course Hand-Out
Department of CSE, RSET 56
CS231
CS
231(overa
ll level)
- - 3 1 - - - - - - - - 2 - 2
JUSTIFICATIONS FOR CO-PO MAPPING
Mapping LOW/MEDIUM/HIGH Justification
CS231.1-PO1 M The knowledge of structure and abstract data type can be applied
to solve complex problems.
CS231.1-PSO1 L These fundamental concepts of CS can be applied to solve complex
problems
CS231.2-PO3 H Efficient algorithms can be designed based on their time
complexity.
CS231.2-PO4 M Analysis of algorithms helps to select suitable algorithms and reach
valid conclusions.
CS231.2-PSO1 H Complexity analysis can be applied in research and other
innovative areas.
CS231.3-PO1 M The knowledge can be enhanced by implementing the data
structure using any programming language
CS231.3-PSO1 H The implementation of data structures helps to design solutions to
complex engineering problems.
CS231.4-PO1 M The knowledge about the various data structures can be applied to
solve complex engineering problems.
CS231.4-PO3 H The knowledge about various data structures can be applied to
design efficient solutions to complex engineering problems
CS231.4-PSO1 H The knowledge about various data structures can be applied to
design efficient solutions to complex engineering problems
CS231.5-PO1 L The knowledge of searching and sorting algorithms can be applied
to solve complex engineering problems.
CS231.5-PO2 M The knowledge of searching and sorting algorithms can be appled
to analyze problems and reach conclusions.
CS231.5-PO3 M The knowledge of searching and sorting algorithms can be applied
to design solutions to complex problems.
CS231.5-PO4 L The knowledge of searching and sorting algorithms can be applied
in analysis and interpretation of data
CS231.5-PSO1 L The knowledge of searching and sorting algorithms can be applied
in analysis of problems and design solutions.
CS231.5-PSO3 M This fundamental knowledge can be used in research and other
areas.
CS231.6-PO3 H This helps to design an efficient solution to complex problems.
CS231.6-PO4 M This knowledge helps in suitable representations and thereby
interpretation of data can be done efficiently
CS231.6-PSO1 M The knowledge of data structures help to analyze and design
Semester III, Course Hand-Out
Department of CSE, RSET 57
solutions to complex problems.
CS231.6-PSO3 M This is a core fundamental concept in CS which can be apped in
research area also.
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS: NIL
SNO DESCRIPTION
1 SPARSE MATRIX ADDITION AND TRANSPOSE
2 CIRCULAR DOUBLY LINKED LIST
3
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
1 AVL TREES
2
WEB SOURCE REFERENCES:
1 http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/sortingII/mergeSort/mergeSort.html
3 www.cse.unt.edu/~rada/CSCE3110/Lectures/Trees.ppt
4 cslibrary.stanford.edu/110/BinaryTrees.pdf
5 cslibrary.stanford.edu/103/LinkedListBasics.pdf
6 www.nptel.iitm.ac.in/video.php?subjectId=106105085
7 www.iitg.ernet.in/cse/?page_id=220
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
CHALK & TALK STUD. ASSIGNMENT WEB RESOURCES
LCD/SMART BOARDS STUD. SEMINARS ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS STUD. SEMINARS TESTS/MODEL EXAMS UNIV. EXAMINATION
STUD. LAB PRACTICES STUD. VIVA MINI/MAJOR PROJECTS CERTIFICATIONS
ADD-ON COURSES OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE) STUDENT FEEDBACK ON FACULTY (TWICE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS OTHERS
Prepared by Approved by
Ms. Anita John (H.O.D)
Semester III, Course Hand-Out
Department of CSE, RSET 58
COURSE PLAN
Rajagiri School of Engineering and Technology
Course plan of CS231 DATA STRUCTURES LAB 2016
Sl.No Module Planned Date Planned
1 1 09-Aug-16 Test on C
2 1 16-Aug-16 Arrays, Sparse matrix
3 1 23-Aug-16 Operations on Linked List
4 1 30-Aug-16 Polynomial Addition and Multiplication
5 1 06-Sep-16 Stack, Queue
6 1 20-Sep-16 Multiple Stacks
7 1 27-Sep-16 Binary Tree using Linked List
8 1 04-Oct-16 Binary Tree using Array, BST
9 1 18-Oct-16 Sorting- Bubble, Insertion and Selection
10 1 25-Oct-16 Recursive and Non Recursive Quick Sort
11 1 01-Nov-16 Recursive and Non Recursive Merge Sort
12 1 08-Nov-16 Heapsort
13 1 15-Nov-16 Lab Exam
14 1 22-Nov-16 Graph and Hashing
15 1 15-Nov-16 lab exam
Semester III, Course Hand-Out
Department of CSE, RSET 59
CS233 Electronics Circuits Lab
COURSE INFORMATION SHEET
PROGRAMME: Computer Science &
Engineering
DEGREE: BTECH
COURSE: Electronic Circuits Lab SEMESTER: S3 CREDITS: 4
COURSE CODE: CS233
REGULATION: 2015
COURSE TYPE: CORE/ELECTIVE /
BREADTH/ S&H
COURSE AREA/DOMAIN: ELECTRONICS CONTACT HOURS: 3 (Lab) hours/Week.
CORRESPONDING LAB COURSE CODE
(IF ANY):
LAB COURSE NAME:
SYLLABUS:
UNIT DETAILS HOURS
(Minimum 13 experiments are to be done in the semester, at least 6 each should be selected
from the first(Exp. 1-10) and second(Exp. 11-20) half. Experiment no. 18 is compulsory).
1 Forward and reverse characteristics of PN diode and Zener diode
3
2 Input and output characteristics of BJT in CE configuration and evaluation
of parameter 3
3 RC integrating and differentiating circuits-Transient response with
different time constant 3
4 RC low pass and high pass circuits- Frequency response with sinusoidal
input 3
5 Clipping circuits (Positive, negative and biased) - Transient and transfer
characteristics 3
6 Clamping circuits (Positive, negative and biased)- Transient characteristics
3
7 Bridge Rectifier - with and without filter- ripple factor and regulation
3
8 Simple Zener regulator- Line and load characteristics
3
9 RC coupled CE amplifier – Mid band gain and frequency response
3
10 RC phase shift or Wien bridge oscillator using transistor
3
11 Astable and Monostable multivibrators using transistors
3
Semester III, Course Hand-Out
Department of CSE, RSET 60
12 Series voltage regulator (Two transistors)- Line and load characteristics
3
13 Voltage regulator using LM 723)- Line and load characteristics
3
14 Astable and mono stable multivibrators using 555 Timer
3
15 Inverting and non-inverting amplifier using op-amp IC741
3
16 Instrumentation amplifier using op-amp IC741
3
17 RC phase shift or Wien bridge oscillator using op-amp IC741
3
18 Simulation of simple circuits (at least 6 from above) using any SPICE
software(Transient, AC and DC analysis) 3
TOTAL HOURS 42
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
1 Sedra and Smith: Microelectronic Circuits, 4/e, Oxford University Press 1998.
2 B. Razavi , “Fundamentals of Microelectronics”, Wiley
3 DavidA Bell, Electronic Devices and Circuits, Oxford University Press, 2008
4 Electronics Lab Manual Vol. 1 / K. A. Navas /
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
EC100 Basics of Electronics Engineering Students should know about basic
electronics components like BJT,
diode, Resistor etc & its working
2
CS207 Electronic Devices and Circuits Student will know about working of
Clipper, Clamper and Multi-vibrator
3
COURSE OBJECTIVES:
1 To introduce the working of analog electronic circuits
2 To design, implement and demonstrate analog circuits using electronic components
3 To provide hands on experience to students so that they are able to put theoretical
concepts to practice.
4 To use computer simulation tools such as PSPICE, or Multisim to the simulation of
electronic circuits.
5 To create an ability to develop descriptions, explanations, predictions and models using
evidence.
Semester III, Course Hand-Out
Department of CSE, RSET 61
6 To create an ability to communicate effectively the scientific procedures and
explanations about the experiments in oral/report forms
COURSE OUTCOMES:
Sl No. DESCRIPTION
1 Rate your knowledge about clipper and clamper circuits
2 Rate your knowledge to design inverting and non inverting amplifier circuits using
opamp
3 Rate your understanding about applications of multi-vibrator circuit
4 Rate your knowledge to design RC phase shift oscillator
5 Rate your knowledge about diode, RC circuits
Semester III, Course Hand-Out
Department of CSE, RSET 62
CO MAPPING WITH PO, PSO
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO
7
PO
8
PO
9
PO
10
PO
11
PO
12
PSO
1
PSO
2
PSO
3
CO1 3 3 3 3 2 1 2 2 2 1
CO2 3 3 3 3 2 2 1 2 2 1 2 1
CO3 3 3 3 3 2 2 2 2 1 1 2 1 1
CO4 3 3 3 3 1 2 3 1 1
CO5 3 3 3 3 3 2 2 2 3 2 1 1 2 2
CS233
JUSTIFICATION FOR THE CORRELATION LEVEL ASSIGNED IN EACH CELL OF THE TABLE ABOVE.
PO1 PO2 PO3 PO4
PO
5
PO
6
PO
7
PO
8
PO
9
PO
10
PO
11
PO
12
PSO
1
PSO
2
PSO
3
CO1
Clipper
and
clamper
circuits
are used
in
electroni
c circuit
Analysi
s and
operatio
n of
clipper
circuit
require
sound
knowle
dge of
enginee
ring
science
Design
of
wavefor
m
shaping,
level
shifting
and
noise
removal
applicat
ion
Design
of
wavefor
m
shaping,
level
shifting
and
noise
removal
applicati
on
Mod
ern
simu
latio
n
tools
–
pspi
ce,
tina
ti
can
be
used
Devel
opmen
t of
produc
ts for
health
and
safety
Exper
iment
s are
done
in
teams
of 3
mem
bers
colla
borati
ng to
produ
ce
result
Writing
lab
records
to
commu
nicate
results
Program
ming
for
modelin
g in
pspice
& tina ti
Practical
skill
develope
d
through
experime
ntation in
the lab
CO2
Op-amp
circuits
are used
in
electroni
c circuit
Analysi
s and
operatio
n of op-
amp
circuit
require
sound
Design
of
circuits
for
amplifyi
ng
signals
Design
of
circuits
for
amplifyi
ng
signals
Mod
ern
simu
latio
n
tools
–
pspi
Devel
opmen
t of
produc
ts for
health
and
safety
Learn
to
develo
p
produ
cts
accord
ing to
Exper
iment
s are
done
in
teams
of 3
mem
Writing
lab
records
to
commu
nicate
results
Design
can be
altered
to
meet
the
specifi
cations
Program
ming
for
modelin
g in
pspice
& tina ti
Practical
skill
develope
d
through
experime
ntation in
the lab
Semester III, Course Hand-Out
Department of CSE, RSET 63
knowle
dge of
enginee
ring
science
ce,
tina
ti
can
be
used
the
norms
of
engine
ering
practic
e
bers
colla
borati
ng to
produ
ce
result
CO3
Multivib
rator
circuits
are used
in signal
generato
rs
Analysi
s and
operatio
n of
multi-
vibrator
require
sound
knowle
dge of
enginee
ring
science
Design
of
multi-
vibrator
circuits
Is used
to
generate
clock,
triggerin
g pulse
signals
Mod
ern
simu
latio
n
tools
–
pspi
ce,
tina
ti
can
be
used
Devel
opmen
t of
produc
ts for
health
and
safety
Exper
iment
s are
done
in
teams
of 3
mem
bers
colla
borati
ng to
produ
ce
result
Writing
lab
records
to
commu
nicate
results
Expo
sure
to
comp
onent
select
ion
and
econo
mical
produ
ct
desig
n
Design
s
evolve
with
techno
logical
advanc
ements
Muli-
vibrator
circuits
are
incopor
ated in
compute
r
products
Program
ming
for
modelin
g in
pspice
& tina ti
Practical
skill
develope
d
through
experime
ntation in
the lab
CO4
Oscillato
r
circuits
are used
in signal
generato
rs
Analysi
s and
operatio
n of
oscillat
or
require
sound
knowle
dge of
enginee
ring
science
Design
of sine
wave
generati
on
circuits
Oscillato
r are
used to
generate
carrier
signals
for
transmis
sion
Devel
opmen
t of
oscilla
tor for
transm
ission
circuit
will
follow
enviro
nment
al
regulat
ions
Exper
iment
s are
done
in
teams
of 3
mem
bers
colla
borati
ng to
produ
ce
result
Writing
lab
records
to
commu
nicate
results
Oscillat
or
circuits
are
incorpor
ated in
commu
nication
products
Program
ming
for
modelin
g in
pspice
& tina ti
Semester III, Course Hand-Out
Department of CSE, RSET 64
CO5
Diode
and RC
circuits
are used
in
electroni
c circuit
Analysi
s and
operatio
n of
diode
and
filter
circuit
require
sound
knowle
dge of
enginee
ring
science
Design
of filter
circuits
Design
of filter,
integrato
r,
different
iator,
regulator
circuits
Mod
ern
simu
latio
n
tools
–
pspi
ce,
tina
ti
can
be
used
Devel
opmen
t of
produc
ts for
health
and
safety
Devel
opmen
t of
power
suppli
es and
regulat
ors
will
follow
enviro
nment
al
regulat
ions
Exper
iment
s are
done
in
teams
of 3
mem
bers
colla
borati
ng to
produ
ce
result
Writing
lab
records
to
commu
nicate
results
Expo
sure
to
comp
onent
select
ion
and
econo
mical
produ
ct
desig
n
Design
s
evolve
with
techno
logical
advanc
ements
Develop
ment of
power
supplies
and
regulato
rs
Program
ming
for
modelin
g in
pspice
& tina ti
Practical
skill
develope
d
through
experime
ntation in
the lab
Semester III, Course Hand-Out
Department of CSE, RSET 65
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION
REQUIREMENTS:
SNO DESCRIPTION PROPOSED
ACTIONS
PO MAPPING
1 Basic working of passive & active components
Lecture/Test 1, 2, 3, 4, 5, 9, 10,
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY
VISIT/GUEST LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
S
No:
DESCRIPTION PO MAPPING
1 To learn TINA TI software by simulating the
circuits in the syllabus and this will help the
students to perform well in the lab also.
1, 2, 3, 4, 5, 6
DESIGN AND ANALYSIS TOPICS:
Sl.
No.
DESCRIPTION PO MAPPING
1 Design & analysis of RC coupled amplifier 1, 2, 3, 4, 5, 9,
10
WEB SOURCE REFERENCES:
1. cc.ee.ntu.edu.tw/~lhlu/eecourses/Electronics1/Electronics_Ch4.pdf
2. http://www.electrical4u.com/op-amp-working-principle-of-op-amp/
3. www.electronics-tutorials.ws › RC Networks
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
☑ CHALK & TALK ☑ STUD.
ASSIGNMENT
☐ WEB
RESOURCES
☑ LCD/SMART
BOARDS
☐ STUD.
SEMINARS
☐ ADD-ON
COURSES
ASSESSMENT METHODOLOGIES-DIRECT
☑ ASSIGNMENTS ☐ STUD.
SEMINARS
☑ TESTS/MODEL
EXAMS
☐ UNIV.
EXAMINATION
☑ STUD. LAB
PRACTICES
☑ STUD. VIVA ☐ MINI/MAJOR
PROJECTS
☐
CERTIFICATIONS
☐ ADD-ON
COURSES
☐ OTHERS
Semester III, Course Hand-Out
Department of CSE, RSET 66
ASSESSMENT METHODOLOGIES-INDIRECT
☑ ASSESSMENT OF COURSE OUTCOMES
(BY FEEDBACK, ONCE)
☑ STUDENT FEEDBACK ON
FACULTY (TWICE)
☐ ASSESSMENT OF MINI/MAJOR
PROJECTS BY EXT. EXPERTS
☐ OTHERS
Prepared by Approved by
Abhishek Viswakumar Dr. Jobin K Antony
Rinju Mariam Rolly (HOD)
Karunkara P Menon
(Faculty in Charges)