S3CSEHand Out

COURSE HAND-OUT
KTU B.TECH. - SEMESTER III
DEPARTMENT OF COMPUTER SCIENCE

AND ENGINEERING
Semester III, Course Hand-Out
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
Department of CSE, RSET 2

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.

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.

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 PLAN 18
CS203 Switching Theory and Logic Design 21
COURSE PLAN 26
CS205 Data Structures 28
COURSE PLAN 34
CS207 Electronics Devices & Circuits 36
HS200 Business Economics 42
CS231 Data Structures Lab 50
COURSE PLAN 58
CS233 Electronics Circuits Lab 59

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 & 3-1-0 4 A
Complex Analysis
CS201 Discrete 3-1-0 4 B
Computational
Structures
CS203 Switching Theory 3-1-0 4 C
and Logic Design
CS205 Data Structures 3-1-0 4 D
CS207 Electronics 3-0-0 3 E
Devices & Circuits
HS210/HS200 Life 2-0-2/3-0-0 3 F
Skills/Business
Economics
CS231 Data Structures 0-0-3 1 S
Lab
CS233 Electronics 0-0-3 1 T
Circuits Lab
Total Credits = 24 Hours: 28/29
Cumulative Credits= 71

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
15
law,Indian contribution to parallel processing.
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 15
and Reconfigurability
III Array processors - SIMD array processors - Interconnection networks - Static vs

dynamic
networks - mesh connected networks - Cube interconnection networks - Parallel
15
algorithms for array processors - SIMD matrix multiplication-Parallel sorting on array
processors - Associative array processing - Memory organization.
IV Multiprocessor architectures and Programming - Loosely coupled and Tightly coupled
multiprocessors - Interconnection networks - Language features to exploit parallelism
15
–Inter process communication mechanism-Process synchronisation mechanisms,
synchronization with semaphores.
V Dataflow computers - Data driven computing and Languages, Data flow computers
architectures - Static data flow computer , Dynamic data flow computer ,Data flow
design
15
alternatives.
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.

COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
CS010 COMPUTER ORGANISATION ARCHITECTURE III
304
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 SEMESTER: 3 CREDITS: 4
ANALYSIS
COURSE CODE: MA201 COURSE TYPE: CORE /ELECTIVE / BREADTH/
REGULATION: 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 9
Limit, continuity and derivative of complex functions
Analytic functions,Cauchy –Riemann equation,Laplaces equation,Harmonic functions
Harmonic conjugate
II Conformal Mapping 10
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
III Complex Integration 10

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
IV 9
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

real integral
V Linear system of equations 9
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
VI Matrix Eigen value Problem 9
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
TOTAL HOURS 52
T Erin Kreyszig:Advanced Engineering Mathematics,10 th 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
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

PO MAPPING
CO mapping with PO, PSO
PO PO PO PO PS PS PS
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO9
8 10 11 12 O1 O2 O3
CO1 3
CO2 3
CO3 3 1 3
CO4 3 3
CO5 3 3
CO6 3 1 3
EC010 1.666 #DIV #DIV #DI ####
3 3
804 L02 667 /0! /0! V/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.
P P P P P P
P P P P
O O O S S S
PO1 PO2 PO3 PO4 O PO6 O O O
1 1 1 O O O
5 7 8 9
0 1 2 1 2 3
Fundamental
knowlegde in
complex analysis
will help to
CO1
analyze the
Engineering
problems ver
easily
Basic knowledge Complex

in Conformal analysis
mapping will may
help to model address
CO2
various various
problems in society
engineering related
fields problems
Complex
integratio
Complex n will
integration will help to
help to simplify design
CO3
problems with solutions
high complexity to various
in Engineering complex
engineeri
ng

problems
Singulariti
es and
Series
Singularities and
expansio
Series
ns will
expansions will
help to
CO4 help to enrich
design
the analysis of
solutions
Engineering
to various
problems
complex
engineeri
ng
problems
Will able
to
Matrix theory
analyse
will give a
various
thorough
CO5 methods
knowledge in
of
the application
solutions
problems
of
equations
The
Eigen value, solutions
Eigen vectors for
and related various
theories will engineeri
CO6
help to design ng
several problems
engineering requires
problems 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

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. ☐ WEB RESOURCES
ASSIGNMENT
☐ LCD/SMART ☐ STUD. SEMINARS ☐ ADD-ON COURSES
BOARDS
ASSESSMENT METHODOLOGIES-DIRECT
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL ☐ UNIV.
EXAMS EXAMINATION
☐ STUD. LAB ☐ STUD. VIVA ☐ MINI/MAJOR ☐ CERTIFICATIONS
PRACTICES PROJECTS
☐ ADD-ON COURSES ☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
☐ ASSESSMENT OF COURSE OUTCOMES (BY ☐ STUDENT FEEDBACK ON FACULTY
FEEDBACK, ONCE) (TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY ☐ OTHERS
EXT. EXPERTS
Prepared by Approved by
(Jaya Abraham) (HOD)

CS201 Discrete Computational Structures

CS 201:DISCRETE COMPUTATIONAL STRUCTURES
PROGRAMME:COMPUTER SCIENCE AND DEGREE: BTECH
ENGINEERING
COURSE: DISCRETE COMPUTATIONAL SEMESTER: III CREDITS: 4
STRUCTURES
COURSE CODE: CS 201 COURSE TYPE: CORE
REGULATION: 2015
COURSE AREA/DOMAIN: Logic Development CONTACT HOURS: 3+1(Tutorial) hours/Week.
SYLLABUS:
UNIT DETAILS HOURS
I Review of elementary set theory : 10
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
II Review of Permutations and combinations, Principle of inclusion exclusion, Pigeon Hole 9

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
III Algebraic systems (contd…):- 8

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
IV Lattices and Boolean algebra :- 10

Lattices –Sublattices – Complete lattices – Bounded Lattices - Complemented Lattices –
Distributive Lattices – Lattice Homomorphisms.
Boolean algebra – sub algebra, direct product and homomorphisms
V Propositional Logic:- 8
Propositions – Logical connectives – Truth tables
Tautologies and contradictions – Contra positive – Logical equivalences and
implications
Rules of inference: Validity of arguments.

VI Predicate Logic:- 9
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.
TOTAL HOURS 54
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.
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:

SiNO DESCRIPTION Blooms’

Taxonomy
Level
C201.1 Students will be able to identify and apply operations on discrete Apply
structures such as sets, relations and functions in different areas of (level 3 )
computing
C201.2 Validate
Students will be able to verify the validity of an argument using (level 4)
propositional and predicate logic.
C201.3 Construct
Students will be able to construct proofs using direct proof, proof by (level 5)
contraposition, proof by contradiction and proof by cases, and by
mathematical induction.
C201.4 Solve/Apply
Students will be able to solve problems using algebraic structures. (level 3 )
C201.5 Solve/Apply
Students will be able to solve problems using counting techniques and (level 3 )
combinatorics.
C201.6 Apply
Students will be able to apply recurrence relations to solve problems in (level 3 )
different domains.
CO-PO AND CO-PSO MAPPING

P PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
O 2 3 4 5 6 7 8 9 0 1 2 1 2 3
1
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 3 3
overall
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

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

Si DESCRIPTION PROPOSED RELEVANCE RELEVANCE
NO ACTIONS WITH POs WITH PSOs
1 Graph Theory and its applications Seminar 1 1
2 Applications of lattice, mathematical logic etc in the Guest Lecture 1,2,3 1,2
field of computer Science and Information Technology
3 Plotting graph for a function Class 1
lecturing
along with the
topic of
function
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

Si DESCRIPTION PROPOSED RELEVANCE WITH RELEVANCE WITH
NO ACTIONS POs PSOs
1 Different types of numbers and Class Assignment 1,3 3
their properties


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
 CHALK & TALK  STUD.  WEB
ASSIGNMENT RESOURCES
 LCD/SMART  STUD. ☐ ADD-ON COURSES
BOARDS SEMINARS
 ASSIGNMENTS  STUD.  TESTS/MODEL  UNIV.
SEMINARS EXAMS EXAMINATION
 STUD. LAB  STUD. VIVA ☐ MINI/MAJOR ☐ CERTIFICATIONS
PRACTICES PROJECTS
☐ ADD-ON ☐ OTHERS
COURSES
 ASSESSMENT OF COURSE OUTCOMES (BY  STUDENT FEEDBACK ON FACULTY
EXT. EXPERTS
Meenu Mathew Shimmi Asokan

HOD, CSE

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

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

46

CS203 Switching Theory and Logic Design

PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH (JULY- DECEMBER 2016)
COURSE: SWITCHING THEORY & LOGIC DESIGN SEMESTER: III CREDITS: 4
COURSE CODE: CS203 COURSE TYPE: CORE
REGULATION: 2016
COURSE AREA/DOMAIN: COMPUTER HARDWARE CONTACT HOURS: 3+1 (Tutorial) hours/Week.
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).
10
Addition and subtraction of BCD, Octal and Hexadecimal numbers. Representation of
floating point numbers – precision – addition, subtraction, multiplication and division
of floating point numbers.
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 9
Conditions.
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
10
adder, BCD adder, code converter, magnitude comparator, decoder, multiplexer,
demultiplexer, parity generator.
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 8
equations.
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 8
counter, Johnson counter — timing sequences and state diagrams.
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, 8
multiplexer. Arithmetic algorithms: Algorithms for addition and subtraction of binary
and BCD numbers, algorithms for floating point addition and subtraction.

TOTAL HOURS 52
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].
M. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2007. [Chapter
T 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.
Rajaraman V. and T. Radhakrishnan, An Introduction to Digital Computer Design, 5/e,
R 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 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:
Blooms’
Sl No DESCRIPTION Taxonomy
Level
Apply the basic concepts of Boolean algebra for the simplification and Understand
C203.1
implementation of logic functions using suitable gates namely NAND, NOR etc. (Level 2)
Design simple Combinational Circuits such as Adders, Subtractors, Code Convertors, Apply
C203.2
Decoders, Multiplexers, and Magnitude Comparators etc.
(Level 3)

Analyze and Design simple and commonly used Sequential Circuits viz. different Apply
C203.3
types of Counters, Shift Registers, Serial Adders and Sequence Generators.
(Level 3)
Apply
C203.4 Use Hardware Description Language for describing simple logic circuits.
(Level 3)
Explain and illustrate algorithms for addition/subtraction operations on Binary, Analyze

C203.5 BCD and Floating Point Numbers.
(Level 4)
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

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.

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.

1 Realization of combinational and sequential logic circuits.
2 Design of small logical circuits beyond the scope of assignment.
3 Programmable logic design.

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
CHALK & TALK  STUD. ASSIGNMENT  WEB RESOURCES  LCD/SMART BOARDS
 STUD. SEMINARS ☐ ADD-ON COURSES

 ASSIGNMENTS  STUD. SEMINARS  TESTS/MODEL  UNIV. EXAMINATION
EXAMS
PRACTICES PROJECTS
☐ ADD-ON COURSES ☐ OTHERS
 ASSESSMENT OF COURSE OUTCOMES (BY  STUDENT FEEDBACK ON FACULTY (TWICE)
FEEDBACK, ONCE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. ☐ OTHERS
EXPERTS
Ms. Sminu Izudheen/Ms. Jisha Mary Jose Ms. Shimmi Asokan
(Faculty) (HOD)

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

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
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
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
63 6 Model question paper discussions

CS205 Data Structures

PROGRAMME: COMPUTER SCIENCE AND DEGREE: BTECH
ENGINEERING
COURSE: DATA STRUCTURES SEMESTER: III CREDITS: 4

REGULATION: 2016
COURSE AREA/DOMAIN: PROGRAMMING CONTACT HOURS: 3+1(Tutorial) hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY):CS LAB COURSE NAME: DATA STRUCTURES LAB
231
SYLLABUS:
UNIT DETAILS HOURS
I Introduction to programming methodologies – structured approach, stepwise 9
refinement techniques, programming style, documentation – analysis of
algorithms: frequency count, definition of Big O notation, asymptotic analysis of
simple algorithms. Recursive and iterative algorithms
II Abstract and Concrete Data Structures- Basic data structures – vectors and arrays. 9
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,.
III Applications of linked list (continued): Memory management, memory allocation 9

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.
IV String: - representation of strings, concatenation, substring searching and deletion. 10

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.
V Graphs – representation of graphs, BFS and DFS (analysis not required) 9
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)
VI Linear and Binary search. (Performance comparison expected. Detailed analysis 10

not required)Hash Tables – Hashing functions – Mid square, division, folding,

digit analysis, collusion resolution and Overflow handling techniques

TOTAL HOURS 56
T/R Samanta D., Classic Data Structures, Prentice Hall India, 2/e, 2009.
T/R Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with
C, 2/e, Cengage Learning, 2005.
R Horwitz E., S. Sahni and S. Anderson, Fundamentals of Data Structures in C, University

Press (India), 2008.
R Aho A. V., J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson
Publication,1983.
R Tremblay J. P. and P. G. Sorenson, Introduction to Data Structures with Applications, Tata

McGraw Hill, 1995.
R Peter Brass, Advanced Data Structures, Cambridge University Press, 2008
R Lipschuts S., Theory and Problems of Data Structures, Schaum’s Series, 1986.
R Wirth N., Algorithms + Data Structures = Programs, Prentice Hall, 2004.
R Hugges J. K. and J. I. Michtm, A Structured Approach to Programming, PHI, 1987.
R Martin Barrett, Clifford Wagner, And Unix: Tools For Software Design, John Wiley, 2008
reprint.
B101-05 Introduction to Computing and Fundamentals of Python programming S1

Problem Solving
Fundamentals of C programming Bridge Course

language

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.

PO PO PO PO PO PO PO PO PO P0 PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 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 - 3 3 1 - - - - - - - - 2 - 2
205(overa
ll level)


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

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

1 AVL Trees

1 http://nptel.ac.in/courses/106103069
 CHALK & TALK  STUD.  WEB
 LCD/SMART  STUD. ☐ ADD-ON COURSES
BOARDS SEMINARS
 ASSIGNMENTS ☐ STUD.  TESTS/MODEL  UNIV.
 STUD. LAB  STUD. VIVA ☐ MINI/MAJOR ☐ CERTIFICATIONS
PRACTICES PROJECTS
COURSES
 ASSESSMENT OF COURSE OUTCOMES (BY  STUDENT FEEDBACK ON FACULTY
EXT. EXPERTS

Jomina John HOD

COURSE PLAN
Sl.No Module Planned
1 1 Introduction to Programming methodologies, Structured approach

Stepwise refinement techniques, Programming style and
2 1 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
Abstract and Concrete Data Structures, Basic Data Structures-
9 2 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

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

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

PROGRAMME: Computer Science & DEGREE: BTECH
Engineering.
COURSE: ELECTRONIC DEVICES & SEMESTER: S3 CREDITS: 3
CIRCUITS
COURSE CODE: CS207 COURSE TYPE: CORE /ELECTIVE /
REGULATION: 2016 BREADTH/ S&H
COURSE AREA/DOMAIN: ELECTRONICS CONTACT HOURS: 3+1 (Tutorial)
hours/Week.
CORRESPONDING LAB COURSE CODE LAB COURSE NAME:Electronic Circuits Lab
(IF ANY): CS233
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 - 5
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.
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
7
high voltage regulators, DC to DC conversion, Circuit/block diagram and
working of SMPS.
Field effect transistors: JFET – Structure, principle of operation and

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 7
bandwidth.
Feedback in amplifiers - Effect of negative feedback on amplifiers.
MOSFET Amplifier- Circuit diagram and working of common source
MOSFET amplifier.
IV
Oscillators: Classification, criterion for oscillation, analysis of Wien bridge
oscillator, Hartley and Crystal oscillator.
Non-sinusoidal oscillators: Astable, monostable and bi-stable multivibrators 5
using transistors (Only design equations and working of circuit are required,
Analysis not required).
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- 8
scale changer, sign changer, adder/summing amplifier, subtractor, integrator,
differentiator,
Schmitt trigger, Wien bridge oscillator.
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 8
only).
Flash, dual slope and successive approximation type A/D convertors.
Circuit diagram and working of Timer IC555, astable and monostable
multivibrators using 555.
TOTAL HOURS 60 hrs.
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.

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.
BE101 - Introduction to Electronics Students should know about basic 1st
04 Engineering electronics components like BJT, Year
diode, Resistor etc&its working of
diodes in circuits and in rectifiers.
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:
Programme-specific
Programme Outcomes (POs)
CO No. Outcomes (PSOs)
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

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:
PO PO1
PO1 PO2 PO3 PO4 PO5 PO6 PSO1 PSO2 PSO3
9 0
Working Working
of RC of RC Group
Can
circuits/cl circuits/ Implemen Assignm
Design impleme
ipper & clipper & Circuit Implemen tation & ent,
C clamper clamper
of Design/prob
Implemen
nt Micr
tation & Design of Seminar
diode lems of circuit o semin
O circuits circuits –
applicat clipper/clam
taion
for daily Proje ars
Design of analog and
require require using analog Circuits Study of
1 mathema mathem
ion per
PSPICE
life ct
Circuits using system
circuits applicati
tical atical PSPICE upgrada
ons
backgrou backgrou tion
nd nd
Analysis Group
Can
of voltage Implemen Assignm
Analysis Design impleme
regulator Design / Circuit Implemen tation & ent,
C circuits
of of
Design/prob Implemen
nt Micr
voltage circuit – circuit o semin
O require
regulator regulat
lemsof taion
for daily Proje ars
mathema regulator using analog Circuits Study of
2 tical
circuits or
circuits PSPICE
life ct
circuits applicati
backgrou PSPICE upgrada
ons
nd tion
Analysis Group
Can
of BJT & Design Design / Implemen Assignm
Analysis impleme
MOSFET of Design/prob Circuit Implemen tation & ent,
C amplifiers
of BJT &
circuit – lemsof Implemen
nt Micr
MOSFET circuit o semin
O require
amplifier
amplifi circuit taion
for daily Proje ars
mathema er- amplifier- using analog Circuits Study of
3 tical
s
MOSFE MOSFET& PSPICE
life ct
applicati
backgrou T & BJT BJT PSPICE upgrada
ons
nd tion
Group
Can
Implemen Assignm
Analysis impleme
Analysis Circuit Implemen tation & ent,
C of
of Design
Opamp Implemen
nt Micr
operatio of circuit o Semin
O operation
nal opamp
circuit taion
for daily Proje ar
al design/pblm using analog Circuits study of
4 amplifiers
amplifier circuits
PSPICE
life ct
s applicati
PSPICE upgrada
ons
tion
Circuit Group
Can
Integrate Integrate design - Circuit Implemen Assignm
impleme
d d Integrat design/probl Circuit Implemen tation & ent,
C circuits/D circuits/ ed ems Implemen
nt Micr
circuit o Semin
O /A and D/A and circuits Integrated taion
for daily Proje ar
A/D A/D /D/A circuits/D/A using analog Circuits Study of
5 converts - converts and and A/D PSPICE
life ct
applicati
analysis -analysis A/D converts PSPICE upgrada
ons
convert tion


SNO DESCRIPTION PROPOSED
ACTIONS
1 Differential Amplifier using BJT Lecture
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC

S DESCRIPTION PO MAPPING
No:
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

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
☑ CHALK & TALK ☑ STUD. ☑ WEB
☐ LCD/SMART STUD. SEMINARS ☐ ADD-ON
BOARDS COURSES

☑ ASSIGNMENTS STUD. SEMINARS ☑ TESTS/MODEL ☑ UNIV.
EXAMS EXAMINATION
☐ STUD. LAB ☐ STUD. VIVA ☐ MINI/MAJOR ☐
PRACTICES PROJECTS CERTIFICATIONS
COURSES
☑ ASSESSMENT OF COURSE OUTCOMES ☑ STUDENT FEEDBACK ON FACULTY
(BY FEEDBACK, ONCE) (TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS ☐ OTHERS
BY EXT. EXPERTS
NITHIN BABU Dr. Jobin K Antony (Faculty)

(HOD)

HS200 Business Economics

PROGRAMME: COMPUTER SCIENCE & DEGREE: B.TECH
ENGINEERING , ELECTRONICS AND
COMMUNICATION ENGINEERING
COURSE: BUSINESS ECONOMICS SEMESTER: 3 CREDITS: 3
COURSE CODE: HS200 COURSE TYPE: CORE
REGULATION: 2017
COURSE AREA/DOMAIN: CONTACT HOURS: 3-0-0
APPLIED ECONOMICS
CORRESPONDING LAB COURSE CODE (IF LAB COURSE NAME: NA
ANY): NIL
SYLLABUS:
UNIT DETAILS HOURS
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
I 4
allocation- Trade-off-opportunity cost-marginal analysis- marginal
utility theory, Law of diminishing marginal utility -production
possibility curve (2 Hrs)
Basics of Micro Economics I Demand and Supply analysis - equilibrium-
elasticity (demand and supply) (3 Hrs.) -Production
II concepts-average product-marginal product-law of variable 6
proportions- Production function-Cobb Douglas function-problems
(3 Hrs.)
FIRST INTERNAL EXAM
Basics of Micro Economics II Concept of costs-marginal, average,
fixed, variable costs-cost curves-shut down point-long run and short
III run (3 Hrs.)- Break Even Analysis-Problem-Markets-Perfect 8
Competition, Monopoly and Monopolistic Competition, Oligopoly - Cartel
and collusion (3 Hrs.)
Basics of Macro Economics - Circular flow of income-two sector
and multi-sector models- National Income Concepts-Measurement
IV methods -problems-Inflation, deflation (4 Hrs.)-Trade cycles-Money - 9
stock and flow concept-Quantity theory of money-Fischer’s Equation
and Cambridge Equation -velocity of circulation of money-credit

control methods-SLR, CRR, Open Market Operations-Repo and

Reverse Repo rate-emerging concepts in money-bit coin (4 Hrs.)
SECOND INTERNAL EXAM
Business Decisions I-Investment analysis-Capital Budgeting-NPV,
IRR, Profitability Index, ARR, Payback Period (5 Hrs.)- Business
V
decisions under certainty-uncertainty-selection of alternatives-risk
And sensitivity- cost benefits analysis-resource management (4 Hrs.).
Business Decisions II Balance sheet preparation-principles and
Interpretation- forecasting techniques (7 Hrs.)-business financing
VI sources of capital- Capital and money markets-international 9
financing-FDI, FPI, FII-Basic Principles of taxation-direct tax,
Indirect tax-GST (2 hrs.)
TOTAL HOURS 36

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:
To familiarize the prospective engineers with elementary Principles of Economics and

1
Business Economics.
To acquaint the students with tools and techniques that are useful in their profession in
2
Business Decision Making which will enhance their employability;
3 To apply business analysis to the “firm” under different market conditions;
To apply economic models to examine current economic scenario and evaluate policy
4
options for addressing economic issues
To gain understanding of some Macroeconomic concepts to improve their ability to
5
understand the business climate;
6 To prepare and analyse various business tools like balance sheet, cost benefit analysis

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
Students will be able to analyse the basic macro – economic concepts and
3
monetary theory
Students will be able to build up decision making skill under uncertain business
4
climate
Students will be able to develop their professional skills by combining their
5
technical knowledge with appropriate economic models
Students will be able to understand the basics of financial accounting and
6
relevance of accounting principles
CORSE OUTCOME AND PROGRAMME OUTCOME MAPPING
CO-PO MAPPING
CO/PO
PO PO PO PO PO PO PO PO PO PO 10 PO 11 PO 12
1 2 3 4 5 6 7 8 9
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

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
Students will be able to develop their professional skills by combining their technical
5
knowledge with appropriate economic models
Students will be able to understand the basics of financial accounting and relevance of
6
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
Basic
economic
Knowledge principles
about basic with simple
economics application
concepts analysis
related to under
micro and different
macro conditions.
economics
CO 1
and model Production
building in functions
tally with and Different
engineering types of
economics market
conditions
(Module I, acquainted
II, III)
(Module II,
III)
Problems
introduced in The
such a way Economic concept
that students concepts and mode
start thinking introduced introduc
of solutions at are are hand
Simple to
their best. applicable and weig
Complex
This calls for under huge
problems are
group different applicatio
verified by
decisions situations. Cobb-
themselves
where he/she Hence Dougla
CO 2 hence effective
will share conceptual Producti
interactions
ideas among application function
are made
the respective and Technica
possible.
peer group. Solutions can aspects i
They start be easily Productio
(Module I, V) identified Decision
thinking
beyond pure tree etc
engineering (Module
since I,II,V,VI) (Modul
problems are I,II,V,V
interconnected

(Module I, V)
CO/PO
Cost
analysis
and
Decision
analysis
pertains to
resource
constraints.
Hence the
CO 3 decision
would be
made by
considering
societal
resource
constraints.
(Module II,
V)
Business Improve
decision under decision
certainty and making
Investment
uncertainty skill,
analysis,
calls for interactio
Capital
discussion and
Budgeting,
among the systemat
Business
students and analysis
decisions
arriving at a the
under
feasible problem
certainty and
conclusion. An
uncertainty
CO 4 Contradictions experien
calls for
arises due to that can
analysis and
different levels carried t
interpretation
of thinking. the futur
of data to
This calls for a where
find solutions
systematic student
to complex
analysis and deal wit
problems
presentation real life
of the busines
(Module V) problem. situation
(All
(Module IV,V) Modules
CO/PO
Knowledge Decisions
on Simple under
economic certainty
CO 5 concept and
applicable uncertainty
in a business is a
climate. mapping of
PPC, CDF, feasible

Opportunity solutions
costs, and
Decision identifying
tree etc the best
outcome.
(Module II, Outcomes
V). decided
calls for
modeling
and
prediction
(Module
V, VI)
Project
management
Account involves the
keeping calls student to
for interaction demonstrate The
among knowledge continuo
different about practicin
departments different of technic
and also departments economi
knowledge in a firm and concept
CO 6 about the approach to and its
same. This each applicatio
facilitates departmental leads to a
team work problems experien
and group form a multi
discussions – (Module
disciplinary VI)
(Module V, approach.
VI).
(Module V,
VI)

PROPOSED
SNO DESCRIPTION
ACTIONS
Seminars, Talks,
1 Tax, Indian Economy-some facts about Indian Economy
web sources
2 Relevant Economic problems like 1930 and 2008 recession Talks, web
3 International Economics-WTO-BOP Seminar, FM course
Seminar, Web
4 India’s Economic relation with other countries
sources
Seminar, Web
5. Stock Exchange Market
sources.
6 Cost Engineering Class Lectures
Proposed Actions: Topics beyond Syllabus/Assignment/Industry Visit/Guest Lecturer/Nptel Etc
1 Current Economic policies by RBI and Government of India.

2 Dollar – Rupee Scenario
3 BREXIT
4 Carbon Credit

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
☐ CHALK & TALK ☐ STUD. ASSIGNMENT ☐ WEB RESOURCES ☐LCD/SMART

BOARDS
☐ STUD. SEMINARS ☐ ADD-ON COURSES ☐ ICT ENABLED
CLASSES
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL ☐ UNIV.

EXAMS EXAMINATION
PRACTICES PROJECTS
☐ ADD-ON ☐ OTHERS ☐ GROUP
COURSES DISCUSSION(IV)
☐ ASSESSMENT OF COURSE OUTCOMES (BY ☐ STUDENT FEEDBACK ON FACULTY

☐ ASSESSMENT OF MINI/MAJOR PROJECTS ☐ OTHERS
BY EXT. EXPERTS
Lekshmi Vijayakumar & Saritha V Dr. Antony T Varghese
(Faculty) (HOD)

CS231 Data Structures Lab

PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH
COURSE: DATA STRUCTURES LAB SEMESTER: III CREDITS: 1
REGULATION: 2016
COURSE AREA/DOMAIN: PROGRAMMING, DATA CONTACT HOURS: 3 Lab hours/Week.
STRUCTURES AND ALGORITHMS
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.**

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

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.

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.

(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.
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,

Cengage Learning, 2005.
B101- Introduction to Computing and Fundamentals of Python programming S1

05 Problem Solving
Fundamentals of C programming language Bridge Course
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

PO PO PO PO PO PO PO PO PO P0 PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 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

CS231
CS - - 3 1 - - - - - - - - 2 - 2
231(overa
ll level)

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

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

1 AVL TREES
2

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
 CHALK & TALK  STUD. ASSIGNMENT  WEB RESOURCES
 LCD/SMART BOARDS STUD. SEMINARS ADD-ON COURSES
ASSIGNMENTS STUD. SEMINARS  TESTS/MODEL EXAMS  UNIV. EXAMINATION
 STUD. LAB PRACTICES  STUD. VIVA MINI/MAJOR PROJECTS CERTIFICATIONS
ADD-ON COURSES OTHERS
 ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE)  STUDENT FEEDBACK ON FACULTY (TWICE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS OTHERS
Ms. Anita John (H.O.D)

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
Polynomial Addition and
4 1 30-Aug-16 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
Sorting- Bubble, Insertion and
9 1 18-Oct-16 Selection
Recursive and Non Recursive
10 1 25-Oct-16 Quick Sort
Recursive and Non Recursive
11 1 01-Nov-16 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

CS233 Electronics Circuits Lab

PROGRAMME: Computer Science & DEGREE: BTECH
Engineering
COURSE: Electronic Circuits Lab SEMESTER: S3 CREDITS: 4
COURSE CODE: CS233 COURSE TYPE: CORE/ELECTIVE /
REGULATION: 2015 BREADTH/ S&H
COURSE AREA/DOMAIN: ELECTRONICS CONTACT HOURS: 3 (Lab) hours/Week.
CORRESPONDING LAB COURSE CODE LAB COURSE NAME:
(IF ANY):
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 3

of parameter
3 RC integrating and differentiating circuits-Transient response with 3
different time constant
RC low pass and high pass circuits- Frequency response with sinusoidal
4 3
input
5 Clipping circuits (Positive, negative and biased) - Transient and transfer 3

characteristics
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

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 3
software(Transient, AC and DC analysis)
TOTAL HOURS 42
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 /
EC100 Basics of Electronics Engineering Students should know about basic 2
electronics components like BJT,
diode, Resistor etc & its working
CS207 Electronic Devices and Circuits Student will know about working of 3
Clipper, Clamper and Multi-vibrator
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.

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

CO MAPPING WITH PO, PSO

PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO PO PO PO PO PO PSO PSO PSO
7 8 9 10 11 12 1 2 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.
PO PO PO PO PO PO PO PO PSO PSO PSO
PO1 PO2 PO3 PO4 5 6 7 8 9 10 11 12 1 2 3
Exper
Mod iment
Analysi ern s are
s and Design Design simu done
operatio of of latio in
n of wavefor wavefor n teams
clipper m m tools of 3
Clipper circuit shaping, shaping, – Devel mem Practical
and require level level pspi opmen bers Writing Program skill
clamper sound shifting shifting ce, t of colla lab ming develope
circuits knowle and and tina produc borati records for d
are used dge of noise noise ti ts for ng to to modelin through
in enginee removal removal can health produ commu g in experime
electroni ring applicat applicati be and ce nicate pspice ntation in
CO1 c circuit science ion on used safety result results & tina ti the lab
Analysi Mod Devel Learn Exper Design Practical
s and Design Design ern opmen to iment Writing can be Program skill
Op-amp operatio of of simu t of develo s are lab altered ming develope
circuits n of op- circuits circuits latio produc p done records to for d
are used amp for for n ts for produ in to meet modelin through
in circuit amplifyi amplifyi tools health cts teams commu the g in experime
electroni require ng ng – and accord of 3 nicate specifi pspice ntation in
CO2 c circuit sound signals signals pspi safety ing to mem results cations & tina ti the lab

knowle ce, the bers

dge of tina norms colla
enginee ti of borati
ring can engine ng to
science be ering produ
used practic ce
e result
Exper
Mod iment Expo
Analysi ern s are sure
s and simu done to
operatio latio in comp
n of n teams onent
multi- tools of 3 select Muli-
vibrator – Devel mem ion Design vibrator Practical
Multivib require Is used pspi opmen bers Writing and s circuits Program skill
rator sound to ce, t of colla lab econo evolve are ming develope
circuits knowle Design generate tina produc borati records mical with incopor for d
are used dge of of clock, ti ts for ng to to produ techno ated in modelin through
in signal enginee multi- triggerin can health produ commu ct logical compute g in experime
generato ring vibrator g pulse be and ce nicate desig advanc r pspice ntation in
CO3 rs science circuits signals used safety result results n ements products & tina ti the lab
Devel Exper
opmen iment
Analysi t of s are
s and oscilla done
operatio tor for in
n of transm teams
oscillat Oscillato ission of 3 Oscillat
or r are circuit mem or
Oscillato require used to will bers Writing circuits Program
r sound Design generate follow colla lab are ming
circuits knowle of sine carrier enviro borati records incorpor for
are used dge of wave signals nment ng to to ated in modelin
in signal enginee generati for al produ commu commu g in
generato ring on transmis regulat ce nicate nication pspice
CO4 rs science circuits sion ions result results products & tina ti

Analysi Devel Exper

s and Mod opmen iment Expo
operatio ern t of s are sure
n of simu power done to
diode latio suppli in comp
and n es and teams onent
filter tools regulat of 3 select
circuit Design – Devel ors mem ion Design Practical
Diode require of filter, pspi opmen will bers Writing and s Develop Program skill
and RC sound integrato ce, t of follow colla lab econo evolve ment of ming develope
circuits knowle r, tina produc enviro borati records mical with power for d
are used dge of different ti ts for nment ng to to produ techno supplies modelin through
in enginee Design iator, can health al produ commu ct logical and g in experime
electroni ring of filter regulator be and regulat ce nicate desig advanc regulato pspice ntation in
CO5 c circuit science circuits circuits used safety ions result results n ements rs & tina ti the lab

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION

REQUIREMENTS:
SNO DESCRIPTION PROPOSED PO MAPPING
ACTIONS
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

S DESCRIPTION PO MAPPING
No:
1 To learn TINA TI software by simulating the 1, 2, 3, 4, 5, 6
circuits in the syllabus and this will help the
students to perform well in the lab also.
DESIGN AND ANALYSIS TOPICS:

Sl. DESCRIPTION PO MAPPING
No.
1 Design & analysis of RC coupled amplifier 1, 2, 3, 4, 5, 9,
10

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
☑ CHALK & TALK ☑ STUD. ☐ WEB
☑ LCD/SMART ☐ STUD. ☐ ADD-ON
BOARDS SEMINARS COURSES
☑ ASSIGNMENTS ☐ STUD. ☑ TESTS/MODEL ☐ UNIV.
☑ STUD. LAB ☑ STUD. VIVA ☐ MINI/MAJOR ☐
PRACTICES PROJECTS CERTIFICATIONS
COURSES

☑ ASSESSMENT OF COURSE OUTCOMES ☑ STUDENT FEEDBACK ON
(BY FEEDBACK, ONCE) FACULTY (TWICE)
☐ ASSESSMENT OF MINI/MAJOR ☐ OTHERS
PROJECTS BY EXT. EXPERTS
Abhishek Viswakumar Dr. Jobin K Antony

Rinju Mariam Rolly (HOD)
Karunkara P Menon
(Faculty in Charges)

S3CSEHand Out

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

S3CSEHand Out

Uploaded by

Copyright:

Available Formats

COURSE HAND-OUT

KTU B.TECH. - SEMESTER III

DEPARTMENT OF COMPUTER SCIENCE

RAJAGIRI SCHOOL OF ENGINEERING AND

TO EVOLVE INTO A PREMIER TECHNOLOGICAL AND RESEARCH INSTITUTION,

TO IMPART STATE-OF-THE-ART KNOWLEDGE TO INDIVIDUALS IN VARIOUS

Department of CSE, RSET 2

DEPARTMENT OF COMPUTER SCIENCE AND

TO BECOME A CENTRE OF EXCELLENCE IN COMPUTER SCIENCE &

TO INSPIRE AND NURTURE STUDENTS, WITH UP-TO-DATE KNOWLEDGE IN

Department of CSE, RSET 3

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

PROGRAMME OUTCOMES (POs)

a. An ability to apply mathematical foundations, algorithmic principles, and computer

Department of CSE, RSET 4

k. An ability to engage in life-long learning and to engage in continuing professional

SCHEME: B.TECH 3RD SEMESTER 6

Department of CSE, RSET 5

SCHEME: B.TECH 3RD SEMESTER

Course Code Course Name L-T-P Credits Exam Slot

Department of CSE, RSET 6

MA201 Linear Algebra & Complex Analysis

COURSE INFORMATION SHEET

III Array processors - SIMD array processors - Interconnection networks - Static vs

Department of CSE, RSET 7

Geometry of Analytic functions,conformal mapping,Mapping w=z^2,conformality of w=e^z

III Complex Integration 10

Department of CSE, RSET 8

V Linear system of equations 9

Linear system of equations,Coefficient matrix,Augmented matrix,Gauss Elimination

Determination of Eigen values and Eigen vectors,Eigen space,Symmetric

CO1 Students will understand about complex numbers and functions

Department of CSE, RSET 9

Basic knowledge Complex

Department of CSE, RSET 10

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN

Department of CSE, RSET 11

Application of analytic functions in Engineering

Application of Complex integration in Engineering

Department of CSE, RSET 12

CS201 Discrete Computational Structures

II Review of Permutations and combinations, Principle of inclusion exclusion, Pigeon Hole 9

III Algebraic systems (contd…):- 8

IV Lattices and Boolean algebra :- 10

Department of CSE, RSET 13

Department of CSE, RSET 14

SiNO DESCRIPTION Blooms’

CO-PO AND CO-PSO MAPPING

JUSTIFICATIONS FOR THE MAPPING

Department of CSE, RSET 15

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

Department of CSE, RSET 16

WEB SOURCE REFERENCES:

Meenu Mathew Shimmi Asokan

Department of CSE, RSET 17

Department of CSE, RSET 18

Department of CSE, RSET 19

Department of CSE, RSET 20

CS203 Switching Theory and Logic Design

COURSE INFORMATION SHEET

II Introduction — Postulates of Boolean algebra – Canonical and Standard Forms — logic