Outcome Attainment

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

AND ENGINEERING
Semester V, 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 5TH SEMESTER 6

CS301 Theory of Computation 7
COURSE INFORMATION SHEET 7
CS303 System Software 12
CS305 Microprocessors and Microcontrollers 16
CS307 Data Communication 19
CS309 Graph Theory and Combinatorics 22
CS361 Soft Computing 26
CS365 Optimization Techniques 30
CS367 Logic for Computer Science 34
CS341 Design Project 38
CS331 System Software Lab 42
CS333 Application Software Development Lab 46

SCHEME: B.TECH 5TH 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

CS301 Theory of 3-1-0 4 A
Computation
CS303 System Software 2-1-0 3 B
CS305 Microprocessors 2-1-0 3 C
and
Microcontrollers
CS307 Data 3-0-0 3 D
Communication
CS309 Graph Theory and 2-0-2 3 E
Combinatorics
Elective 1 3-0-0 3 F
CS341 Design Project 0-1-2 2 S
CS331 System Software 0-0-3 1 T
Lab
CS333 Application 0-0-3 1 U
Software
Development Lab
Total Credits = 23 Hours: 29
Cumulative Credits= 117

CS301 Theory of Computation
COURSE INFORMATION SHEET

PROGRAMME : COMPUTER SCIENCE & DEGREE : BTECH
ENGINEERING
COURSE: THEORY OF COMPUTATION SEMESTER : IV CREDITS : 4
COURSE CODE : CS 301 COURSE TYPE : CORE
REGULATION : 2016
COURSE AREA/DOMAIN : Theoretical CONTACT HOURS : 3+1 (Tutorial)
Computer Science hours/Week.
CORRESPONDING LAB COURSE CODE (IF LAB COURSE NAME: NA
ANY): NA
SYLLABUS:
UNIT DETAILS HOURS
I Introduction to Automata Theory and its significance. Type 3 Formalism: 10
Finite state automata – Properties of transition functions, Designing finite
automata, NFA, Finite Automata with Epsilon Transitions, Equivalence of
NFA and DFA, Conversion of NFA to DFA, Equivalence and Conversion
of NFA with and without Epsilon Transitions.
II 10
Myhill-Nerode Theorem, Minimal State FA Computation. Finite State
Machines with Output- Mealy and Moore machine (Design Only), Two-
Way Finite Automata.
Regular Grammar, Regular Expressions, Equivalence of regular
expressions and NFA with epsilon transitions. Converting Regular
Expressions to NFA with epsilon transitions Equivalence of DFA and
regular expressions, converting DFA to Regular Expressions.
III Pumping Lemma for Regular Languages, Applications of Pumping Lemma. 9
Closure Properties of Regular sets (Proofs not required), Decision Problems
related with Type 3 Formalism
Type 2 Formalism:- Context-Free Languages (CFL), Context-Free Grammar
(CFG), Derivation trees, Ambiguity, Simplification of CFG, Chomsky
Normal Form, Greibach normal forms
IV Non-Deterministic Pushdown Automata (NPDA), design. Equivalence of 8

acceptance by final state and empty stack in PDA. Equivalence between
NPDA and CFG, Deterministic Push Down Automata, Closure properties of
CFLs (Proof not required), Decision Problems related with Type 3
Formalism.
V Pumping Lemma for CFLs, Applications of Pumping Lemma. 9
Type 1 Formalism: Context-sensitive Grammar. Linear Bounded Automata
(Design not required)
Type 0 Formalism: Turing Machine (TM) – Basics and formal definition,
TMs as language acceptors, TMs as Transducers, Designing Turing
Machines.
VI Variants of TMs -Universal Turing Machine, Multi- tape TMs, Non 8

Deterministic TMs, Enumeration Machine (Equivalence not required),

Recursively Enumerable Languages, Recursive languages, Properties of
Recursively Enumerable Languages and Recursive Languages, Decidability
and Halting Problem. Chomsky Hierarchy
TOTAL HOURS 54
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T John E Hopcroft, Rajeev Motwani and Jeffrey D Ullman, Introduction to Automata
Theory, Languages, and Computation, 3/e, Pearson Education, 2007
T John C Martin, Introduction to Languages and the Theory of Computation, TMH, 2007
T Michael Sipser, Introduction To Theory of Computation, Cengage Publishers, 2013
R Dexter C. Kozen, Automata and Computability, Springer1999
R K.L.P. Mishra, N. Chandrashekharan , Theory of Computer Science , Prentice Hall of India
R Harry R Lewis, Christos H Papadimitriou, Elements of the theory of computation,
Pearson Education Asia.
R RajendraKumar,Theory of Automata Language &Computation,Tata McGraw Hill,New
Delhi,2010
R Wayne Goddard, Introducing Theory of Computation, Jones & Bartlett India,New Delhi2010
R Bernard M Moret: The Theory of Computation, Pearson Education
R Raymond Greenlaw,H. James Hoover, Fundamentals of Theory of
Computation,Elsevier,Gurgaon,Haryana,2009
R Kamala Krithivasan, Rama R, Introduction to Formal Languages,Automata Theory and
Computation, Pearson Education Asia,2009
R Rajesh K. Shukla, Theory of Computation, Cengage Learning, New Delhi,2009
R K V N Sunitha, N Kalyani: Formal Languages and Automata Theory, Tata McGraw Hill,New
Delhi,2010
R S. P. Eugene Xavier, Theory of Automata Formal Language &Computation,New Age
International, New Delhi ,2004
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
CS201 Discrete Computational Structures Basics of Discrete Mathematics- Sets and 3
Relations
COURSE OBJECTIVES:
1 To discuss the Chomsky classification of formal languages with discussion on grammar and
automata for regular, context-free, context sensitive and unrestricted languages.
2 To discuss the Chomsky classification of formal languages with discussion on grammar
and automata for regular, context-free, context sensitive and unrestricted languages
3 To discuss the notions of decidability and halting problem
COURSE OUTCOMES:

SL. DESCRIPTION Blooms’

NO. Taxonomy Level
C404.1 Students will be able to define the mathematical principles behind Knowledge (level1)
theoretical computer science.
C404.2 Students will be able to differentiate and give examples for the different Understand, Analyze
types of automata like finite automata, push down automata, linear (level 2 and 4)
bounded automata and turing machine.
C404.3 Students will be able to correlate the different types of automata to real Analyze (level 4)
world applications.
C404.4 Students will be able to choose and design appropriate automata for the Evaluate (level 5 )
different requirements outlined by theoretical computer science.
C404.5 Students will be able to identify the different computational problems Understand
and their associated complexity. (level 2)
CO-PO AND CO-PSO MAPPING

PO PO PO PO PO PO PO PO PO PO PO PO PSO1 PSO2 PSO3
1 2 3 4 5 6 7 8 9 10 11 12
C404. 1 1 _ _ _ _ _ _ _ _ _ _ _ _ _
1
C404. _ 2 3 3 _ _ _ _ _ _ _ _ 2 _ _
2
C404. _ 2 3 _ _ _ _ _ _ _ _ _ 2 _ _
3
C404. _ 3 3 2 _ _ _ _ _ _ _ _ 1 _ _
4
C404. 2 2 2 1 _ _ _ _ _ _ _ _ 1 _ _
5
JUSTIFICATIONS FOR CO-PO/PSO MAPPING

MAPPING LOW/MEDIUM/HIGH JUSTIFICATION
C404.1-PO1 L The knowledge of mathematical principles will help the students to
apply the same to formulate solutions for engineering problems.
C404.1-PO2 L The knowledge of mathematical principles will help the students to
apply the same to identify and analyze engineering problems.
C404.2-PO2 M Understanding of different automata will help to review and
analyze engineering problems.
C404.2-PO3 H Thorough understanding of different types of automata will help in
the design and development of abstract models for computational
problems.
C404.2-PO4 H Study of automata with examples will help in conducting detailed
investigation of complex engineering problems.
C404.2-PSO1 M Understanding of different types of automata will aid in design of
real time algorithms for complex problems

C404.3-PO2 M Correlating the study of automata to real world applications will

aid in formulating engineering problems with similar background
and arriving at with solutions
C404.3-PO3 H The real world application study of automata will help to design
and develop solutions of similar kind engineering problems
C404.3-PSO1 M Correlating the real world applications of automata to other
computational problems will help in designing and analyzing the
same
C404.4-PO2 H Detailed analytical and evaluative study of automata with help in
identification, formulation and finding feasible solutions for real
world computational problems
C404.4-PO3 H An evaluative knowledge of automata will help in applying the
same while designing and developing solutions to computational
problems
C404.4-PO4 M Evaluative learning of different type of automata will help in
analysis and synthesis of real time computational problems.
C404.4-PSO1 L Evaluative learning of different types of automata will help in
finding an abstract model for algorithms developed
C404.5-PO1 M Understanding the different categories of basic computational
problems will aid in applying the knowledge to find solutions of
complex problems
C404.5-PO2 M Different computational problems can be identified, formulated,
reviewed and conclusions can be reached, when we are aware of
the basic computational problems
C404.5-PO3 M Complexity study of the basic computational problems will help in
design and development of solutions for real time computational
problems.
C404.5-PO4 L Study of computational problems and their associated complexity
will help to provide valid conclusions of real time computational
problems.
C404.5-PSO1 L Students will be able to identify the complexity associated with the
computational problems while providing an implementation of the
same
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

SNO DESCRIPTION PROPOSED
ACTIONS
1 Characterization of computability functions NPTEL Video
Lectures
2 Decision problems and their relationship to model of computations NPTEL Video

Lectures
3 Parsing and Ambiguity of CFG Assignment
4 CFG and programming Topics Beyond

Syllabus

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN

1 Recursive Languages, Recursive Enumerable Languages
2 CFG and programming
3 Different Models of Turing Machines, Combinations of Turing Machines
WEB SOURCE REFERENCES:

1 http://nptel.iitm.ac.in/courses/106106049/
2 http://nptel.iitm.ac.in/courses/106104028/
3 http://www.cse.iitb.ac.in/~supratik/courses/cs331/
4 http://freevideolectures.com/Course/3045/Theory-of-Computation-I
5 http://www.comp.nus.edu.sg/~sanjay/cs4232.html
6 http://www.cs.toronto.edu/~pmccabe/csc236-2006s
7 http://www.cse.iitd.ernet.in/~ssen/csl705
8 http://www.eecs.yorku.ca/course_archive/2012-13/S/2001
9 http://sydney.edu.au/engineering/it/~comp3310/tutorials.html
10 http://www.nuim.ie/courses/?Target=MODULE&Mode=VIEW&MODULE_CODE=CS355
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, ☐ STUDENT FEEDBACK ON FACULTY (TWICE)
ONCE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. ☐ OTHERS
EXPERTS
Prepared by Approved
by
(Mary Priya Sebastian)
(HOD)

CS303 System Software

PROGRAMME: COMPUTER SCIENCE & DEGREE: BTECH
ENGINEERING
COURSE: SYSTEM SOFTWARE SEMESTER: III CREDITS: 4
COURSE CODE: CS303 REGULATION: 2016 COURSE TYPE: CORE
COURSE AREA/DOMAIN: SYSTEM SOFTWARE CONTACT HOURS: 2+1 (Tutorial) hours/Week.
CONCEPTS
CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME: SYSTEM SOFTWARE
CS331 LAB
SYLLABUS:
I Introduction : System Software Vs. Application Software, Different System Software– 8
Assembler, Linker, Loader, Macro Processor, Text Editor,
Debugger, Device Driver, Compiler, Interpreter, Operating System(Basic Concepts only) SIC
& SIC/XE Architecture, Addressing modes, SIC & SIC/XE Instruction set, Assembler
Directives and Programming.
II Assemblers Basic Functions of Assembler. Assembler output format – Header, Text and End 6
Records- Assembler data structures, Two pass assembler algorithm, Hand assembly of
SIC/XE program, Machine dependent assembler features.
III Assembler design options: Machine Independent assembler features – program blocks, 7
Control sections, Assembler design options- Algorithm for Single Pass assembler, Multi pass
assembler, Implementation example of MASM Assembler
IV Assembler design options: Machine Independent assembler features – program blocks, 7
Control sections, Assembler design options- Algorithm for Single Pass assembler, Multi pass
assembler, Implementation example of MASM Assembler
V Macro Preprocessor:- Macro Instruction Definition and Expansion. One pass Macro processor 7
Algorithm and data structures, Machine Independent Macro Processor Features, Macro
processor design options
VI Device drivers: Anatomy of a device driver, Character and block device drivers, General 8
design of device drivers
Text Editors: Overview of Editing, User Interface, Editor Structure.
Debuggers :- Debugging Functions and Capabilities, Relationship with other parts of the
system, Debugging Methods- By Induction, Deduction and Backtracking.
TOTAL HOURS 43
T Leland L. Beck, System Software: An Introduction to Systems Programming, 3/E, Pearson
Education Asia, 1997.
R http://gcc.gnu.org/onlinedocs/gcc-2.95.3/cpp_1.html - The C Preprocessor
R Systems Programming and Operating Systems – D.M. Dhamdhere, Tata McGraw Hill Second
Revised Edition.
R Writing UNIX device drivers - George Pajari -Pearson Education Asia.
R Systems Programming – John J. Donovan, Tata McGraw Hill Edition 1991

R System Software – J Nithyashri –Second Edition- Tata McGraw Hill

R Jonathan Corbet, Alessandro Rubini, Greg Kroah-Hartman, Linux Device Drivers, Third
Edition, O.Reilly Books
R M. Beck, H. Bohme, M. Dziadzka, et al., Linux Kernel Internals, Second Edition, Addison
Wesley Publications
R Peter Abel, IBM PC Assembly Language and Programming, Third Edition, Prentice Hall of
India.
COURSE PRE-REQUISITES: Nil
COURSE OBJECTIVES:
1 To make students understand the design concepts of various system software like Assembler,
Linker, Loader and Macro pre-processor, Utility Programs such as Text Editor and Debugger.
COURSE OUTCOMES:
SNO DESCRIPTION LEVEL
1 Students will be able to distinguish different software into Level 2

different categories.
2 Students will be able to design, analyze and implement one Level 3 and 4
pass, two pass or multi pass assembler
3 Students will be able to design, analyze and implement Level 3 and 4
loader and linker.
4 Students will be able to design, analyze and implement Level 3 and 4

macro processors
5 Students will be able to critique the features of modern Level 5
editing /debugging tools.

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
C603.1 3 1 _ _ _ _ _ _ _ _ _ _ 1 _ _
C603.2 3 3 _ _ _ _ _ _ _ _ _ _ 1 _ _
C603.3 2 2 _ _ _ _ _ _ _ _ _ _ 2 _ _
C603.4 2 2 _ _ _ _ _ _ _ _ _ 1 1 _
C603.5 3 2 _ _ _ _ _ _ _ _ _ - _ _
C603 2 2 - - - - - - - - 2 - -
(overall
level)
JUSTIFICATIONS FOR THE MAPPING

Mapping LOW/MEDIUM/ Justification
HIGH
C603.1-PO1 H They can identify the softwares using the concepts learnt
C603.1-PO2 L They can analyse and explain the working of the existing

softwares.
C603.2-PO1 H They can analyze the functioning of an assembler
C603.2-PO2 H They can explain the variants of the existing one using the
concepts learnt
C603.3-PO1 M Algorithms learnt can be extrapolated to create new system
softwares
C603.3-PO2 M Algorithms learnt can be used to design new loading schemes
C603.4-PO1 M Algorithms can be formulated using engineering principles
C603.4-PO2 M Algorithms formulated can be converted into code using suitable

programming languages
C603.5-PO1 H They can identify and explain the softwares for the new
advancements in the field.
C603.5-PO2 M They can identify and explain the softwares for the new
advancements in the field.
C603.1-PSO1 L They can identify and analyse the softwares
C603.2-PSO1 L Identify the existing softwares and also explain their working
C603.3-PSO1 M Design solutions for the softwares that are required by the
system
C603.4-PSO1 L Write algorithms and also decide on the various concepts of
programming
C603.4-PSO2 L Suitable programming strategies can be applied to convert the
algorithms to programs

ACTIONS
1 Automated Tools available for debugging are not covered SEMINARS
2 Writing UNIX device drivers WORKSHOPS
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

1 Detailed study of structure and record formats of DLL.
2 Elaborate commands used in VI text editors.

1 C Preprocessor-http://gcc.gnu.org/onlinedocs/gcc-2.95.3/cpp_1.html The C Preprocessor
2 LINUX Device Drivers-
www.latech.edu/~box/os/linuxdd.ppt+device+drivers+ppt&cd=1&hl=en&ct=clnk&gl=in
3 Debugging Techniques- http://lwn.net/images/pdf/LDD3/ch04.pdf
4 UNIX ELF-http://www.skyfree.org/linux/references/ELF_Format.pdf

 CHALK &  STUD.  WEB

TALK ASSIGNMENT RESOURCES
 LCD/SMART ☐ STUD. SEMINARS ☐ ADD-ON
BOARDS COURSES
 ASSIGNMENTS  STUD.  TESTS/MODEL  UNIV.
SEMINA EXAMS EXAMINA
RS TION
STUD. LAB PRACTICES  STUD. MINI/MAJOR PROJECTS ☐
VIVA CERTIFICATIONS
 ASSESSMENT OF COURSE OUTCOMES ☐ STUDENT FEEDBACK ON FACULTY
(BY FEEDBACK, ONCE) (ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY ☐ OTHERS
EXT. EXPERTS
Prepared by Approved by
Meenu Mathew Shimmi Asokan

Assistant Professor, DCS HOD, DCS

CS305 Microprocessors and Microcontrollers

PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: B.TECH
COURSE: CS 305 MICROPROCESSOR AND SEMESTER: V CREDITS: 3
MICROCONTROLLERS
COURSE CODE : CS 305 COURSE TYPE: CORE

REGULATION: 2016
COURSE AREA/DOMAIN:COMPUTER HARDWARE CONTACT HOURS: 2+12 (Tutorial) hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME:
SYLLABUS:
UNIT DETAILS HOURS
I Evolution of microprocessors, 8086 Microprocessor - Architecture and signals, Memory organization, Minimum 7
and maximum mode of operation, Minimum mode Timing Diagram. Comparison of 8086 and 8088.
II 8086 Addressing Modes, 8086 Instruction set and Assembler Directives - Assembly Language Programming with 8
Subroutines, Macros, Passing Parameters, Use of stack.
III Interrupts - Types of Interrupts and Interrupt Service Routine. Handling Interrupts in 8086, Interrupt 7
programming. Basic Peripherals and their Interfacing with 8086 - Programmable Interrupt Controller - 8259 -
Architecture.
IV Interfacing Memory, I/O, 8255 - Detailed study - Architecture, Control word format and modes of operation, 7
Architecture and modes of operation of 8279 and 8257 (Just mention the control word, no need to memorize the
control word format)
V Microcontrollers - Types of Microcontrollers – Criteria for selecting a microcontroller - Example 8
Applications. Characteristics and Resources of a microcontroller. Organization and design of these
resources in a typical microcontroller - 8051. 8051 Architecture, Register Organization, Memory and
I/O addressing, Interrupts and Stack.
VI 8051 Addressing Modes, Different types of instructions and Instruction Set, Simple programs. 8
Peripheral Chips for timing control - 8254/8253.
TOTAL HOURS 45
T Bhurchandi and Ray, Advanced Microprocessors and Peripherals, Third Edition ,McGraw Hill.
T Raj Kamal, Microcontrollers: Architecture, Programming, Interfacing and System Design, Pearson Education.
Douglas V. Hall, SSSP Rao, Microprocessors and Interfacing, Third Edition, McGrawHill Education.
T
R Barry B. Brey, The Intel Microprocessors – Architecture, Programming and Interfacing, Eigth Edition, Pearson Education.
R A. NagoorKani, Microprocessors and Microcontrollers, Second Edition, Tata McGraw Hill.
BE 101-05 Introduction to Computing and Problem Solving I
CS203 Switching Theory and Logic Design III
CS202 Computer Organization and Architecture IV
COURSE OBJECTIVES:
1 To impart basic understanding of the internal organization of 8086 Microprocessor and 8051
microcontroller.
2 To introduce the concepts of interfacing microprocessors with external devices.

3 To develop Assembly language programming skills.
COURSE OUTCOMES:
Sl.No. CO.No. DESCRIPTION BLOOMS

TAXONOMY
1. CS305.1 Student is able to describe different modes of operations Level 2
of a typical microprocessor.
2. CS305.2 Student is able to design and develop 8086 assembly Level 3,6
language programs using software interrupts and various
assembler directives.
3. CS305.3 Student is able to develop Interface microprocessors with Level 2, 4
various external devices.
4. CS305.4 Student is able to analyze and compare the features of Level 4

microprocessors and microcontrollers.
5. CS305.5 Student is able to design and develop assembly language Level 3,6
programs using 8051 microcontroller.

PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO
CS305.1 1 - - - - - - - - - - - 1 - 3
CS305.2 - 2 - - - - - - - - - - 1 - 3
CS305.3 - - 3 - - - - - - - 3 - 1
CS305.4 - 2 - - - - - - - - - - - 1 2
CS305.5 1 - - 3 - - - - - - - - 2 3 2
CS305
(Overall
attainment)
JUSTIFICATIONS FOR CO-PO MAPPING

Mapping Low/Medium/High Justification
CS305.1-PO1 L They could apply the knowledge acquired to describe the concepts of
microprocessor based systems.
CS305.2- PO2 M Understanding the concepts of various microprocessors and so they
can compare between the different processors.
CS305.3-PO3 H Understanding the details will help in analyzing and interpreting the
various components in motherboard.
CS305.4-PO4 M Understanding the concept of data storage and its types
CS305.5-PO5 L Studies about the various instructions in 8086.
CS305.5-PO5 H Understands and writes programs with 8086.

SNO DESCRIPTION PROPOSED PO
ACTION MAPPING
1 Case study on various processors of different vendors like motorolla, intel Assignment PO3,

etc. PO4,
PO5
2 Comparative study of hardware definition languages like VHDL, Verilog Reading PO1,
and Blue Spec. Assignment PO3,
PO5
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/
GUEST LECTURER/NPTEL ETC

SNO DESCRIPTION PO
MAPPING
1 Design of simple circuits using VHDL PO3,
PO4,
PO5
2 Analyzing the timing diagram of circuits designed using VHDL PO1,
PO3,
PO5

1 http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-
KANPUR/microcontrollers/micro/ui/Course_home4_31.htm
2 http://elearning.vtu.ac.in/13/ENotes/8086/unit%201.pdf
3 http://cva.stanford.edu/people/davidbbs/classes/ee108a/winter0607%20labs/ee108a_nham_intro_to_verilog.
pdf
4 http://www.cse.yorku.ca/~roumani/verimips/VM_Roumani/LabK.pdf
 CHALK & TALK STUD. ASSIGNMENT  WEB RESOURCES
 LCD/SMART BOARDS  STUD. SEMINARS ☐ ADD-ON COURSES
 ASSIGNMENTS  STUD.  TESTS/MODEL  UNIV.
SEMINARS EXAMS EXAMINATION
 STUD. LAB  STUD. VIVA ☐ MINI/MAJOR ☐
PRACTICES PROJECTS CERTIFICATIONS
☐ ADD-ON ☐ OTHERS
COURSES
 ASSESSMENT OF COURSE OUTCOMES (BY  STUDENT FEEDBACK ON FACULTY (ONCE)
FEEDBACK, ONCE)
EXPERTS
Prepared by Approved
by
Tripti C
Meera M (HOD)
(H.O.D)

CS307 Data Communication

PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH YEAR: JAN 2017
COURSE: DATA COMMUNICATION SEMESTER: V CREDITS: 3
COURSE CODE: CS307 COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H
COURSE AREA/DOMAIN: CONTACT HOURS: 3 hours/Week.
NETWORKING & COMMUNICATION
SYLLABUS:
UNIT DETAILS HOURS
I Data Transmission: Communication model Simplex, half duplex and full duplex transmission -
Periodic
Analog signals: Sine wave, phase, wavelength, time and frequency domain, bandwidth - Digital
Signals;
8
Digital data Transmission:- Analog & Digital data, Analog & Digital signals, Analog &Digital
transmission – Transmission Impairments: Attenuation, Delay distortion, Noise - Channel
capacity: Nyquist Bandwidth, Shannon's Capacity formula.
II Transmission media - Guided Transmission Media: Twisted pair, Coaxial cable, optical fiber,
Wireless 7
Transmission, Terrestrial microwave, Satellite microwave. Wireless Propagation: Ground wave
propagation, Sky Wave propagation, LoS Propagation.
III Signal Encoding techniques - Digital Data Digital Signals: NRZ, Multilevel binary, Biphase - Digital
Data Analog Signals : ASK, FSK, PSK - Analog Data Digital Signals: Sampling theorem, PCM,
Delta 7
Modulation - Analog Data Analog Signals: AM, FM, PM.
IV Multiplexing- Space Division Multiplexing- Frequency Division Multiplexing: Wave length
Division Multiplexing - Time Division multiplexing: Characteristics, Digital Carrier system,
SONET/SDH-Statistical time division multiplexing: Cable Modem - Code Division Multiplexing. 7
Multiple Access– CDMA.
V Digital Data Communication Techniques - Asynchronous transmission, Synchronous transmission-
Detecting and Correcting Errors-Types of Errors-Error Detection: Parity check, Cyclic 6
Redundancy Check (CRC) - Error Control Error Correction: Forward Error Correction and Hamming
Distance.
VI Spread Spectrum Techniques-Direct Sequence Spread Spectrum (DSSS), Frequency Hopping 7
Spread Spectrum (FHSS). Basic principles of switching - Circuit Switched Networks, Structure of
Circuit Switch – Packet Switching: Datagram Networks, Virtual Circuit Networks, Structure of
packet switches.
TOTAL HOURS 42
T 1. William Stallings, Data and Computer Communication 9/e, Pearson Education, Inc.
[Chapters: 4, 5, 6, 7, 8, 9].
2. Forouzan B. A., Data Communications and Networking, 5/e, Tata McGraw Hill, 2013.
[Chapters:3,4, 5, 6,7,8]
3. Schiller J., Mobile Communications, 2/e, Pearson Education, 2009. [Chapters:2,3]
4. Curt M. White, Fundamentals of Networking and Communication 7/e, Cengage learning.
[Chapter 3,4,9,10]
R1 1. Forouzan B. A., Data Communications and Networking, 4/e, Tata McGraw Hill, 2007.
2. Tanenbaum A. S. and D. Wetherall, Computer Networks, Pearson Education, 2013.
BE 101-4 Introduction to Electronics To get a basic knowledge about signals II
Engineering
CS203 Switching Theory and Logic To get a basic knowledge about how multiplexing and III

Design digital logic work
COURSE OBJECTIVES:
1 To introduce fundamental communication models
2 To discuss various time domain and frequency domain concepts of data communication.
3 To introduce the concepts of encoding, multiplexing and spread spectrum.
COURSE OUTCOMES:
Sl.No. CO.No. DESCRIPTION BLOOMS

TAXONOMY
1. CS307.1 The students will be able to identify and list the various issues present in the Level 1
design of a data communication system.
2. CS307.2 The students will be able to apply the time domain and frequency domain Level 3
concepts of signals in data communication.
3. CS307.3 The students will be able to compare and select transmission media based on Level 5
transmission impairments and channel capacity.
4. CS307.4 The students will be able to select and use appropriate signal encoding Level 2
techniques and multiplexing techniques for a given scenario.
5. CS307.5 The students will be able to design suitable error detection and error correction Level 6
algorithms to achieve error free data communication and explain different
switching techniques.

PO P PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
O 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO 1
CS307.1 1 - - - - - - - - - - - 1 - 3
CS307.2 - 2 - - - - - - - - - - 1 - 3
CS307.3 - - 3 - - - - - - - 3 - 1
CS307.4 - 2 - - - - - - - - - - - 1 2
CS307.5 1 - - 3 - - - - - - - - 2 3 2
CS307
(Overall
attainment)

Mapping Low/Medium/High Justification
CS307.1-PO1 L They could apply the knowledge acquired to describe the concepts of
data communication systems.
CS307.2- PO2 M Understanding the concepts of time and frequency domain they can
design appropriate communication systems.
CS307.3-PO3 H They could apply the knowledge acquired to compare the various
transmission mediums.
CS307.4-PO4 M Understanding the concept of signal encoding will help to design
appropriate systems for communication.
CS307.5-PO5 L Studies about the various error detection and correction schemes for
transmission of data.

CS307.5-PO5 H They could apply the concepts of error detection and correction for
creating reliable transmission of data over the network.

1 en.wikipedia.org/wiki/
2 www.w3schools.com/
3 www.w3.org/
4 http://computing.dcu.ie/~humphrys/ca651/index.html
5 http://www.cs.ccsu.edu/~stan/classes/CS490/Slides/Networks4-Ch4-4.pdf
6 http://ecourses.vtu.ac.in/nptel/courses/Webcourse-contents/IIT-MADRAS/ComputerNetworks/pdf/
7 http://www.solarwinds.com/support/tutorials.aspx
 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,  STUDENT FEEDBACK ON FACULTY (ONCE)
ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS OTHERS
Tripti C Ms. Shimmi Asokan
(H.O.D)

CS309 Graph Theory and Combinatorics

PROGRAMME: COMPUTER SCIENCE DEGREE: BTECH
ENGINEERING
COURSE: GRAPH THEORY & SEMESTER: 5 CREDITS: 3
COMBINATORICS
COURSE CODE: CS309 COURSE TYPE: CORE /ELECTIVE /
REGULATION: BREADTH/ S&H
COURSE AREA/DOMAIN: CONTACT HOURS: 4 hours/Week.
CORRESPONDING LAB COURSE CODE : LAB COURSE NAME:
SYLLABUS:
UNIT DETAILS HOURS
I 9
Introductory concepts - What is graph – Application of graphs – finite and
infinite graphs – Incidence and Degree – Isolated vertex, pendent vertex and
Null graph. Paths and circuits – Isomorphism, sub graphs, walks, paths and
circuits, Connected graphs, disconnect graphs.
II Euler graphs, Hamiltonian paths and circuits, Dirac's theorem for Hamiltonicity, 10
Travelling salesman problem. Directed graphs – types of digraphs, Digraphs and
binary relation
III Trees – properties, pendent vertex, Distance and centres - Rooted and 7
binary tree, counting trees, spanning trees.
IV 9
Vertex Connectivity, Edge Connectivity, Cut set and Cut Vertices, Fundamental
circuits, Planar graphs, Different representation of planar graphs, Euler's
theorem, Geometric dual, Combinatorial dual.
V Matrix representation of graphs- Adjacency matrix, Incidence Matrix, 8
Circuit matrix, Fundamental Circuit matrix and Rank, Cut set matrix, Path
matrix
VI Graphs theoretic algorithms - Algorithm for computer representation of a graph, 7

algorithm for connectedness and components, spanning tree, shortest path.
T
1. Douglas B. West, Introduction to Graph Theory, Prentice Hall India Ltd., 2001
2. Narasingh Deo, Graph theory, PHI, 1979.
3. Robin J. Wilson, Introduction to Graph Theory, Longman Group Ltd., 2010

R
R. Diestel, Graph Theory, free online edition, 2016: diestel-graph-
theory.com/basic.html.
COURSE OBJECTIVES:
1 
To introduce the fundamental concepts in graph theory, including properties and characterization of graphs/ trees
and Graphs theoretic algorithms 
COURSE OUTCOMES:
Demonstrate the knowledge of fundamental concepts in graph theory, including properties and
CO1
characterization of graphs and trees.
CO2 Use graphs for solving real life problems.
CO3 Distinguish between planar and non-planar graphs and solve problems.
CO4 Develop efficient algorithms for graph related problems in different domains of engineering and science.
CO-PO-PSO 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 3
CO4 3 3 3
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
graph theory
will help to
CO1
analyze the
Engineering
problems ver
easily

Basic knowledge
in simple graphs
will help to
CO2 model various
problems in
engineering
fields
Differenc
ebetween
planar
and non
Planar and non planar
planar graphs graphs
will help to solve will help
CO3
problems with to design
high complexity solutions
in Engineering to various
complex
engineeri
ng
problems
Algorithm
Graph
s for
theoretical
graphs
algorithms
will help
Graph theoretic provides an
to
algorithms will easier
provide
help to enrich access to
CO4 valid
the analysis of the
conclusio
Engineering solutions in
ns to
problems the
various
professional
complex
engineering
engineeri
practise
ng
problems
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION

REQUIREMENTS:
SLNO DESCRIPTION PROPOSED
ACTIONS
1 Basic concepts on graphs Reading
2 Application of graphs in solving various Engineering problems Reading
3 Importance of graph theoretic algorithms in different fields of our society Reading
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY
VISIT/GUEST LECTURER/NPTEL ETC

1 http://www.diestel-graph-theory.com/basic.html

☐ CHALK & TALK ☐ STUD. ☐ WEB RESOURCES
ASSIGNMENT
☐ LCD/SMART ☐ STUD. SEMINARS ☐ ADD-ON COURSES
BOARDS
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL ☐ UNIV.
EXAMS EXAMINATION
☐ STUD. LAB ☐ STUD. VIVA ☐ MINI/MAJOR ☐ CERTIFICATIONS
PRACTICES PROJECTS
☐ ASSESSMENT OF COURSE OUTCOMES (BY ☐ STUDENT FEEDBACK ON FACULTY
FEEDBACK, ONCE) (TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY ☐ OTHERS
EXT. EXPERTS
(Reya Kuruvila) (HOD)

CS361 Soft Computing

PROGRAMME: Computer Science and Engineering DEGREE: BTECH
COURSE: Soft Computing SEMESTER: 5 CREDITS: 3
COURSE CODE: CS361 REGULATION: 2015 COURSE TYPE: ELECTIVE
COURSE AREA/DOMAIN: Computing CONTACT HOURS: 3 hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): Nil LAB COURSE NAME: Nil
SYLLABUS:
UNIT DETAILS HOURS
I Introduction to Soft Computing 8
Artificial neural networks - biological neurons, Basic models of artificial neural networks –
Connections, Learning, Activation Functions, McCulloch and Pitts Neuron, Hebb network.
II Perceptron networks – Learning rule – Training and testing algorithm, Adaptive Linear Neuron, Back 8
propagation Network – Architecture, Training algorithm
III Fuzzy logic - fuzzy sets - properties - operations on fuzzy sets, fuzzy relations - 7
operations on fuzzy relations
IV Fuzzy membership functions, fuzzification, Methods of 7
membership value assignments – intuition – inference –
rank ordering, Lambda –cuts for fuzzy sets, Defuzzification
methods
V Truth values and Tables in Fuzzy Logic, Fuzzy propositions, 8
Formation of fuzzy rules - Decomposition of rules –
Aggregation of rules, Fuzzy Inference Systems – Mamdani – and – Sugeno - types, -

Neuro-fuzzy – hybrid - systems - characteristics - classification
VI Introduction to genetic algorithm, operators in genetic algorithm - coding - selection 8
- cross over – mutation, Stopping condition for genetic algorithm flow, Genetic-
neuro hybrid systems, Genetic-Fuzzy rule based system
TOTAL HOURS 46
1 S. N. Sivanandam and S. N.Deepa, Principles of soft computing - Wiley India.
2 Timothy J. Ross, Fuzzy Logic with engineering applications – Wiley India.
3 N. K. Sinha and M. M. Gupta, Soft Computing & Intelligent Systems: Theory & Applications-Academic Press
/Elsevier. 2009.
4 Simon Haykin, Neural Network- A Comprehensive Foundation- Prentice Hall International, Inc.
5 R. Eberhart and Y. Shi, Computational Intelligence: Concepts to Implementation, Morgan Kaufman/Elsevier,
2007.
6 Ross T.J. , Fuzzy Logic with Engineering Applications- McGraw Hill.
7 Driankov D., Hellendoorn H. and Reinfrank M., An Introduction to Fuzzy Control-
Narosa Pub.
8 Bart Kosko, Neural Network and Fuzzy Systems- Prentice Hall, Inc., Englewood Cliffs
9 Goldberg D.E., Genetic Algorithms in Search, Optimization, and Machine Learning- Addison Wesley.
C.CODE COURSE NAME DESCRIPTION S
E
M
CS203 Switching Theory and Logic Design Basic knowlegde of different types of gates 3

COURSE OBJECTIVES:
1 To introduce the concepts in Soft Computing such as Artificial Neural Networks, Fuzzy logic-
based systems, genetic algorithm-based systems and their hybrids.
COURSE OUTCOMES:
SNO DESCRIPTION
1 Learn about soft computing techniques and their applications.
2 Analyze various neural network architectures.
3 Define the fuzzy systems.
4 Understand the genetic algorithm concepts and their applications.
5 Identify and select a suitable Soft Computing technology to solve the problem; construct a
solution and implement a Soft Computing solution.
CORSE OUTCOME AND PROGRAMME OUTCOME MAPPING
CO-PO MAPPING
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PS
1 2 3 4 5 6 7 8 9 0 1 2 1 2 O3
C706 1 1 3 - - _ _ _ _ _ _ _ 1 3 _
.1
C706 2 2 3 - _ _ _ _ _ _ _ _ 1 3 _
.2
C706 2 2 3 - - _ _ _ _ _ _ _ 1 3 _
.3
C706 1 1 2 _ - _ _ _ _ _ _ _ 1 - _
.4
C706 2 2 3 - - _ _ _ _ _ _ _ - 3 -
.5
CS 2 2 3 - 1 - - - - - - - 1 3 -
010
603(
over
all
level
)

Mapping LOW/ Justification
MEDIUM/
HIGH
C706.1-PO1 L As they could just apply the knowledge of softcomputing for

solutions to engineering problems

C706.1-PO2 L Students could arrive at conclusions using principles of soft
computing
C706.1-PO3 H They can design softcomputing systems for societal needs
C706.1-PSO1 L They can design solutions for complex engineering problems by
understanding the core principles of working of human brain.
C706.1-PSO2 H Students acquire competency in designing and developing soft
computing algorithms which meets the demands of the industry.
C706.2-P01 M Students will be able to describe neural network architectures
C706.2-PO2 M Students will be able to analyse problems and arrive at
conclusions using neural networks.
C706.2-PO3 H Students will be able to design systems using neural networks
C706.2-PSO1 L Understanding of the working of different neural architectures
C706.2-PSO2 H Students acquire competency in developing a neural network
C706.3-PO1 M Students will be able to describe various fuzzy systems
C706.3-PO2 M Students will be able to describe various fuzzy operations
C706.3-PO3 H Students gain competency in designing fuzzy inference system
C706.3-PSO1 L Understanding the working of various methods fuzzy systems
C706.3-PSO2 H Students acquire competency in developing good fuzzy inference
system
C706.4-PO1 L Students will be able to identify different genetic algorithm
operations
C706.4-PO2 L Students will gain knowledge in applying genetic algorithm
methods
C706.4-PO3 M Students gain competency in designing a genetic method for a
problem
C706.4-PSO1 L Understanding of the design and working of genetic algorithm
based method
C706.5-PO1 M Students will be able to identify different soft computing methods
for real time problems
C706.5-PO2 M Students will be able to design algorithms using standard
practices in soft computing
C706.5-PO3 H Students gain competency in designing and developing their own
softcomputing system
C603.5-PSO2 H Students acquire competency in design and development of soft
computing system in the field of character recognition , weather
forecasting etc.

SL Topics PO mappings
NO
1 Character recognition using soft computing PO3
2 Clustering using genetic algorithm PO3

1 https://www.omicsonline.org/open-access/real-time-applications-of-soft-computing-techniques

2 http://www.scrs.in/
☐ CHALK & TALK ☐ STUD. ASSIGNMENT ☐ WEB RESOURCES
☐ LCD/SMART ☐ STUD. SEMINARS ☐ ADD-ON COURSES
BOARDS
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL EXAMS ☐ UNIV. EXAMINATION
☐ STUD. LAB ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS
PRACTICES
☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ☐ STUDENT FEEDBACK ON FACULTY (ONCE)
ONCE)
EXPERTS
Ms. Dhanya P.M Ms. Shimmi Asokan(HOD, CSE)

CS365 Optimization Techniques

PROGRAMME: COMPUTER DEGREE: B TECH
SCIENCE & ENGINEERING
COURSE: Optimization Techniques SEMESTER: 5 CREDITS: 3
COURSE CODE: CS365 COURSE TYPE: ELECTIVE
REGULATION: 2015
COURSE AREA/DOMAIN: Mathematics CONTACT HOURS: 3
CORRESPONDING LAB COURSE CODE LAB COURSE NAME:
(IF ANY): NA
SYLLABUS:
Module I – Decision -making procedure under certainty and under uncertainty – Operations
Research – Probability and decision – making – Queuing or Waiting line theory – Simulation and
Monte – Carlo Technique – Nature and organization of optimization problems – Scope and
hierarchy of optimization – Typical applications of optimization. 08 hours, Weitage – 15%
Module II – Essential features of optimization problems – Objective function – Formulation of

optimization problems – Continuous functions – Discrete functions – Unimodal functions –
Convex and concave functions, Investment costs and operating costs in objective function –
Optimizing profitably constraints – Internal and external constraints. Hours – 07 Weightage –
15%
FIRST INTERNAL EXAM
Module III – Necessary and sufficient conditions for optimum of unconstrained functions –
Numerical methods for unconstrained functions – One – dimensional search – Gradient – free
search with fixed step size. Linear Programming – Basic concepts of linear programming –
Graphical interpretation – Simplex method – Apparent difficulties in the Simplex method. Hours
– 06 Weightage – 15%
Module IV – Transportation Problem, Loops in transportation table, Methods of finding initial

basic feasible solution, Tests for optimality. Assignment Problem, Mathematical form of
assignment problem, methods of solution. Hours – 06 Weightage – 15%
SECOND INTERNAL EXAM
Module V – Network analysis by linear programming and shortest route, maximal flow
problem. Introduction to Non – traditional optimization, Computational Complexity – NP – Hard,
NP – Complete. Tabu Search – Basic Tabu search, Neighborhood, Candidate list, Short term and
Long term memory. Hours – 07 Weightage – 20%
Module VI – Genetic Algorithms – Basic concepts, Encoding, Selection, Crossover, Mutation.

Simulated Annealing – Acceptance probability, Cooling, Neighborhoods, Cost function.

Application of GA and Simulated Annealing in solving sequencing and scheduling problems and
Travelling salesman problem. Hours – 08 Weightage – 20%
Text Books
1. Rao S.S., Optimization Theory and Applications, Wiley Eastern.
2. Hamdy A. Taha, Operations Research – An introduction, Prentice – Hall India.
3. G. Zapfel, R. Barune and M. Bogl, Metaheuristic search concepts: A tutorial with

applications to production and logistics, Springer.
References
1. Gass S. I., Introduction to Linear Programming, Tata McGraw Hill.
2. Reeves C., Modern heuristic techniques for combinatorial problems, Orient Longman.
3. Goldberg, Genetic algorithms in Search, optimization and Machine Learning, Addison

Wesley.
4. K. Deb, Optimization for engineering design – algorithms and examples, Prentice Hall of
India.
COURSE OBJECTIVES:
1. To build an understanding on the basics of optimization techniques.
2. To introduce basics of linear programming and metaheuristic search techniques.
COURSE OUTCOMES:
Course Outcomes
Understand Decision making procedure and its applications - Know the role queuing
CO1
model and simulation in real life scenario.
Understand the essential features and scope of optimization techniques - Learn properties
CO2
of objective function and formalization of optimization problem.
Learn numerical methods to find optimum point and value of a function - Learn to solve
CO3
the LPP.
Learn to solve transportation problems and assignment problems. - Apply in real life
CO4
situations
Learn applications of network models and analyse the model – Learn to use Tabu Search
CO5
methods in various fields.
CO6 Understand Genetic algorithms and its applications

CO-PO MAPPING
PO
1
1 2 3 4 5 6 7 8 9 10 11
2
CO1 3 2 1 1 1
CO2 2 2 1 1
CO3 3 2 2 2
CO4 3 2 2 2
CO5 3 3 2 2 3 2
CO6 3 2 2 3 2
Avg 3 2 2 2 2 2
PO
1 1
1 2 3 4 5 6 7 8 9 10
1 2
Solved Helpful in Help to
It helps to Learn
using analysing design
CO undesrtand about
m- situations complex
1 the complex new
formul like waiting models in
situations tools
as or modelling simple form
Help to Learn
Analysing It helps to
CO understand about
optimal interpret
2 the m- new
solutions datas
modelling tools
Modder
n tools
Solved Simpled any
Analysing Interpretati are
using models
CO the on of data used to
m- which can
3 optimality for solving solve
formul be solved
using LPP linearly such
as linearly
proble
ms
Analysisng Tols
Simplifies
Basic the avalable
assignment
CO algebra assigment to solve
and
4 used to and larger
transportati
solve transportati proble
on problems
on problem ms
They
Understand
Basic Designed to Tools simplify
Analysing the
CO algebra solve a avalable the
the ntwork situations to
5 used to problem in and comple
models solve in
solve fastest way used x
fastest way
proble

ms and
solve in
a
simpler
way
They
simplify
the
Understand comple
Basic Designed to Tools
the x
CO algebra solve a avalable
situations to proble
6 used to problem in and
solve in ms and
solve fastest way used
fastest way solve in
a
simpler
and fast
☐ CHALK & TALK ☐ STUD. ASSIGNMENT ☐ WEB RESOURCES ☐ LCD/SMART
BOARDS
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL ☐ UNIV. EXAMINATION
EXAMS
☐ STUD. LAB ☐ STUD. VIVA ☐ MINI/MAJOR ☐ CERTIFICATIONS

PRACTICES PROJECTS
☐ ASSESSMENT OF COURSE OUTCOMES (BY ☐ STUDENT FEEDBACK ON FACULTY (TWICE)
FEEDBACK, ONCE)
(Shyam Sunder Iyer) (HOD)

CS367 Logic for Computer Science

PROGRAMME: COMPUTER SCIENCE AND DEGREE: BTECH
ENGINEERING
COURSE: LOGIC FOR COMPUTER SCIENCE SEMESTER: V CREDITS: 3
COURSE CODE: CS 367 COURSE TYPE: ELECTIVE

REGULATION: 2017
COURSE AREA/DOMAIN: PROBLEM SOLVING CONTACT HOURS: 3 hours/Week.
CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME: N.A
N.A
SYLLABUS:
UNIT DETAILS HOURS
I Introductory Concepts: Mathematical Logic,Propositional Logic, First Order 6
Logic, Modal and Temporal logic, Program Verification.
Propositional Logic: Formulae and interpretations, Equivalence, Satisfiability

& Validity, Semantic Tableaux, Soundness and Completeness.
II Propositional Logic: Formulae and interpretations, Equivalence, Satisfiability 6
& Validity, Semantic Tableaux, Soundness and Completeness.
Resolution in Propositional Logic: Conjunctive Normal form, Clausal form,

resolution rule.
III Binary Decision Diagrams: Definition, Reduced and ordered BDD, Operators. 7
Predicate Logic: Relations, predicates, formulae and interpretation, logical

equivalence, semantic tableaux, soundness.
IV The Hilbert deduction system for predicate logic.Functions, PCNF and clausal 8
form, Herbrand model.Resolution in predicate logic: ground resolution,
substitution, unification, general resolution.
V Temporal logic: Syntax and semantics, models of time, linear time temporal 7
logic, semantic tableaux. Deduction system of temporal logic.
VI Program Verification: Need for verification, Framework for verification, 8
Verification of sequential programs, deductive system, verification, synthesis.
Modal Logic: Need for modal logic, Case Study: Syntax and Semantics of K,
Axiomatic System KC,
TOTAL HOURS 42

T Modechai Ben-Ari, Mathematical Logic for Computer Science, Springer, 3/e, 2102.
T Arindhama Singh, Logics for Computer Science, Prentice Hall India, 2004.
R Michael Huth, Mark Ryan, Logic in Computer Science: Modeling and Reasoning
about
Systems, Cambridge University Press, 2005.
BE101- Introduction to Computing and Fundamentals of Python programming S1

05 Problem Solving
CS205 DATA STRUCTURES Programming S3
COURSE OBJECTIVES:
1 To introduce the concepts of mathematical logic and its importance.
2 To discuss propositional, predicate, temporal and modal logic and their applications.
COURSE OUTCOMES:
CS367.1 Explain the concept of logic and its importance.
(Level 2)
CS367.2 Understand fundamental concepts in propositional logic and apply resolution
techniques. (Level 3)
CS367.3 Understand fundamental concepts in predicate logic and apply resolution
techniques.(Level 3)
CS367.4 Understand fundamental concepts in temporal logic and apply resolution
techniques.(Level 3)
CS367.5 Understand the concept of program verification and apply it in real-world
scenarios.(Level 4)
CS367.6 Understand fundamental concepts in modal logic.(Level 2)
CO-PO MAPPING
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
CS367.1 2 2 2 2 - - - - - - - - 2 1 1
CS367.2 1 1 2 - - - - - - - - - 2 - -
CS367.3 2 1 2 2 - - - - - - - - 2 1 -
CS367.4 1 2 2 3 - - - - - - - - 2 - 1
CS367.5 - 2 2 2 - - - - - - - - 2 - -
CS367.6 2 1 2 2 2 2 2

CS 2 2 2 2 - - - - - - - - 2 2 2
306(overa
ll level)

Mapping LOW/MEDIUM/HIGH Justification
C367.1-PO3 M The knowledge in problem solving helps in designing solutions for
complex engineering problems.
C367.1-PO4 M The knowledge of Boolean algebra helps in analysis of performance
of solutions to complex problems
C367.1-PSO1 M The knowledge in problem solving techniques help in designing
solutions and analyzing its complexity.
C367.1-PSO2 L This knowledge helps to design good and efficient algorithms.
C367.1-PSO3 L These concepts are fundamental to CS and can be used in research
and other innovative ideas.
C367.2-PO1 L The knowledge of propositional logic can be applied to solve
C367.2-PO3 H The knowledge of propositional logic can be applied to design
solutions to complex engineering problems.
C367.2-PSO1 H The knowledge of propositional logic can be applied to design
solutions to complex engineering problems in multidisciplinary
areas. They belong to the core concepts of CS.
C367.3-PO1 M The knowledge of predicate logic can be applied to solve complex
engineering problems.
C367.3-PO3 H This knowledge can be used to design efficient solutions to
complex problems.
C367.3-PO4 M This knowledge helps in representation, analysis and
interpretation of data to provide valid conclusions.
C367.3-PSO1 H The knowledge of predicate logic can be applied to design solutions
to complex engineering problems.
C367.3-PSO2 L This knowledge helps in designing efficient algorithms using
appropriate data structure.
C367.4-PO1 L This basic knowledge can be used in solutions to complex
C367.4-PO3 M This basic knowledge can be used in designing solutions to
C367.4-PO4 H This concept is fundamental in conducting investigations and
interpretations of data.
C367.4-PSO1 M This basic knowledge can be used in designing solutions to
complex multidisciplinary engineering problems.
C367.4-PSO3 L This concept are fundamental to the CS discipline and can be used
research and other innovative ideas.
C367.5-PO1 L The knowledge of various techniques can be applied in designing
solutions to complex engineering problems.
C367.5-PSO1 L The knowledge of various techniques can be applied in designing
solutions to complex multidisciplinary engineering problems.


1 http://www.nptelvideos.in/2012/11/logic-for-cs.html
 CHALK & TALK  STUD.  WEB
ASSIGNMENT RESOURCES
 LCD/SMART  STUD. ☐ ADD-ON COURSES
BOARDS SEMINARS
 ASSIGNMENTS ☐ STUD.  TESTS/MODEL  UNIV.
SEMINARS EXAMS EXAMINATI
ON
 STUD. LAB  STUD. VIVA ☐ MINI/MAJOR ☐
PRACTICES PROJECTS CERTIFICATIONS
COURSES
 ASSESSMENT OF COURSE OUTCOMES (BY  STUDENT FEEDBACK ON FACULTY
☐ ASSESSMENT OF MINI/MAJOR PROJECTS ☐ OTHERS
BY EXT. EXPERTS
Sandy Joseph HOD

CS341 Design Project

PROGRAMME: Computer Science & Engineering DEGREE: B.Tech.
COURSE: DESIGN PROJECT SEMESTER: S5 CREDITS: 2
COURSE CODE: CS341 REGULATION:
COURSE TYPE: Core
2016
COURSE AREA/DOMAIN: Engineering (All CONTACT HOURS: 2 (Practical) + 1 (Tutorial)
Branches) Hours / Week
CORRESPONDING LAB COURSE CODE (IF
LAB COURSE NAME: NA
ANY): NA
SYLLABUS:
PHASE DETAILS HOURS
I STUDY: 12 (4 Weeks)
Take minimum three sample products, processes or techniques in the

area of specialization, study, analyze and present them. The analysis shall
be focused on functionality, strength, material, manufacture/construction,
quality, reliability, aesthetics, ergonomics, safety, maintenance, handling,
sustainability, cost etc. whichever are applicable. Each student in the
group has to present individually, choosing different products, processes
or techniques.
II DESIGN: 27 (9 Weeks)
The project team shall identify an innovative product, process or technology

and proceed with detailed design. At the end, the team has to document it
properly and present and defend it. The design is expected to concentrate on
functionality, design for strength is not expected.
Note: The one hour/week allotted for tutorial shall be used for discussions
and presentations. The project team (not exceeding four) can be students
from different branches, if the design problem is multidisciplinary.
TOTAL HOURS 39
S. No. T/R AUTHORS/BOOK TITLE/PUBLICATION
1. R Michael Luchs, Scott Swan, Abbie Griffin, 2015. Design Thinking. 405
pages, John Wiley & Sons, Inc.
2. R Kevin Otto, Kristin Wood, 2017. Product Design, 1065 pages, Pearson
Education, Inc.
COURSE PRE-REQUISITES: Nil
COURSE OBJECTIVES:
1 To understand the engineering aspects of design with reference to simple products

2 To foster innovation in design of products, processes or systems
3 To develop design that add value to products and solve technical problems
COURSE OUTCOMES:
Blooms
Ref. No. DESCRIPTION
Taxonomy Level
The students will be able to understand the engineering aspects of design of Understand
CS341.1 (Level 2)
products
The students will be able to think innovatively on the development of Create
CS341.2 components, products, processes or technologies in the engineering field. (Level 6)
The student will be able to analyze the problem requirements and arrive at Analyze & Create
CS341.3 (Level 4, 6)
workable design solutions.
CO-PO MAPPING
CS341.1 3
CS341.2 3 3 3 2 2 - 3 3 3 _ 2 1 3
CS341.3 3 3 3 3 3 - - _ 3 3 3 - 2 3

MAPPING LOW/MEDIUM/HIGH JUSTIFICATION
CS341.1-PO1 H Students will understand and gain knowledge on various
engineering aspects of product design.
CS341.2-PO1 H Students will apply the engineering knowledge while developing
components, products, processes and technologies in the
engineering field.
CS341.2-PO3 H Students will design and develop solutions for complex
engineering problems by developing innovative components,
products, processes and technology.
CS341.2-PO5 H Students shall learn the use of tools for innovation & creative
thinking and modern modeling tools etc. for innovation and
development of components, products and processes.
CS341.2-PO6 M Students shall also consider societal aspects like health, safety,
legal and cultural in addition to functional aspects while innovating
and developing components, products and processes.
CS341.2-PO7 M Students shall also consider environmental issues and the need for
sustainable development while innovating and developing
components, products and processes.
CS341.2-PO9 H Students shall develop individual skills as well as team &
leadership skills while working in student groups.

CS341.2-PO10 H Students shall develop communication skills while working in

student groups.
CS341.2-PO11 H Students shall develop project management skills while working in
groups and managing the development of components, products
and processes.
CS341.2-PSO1 M Students shall also apply computer science specific skills while
developing components, products and processes.
CS341.2-PSO2 L Students shall develop software prototypes to prove their design as
part of developing innovative products and solutions, though the
full software development life cycle is not intended as part of this
course.
CS341.2-PSO3 H Students shall also develop professional skills like research and
entrepreneurship skills while working as a team to develop
innovative products and solutions.
CS341.3-PO1 H Students will apply the engineering knowledge while analyzing the
problem requirements and arriving at workable design solutions.
CS341.3-PO2 H Students shall develop strong problem analysis skills while
identifying and analyzing problems and arriving at innovative
solutions for problems.
CS341.3-PO3 H Students shall design and develop innovative solutions after
identifying and analyzing problems.
CS341.3-PO4 H Students shall conduct user surveys & research and analyze
complex data to arrive at conclusions as part of analyzing complex
CS341.3-PO5 H Students shall use modern tools for problem identification and
analysis.
CS341.3-PO9 H Students shall develop individual skills as well as team &
leadership skills while working in student groups.
CS341.3-PO10 H Students shall develop communication skills while working in
student groups.
CS341.3-PO11 H Students shall develop project management skills while working in
groups and managing the development of components, products
and processes.
CS341.3-PSO1 M Students shall also apply computer science specific skills while
analyzing problems and arriving at workable design solutions.
CS341.3-PSO3 H Students shall also develop professional skills like research and
entrepreneurship skills while working as a team to analyze
problems and to arrive at workable design solutions.
INDUSTRY RELEVANCE:
There is a very strong focus nowadays on innovation and entrepreneurship development in all universities
including KTU. The universities promote and support students to come up with innovative ideas/concepts to
solve real life problems and eventually develop those concepts as marketable products. This course will enable
students to observe and identify problems, think innovatively and come up with creative solutions for the
problems. They could convert these innovative solutions/ideas into creative products and become entrepreneurs.
Also, this course will equip students with creative design thinking tools and skills that will help students to make
significant contributions in product design companies.

☐ CHALK & TALK √ ☐ STUD. ASSIGNMENT √ ☐ WEB RESOURCES √
☐ LCD/SMART BOARDS √ ☐ STUD. SEMINARS √ ☐ DISCUSSIONS/ DEBATES √
☐ ASSIGNMENTS √ ☐ STUD. SEMINARS √ ☐ TESTS/MODEL EXAMS ☐ UNIV. EXAMINATION
☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS
☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK,
☐ STUDENT FEEDBACK ON FACULTY (ONCE) √
ONCE) √
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS ☐ OTHERS
Asha Raj Shimmi Asokan

CS331 System Software Lab

PROGRAMME: COMPUTER SCIENCE & DEGREE: BTECH
ENGINEERING
COURSE: SYSTEM SOFTWARE LAB SEMESTER: III CREDITS: 4
COURSE CODE: CS331 REGULATION: 2016 COURSE TYPE: CORE
COURSE AREA/DOMAIN: SYSTEM SOFTWARE CONTACT HOURS: 3+1 (Tutorial) hours/Week.
CONCEPTS
SYLLABUS:
1. Simulate the following non-preemptive CPU scheduling algorithms to find turnaround
time and waiting time.
a) FCFS b) SJF c) Round Robin (pre-emptive) d) Priority
2. Simulate the following file allocation strategies.
a) Sequential b) Indexed c) Linked
3. Implement the different paging techniques of memory management.
4. Simulate the following file organization techniques *
a) Single level directory b) Two level directory c) Hierarchical
5. Implement the banker’s algorithm for deadlock avoidance.*
6. Simulate the following disk scheduling algorithms. *
a) FCFS b)SCAN c) C-SCAN
7. Simulate the following page replacement algorithms
a) FIFO b)LRU c) LFU
8. Implement the producer-consumer problem using semaphores. *
9. Write a program to simulate the working of the dining philosopher’s problem.*
B-Tech CSE S5& S6 Syllabus & Course Plan
Part B
10. Implement the symbol table functions: create, insert, modify, search, and display.
11. Implement pass one of a two pass assembler. *
12. Implement pass two of a two pass assembler. *
13. Implement a single pass assembler. *
14. Implement a two pass macro processor *
15. Implement a single pass macro processor.
16. Implement an absolute loader.
17. Implement a relocating loader.
18. Implement pass one of a direct-linking loader.
19. Implement pass two of a direct-linking loader.
20. Implement a simple text editor with features like insertion / deletion of a character,
word, and sentence.
21. Implement a symbol table with suitable hashing.*
T Leland L. Beck, System Software: An Introduction to Systems Programming, 3/E, Pearson
Education Asia, 1997.
R http://gcc.gnu.org/onlinedocs/gcc-2.95.3/cpp_1.html - The C Preprocessor
R Systems Programming and Operating Systems – D.M. Dhamdhere, Tata McGraw Hill Second
Revised Edition.
R Writing UNIX device drivers - George Pajari -Pearson Education Asia.
R Systems Programming – John J. Donovan, Tata McGraw Hill Edition 1991

R System Software – J Nithyashri –Second Edition- Tata McGraw Hill

R Jonathan Corbet, Alessandro Rubini, Greg Kroah-Hartman, Linux Device Drivers, Third Edition,
O.Reilly Books
R M. Beck, H. Bohme, M. Dziadzka, et al., Linux Kernel Internals, Second Edition, Addison
Wesley Publications
R Peter Abel, IBM PC Assembly Language and Programming, Third Edition, Prentice Hall of India.
COURSE PRE-REQUISITES: Operating System, C-programming, Data structure
COURSE OBJECTIVES:
1 To build an understanding on design and implementation of different types of system
software.
COURSE OUTCOMES:
SNO DESCRIPTION LEVEL
1 Compare and analyze CPU Scheduling Algorithms like Level 5

FCFS, Round Robin, SJF, and
Priority.
2 Implement basic memory management schemes like Level 3 and 6
paging.
3 Implement synchronization techniques using Level 3 and 6
semaphores etc.
4 Implement banker’s algorithm for deadlock avoidance. Level 3 and 6
5 Implement memory management schemes and page Level 5

replacement schemes and file allocation
and organization techniques.
6 Implement system software such as loaders, Level 3 and 6
assemblers and macro processor.

CS331.1 _ 3 _ 1 _ _ _ _ _ _ 1 _ _
CS331.2 3 3 _ _ _ _ _ _ _ _ _ _ 1 _ _
CS331.3 2 2 _ _ _ _ _ _ _ _ _ _ 2 _ _
CS331.4 2 2 _ _ _ _ _ _ _ _ _ 1 1 _
CS331.5 3 1
CS331.6 3 2 _ _ _ _ _ _ _ _ _ - _ _
CS331 2 2 3 - 1 - - - - - - 1 - -
(overall
level)

JUSTIFATIONS FOR CO-PO-PSO MAPPING

Mapping LOW/MEDIUM/ Justification
HIGH
CS331.1-PO4 H They can identify various CPU scheduling algorithms
CS331.1-PO6 L They can analyse and explain the working of the CPU
scheduling
CS331.2-PO1 H They can analyze basic memory management schemes
CS331.2-PO2 H They can explain the working of various memeory management

scheme and analyze the performance
CS331.3-PO1 M Implement synchronization concepts using semaphore
CS331.3-PO2 M Algorithms learnt can be used to find solutions for various

synchronization problem
CS331.4-PO1 M They will analyze the working of bankers algorithm for deadlock
avoidance
CS331.4-PO2 M Algorithms formulated can be converted into code using suitable
programming languages
CS331.5-PO4 H They can identify and explain page replacement schemes
CS331.5-PO6 M They can implement page replacement schemes
CS331.6-PO1 M They can identify and explain assembler functionality
CS331.6-PO2 M They can implement the working of one pass and two pass
assembler
CS331.1-PSO1 L They can identify and analyse the operating system and system
software functionality
CS331.2-PSO1 L Identify the existing softwares and also explain their working
CS331.3-PSO1 M Design solutions for the softwares that are required by the
system
C603.4-PSO1 L Write algorithms and also decide on the various concepts of
programming
C603.4-PSO2 L Suitable programming strategies can be applied to convert the
algorithms to programs

ACTIONS
1 Automated Tools available for debugging are not covered SEMINARS
2 Writing UNIX device drivers WORKSHOPS
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

1 Implementation of simple text editor
2 Implementation of a loader


1 http://www.sourcecodesolutions.in/2010/09/4implementation-of-single-pass.html
2 www.geeksforgeeks.org/program-bankers-algorithm-set-1-safety-algorithm/
3 www.ccet.org.in/wp-content/uploads/2014/12/3.Operating-Systems-Lab-1.pdf
4 www.geeksforgeeks.org/disk-scheduling-algorithms/
 CHALK &  STUD.  WEB
TALK ASSIGNMENT RESOURCES
 LCD/SMART ☐ STUD. SEMINARS ☐ ADD-ON COURSES
BOARDS
 ASSIGNMEN  STUD.  TESTS/MODEL  UNIV.
TS SEMINARS EXAMS EXAMINATI
ON
 STUD. LAB  STUD. MINI/MAJOR PROJECTS ☐ CERTIFICATIONS
PRACTICES VIVA
COURSES
 ASSESSMENT OF COURSE OUTCOMES ☐ STUDENT FEEDBACK ON FACULTY
(BY FEEDBACK, ONCE) (ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY ☐ OTHERS
EXT. EXPERTS
Dhanya P.M Shimmi Asokan

CS333 Application Software Development Lab

PROGRAMME: COMPUTER SCIENCE & DEGREE: B.TECH
ENGINEERING YEAR: August 2017 – December 2017
COURSE: Application Software Development SEMESTER: V
Lab CREDITS: 1
COURSE CODE : CS333
COURSE TYPE: LAB
REGULATION: 2016
COURSE AREA/DOMAIN: DATA BASE
CONTACT HOURS: 0-0-3
MANAGEMENT SYSTEM
CORRESPONDING LAB COURSE CODE
LAB COURSE NAME:
(IF ANY):
SYLLABUS:
List of Exercises/Experiments: (Exercises/experiments marked with * are mandatory
from each part. Total 12 Exercises/experiments are mandatory)
1. Creation of a database using DDL commands and writes DQL queries to retrieve
information from the database.
2. Performing DML commands like Insertion, Deletion, Modifying, Altering, and Updating
records based on conditions.
3. Creating relationship between the databases. *
4. Creating a database to set various constraints. *
5. Practice of SQL TCL commands like Rollback, Commit, savepoint.
6. Practice of SQL DCL commands for granting and revoking user privileges.
7. Creation of Views and Assertions *
8. Implementation of Build in functions in RDBMS *
9. Implementation of various aggregate functions in SQL *
10. Implementation of Order By, Group By& Having clause. *
11. Implementation of set operators, nested queries and Join queries *
12. Implementation of various control structures using PL/SQL *
13. Creation of Procedures and Functions *
14. Creation of Packages *

15. Creation of database Triggers and Cursors *
16. Practice various front-end tools and report generation.
17. Creating Forms and Menus
18. Mini project (Application Development using Oracle/ MySQL using Database
connectivity)*
PRINCIPLES OF DATABASE Gives concepts about the theory and practice of
CS208 DESIGN database systems and to exposure to oracle 4
database programming, modelling and design.
COURSE OBJECTIVES:
1. To introduce basic commands and operations on database.
2. To introduce stored programming concepts (PL-SQL) using Cursors and Triggers.
3. To familiarize front end tools of database.

COURSE OUTCOMES:
CS333.1 The students will be able design and implement a database for a given problem using database
design principles.
The students will be able to apply stored programming concepts (PL-SQL) using Cursors and
CS333.2 Triggers.
The students will be able to use graphical user interface, Event Handling and Database
CS333.3 connectivity to develop and deploy applications and applets.
The students will be able to develop medium-sized project in a team.

CS333.4

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CS333.1 3 2 2 1 1 _ _ _ _ _ _ _ 2 2 _
CS333.2 2 2 2 - _ _ _ _ _ _ _ _ 1 3 _
CS333.3 2 1 2 - 2 _ _ _ _ _ _ _ 1 2 _
CS333.4 2 1 - 1 3 2 _ _ _ _ _ _ 1 3 1
CS333 2 2 2 1 1 1 - - - - - - 1 3 1
(overall
level)

Mapping LOW/MEDIUM/HIGH Justification
CS333.1-PO1 H The student becomes able to design a database and include
tables in it for data storage.
CS333.1-PO2 M The student can analyze a problem based on its data
requirements.
CS333.1-PO3 M The student can design the structure of the tables based on
the given problem.
CS333.1-PO4 L Able to interpret the given problem and find out the fields
required in the tables and the database.
CS333.1-PO5 L The student becomes well versed in using Oracle for
designing database solutions.
CS333.1-PSO1 M The student is able to understand the basics of database
design and its core principles and apply them for
application software development.
CS333.1-PSO2 M The student is able to use the concepts of database design
in application development.
CS333.2-PO1 M The student is able to apply the procedural anguage
concepts in database design and implementation using
PL/SQL.
CS333.2-PO2 M The student is able to analyze a given data manipulation
problem using procedural language concepts of SQL.
CS333.2-PO3 M The student can solve a data processing problem and easily
handle errors using PL/SQL constructs.
CS333.2-PSO1 L The student can use the concepts of triggers and cursors
and solve complex database problems.
CS333.2-PSO2 H The student can implement the concepts of triggers,
cursors, packages, procedures and functions to build
software solutions to data handling problems.
CS333.3-.PO1 M The student will be able to use the concepts of GUI,
database connectivity in problems.
CS333.3-.PO2 L The student will be able to analyze a given problem and
determine the requirement of GUI interface and database
connectivity for the problem.

CS333.3-.PO3 M The student will be able to design applications using the

concepts of GUI and applets.
CS333.3-.PO5 M The student is able to use modern tools to develop high
end applications which use database in the back end.
CS333.3-.PSO1 L The student is able to design applications combining the
concepts of database and GUI.
CS333.3-.PSO2 M The student is able to perform database connectivity from
front-end applications.
CS333.4-.PO1 M The student gets a general knowledge about how to design
and develop a small sized project.
CS333.4-.PO2 L The student gets an idea on how to work as a team to
analyze a given problem definition.
CS333.4-.PO4 L The student is able to perform a feasibility study on a
given problem so as to develop a solution to it.
CS333.4-.PO5 H The student is able to use modern tools to develop a small
database project by working as a team.
CS333.4-.PO6 M The student is made able so as to develop database
management solutions which can help the society.
CS333.4-.PSO1 L The student is made able to design and develop small sized
applications using databases in the back-end.
CS333.4-.PSO3 L The student acquires professional skills in developing
database solutions.
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION

REQUIREMENTS:
ACTIONS
1 Case study - Microsoft Access Topic Beyond Syllabus
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC

1 Case study- Microsoft access

1 www.w3schools.com
2 www.docs.oracle.com
3 www.sqlcourse.com
4 www.beginner-sql-tutorial.com
5 www.plsql-tutorial.com
6 www.ibm.com
7 www.tutorialspoint.com

CHALK & TALK  STUD. WEB RESOURCES
ASSIGNMENT
☐ LCD/SMART ☐ STUD. SEMINARS ☐ ADD-ON
BOARDS COURSES
ASSIGNMENTS ☐ STUD. SEMINARS  TESTS/MODEL ☐ UNIVRSITY
EXAMS EXAMINATION
 STUD. LAB STUD. VIVA  MINI/MAJOR ☐ CERTIFICATIONS
PRACTICES PROJECTS
COURSES
 ASSESSMENT OF COURSE OUTCOMES (BY  STUDENT FEEDBACK ON FACULTY
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY ☐ OTHERS
EXT. EXPERTS
Jisha Mary Jose, Dincy Paul , Hareesh M J Ms. Shimmi Asokan

(Lab-in-charges) (HOD)

Outcome Attainment

Uploaded by

Copyright:

Available Formats

Outcome Attainment

Uploaded by

Document Information

Original Description:

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

Outcome Attainment

Uploaded by

Copyright:

Available Formats

COURSE HAND-OUT

KTU B.TECH. - SEMESTER V

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 5TH SEMESTER 6

Department of CSE, RSET 5

SCHEME: B.TECH 5TH SEMESTER

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

Cumulative Credits= 117

Department of CSE, RSET 6

CS301 Theory of Computation

COURSE INFORMATION SHEET

IV Non-Deterministic Pushdown Automata (NPDA), design. Equivalence of 8

VI Variants of TMs -Universal Turing Machine, Multi- tape TMs, Non 8

Department of CSE, RSET 7

Deterministic TMs, Enumeration Machine (Equivalence not required),

Department of CSE, RSET 8

SL. DESCRIPTION Blooms’

CO-PO AND CO-PSO MAPPING

JUSTIFICATIONS FOR CO-PO/PSO MAPPING

Department of CSE, RSET 9

C404.3-PO2 M Correlating the study of automata to real world applications will

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

2 Decision problems and their relationship to model of computations NPTEL Video

3 Parsing and Ambiguity of CFG Assignment

4 CFG and programming Topics Beyond

Department of CSE, RSET 10

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN

WEB SOURCE REFERENCES:

Department of CSE, RSET 11

CS303 System Software

COURSE INFORMATION SHEET

Department of CSE, RSET 12

R System Software – J Nithyashri –Second Edition- Tata McGraw Hill

COURSE PRE-REQUISITES: Nil

1 Students will be able to distinguish different software into Level 2

4 Students will be able to design, analyze and implement Level 3 and 4

CO-PO AND CO-PSO MAPPING

JUSTIFICATIONS FOR THE MAPPING

Department of CSE, RSET 13

C603.4-PO1 M Algorithms can be formulated using engineering principles

C603.4-PO2 M Algorithms formulated can be converted into code using suitable

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

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

WEB SOURCE REFERENCES:

Department of CSE, RSET 14

 CHALK &  STUD.  WEB