don bosco college, sulthan bathery affiliated to

DON BOSCO COLLEGE, SULTHAN BATHERY

Affiliated to University of Calicut

(A NAAC accredited & ISO 9001:2015 Certified Institution)

Department Name: Computer Science & Mathematics

COURSE OUTCOME

IV Semester MT4 C04:MATHEMATICS-4

Credit

Complementary 3

Course Objective:

To enable the students to acquire knowledge about basics of ODE and PDE.

To familiarize the students with the different types of DE.

Prerequisite:

Differentiation, Integration, etc.

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to ordinary and partial differential equations.

CO1 Recall the linear and first order differential equations. Knowledge

CO2 Explain basic trigonometric identities and numerical methods. Understand

CO3 Apply definite integrals using numerical integration techniques and solve related problems.

Apply

CO4

Analyse first-order differential equations and second-order differential

equations and small systems of such equations using analytic, graphical, and

numeric techniques.

Analyse

CO5 Determine various techniques of integration and apply them to definite and

improper integrals.

Evaluate

CO6 Solve integration problems using basic techniques of integration, including

integration by parts and partial fractions.

Create

Mapping with Programme Outcomes

CO’s Module-1 Module-2 Module-3 Module-4 Module-5

CO1 M S M

CO2 M L

CO3 M M

CO4 M L L M

CO5 M L

CO6 M M

S- Strong; M-Medium; L-Low

Assessment Pattern

Bloom’s

Category

Internal

Internal-I Internal-II Assignments

Remember 10% 20% 20%

Understand 40% 30% 30%

Apply 50% 50% 50%

Analyze --- --- ---

Evaluate --- --- ---

Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Module I

1.1: Definitions and Terminology- definition, Classification by

Type, Classification by Order, Classification by Linearity,

Solution, Interval of Definition, Solution Curve, Explicit and

Implicit Solutions, Families of Solutions, Singular Solution,

Systems of Differential Equations

1.2: Initial Value Problems-First- and Second-Order IVPs,

Existence of solution

1.3: Differential Equations as Mathematical Models- some

specific differential- equation models in biology, physics and

chemistry.

2.1: Solution Curves without Solution-Direction Fields

2.2: Separable Equations- definition. Method of solution, losing

a solution, An Integral-Defined Function

2.3: Linear Equations-definition, standard form, homogeneous

and non-homogeneous DE, variation of parameter technique,

Method of Solution, General Solution, Singular Points,

Piecewise-Linear Differential Equation, Error Function

2.4: Exact Equations- Differential of a Function of Two

Variables, Criteria for an exact differential, Method of Solution,

Integrating Factors,

2.5: Solutions by Substitution-Homogeneous Equations,

Bernoulli’s Equation, Reduction to Separation of Variables

2.6: A Numerical Method- Using the Tangent Line, Euler’s

Method

21

Module II

3.1: Theory of Linear Equations- Initial-Value and Boundary-

Value Problems, Homogeneous Equations, Nonhomogeneous

Equations

3.2: Reduction of Order- a general method to find a second

solution of linear second order equation by reducing to linear

first order equation

3.3: Homogeneous Linear Equations with Constant

Coefficients- Auxiliary Equation, Distinct Real Roots ,

Repeated Real Roots , Conjugate Complex Roots, Higher-Order

Equations , Rational Roots

3.4: Undetermined Coefficients- Method of Undetermined

Coefficients for finding out particular solution

3.5: Variation of parameter- General solution using Variation of

parameter technique

3.6: Cauchy-Euler Equations- Method of solution, Distinct Real

Roots, Repeated Real Roots, Conjugate Complex Roots

3.9: Linear Models & Boundary Value Problems- Deflection of

a Beam, Eigenvalues and Eigen functions

22

Module III

4.1: Definition of Laplace Transform- definition, examples,

linearity, Transforms of some basic functions, Sufficient

Conditions for Existence of transform,

4.2: Inverse Transform and Transforms of Derivative- Inverse

Transforms:- A few important inverse transforms, Linearity,

Partial Fractions, Transforms of Derivatives, Solving Linear

ODEs

4.3: Translation Theorems- Translation on the s-axis, first

19

translation theorem, its inverse form, Translation on the t-axis,

Unit step function, second translation theorem. Its Inverse form ,

Alternative Form of second translation theorem. Beams

4.4: Additional Operational Properties- Derivatives of

Transforms, Transforms of Integrals-convolution, convolution

theorem and its inverse form, Volterra Integral Equation, Series

Circuits, Transform of a Periodic Function

4.5: The Dirac delta Function- Unit Impulse, The Dirac Delta

Function and its transform

Module IV

12.1: Orthogonal Functions- Inner Product, Orthogonal

Functions, Orthonormal Sets, Vector Analogy, Orthogonal

Series Expansion, Complete Sets,

12.2: Fourier Series-Trigonometric Series, Fourier Series,

Convergence of a Fourier Series, Periodic Extension, Sequence

of Partial Sums,

12.3: Fourier Cosine and Sine Series- Even and Odd Functions.,

Properties, Cosine and Sine Series, Gibbs Phenomenon, Half-

Range Expansions, Periodic Driving Force,

13.1: Separable Partial Differential Equations- Linear Partial

Differential Equation, Solution of a PDE, Separation of

Variables ( Method ), Superposition Principle, Classification of

Equations (- hyperbolic, parabolic, elliptic)

13.2: Classical PDE’s and BVP’s- Heat Equation, Wave

Equation, Laplace’s Equation, Initial Conditions, Boundary

Conditions, Boundary-Value Problems

13.3: Heat Equation- Solution of the BVP ( method of

Separation of Variables)

18

Text Books:

Advanced Engineering Mathematics (6/e) : Dennis G Zill Jones & Bartlett Learning, LLC (2018) ISBN: 978-1-284-10590-2

Reference Books:

1 Peter V O’Neil: Advanced Engineering Mathematics (7/e) Cengage Learning (2012)

ISBN: 978-1-111-42741-2

2 Erwin Kreyszig: Advanced Engineering Mathematics (10/e) John Wiley & Sons (2011)

ISBN: 978-0-470-45836-5

3 Alan Jeffrey: Advanced Engineering Mathematics Harcourt/Academic Press (2002)

ISBN: 0-12-382592-X

4 Glyn James: Advanced Modern Engineering Mathematics (4/e) Pearson Education Limited

(2011) ISBN: 978-0-273-71923-6

Course Designer:

Arya Vijayakumar,

Assistant Professor, Don Bosco College,

Sulthan Bathery.




Department Name: Computer Science & Mathematics

COURSE OUTCOME

VI Semester MAT6B09: REAL ANALYSIS

Credit

Core 5

Course Objective:

To enable the students to acquire knowledge about basics of Analysis.

To familiarize the students with the different types of problems.

Prerequisite:

Continuous functions, Sequence, Series, Beta-Gamma functions, Differentiation and Integration.

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to distinct types of Continuous functions, Riemann integral and Improper integrals of different kinds.

CO1 Demonstrate an understanding of limits and how they are used in sequences,

series, differentiation and integration. Understand

CO2 Construct rigorous mathematical proofs of basic results in real analysis. Apply

CO3 Analyse rigorous arguments developing the theory underpinning real

analysis. Analyse

CO4 Appraise how abstract ideas and rigorous methods in mathematical analysis can be applied to important practical problems.

Evaluate

CO5 Discuss fundamental properties of the real numbers that lead to the formal

development of real analysis. Create


CO’s Module-1 Module-2 Module-3 Module-4

CO1 M S L

CO2 M M L M

CO3 M L L L

CO4 L L M M

CO5 L L L L


Assessment Pattern

Bloom’s

Category

Internal




Apply 50% 50% 50%

Analyze --- --- ---


Create --- --- ---

SYLLABUS

Module/

Unit No.

Content Hours

Module I

Continuous Functions Continuous functions (a quick review),Continuous

functions on intervals, Uniform continuity 25

Module II

Riemann Integral

Riemann Integral, Riemann Integrable Functions, The fundamental theorem, Substitution theorem and application, Approximate Integration

25

Unit III

Sequence and series of functions

A quick review of series of real numbers, Point wise and uniform convergence, Interchange of limit and continuity, Series of functions

20

Unit IV

Improper Integrals Improper integrals of the first kind, Improper integrals

of the second kind, Cauchy Principal value Improper Integrals of the third

kind. Beta and Gamma functions Beta Functions, Gamma Functions, Relation

between Beta and Gamma Functions

20

Text Books:

1. G. Bartle, Donald R. Sherbert: Introduction to Real Analysis (3rd Edn.)

2. R.R. Goldberg: Methods of Real Analysis.

3. Narayanan & Manicavachagom Pillay: Calculus, Vol. II

Reference Books:

1. J.V. Deshpande: Mathematical Analysis and Applications, Narosa Pub. House.

2. Torence Tao: Analysis I, TRIM 37, Hindustan Book Agency.

3. K.A. Ross: Elementary Real Analysis: Theory of Calculus, Springer.

4. K.G. Binmore: Mathematical Analysis, CUP.

Course Designer:

Arya Vijayakumar,

Assistant Professor,

Don Bosco College, Sulthan Bathery.




Department Name:Computer Science

COURSE OUTCOME

IV Semester XXXXA13 Data Communication and Optical Fibers

Credit

Core 4

Course Objective:

To enable the students to acquire knowledge about basics of Data Communication

Systems in Digital Technology.

Prerequisite:

Communication System, Protocols, Technology Standards.

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to Networking which helps to possess a career in Mobile/Computer Networking field.

CO1 To understand the concept and Architecture of Communication System Understand

CO2 To Analyze the Architecture work of Telecommunication System. Understand

CO3 To Understand Reliability of Optical Fibre Apply

CO4 Develop various principles to ensure the standard of Protocols Apply

CO5 Facilitate the most effective action to implement Computer Networks Apply



CO1 S L M M

CO2 M S M S

CO3 S L S M

CO4 S M L S

CO5 M S S S


Assessment Pattern

Bloom’s

Category

Internal




Apply 50% 50% 50%

Analyze --- --- ---


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Introduction- Components, Networks, Protocols and standards, Basic Concepts: Line Configuration, Topology Transmission mode, analog and digital signals, Encoding and modulatinganalog-to-digital conversion, digital to analog conversion, digital data transmission, DTE-DCE interface, modems, cable modems. Transmission media: guided media, unguided media, and transmission impairment.

16

Unit II

Multiplexing: Many to one/ one to many, frequency division multiplexing, wave division multiplexing, TDM, multiplexing applications: the telephone system, Cellular System, Mobile Communication-GSM, Mobile Services, GSM system Architecture, Radio Interface in GSM

16

Unit III

Data link Control: Line Discipline, flow control, error control, Data link Protocols: Asynchronous Protocols, synchronous protocols, character oriented protocols, bit – oriented protocols, link access procedures. Local Area Networks: Ethernet, token bus, token ring, FDDI, Comparison, Switchingcircuit switching, packet switching, message switching, integrated services digital networks (ISDN): services, history, subscriber access to ISDN.

16

Unit IV

Overview of Optical Fiber Communication - Introduction, historical development, general system, advantages, disadvantages, and applications of optical fiber communication, optical fiber waveguides, fiber materials, Optical Sources And Detectors- Introduction, LED‟s, LASER diodes, Photo detectors. Ray theory, cylindrical fiber, single mode fiber, cutoff wave length, mode field diameter.

16

Text Books:

Reference Books: 1.Behrouz A. Forouzan, Data Communication and Networking, TMH

2. William Stallings: Data & Computer Communications, 6/e, Pearson Education. 3. William L. Schweber : Data Communication, McGraw Hill. 4. Electronic Communication Systems - Kennedy and Davis, TMH 5. Optical Fiber Communications– – John M. Senior, Pearson Education. 3rd Impression,2007. 6. Fiber optic communication – Joseph C Palais: 4th Edition, Pearson Education.

Course Designer:

Mr.Basil K Eldhose


Sulthan Bathery.




Department Name:Computer Science

COURSE OUTCOME

IV Semester

CSC4C04 – Data Structure Using C

Credit

Core 2

Course Objective:

Objectives of the Course: • To introduce the concept of datastructures • To make the

students aware of various datastructures • To equip the students implement fundamental

datastructures.

Prerequisite:

Knowledge in C Programming Language.

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to Networking which helps to possess a career in Mobile/Computer Networking field.

CO1 To understand the concept Data Structure Apply

CO2 To Analyze the Structure of Various DS. Apply

CO3 To Understand How to implement Maths in DS Apply

CO4 Develop Engineering Concepts in DS Apply

CO5 Facilitate the most effective action to implement Algorithms Apply



CO1 M S M M M

CO2 M M M M M

CO3 S L S M S

CO4 M M L S M

CO5 M S M S S


Assessment Pattern

Bloom’s

Category

Internal




Apply 50% 50% 50%

Analyze --- --- ---


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Primitive Data types and Abstract Data Types(ADT) - Introduction to data structures – definition - characteristics of data structures - categories of data structures – algorithm - space complexity and time complexity of an algorithm.

11

Unit II

Arrays and Singly Linked Lists - 1D, 2D and Multi-dimensional arrays – operations on arrays - Sparse matrix Representation

07

Unit III Lists- Linked List- Definition –Creation- Operations, Basics of Doubly Linked List, Circular Linked List

09

Unit IV

Stack and Queues – Definition and Operations on stack - Implementation of Stack using arrays and linked lists - Applications of Stacks - Polynomial Addition Queues – Definition, Implementations of queue using arrays and linked lists – basics of Circular queue, Dequeue - Applications of queues.

11

Unit-V

Searching and Sorting: Searching: Linear search & Binary search. Sorting – Linear sort - Bubble sort - Selection sort - Insertion sort - Quick sort - Merge sort – Comparisons and implementations.

10

Text Books:

Reference Books:

. YedidyanLangsam,MosheJ.Augenstein,andAaronM.Tenenbaum,

“DataStructuresUsingC”,PearsonEducation.,NewDelhi. HorowitzandSahani,

“FundamentalsofdataStructures”,GalgotiaPublicationPvt.Ltd.,NewDelhi. Course Designer:

Mr.Basil K Eldhose


Sulthan Bathery.




Department Name: Computer Science

COURSE OUTCOME

VI Semester BCS6B13 Computer Networks

Credit

Core 4

Course Objective:

To learn about transmissions in Computer Networks.

To learn various Protocols used in Communication.

To have a general idea on Network Administration. Prerequisite:

Knowledge in data structure.

Knowledge in Operating System.

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to Data Communication and networking which helps to possess a career in Networking field.

CO1 Describe various technologies used for data communication Remembering

CO2 Identify possible errors in data transfer and solutions for them Remembering

CO3 Describe the various protocols used in data communication Remembering

CO4 Classify the routing protocols and analyze how to assign the IP

addresses for the given network Apply

CO5 Identify security issues in networks and available protection

mechanisms Remembering



CO1 S S S S S

CO2 L S S M M

CO3 L S S S L

CO4 L M M S S

CO5 S


Assessment Pattern

Bloom’s

Category

Internal



Understand --- --- ---

Apply 50% 50% 50%

Analyze --- --- ---


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Introduction to Computer networks, Topology, categories of

networks, Internetwork, Internet, Network Models, Layered

model, OSI and TCP/IP models, Physical layer, Switching –

Circuit switching, Packet Switching and Message Switching, DTE

- DCE Interface, EIA - 232 interface,X.21 modems.

15

Unit II

Data link layer, Error detection and correction, Types of errors,

Single CSC error and Burst error, Vertical redundancy check

(VRC), longitudinal redundancy Check (LRC), Cyclic

Redundancy Check(CRC), Error correction - Single CSC error

correction, Hamming code Data compression - Huffman code, data

link control, Line discipline, Flow control, Error control, Multiple

Access, Random Access, ALOHA, pure ALOHA and slotted

ALOHA, CSMA/CD and SCMA/CA, Polling, Wired LANs,

Ethernet - IEEE standards, Wireless LANs - IEEE -802.11,basics

of Bluetooth,wifi,wimax and mobile networks (2G,3G,4G)

15

Unit III

Network layer, Networking and Internetworking devices -

Repeaters, Bridges, Routers, Gateways, Logical addressing - IPv4

& IPv6 addresses, Network Address Translation(NAT), Internet

protocols, internetworking, Datagram, Transition from IPv4 to

IPv6, Address Mapping- Error reporting and multicasting -

Delivery, Forwarding and Routing algorithms, Distance Vector

Routing, Link State Routing,.

15

Unit IV

Transport layer, Process-to-process Delivery: UDP, TCP and

SCTP, Congestion control and Quality of Service, Application

Layer, Domain Name Systems-Remote Login-Email FTP,WWW,

HTTP, Introductory concepts on Network management: SNMP.

15

Unit V Cryptography and Network Security: Introduction – Goals of 15

Security – Attacks - Services and Techniques. Basics of

Cryptography: Plain Text - Cipher Text – Encryption –

Decryption. Confidentiality: Basics of Symmetric Key Ciphers -

Traditional Symmetric Key Ciphers: Substitution, Transposition,

Stream & Lock, Modern – Components of Modern Block Cipher –DES - Modern Stream Cipher. Basics of Asymmetric Key Ciphers

– RSA Cryptosystem. Integrity: Message – Message Digest – Hash

Function. Authentication: MAC. Digital Signature : Analogy with

Manual Signature – Process – Signing the Digest – Services –

RSA Digital Signature Scheme.

Text Books:

1. Behurouz A Forozan, Introduction to Data Communications & Networking, TMH

Reference Books:

1 Andrew S. Tanenbaum, Computer Networks, PHI

2 William Stallings, Data and Computer Communications, VIIth Edition, Pearson

Education

3 William Stallings, Cryptography and Network Security, Principles and Practices,

Prentice Hall of India.

4 Steven Graham and Steve Shah, Linux Administration: A Beginners Guide, Third

Edition, Dreamtech, 2003.

5 Course Designer:

Geetha K G Assistant Professor,

Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

IV Semester BCS4B05 – Database Management System and RDBMS

Credit

Core 3

Course Objective:

To learn the basic principles of database and database design

To learn the basics of RDBMS

To learn the concepts of database manipulation SQL

To study PL/SQL language.

Prerequisite:

Basic knowledge of computers, data structures and programming.

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to Databases which helps to possess a career in Software field.

CO1 Explain the features of database management systems and Relational

database Understand

CO2 Design conceptual models of a database using ER modelling for real

life applications and also construct queries in Relational Algebra. Create

CO3 Create and populate a RDBMS for a real life application, with

constraints and keys, using SQL Create

CO4 Analyse the existing design of a database schema and apply concepts

of normalization to design an optimal database Analyse

CO5

Design a commercial relational database system (Postgres) by

writing SQL using the system

Create



CO1 S S S M M

CO2 S S

CO3 L L S S S

CO4 S S

CO5 L M S S S


Assessment Pattern

Bloom’s

Category

Internal


Remember --- --- ---


Apply 50% 50% 50%

Analyze --- --- ---


Create 10% 10% 20%

Syllabus

Module/

Unit No.

Content Hours

Unit I

Database System concepts and applications Introduction to

databases, File Systems vs. DBMS, Advantages and

Disadvantages of using DBMS Approach, Database administrators

and user, Data Models, Schemas, and Instances, Types of Data

Models, Three Schema Architecture and Data Independence,

Database Languages and Interfaces

8

Unit II

Entity-Relationship Model - Conceptual Data Models for Database

Design Entity Relationship Models, Concept of Entity, Entity Sets,

Relationship Sets, Attributes, Domains, Constraints, Keys, Strong

and Weak Entities, Concepts of EER. Relational Data Model

Relations, Domains and Attributes, Tuples, Keys. Integrity Rules,

Relational Algebra and Operations, Relational Calculus and

Domain Calculus, Relational Database Design using ER to

Relational Mapping

15

Unit III

Relational Database Design - Relational database design

Anomalies in a Database, Normalization Theory, Functional

Dependencies, First, Second and Third Normal Forms, Relations

with more than one Candidate Key, Good and Bad

Decompositions, Boyce Codd Normal Form, Multivalued

Dependencies and Fourth Normal Form, Join Dependencies and

Fifth Normal Form.

15

Unit IV SQL Concepts: Basics of SQL, DDL, DML, DCL, Tables – 15

Create, Modify and Delete table structures, Rename and Drop

tables, Defining constraints – Primary key, foreign key, unique,

not null, check, IN operator Select Command, Logical Operators,

Functions - aggregate functions, Built-in functions –numeric, date,

string functions, set operations, sub-queries, correlated sub-

queries, Use of group by, having, order by, join and its types,

Exist, Any, All. View - Creation, Renaming the column of a view,

destroys view.

Unit V

Transaction Management and Concurrency Control - Transaction

Properties (ACID), states, Commit, Rollback; Concurrency

Control Lost update problems, Locks, two phase locking.

Programming with SQL: Data types: Base and Composite,

Attributes. Variables – Constants - Using set and select

commands, Control Structures: IF, IF THEN ELSE, IF THEN

ELSEIF, CASE. Loops: LOOP, EXIT, CONTINUE, WHILE,

FOR, and FOREACH - Looping Through Arrays - Looping

Through Query Results. Security: Locks: Table-level Lock, Row-

level Lock, Deadlock, Advisory Lock. Cursors: Boud and

Unbound Cursors, Declaration, Opening, Working with cursors:

FETCH, MOVE, UPDATE/DELETE, CLOSE, Looping through a

Cursor. Concept of Stored Procedures – Advantages and

Disadvantages – Creation – Parameters Setting for Function- Alter

– Drop – Grant and Revoke - Passing and Returning data to/from

Stored Procedures - Using stored procedures within queries –

Triggers: Creation, Modification, Deletion, Error Handling:

Control Structures, Cursors, Functions, Triggers

20

Text Books:

1 Abraham Silberschatz, Henry F Korth, S.Sudharshan, Database System Concepts,

6thEdition

2 W. Gilmore, Beginning PHP and PostgreSQL 8: From Novice to Professional, Goels

Computer Hut (2007), ISBN: 9788181286000

3 PosgreSQL Official Documentation Online

Reference Books:

1. Alex Krigel and Boris M.Trukhnov, SQL Bible, Wiley pubs

2. Paul Nielsen, Microsoft SQL Server 2000 Bible, Wiley Dreamtech India Pubs.

3. CJ Date, Introduction to Database Systems, Addison Wesley.

4. Ramkrishnan, Database Management Systems, McGraw Hill

Course Designer:

Geetha K G


Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

I Semester CSS1C01 – DISCRETE MATHEMATICAL

STRUCTURES

Credit

Core 4

Course Objective:

To introduce discrete mathematics concepts necessary to understand basic foundation

of Computer Science Prerequisite:

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to Discrete Mathematics which helps to understand basic concepts of Computer operations.

CO1 Write an argument using logical notation and determine if the

argument is or is not valid. Remembering

CO2

Manipulate basic mathematical objects such as sets, functions,

and relations and will also be able to verify simple mathematical

properties that these objects possess Applying

CO3 Develop understanding of Logic Sets and Functions Creating

CO4 Demonstrate an understanding of relations and functions and be

able to determine their properties. Applying

CO5 Develop an understanding of how graph and tree concepts are

used to solve problems arising in the computer science. Creating



CO1 S

CO2 S S M S S

CO3 S L S M S

CO4 S M L S S

CO5 L L L L S


Assessment Pattern

Bloom’s

Category

Internal



Understand ---- --- ---

Apply 50% 50% 50%

Analyse --- --- ---

Evaluate --- --- ----

Create 205 30% 30%

Syllabus

Module/

Unit No.

Content Hours

Unit I

Sets and Mathematical Logic: Set Theory - Types of sets, Set

operations, Principles of Inclusion and Exclusion. Mathematical

Logic - Propositional Calculus - Statement, Connectives,

Conditional and Biconditional, Equivalence of Formula, Well

Formed Formula, Tautologies, Duality Law, Functionally

Complete Sets of Connectives, Normal Forms, Theory of

Inference for the Statement Calculus, Predicate Calculus –

Statement Functions, Variables and Quantifiers, Free and Bound

Variables, Theory of Inference for the Predicate Calculus.

15

Unit II

Functions and Relations: Functions – Types of Functions,

Composition of Functions and Inverse Functions. Relations -

Relations and Their Properties, Functions as relations, Closure of

Relations, Composition of relations, Equivalence Relations and

Partitions. Partial Ordering, Hasse Diagram. The Pigeon Hole

Principle

15

Unit III

Lattices and Boolean Algebra - Lattices and Algebraic Systems,

Principles of Duality, Basic Properties of Algebraic Systems

Defined by Lattices, Distributive Lattices and Complemented

Lattices. Boolean Lattices and Boolean Algebras. Boolean

Functions and Boolean Expressions.

15

Unit IV

Group Theory – Definition and Elementary Properties -

Permutation Groups,Cyclic Groups – Subgroups - Cosets and

Lagrange’s Theorem, Semigroup and Monoid. Homeomorphism

and Isomorphism. Rings, Integral Domains and Fields

15

Unit V

Graph Theory – Introduction, Directed Graph, Undirected Graph,

Connected and Disconnected Graphs, Bipartite Graph, Complete

Bipartite Graph, Isomorphic Graphs, Subgraph. Paths and Circuits.

Shortest Paths in Weighted Graphs - Dijkstra's Algorithm.

Eulerian Paths and Circuits, Hamiltonian Paths and Circuits. Trees

- Spanning Trees and Cut-Sets, Minimum Spanning Trees -

Kruskal's Algorithm, Prim's Algorithm

15

Text Books:

6 C Liu and D. Mohapatra, Elements of Discrete Mathematics - A Computer Oriented

Approach, TMH, ISBN: 1259006395.

7 Alan Doerr and Kenneth Levassur, Applied Discrete Structure for Computer Science,

Galgotia Publications Pvt. Ltd, ISBN: 9780574217554.

8 J. K. Sharma, Discrete Mathematics, Macmillan Publishers India Limited, ISBN:

1403924759.

9 J. P. Tremblay and R. Manohar, Discrete Mathematical Structures with Application

to Computer Science, McGraw-Hill Companies, ASIN: B001FPXR5Y. Course Designer:

Geetha K G


Don Bosco College,Sulthan Bathery.





COURSE OUTCOME

I Semester BCS1B01 – COMPUTER FUNDAMENTALS AND HTML

Credit

Core 3

Course Objective:

• To equip the students with fundamentals of Computer

• To learn the basics of Computer organization

• To equip the students to write algorithm and draw flow chart for solving simple problems • To learn the basics of Internet and webpage design

Prerequisite:

Basic knowledge about computer

Course Outcomes:

1. Bridge the fundamental concepts of computers with the present level of knowledge of

the students

2. Understand how logic circuits and Boolean algebra forms as the basics of digital

computer.

3. Understand binary, hexadecimal and octal number systems and their arithmetic.

4. Design and create a web page as well as to host the web page



SL NO Learning Outcomes Level

CO1 Recognize the fundamental concepts of computers

with the present level of knowledge

understanding

CO2 Recognise number system and construct basic logic

gates Knowledge

CO3 Identify the Problem solving skill in programming understanding

CO4 Implement interactive web page(s) using HTML,

CSS and JavaScript Applying

Course

Outcomes Module 1 Module 2 Module 3 Module 4 Module 5

1. S

2. S

3. L S

4. M S S

Assessment Pattern

Bloom’s

Category

Internal




Apply 30% 20% 30%

Analyze 20% 30% 20%


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Concepts of Hardware and Software: Computer Languages,

Language Translators, Features of good language, Basics

Computer Organization: Von Neumann Model, Input Unit, Output

Unit, Storage Unit, Control Unit, Memory Hierarchy, Primary

Storage, Cache Memory, Registers, Secondary Storage Devices,

Basics of Hardware Components – SMPS, Motherboard, Add-on

Cards, Ports, Memory, Adapters, Network cables, Basic Computer

Configuration

10

Unit II

Number Systems and Boolean Algebra – Decimal, Binary, Octal

and Hexadecimal Numbers, Arithmetic involving Number

Systems, Inter Conversions of Number Systems, 1’s and 2’s

Complements, Complement Subtractions, Digital Codes – Binary

Coded Decimal (BCD), ASCII Code ,Unicode, Gray Code,

Excess-3 Code.Boolean Algebra: Boolean Operations, Logic

Expressions, Postulates, Rules and Laws of Boolean Algebra,

DeMorgan's Theorem, Minterms, Maxterms, SOP and POS form

of Boolean Expressions for Gate Network, Simplification of

Boolean Expressions using Boolean Algebra and Karnaugh Map

Techniques (up to 4 variables)

10

Unit III

Fundamentals of Problem Solving – The Problem Solving Aspect,

Top-down Design, Definition –Algorithm, Flowchart, Program -

Properties of Flowcharts – Flowchart Symbols for Designing

Application Programs, Sample Algorithms – Sum, Average,

Finding Smallest Number, Checking Odd/Even Number, Prime

Number, Quadratic Equation

10

Unit IV

Basics of Web Design – www, W3C, Web Browser, Web Server,

Web Hosting, Web Pages, DNS, URL, Introduction to HTML,

XHTML, DHTML, HTTP. Overview of HTML 5 Basic

Formatting Tags: heading, paragraph, break, underline, bold, italic,

superscript, subscript, font and image, attributes: align, color,

bgcolor, font face, border, size navigation links using anchor tag:

internal, external, mail and image, lists: ordered, unordered and

definition, HTML media tags: audio and video

20

Unit V

Creating Simple Tables: row, col, heading, cell, border, spanning –

Form Controls: Input types – text, password, text area, button,

checkbox, radio button, select box, hidden controls, frames and

frame sets CSS: Introduction - Concept of CSS, Creating Style

Sheet: inline and internal, CSS Properties, CSS Styling:

Background, Text Format, Controlling Fonts - Working with

Block Elements and Objects, CSS ID and Class

.

20

Text Books

1. Sinha. P.K, Computer Fundamentals, BPB Publications

2. Ram. B, Computer fundamentals, New Age International Pvt. Ltd Publishers

3. Rajaraman V and Radhakrishnan, An introduction to Digital computer Design, PHI,

4. HTML 5 Blackbook, Dream Tech Press,2016 Edition

Reference Books

1. Thomas L Floyd, Digital Fundamentals, Universal Book Stall

2. Bartee T.C, Digital Computer Fundamentals, THM

Designer:

Mrs.Gibi.K S


Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

VI Semester BCS6B16a System Software

Credit

Elective 3

Course Objective:

To build fundamental knowledge in system software. and To learn functions of various

system software.

To learn specifically learn compilation process of a program.

Prerequisite:

Types of software, pre-processors, operating systems

Course Outcomes:

5. Analyze and synthesize system software

6. Design simple assembler for Simple instruction computer. 7. Design linker and loaders for simple instruction computer. 8. Design elementary macro processor for simple assembly level language 9. Design and implement simple laxer and parser using lex and yacc tools



Assessment Pattern

Bloom’s

Category

Internal




Apply 30% 20% 50%

Analyze 20 30 ---


SL NO Learning Outcomes Level

CO1 Distinguish between Operating Systems software and

Application Systems software

Analyze

CO2 Design loader and linker. Creating

CO3 Analyze macro processors Analyzing

CO4 Design one pass, two pass or multi pass assembler Creating

Course


5. S M

6. S

7. S

8. S

9. L S S

Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

System software: General concept, Assemblers, loaders, linkers,

macros, compilers, interpreters operating system, Design of

assemblers.

12

Unit II Macros and macro processors, Macro definitions and instructions,

Macro calls, Features of Macros, Design of Macro processors. 12

Unit III

Loading, linking and relocating Loader schemes- Binders, linking

loaders, overlays, dynamic binders- Dynamic loading and dynamic

linking – Relocatability of programs.

12

Unit IV

Compilers - Phases of a compiler - Lexical, Syntax, Intermediate

code generation, Optimization, Code generation, Symbol table and

error correcting routines – Passes of a compiler.

12

Unit V Case studies of lexical and syntax analyzers: LEX and YAAC.

12

Reference Books:

References:

1. D.M. Dhamdhere, Systems Programming and Operating Systems

2. John J Donovan, Systems programming

3. Jim Welsh and R M Mckeag, Structured System Programming, Prentice Hall.

4. Principal of Compiler Design, Alfred Aho V and Jeffrey D Ullman,Addison- Wesley

Publi.

5. L Lbech, System SoftwareCourse

Designer:

Mrs.Gibi.K S Assistant Professor,

Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

I Semester CSS1C03 – THEORY OF COMPUTATION

Credit

Core 4

Course Objective:

To provide the students with an understanding of basic concepts in the theory of computation.

Prerequisite:

Mathematical model of computing, compilation

Course Outcomes:

10. Discuss key notions of computation, such as algorithm, computability, decidability,

reducibility, and complexity, through problem solving.

11. Explain the models of computation, including formal languages, grammars and

automata, and their connections.

12. State and explain the Church-Turing thesis and its significance.

13. Analyze and design finite automata, pushdown automata, Turing machines, formal

languages, and grammars.

14. Solve computational problems regarding their computability and complexity and

prove the basic results of the theory of computation.

SL .NO

Learning Outcomes Level

CO1 Master regular languages and finite automata Understanding

CO2 Be familiar with Regular grammar Understanding

CO3 Master in CFL,CSL Comprehension

CO4 Master context‐free languages, push‐down automata, and

Turing recognizable languages

Understanding

CO5 Learn computational complexity creating


Course


10. S

11. l S

12. S

13. S

14. L M S


Assessment Pattern

Bloom’s

Category

Internal




Apply 30% 20% 300%

Analyze 20% 30% 20%


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Preliminaries - Introduction to formal proof and inductive proofs -

The central concepts of Automata Theory - Alphabets, Strings,

Languages – Introduction to automata and grammar -

Deterministic Finite Automata, Non-deterministic Finite Automata

– Equivalence of Deterministic and Nondeterministic Finite

Automata - Finite Automata with Epsilon Transitions -

Equivalence of NFA with and without epsilon moves

15

Unit II

Regular Expressions, Finite Automata and Regular Expressions,

Properties of Regular Languages - Pumping lemma and proof for

existence of non regular languages, Closure properties,

homomorphism, substitution - Decision Properties - Equivalence

and Myhill Nerode and DFA state minimization – Regular

Grammar.

15

Unit III

Context Free Languages - Equivalence of CFG and PDA – Normal

forms (CNF and GNF) – Closure properties of CFL’s – DCFL’s

and their properties – Decision procedures – CYK algorithm –

Pumping lemma and proof for existence of non context-free

languages – Context sensitive languages: Equivalence of LBA and

Context Sensitive Grammar (CSG).

15

Unit IV

Turing machines - TM computations – Equivalence of standard

TM with multi tape and non deterministic TM’s – Turing

acceptable, Turing decidable and Turing enumerable language

classes - Equivalence of type 0 grammars with TM’s – Church

thesis – Chomsky hierarchy - Closure properties of recursive and

recursively enumerable languages.

15

Unit V

Computability and Decidability – halting problem – reductions –

post correspondence problem. Computational complexity - Time

and space bounded simulations – Classes P and NP – NP

completeness – Cook’s theorem.

15

Reference Books:

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory,

Languages of Computation, 3rd Edition, Prentice Hall, ISBN: 0321455363.

2. Linz P, An Introduction to Formal Languages and Automata, Narosa Publishing House

Pvt. Ltd., New Delhi, ISBN: 9788173197819.

3. Michael Sipser, Introduction to Theory of Computation, Cengage Learning India Private

Limited, Indian Edition, ISBN: 8131505138.

4. H.R. Lewis and C.H. Papadimitriou, Elements of Theory of Computation, 2nd Edit ion,

Prentice Hall, ISBN: 0132624788.

5. J. E. Savage, Models of Computation, Exploring the Power of Computing, Addison

Wesley, 1998, Available at http://cs.brown.edu/~jes/book/.

6. Martin J.C, Introduction to Languages and Theory of Computation, Tata McGraw Hill, 3rd

Edition, ISBN: 9780070660489.

Designer:

Mrs.Gibi.K S


Sulthan Bathery.




Department Name: Computer Science and Mathematics

COURSE OUTCOME

VI Semester MAT6B10 : COMPLEX ANALYSIS

Credit

Core 5

Course Objective:

The objective of this course is to introduce the fundamental ideas of the functions of complex variables and developing a clear understanding of the fundamental

concepts of Complex Analysis such as analytic functions, complex integrals and

a range of skills which will allow students to work effectively with the concepts.

Prerequisite:

Complex numbers , Operations on complex numbers

Course Outcomes:

CO1

Demonstrate understanding of the basic concepts underlying

complex analyis

Understanding

CO2 Demonstrate familiarity with a range of examples of these

concepts.

Understanding

CO3 Prove basic results in complex analysis.

evaluation

CO4 Apply the methods of complex analysis to evaluate definite

integrals and infinite series.

Applying

Nb

Demonstrate understanding and appreciation of deeper aspects of

complex analysis such as the Riemann Mapping theorem..

analyzing



CO1 S

CO2 L M S

CO3 S M

CO4 M L S

CO5 S M

CO6


Assessment Pattern

Bloom’s

Category

Internal




Apply 40% 30% 40%

Analyze --- --- ---

Evaluate 10% 25% ---

Create --- --- ---

Syllabus

Module/

Unit

No.

Content Hours

Module

I

Derivatives, Differentiation formula, Cauchy‐Riemann Equations, Polar coordinates, Analyticfunctions, Harmonic functions Elementary functions ,The exponential function, Logarithmic function, Complex exponents, Trigonometric functions, Hyperbolic functions, Inverse Trigonometric and Hyperbolic functions.

15

Module

II

Derivatives of functions ω(t); Indefinite integral of ω(t); Contours, Contour integrals, Antiderivatives, Cauchy‐Goursat theorem (without proof), Simply and multiply connected domains, Cauchy's integral formula and its extension, Liouville's theorem and fundamental theorem of algebra, Maximum modulus principle.

25

Module

III

A quick review of convergence of sequence and series of complex numbers. Taylor series, Laurents series (without proof), Applications. Power series: Absolute and uniform convergence. Continuity of sum of powerseries, Differentiation and integration of power series, Multiplication and division of power series.

25

Module

IV

Isolated singular points, Residues, Cauchy's residue theorem, Residue at infinity, Three types of isolated singular points, Residues at poles, Zeroes of analytic functions, Zeroes and poles. Applications of residues, Evaluation of improper integrals, Jordan's Lemma (statement only), Definite integrals involving sines and cosines.

25

Text Books:

James Ward Brown and Ruel V. Churchill : Complex Variables andApplications (8th Edn.), McGraw Hill.

Reference Books:

1. Mark J.Ablowitz and Anthanassios S. Fokas: Complex Variables, Cambridge Text, 2nd Edn. 2. S. Ponnusamy : Foundation of Complex Analysis : Narosa. 3. Murray R. Spiegel: Complex Variables, Schaum's Outline series. 4. J.M. Howie: Complex Analysis: Springer India Reprint.

5. Stewart & Tall: Complex Analysis, CUP

Course Designer:

Jaismol Sebastian


Sulthan Bathery.





COURSE OUTCOME

IV Semester MTS4 B04 LINEAR ALGEBRA

Credit

Core 4

Course Objective:

to learn the fundamentals of linear algebra by capturing the ideas geometrically, by justifying

them algebraically and by preparing them to apply it in several different fields such as data communication, computer graphics, modelling etc.

Prerequisite:

Matrices and Matrix operations.

Course Outcomes:

CO1 Define the terms vector spaces, eigen value, eigen vector, inner

product spaces. Knowledge

CO2 Illustrate the examples of matrices and how they used in vector space and inner product space.

Understand

CO3

Identify the concepts of the terms span, linear independence, basis,

and dimension, and apply these concepts to various vector spaces

and subspaces

Apply

CO4 Analyze vectors in Rn geometrically and algebraically Analyse

CO5 Evaluate and use determinants, inverse, , eigen vector Evaluate

CO6 Solve the problems based on orthonormal sets and orthogonal

diagonalization Create



CO1 M L S

CO2 M L M

CO3 S L

CO4 M M

CO5 S M

CO6 S


Assessment Pattern

Bloom’s

Category

Internal




Apply 40% 45% 40%

Analyze --- --- ---


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Module I

Systems of Linear Equations & Matrices :-

1.1: Introduction to Systems of Linear Equations- linear equation in 𝑛

variables, linear system of 𝑚 equations in 𝑛 variables, solution, Linear Systems in Two and Three Unknowns, solution by geometric analysis,

consistent and inconsistent systems, linear system with no, one, and

infinite number of solutions, augmented matrix and elementary row operations 1.2: Gaussian elimination - Considerations in Solving Linear

Systems, Echelon Forms, reduced row echelon form, Elimination

Methods, Gauss–Jordan elimination, Gaussian elimination, Homogeneous Linear Systems, Free Variables, Free Variable Theorem

for Homogeneous Systems, Gaussian Elimination andBack- Substitution,

Some Facts about Echelon Forms 1.3: Matrices and Matrix operations-

Matrix Notation and Terminology, row vector , column vector , square matrix of order n , Operations on Matrices , Partitioned Matrices, Matrix

Multiplication by Columns and by Rows, Matrix Products as Linear

Combinations, linear combination of column vectors, Column-Row Expansion, Matrix Form of a Linear System,Transpose of a Matrix,

Trace of a Matrix 1.4: Inverses and algebraic properties of matrices-

Properties of Matrix Addition and Scalar Multiplication, Properties of

Matrix Multiplication, Zero Matrices and Properties, Identity Matrices, Inverse of a Matrix, Properties of Inverses, Solution of a Linear System

by Matrix Inversion, Powers of a Matrix , Matrix Polynomials,

Properties of the Transpose 1.5: Elementary matrices and a method for

finding 𝐴 −1 -row equivalence, elementary matrix, Row Operations by

Matrix Multiplication, invertibility of Syllabus 24 elementary matrices,

invertibility and equivalent statements, A Method for Inverting Matrices,Inversion Algorithm, illustrations. 1.6: More on linear systems

and invertible matrices - Number of Solutions of a Linear System,

Solving Linear Systems by Matrix Inversion, Linear Systems with a

Common Coefficient Matrix, Properties of Invertible Matrices,

equivalent statements for unique solution of 𝐴𝑥 = 𝑏, determining

consistency 1.7: Diagonal, Triangular and Symmetric matrices-Diagonal

Matrices, Inverses and Powers of Diagonal Matrices, Triangular Matrices. Properties of Triangular Matrices, Symmetric Matrices,

algebraic properties of symmetric matrices, Invertibility of Symmetric

Matrices 1.8: Matrix transformation- definition, Properties of Matrix

17

Transformations, standard matrix, A Procedure for Finding Standard

Matrices 2.1: Determinants by cofactor expansion- minors, cofactors,

cofactor expansion, Definition of a General Determinant, A Useful

Technique for Evaluating 2 × 2 and 3 × 3 Determinants 2.2: Evaluating determinants by row reduction- a few basic theorems, elementary row

operations and determinant, determinant of elementary matrices,

determinant by row reduction

Module

II

General Vector Spaces 4.1: Real vector space - Vector Space Axioms, examples, Some

Properties of Vectors 4.2: Subspaces- definition, criteria for a subset to

be a subspace, examples, Building Subspaces, linear combination, spanning, Solution Spaces of Homogeneous Systems as subspace, The

Linear Transformation Viewpoint , kernel, different set of vectors

spanning the subspace. 4.3: Linear Independence- Linear Independence and Dependence, illustrations , A Geometric Interpretation of Linear

Independence, Wronskian, linear independence using wronskian 4.4:

Coordinates and basis-Coordinate Systems in Linear Algebra, Basis for a

Vector Space, finite and infinite dimensional vector spaces, illustrations, Coordinates Relative to a Basis, Uniqueness of Basis Representation 25

4.5: Dimension- Number of Vectors in a Basis , dimension, Some

Fundamental Theorems, dimension of subspaces,

18

Module

III

4.6: Change of basis -Coordinate Maps, Change of Basis, Transition

Matrices, Invertibility of Transition Matrices, An Efficient Method for

Computing Transition Matrices for ℝ𝑛 , Transition to the Standard Basis

for ℝ𝑛 4.7: Row space, Column space and Null space- vector spaces associated with matrices, consistency of linear system, Bases for Row

Spaces, Column Spaces, and Null Spaces, basis from row echelon form,

Basis for the Column Space of a Matrix, row equivalent matrices and relationship between basis for column space, Bases Formed from Row

and Column Vectors of a Matrix 4.8: Rank Nullity and Fundamental

matrix spaces- equality of dimensions of row and column spaces, Rank

and Nullity, Dimension Theorem for Matrices, The Fundamental Spaces of a Matrix, rank of a matrix and its transpose, A Geometric Link

Between the Fundamental Spaces, orthogonal complement,, invertibility

and equivalent statements, Applications of Rank, Overdetermined and

Underdetermined Systems 4.9: Basic matrix transformations in 𝑅 2 and

𝑅 3 -Reflection Operators, Projection Operators, Rotation Operators,

Rotations in ℝ3 , Dilations and Contractions, Expansions and

Compressions, Shears, Orthogonal Projections onto LinesThrough the Origin, Reflections About Lines Through the Origin 4.10: Properties of

matrix transformation- Compositions of Matrix Transformations, One-

to-One Matrix Transformations, Kernel and Range, fundamental relationship between invertibility of a matrix and its matrix

transformation, Inverse of a One-to-One Matrix Operator

22

Module

IV

4.11: Geometry of matrix operators-Transformations of Regions, Images

of Lines Under Matrix Operators, Geometry of Invertible Matrix Operators, Elementary matrix and its matrix transformation,

consequence 5.1: Eigen values and Eigen Vectors- definition,

Computing Eigenvalues and Eigenvectors, characteristic equation, alternative ways of describing eigen values, Finding Eigenvectors and

Bases for Eigenspaces, Eigenvalues and Invertibility, Eigenvalues of

General Linear Transformations, 5.2: Diagonalization-The Matrix Diagonalization Problem, linear independence of eigen vectors and

diagonalizability, Procedure for Diagonalizing a Matrix, 26 Eigenvalues

of Powers of a Matrix, Computing Powers of a Matrix, Geometric and

Algebraic Multiplicity 6.1: Inner Product – definition of General inner

product, Euclidean inner product (or the standard inner product) on ℝ𝑛 ,

norm of a vector, properties (upto and including theorem 6.1.1), a few

examples (only example7 and example 10) [rest of the section omitted]

23

6.2: Angle and orthogonality in Inner product spaces- only the definition

of orthogonality in a real inner product space (to be motivated by the

relation in the definition (3) of section 3.2) and examples(2),(3) and (4)

6.3: Gram–Schmidt Process- definition of Orthogonal and Orthonormal Sets, examples,linear independence of orthogonal set, orthonormal basis,

Coordinates Relative to Orthonormal Bases [‘Orthogonal Projections’

omitted] The Gram–Schmidt Process [only statement of Theorem 6.3.5 and the step by step construction technique are required; derivation

omitted], illustrationsexamples 8 and 9, Extending Orthonormal Sets to

Orthonormal Bases [rest of the section omitted] 7.1: Orthogonal

Matrices- definition, characterisation of orthogonal matrices, properties of orthogonal matrices, Orthogonal Matrices as Linear Operators, a

geometric interpretation [ rest of the section omitted] 7.2: Orthogonal

Diagonalization- The Orthogonal Diagonalization Problem, Conditions for Orthogonal Diagonalizability, Properties of Symmetric Matrices,

Procedure for Orthogonally Diagonalizing an n × n Symmetric Matrix,

Spectral Decomposition (upto and including example2) [rest of the section omitted]

Text Books:

Elementary Linear Algebra: Application Version(11/e) :Howard Anton & Chris Rorres Wiley(2014) ISBN 978-1-118-43441-3

Reference Books: 1 .Jim DeFranza, Daniel Gagliardi: Introduction to Linear Algebra with Applications Waveland Press, Inc(2015)ISBN: 1-4786-2777-8

2 .Otto Bretscher: Linear Algebra with Applications(5/e) Pearson Education, Inc (2013) ISBN: 0-321-79697-7

3. Ron Larson, Edwards, David C Falvo : Elementary Linear Algebra(6/e) Houghton Mifflin Harcourt Publishing Company(2009) ISBN: 0-618-78376-8

4. David C. Lay, Steven R. Lay, Judi J. McDonald: Linear Algebra and its Application (5/e) Pearson Education, Inc(2016) ISBN: 0-321-98238-X

5. Martin Anthony, Michele Harvey: Linear Algebra: Concepts and Methods Cambridge University Press(2012) ISBN: 978-0-521-27948-2

6. Jeffrey Holt: Linear Algebra with Applications W. H. Freeman and Company (2013) ISBN: 0-7167-8667-2

Course Designer:

Jaismol Sebastian Assistant Professor,

Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

I Semester MTS1 C01:MATHEMATICS-1

Credit

Complimentary 3

Course Objective:

Use the Intermediate Value Theorem to identify an interval where a continuous function has a root

Find critical points, and use them to locate maxima and minima

Use integration to find the area under curves and the area between curves

Use Differential Calculus to solve optimization problems

Prerequisite:

Differentiation,Integration.

Course Outcomes:

CO1 Define, graph, compute limits of, differentiate, integrate, and solve

related problems Knowledge

CO2 Illustrate some examples of limits, differentiation, integration. Understand

CO3 Solve different types of problems and sketch the graphs Apply

CO4 Estimate the way for finding area, velocity, volume etc. Create



CO1 M M L M

CO2 M L M M

CO3 L M L L

CO4 S M S


Assessment Pattern

Bloom’s

Category

Internal




Apply 50% 40% 40%

Analyze --- --- ---


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Module I

1.1: Introduction to the derivative-instantaneous velocity, slope of

tangent line, differentiating simplest functions

1.2: Limits- Notion of limit, basic properties, derived properties,

continuity, continuity of rational functions, one sided limit, limit

involving ±∞

1.3: The derivative as Limit- formal definition, examples,

14

differentiability and continuity, Leibnitz notation,

1.4: Differentiating Polynomials-power rule, sum rule etc.,

1.5: Product and quotients- product, quotient, reciprocal & integral

power rule

1.6: Linear Approximation and Tangent Lines- equation of tangent

line and linear approximation, illustrations

Module

II

2.1: Rate of change and Second derivative- linear or proportional

change, rates of change, second derivative,

2.2: The Chain Rule- power of a function rule, chain rule,

2.3: Fractional Power & Implicit Differentiation-rational power of

a function rule, implicit differentiation

2.4: Related rates and parametric curves- Related rates, parametric

curves, word problems involving related rates

2.5: Anti derivatives- anti differentiation and indefinite integrals,

anti differentiation rules

13

Module

III

3.1: Continuity and Intermediate value theorem-IVT: first and

second version

3.2: Increasing and decreasing function- Increasing and

decreasing test, critical point test, first derivative test

3.3: Second derivative and concavity- second derivative test for

local maxima , minima and concavity , inflection points

3.4: Drawing of Graphs- graphing procedure, asymptotic

behaviour

3.5: Maximum- Minimum Problems- maximum and minimum

values on intervals, extreme value theorem, closed interval test,

word problems

3.6: The Mean Value Theorem- The MVT, consequences of MVT-

Rolles Theorem, horserace theorem

11.2: L’Hospital rule- Preliminary version, strengthened version

18

Module

IV

4.1: Summation- summation, distance and velocity, properties of

summation, telescoping sum (quick introduction- relevant ideas

only )

4.2: Sums and Areas-step functions, area under graph and its

counterpart in distance-velocity problem

4.3: The definition of Integral- signed area (The counterpart of

signed area for our distance-velocity problem), The integral,

Riemann sums

4.4: The Fundamental Theorem of Calculus-Arriving at FTC

intuitively using distance velocity problem, Fundamental

integration Method, proof of FTC, Area under graph,

displacements and velocity

4.5: Definite and Indefinite integral-indefinite integral test,

properties of definite integral, fundamental theorem of calculus:

alternative version (interpretation and explanation in terms of

areas)

4.6: Applications of the Integral- Area between graphs, area

between intersecting graphs, total changes from rates of change,

9.1: Volume by slice method- the slice method, volume of solid of

revolution by Disk method

82

9.3: Average Values and the Mean Value Theorem for Integrals-

motivation and definition of average value, illustration, geometric

and physical interpretation, the Mean Value Theorem for Integrals

19

Text Books:

1. Calculus I (2/e) : Jerrold Marsden & Alan Weinstein Springer-Verlag New York Inc(1985) ISBN 0-387-90974-5

2. Calculus II (2/e) : Jerrold Marsden & Alan Weinstein Springer-Verlag New York Inc(1985) ISBN 0-387-90975-3

Reference Books: 1.Soo T Tan: Calculus Brooks/Cole, Cengage Learning(2010 )ISBN 0-534- 46579-X

2 Gilbert Strang: Calculus Wellesley Cambridge Press(1991)ISBN:0-9614088- 2-0

3 Ron Larson. Bruce Edwards: Calculus(11/e) Cengage Learning(2018) ISBN: 978-1-337-27534-7

4 Robert A Adams & Christopher Essex : Calculus Single Variable (8/e) Pearson Education Canada (2013) ISBN: 0321877403

5 Joel Hass, Christopher Heil & Maurice D. Weir : Thomas’ Calculus(14/e) Pearson (2018) ISBN 0134438981

6 Jon Rogawski & Colin Adams : Calculus Early Transcendentals (3/e) W. H. Freeman and Company(2015) ISBN: 1319116450

Course Designer:

Jaismol Sebastian Assistant Professor,

Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

VI Semester BCS6B11:Android Programming

Credit

Core 4

Course Objective:

To have a review on concept of Android programming.

To learn Android Programming Environments.

To practice programming in Android.

To learn GUI Application development in Android platform with xml.

Prerequisite: Knowledge in OO & Java Programming. .

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to OOP which helps them to develop android applications.

CO1 Find student ability to develop software with reasonable

complexity on mobile platform Recall

CO2 Explain the fundamentals of Android operating systems Examine

CO3 Apply Java programming concepts to Android application

development. Apply

CO4 Investigate how to debug and deploy software to mobile

devices Analyze

CO5 Asses students skills of using Android software development

tools Evaluate

CO6 Design and develop user Interfaces for the Android platform. Create



CO1 S S S S S

CO2 L S S M

CO3 S M M

CO4 S

CO5 S M M M

CO6 H M L


Assessment Pattern

Bloom’s

Category

Internal




Apply 20% 20% 20%

Analyze 40% 5% 15%

Evaluate 40% 20% 10%

Create 30% 20% 10%

Syllabus

Module/

Unit No.

Content Hours

Unit I

Introducing the android computing platform, History of android,

android software stack, Developing end user application using

Android SDK, Android java packages, Setting up the development

environment, Installing android development tools (ADT),

Fundamental components, Android virtual devices, Running on

real device, Structure of android application, Application life

cycle.

15

Unit II

Understanding android resources - String resources, Layout

resources, Resource reference syntax, Defining own resource IDs -

Enumerating key android resources, string arrays, plurals, Colour

resources, dimension resources, image resources, Understanding

content providers - Android built in providers, exploring databases

on emulator, architecture of content providers, structure of android

content URIs, reading data using URIs, using android cursor,

working with where clause, inserting updates and deletes,

implementing content, Understanding intents basics of intents,

available intents, exploring intent composition, Rules for

Resolving Intents to Their Components, ACTION PICK, GET

CONTENT, pending intents

15

Unit III

User interfaces development in android - building UI completely

in code, UI using XML, UI in XML with code, Android's common

controls - Text controls, button controls, checkbox control, radio

button controls, image view, date and time controls, map view

control, understanding adapters, adapter views, list view, grid

view, spinner control, gallery control, styles and themes,

Understanding layout managers - linear layout manager, table

layout manager, relative layout manager, frame layout manager,

grid layout manager.

15

Unit IV

Android menus - creating menus, working with menu groups,

responding to menu items, icon menu, sub menu, context menu,

dynamic menus, loading menu through XML, popup menus,

Fragments in Android structure of fragment, fragment life cycle,

fragment transaction and back stack, fragment manager, saving

fragment state, persistence of fragments, communications with

fragments, startActivity() and set TargetFragment(), using dialogs

in android, dialog fragments, working with toast, Implementing

action bar - tabbed navigation action bar activity, implementing

base activity classes, tabbed action bar and tabbed listener, debug

text view layout, action bar and menu interaction, list navigation

action bar activity, spinner adapter, list listener, list action bar,

standard navigation action bar activity, action bar and search view,

action bar and fragments.

15

Unit V

Persisting data - Files, saving state and preferences - saving

application data, creating, saving and retrieving shared

preferences, preference framework and preference activity,

preference layout in XML, native preference controls, preference

fragments, preference activity, persisting the application state,

including static files as resources, Working with file system,

SQLLite - SQLLite types, database manipulation using SQLLite,

SQL and database centric data model for Android, Android

database classes.

15

Text Books:

Reference Books:

1. Satya Komatineni & Dave MacLean, Pro Android 4, Apress.

2. Retomeier, Professional Android 4 Application Development, Wrox.

3. Zigurd Mednieks, Laird Dornin, G. Blake Meike, and Masumi Nakamura,

Programming Android, O'Reilly

Course Designer:

Jwala Jose

Assistant Professor Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

I Semester CSS1C04 | The Art of Programming Methodology

Credit

Core 4

Course Objective:

To learn the art of designing algorithms and flowcharts.

To introduce the concept of algorithmic approach for solving real‐life problems.

To develop competencies for the design and coding of computer programs.

To learn designing programs with advanced features of C.

.

Course Outcomes:

On completing the course the students will be able to handle errors, solving problems, and building

application using C.

CO1 Describe and employ strategies that are useful in debugging. Recall

CO2 Explain the use different data types, such as simple variables,

arrays, and structures. Examine

CO3 Use algorithms to solve simple programming problems. Apply

CO4 Analyze programming problems to choose when regular loops

should be used and when recursion will produce a better program. Analyze

CO5

Evaluate the programming concepts that use calculations and

selections, loops and arrays, functions, arrays for character strings

and that use pointers for character strings.

Evaluate

CO6 Design and plan the logic of a Program. Create



CO1 S

CO2 S M L CO3 S

CO4 S M CO5 S M M L CO6 S


Assessment Pattern

Bloom’s

Category

Internal


Remember 40% 5% 20%


Apply 40% 10% 20%

Analyze 10% 40% 15%


Create 40% 5% 10%

Syllabus

Module/

Unit No.

Content Hours

Unit I Part A: Problem Solving – Flow Chart for Structured 15

Programming – Program Charts – System Charts – Variables, data

names, programming statements – Flow Chart Symbols –

Terminal Symbols – I/O – Comments – Connectors – Process –

Decision - Loops – Flow Charts of Fundamental Algorithms

(mentioned in Part B) - Part B: Algorithm Design – Problem

Solving Aspect – Top Down Design – Formal Conventions –

Writing Algorithms – Fundamental Algorithms (Discuss the

Design of Algorithms only). Part C: Program, Characteristics of a

good program - Modular Approach - Programming style -

Documentation and Program Maintenance - Compilers and

Interpreters - Running and Debugging Programs - Syntax Errors -

Run-Time Errors - Logical Errors - Concept of Structured

Programming.

Unit II

Introduction to C Programming - overview and importance of C -

C Program Structure and Simple programs - Creation and

Compilation of C Programs under Linux and Windows Platforms.

Elements of C Language and Program constructs - structure of C

program - character set, tokens, keywords, identifier - Data types,

constants, symbolic constants, variables, declaration, data input

and output, assignment statements. Operators in C - arithmetic

operators, relational operators, logical operators, assignment

operators, increment and decrement operators, conditional

operators, special operators, precedence of operators - arithmetic

expressions – evaluation of expressions, type conversion in

expressions – precedence and associativity - mathematical

functions - I/O operations.

15

Unit III

Decision making – IF statement, IF ELSE statement, Nesting of IF

ELSE and ELSE IF Ladder, SWITCH statement, BREAK

statement, CONTINUE statement, GOTO statement, return

statement. Looping - WHILE, DO-WHILE, and FOR loops,

nesting of loops, skipping & breaking loops. Arrays - single

dimension arrays - accessing array elements - initializing an array,

two dimensional & multi dimensional arrays - memory

representation - strings – processing of strings - string

manipulation functions.

15

Unit IV

The Concept of modularization - defining function - types of

functions – User defined functions - function prototype and

definition – arguments - passing parameters - call by reference -

call by value – returning - nesting of functions and recursion -

passing arrays & strings to function - returning multiple values -

recursion – scope and life time of variables storage class specifiers

- automatic, extern, static storage, register storage. Structures &

Union definition, giving values to members, structure

initialization, comparison of structure variables, arrays of

structures, arrays within structures, structures within arrays,

structures and functions, Unions, bit-fields.

15

Unit V

Pointer - pointer operator - pointer expression - declaration of

pointer - initializing pointer - de-referencing - pointer to pointer,

constant pointer, array of pointers, pointer to function. Files - file

handling - defining & opening a file - closing a file - Input/output

operations on files – error handling, random access to files,

command line arguments – dynamic memory allocation - linked

lists (concepts only) - preprocessor directives: macro substitution

directives - simple macros - macros with arguments - nesting of

15

macros, compiler control directives.

Text Books:

Reference Books:

1. Martin M. Lipschutz and Seymour Lipschutz, Schaum's Outline of Theory and

Problems of Data Processing, ISBN: 9780070379831 (Unit I Part A).

2. Anil Bikas Chaudhuri, The Art Of Programming Through Flowcharts & Algorithms,

Laxmi Publications, New Delhi (Unit I Part A).

3. Jean Paul Trembley and Pual G Sorenson, An Introduction to Data Structures with

Applications, Tata McGraw Hill (Unit I Part B).

4. R G Dromey, How to Solve by Computer, Pearson Education, 5 th Edition, ISBN:

0134340019 (Unit I Part B).

5. J.B Dixit, Computer Fundamentals and Programming in C, Firewall Media, ISBN:

8170088828. (Unit I Part C).

6. Dennie Van Tassel, Program Style, Design, Efficiency, Debugging, and Testing, PHI,

ISBN: 0137299478 (Unit I Part C).

7. E Balagruswamy, Programming in ANSI C, TMH, 5 th Edition, ISBN: 0070681821.

8. Kamthane, Programming in C, 2nd Edition, Pearson India, ISBN: 8131760316.

9. Brian W. Kernighan and Dennis M. Ritchie, C Programming Language, PHI, ISBN:

0131103628.

10. Kanetkar, Let Us C, BPB Publications, 8 th Edition, ISBN: 1934015253.

Course Designer:

Jwala Jose

Assistant Professor

Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

I Semester CSC1C01 – Computer Fundamentals

Credit

Complementary 2

Objectives of the Course:

To learn the basics of computer hardware units and how they work together

To acquire basic skill with office packages

Prerequisites

Background of the basic science at +2 level

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to

OOP which helps them to develop java applications.

CO1

Find the concept of input and output devices of Computers and

how it works and recognize the basic terminology used in

computer programming

Remembering

CO2 Explain the fundamental concepts of computers with the present

level of knowledge of the students. Understanding

CO3 classify operating systems, programming languages, peripheral

devices, networking, multimedia and internet Applying

CO4 Categorize binary, hexadecimal and octal number systems and

their arithmetic.

Analyzing

CO5 Evaluate how logic circuits and Boolean algebra forms as the

basics of digital computer.

Evaluating

CO6 Create Sequential and combinational logic from basic gates. Creating



CO1 S

CO2 S M M S L CO3 L M S S

CO4 S L CO5 S L CO6 S


Assessment Pattern

Bloom’s

Category

Internal




Apply 20% 50% 20%

Analyze 40% 15% 15%


Create 40% 5% 10%

Syllabus

Module/

Unit No.

Content Hours

Unit I

Number systems- Non-positional number systems and positional

number systems (Binary, Octal and Hexadecimal), Converting

from one number system to another- decimal to a new base,

converting to decimal from another bases, converting from base

other than ten to base other than ten, short cut method for

converting from binary to octal, octal to binary, binary to

hexadecimal and hexadecimal to binary, Computer Codes (BCD,

EBCDIC, ASCII) error detecting and correcting codes, parity bit,

Hamming Code, computer arithmetic ,importance of binary, binary

addition and subtraction.

13

Unit II

Boolean Algebra and Logic circuits- fundamental concepts of

Boolean Algebra, postulates, Principle of duality, theorems of

Boolean Algebra, Boolean functions, minimization, complement,

canonicals forms, conversion between canonical forms. Logic

Gates- AND, OR, NOT, NAND, NOR, XOR and XNOR, logic

circuits, converting expression to logic circuit, universal NAND

and NOR gates, Exclusive OR and equivalence functions, Design

of Combinational circuits (Half Adder, Subtractor and Full Adder)

13

Unit III

Basic Computer Organization-Input Unit, Output Unit, Storage

Unit (Direct, Sequential and Random Access), CPU organization,

Control Unit (micro programmed and hardwired control), primary

storage, memory hierarchy, storage locations and addresses,

storage capacity, bit, byte, nibble, RAM, ROM, PROM and

EPROM, cache memory, registers. Secondary storage devices

(Magnetic tape, Hard disk and CD drive)

13

Unit IV

I/O devices - Input Devices-identification and its use, keyboard,

pointing devices (mouse, touch pad and track ball), Video

digitizer, remote control, joystick, magnetic stripes, scanner,

digital camera, microphone, sensor, and MIDI instruments, Output

Devices identification and its use, monitor, printer (laser, inkjet,

dot-matrix), plotter, speaker, control devices (lights, buzzers,

robotic arms, and

13

Unit V

Planning a Computer program, purpose of program planning,

algorithm, flowchart - symbols, sample flowcharts, advantages and

limitations.

12

Text Books

1. Pradeep K. Sinha and Priti Sinha, Computer Fundamentals, BPB

References:

1. Peter Nortorn, Introduction to Computer, TMH

2. Rajaraman, V, Fundamental of Computers, Prentice Hall India

3. B. Ram, Computer Fundamentals

Course Designer:

Jwala Jose Assistant Professor

Don Bosco College,

Sulthan Bathery.




Department Name:Computer science and Mathematics

COURSE OUTCOME

VI Semester MAT6B12:NUMBER THEORY AND LINEAR ALGEBRA

Credit

Core 4

Course Objective:

To describe the concept and results of Number Theory

To demonstrate an understanding of the linear Algebra

To apply the theory in the course to solve a variety of problems at an appropriate level

of difficulity

Pre requisite:

Theory of numbers,abstract algebra,matrices

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to real and complex numbers.

CO1 To define and recognize the basic properties of theory of numbers Remembering

CO2 Ability to apply the theorem in a correct mathematical way Applying

CO3 Analyse the solution set of a system of linear equations Analysing

CO4 Apply Euler Fermat’s theorem to prove relations involving prime numbers.

Applying

CO5

To define the properties of vector space and subspaces using linear

transformations.

Remembering



CO1 S M S S

CO2 M L H L

CO3 M M H M

CO4 M M M H

CO5 L M M H


Assessment Pattern

Bloom’s

Category

Internal



Apply 30% 20% 50%

Analyze 50% 50% 30%

Evaluate --- ---

Create --- --- ---

Syllabus

Mo

dul

e/

Un

it

No

.

Content H

ou

rs

Un

it1

A quick review of sets and functions ,Mathematical induction ,Finite and infinite Sets,Real Numbers ,The algebraic property of real numbers (Sec. 1.1, 1.2, 1.3, 2.1 of text 1)

30

Un

it2

Fermat's little theorem and pseudoprimes Wilson's theorem. The sum and number of divisors.The greatest integer function.Euler's phi‐function.Euler's generalization of Fermat's theorem.Properties of the phi‐function. (Sections 5.2, 5.3, 6.1, 6.3, 7.2, 7.3 and 7.4 of Text 1) (Theorems 7.6 and 7.7 only).

25

Un

it3

Vectorspaces‐examples,linearcombinations,spanning,linearindependence,base, finite dimensional vector spaces

15

Un

it4

Linear mappings‐ Linear transformations,examples,nullspace,rank –nullity theorem,linear isomorphism.

20

Text Books:

Reference Books: 1. David M. Burton : Elementary Number Theory, Sixth Edn., TMH. 2. T. S. Blynth and E.F. Robertson: Basic Linear Algebra, second Edn springer under graduate mathematics series 2009 Course Designer:

Praseetha N A







COURSE OUTCOME

I Semester MAT1B01:BASIC LOGIC &NUMBER THEORY

Credit

Core 4

Course Objective:

To describe the concept and results of Number Theory

To solve linear congruent equations

To express ideas in precise and concise mathematical terms and to make valid

arguments. To apply the theory in the course to solve a variety of problems at an appropriate level

of difficulity

Pre requisite:

Theory of numbers,abstract algebra,matrices

Course Outcomes:


CO1 To define and recognize the basic properties of logic gates Remembering

CO2 Ability to apply the theorem in a correct mathematical way Applying

CO3 Analyse the solution set of a system of linear equations Analysing

CO4 To demonstrate the basis of vector space Understanding

CO5 To understand the definitions of congruences,residue classes. Remembering



CO1 L M S S

CO2 M L L L

CO3 S M M M

CO4 M S M L

CO5 L M M M


Assessment Pattern

Bloom’s

Category

Internal




Apply 30% 10% 50%

Analyze 10% 40% ---

Evaluate --- 10% ---

Create --- --- ---

Syllabus

Module/

Unit

No.

Content Hours

Unit1

Text (1) (12 hrs) 1.1: Propositions- definition, Boolean (logic) variables, Truth Value, Conjunction , Boolean expression, Disjunction (inclusive and exclusive), Negation, Implication, Converse, Inverse and Contra positive, Biconditional statement, Order of Precedence, Tautology Contradiction and Contingency [‘Switching Networks’ omitted] 1.2: Logical equivalences- laws of logic [‘Equivalent Switching Networks’ ‘Fuzzy logic’ & ‘Fuzzy decisions’omitted] 1.3: Quantifiers- universal & existential, predicate logic 1.4: Arguments- valid and invalid arguments, inference rules 1.5: Proof Methods – vacuous proof, trivial proof, direct proof, indirect proof-contrapositive & contradiction, proof by cases , Existence proofconstructive & non constructive, counterexample 1.3:

15

Unit2

Mathematical induction- well ordering principle, simple applications, weak version of principle of mathematical induction, illustrations, strong version of induction (second principle of MI), illustration 1.4: Recursion- recursive definition of a function, illustrations. 2.1: The division algorithm – statement and proof, div & mod operator, card dealing, The

12

two queens puzzle (simple applications), pigeonhole principle and division algorithm, divisibility relation, illustration ,divisibility properties, union intersection and complement-inclusion-exclusion principle & applications, even and odd integers. 2.2: Base- b representation – base-b expansion of an integer & representation in nondecimal bases.Prime and Composite Numbers- definitions, infinitude of primes, The sieve of Eratosthenes, a number theoretic function, prime number theorem (statement only), distribution of primes (upto and including Example ) 2.6: Fibonacci and Lucas Numbers- Fibonacci Problem, Fibonacci Numbers Cassini’s Formula, Lucas Numbers and Binet’s Formula. 2.7: Fermat Numbers- definition, recurrence relation satisfied by 𝑓𝑛, non primality of 𝑓5 , primality of 𝑓4 (upto and including example 2.30 )Greatest Common Divisor- gcd, symbolic definition, relatively prime integers, Duncan’s identity, Polya’s theorem, infinitude of primes, properties of gcd, linear combination, gcd as linear combination, an alternate definition of gcd, gcd of n positive integers, a linear combination of n positive integers, pairwise relatively prime integers, alternate proof for infinitude of prime. 3.2: The Euclidean Algorithm- The Euclidean algorithm [algorithm 3.1 omitted], A jigsaw puzzle, Lame’s theorem (statement only; proof omitted ) 3.3: The Fundamental Theorem of Arithmetic- Euclid’s lemma on division of product by a prime, fundamental theorem of arithmetic, Canonical Decomposition, number of trailing zeros, highest power of a prime dividing 𝑛!, [only statement of Theorem3.14 required; proof omitted] Distribution of Primes Revisited, Dirichlet’s Theorem(statement only)

Unit3

Least Common Multiple- definition, canonical decomposition to find lcm, relationship between gcd and lcm, relatively prime numbers and their lcm Linear Diophantine Equations – LDE in two variables, conditions to have a solution, Aryabhatta’s method, number of solutions, general solution, Mahavira’s puzzle, hundred fowls puzzle, Monkey and Coconuts Puzzle, Fibonacci numbers and LDE, LDE in more number of variables and their solutions-Congruences - congruence modulo m, properties of congruence, characterization of congruence, least residue, congruence classes, A Complete Set of Residues Modulo m , properties of congruence, use of congruence to find the remainder on division ,Towers of Powers Modulo m, further properties of congruence and their application to find remainder ,congruences of two numbers with different moduli 4.2: Linear Congruence- solvability, uniqueness of solution, incongruent solutions, Modular Inverses, applications 5.1: Divisibility Tests-Divisibility Test for 10, Divisibility Test for 5, Divisibility Test for 2 𝑖 , Divisibility Tests for 3 and 9, Divisibility Test for 11 .

17

Unit4

Wilson’s Theorem- self invertible modulo prime, Wilson’s theorem and its converse, Fermat’s Little Theorem(FLT)- FLT and its applications,inverse of a modulo p using FLT, application-solution of linear congruences , extension of FLT in various directions,Pseudoprimes- FLT to check compositeness, disproving converse of FLT, pseudoprimes, infinitude of pseudoprime, Euler’s Theorem- motivation, Euler’s Phi Function 𝜑, Euler’s Theorem, applications, generalisation of Euler’s theorem (koshy),Euler’s Phi Function Revisited- multiplicative functions, fundamental theorem for multiplicative functions, formula for 𝜑(𝑝 𝑒 ) ,multiplicative nature of 𝜑, use in computation, Gauss theorem on sum of 𝜑(𝑑) values of divisors 𝑑 of 𝑛.The Tau and Sigma Function- definition, multiplicative nature of tau(𝜏 ) and sigma (𝜎)

20

Text Books:

Reference Books: 1. David M. Burton : Elementary Number Theory, Sixth Edn., TMH. 2. T. S. Blynth and E.F. Robertson: Basic Linear Algebra, second Edn springer under graduate mathematics series 2009 Course Designer:

Praseetha N A


Sulthan Bathery.




Department Name: Computer Science COURSE OUTCOME

IV Semester CSS4E04f – ADVANCED JAVA

PROGRAMMING

Credit

Core 4

Course Objective:

To learn the advanced features of Java programming language that equip

the students to develop web based applications with JSP

Develop error-free, well-documented Java programs; develop and test Java network,

search engine, and web framework programs.

Learn how to write, test, and debug advanced-level Object-Oriented programs using

Java.

Course Outcomes:

On completing the course, the students will be able to gain an understanding of the concepts,

related to advanced java concept which helps to increase the knowledge about advanced java

servlet.

CO1 To understand the concept and model of Servlet Knowledge

CO2 Students will develop sophisticated, interactive user interfaces using the

Java Swing class and appropriate layout managers Understand

CO3 To study the different JSP libraries Application

CO4 Develop various operation in JDBC Analysis

CO5 Hibernate and mapping classes details Synthesis



CO1 S M S M S

CO2 M S M S S

CO3 M S M M S

CO4 S M M S S

CO5 M S S S S


Assessment Pattern

Bloom’s

Category

Internal


Knowledge 40% 40% 20%


Application 40% 40% 20%

Analysis --- --- ---

Synthesis --- --- ---

Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

RMI & Servlets - introduction, architecture, defining remote

objects, creating stubs and skeletons, serializable classes,

accessing remote objects, factory classes, dynamically loaded

classes, RMI activation, registering remote objects.

16

Unit II

Servlets, generic servlet, servlets that access request headers,

develop servlets that manipulate response headers, HTTP servlets,

forms, HTTP protocols - configuring Tomcat Server, servlet

context, servlet context listener, servelet chaining. 16

Unit III

JNDI & EJB - architecture, context initial context class, objects in

a context, binding objects, accessing directory services, attributes

and attribute interface modifying directory entities, creating

directories entities. EJB roles, architecture, container,

implementing a basic EJB object, implementing session beans,

implementing entity bean, deploying an enterprise bean object.

16

Unit IV

Java Server Pages (JSP) - developing JSP pages, technology,

syntax using scripting elements, syntax using the courier page

directive, create and use JSP error pages, building reusable web

presentation, components, JSP technology syntax using the include

directive, JSP technology syntax using the jsp:include standard

action, developing JSP Pages using custom tags, problem with JSP

technology scriptlet code, given an existing custom tag library,

develop a JSP page using the library, developing a simple custom

tag, structure and execution of a custom tag in a JSP page, tag

handler class for a simple empty custom tag, custom tag that

includes its body in the contour of the HTTP response, tag library

description for a simple, empty custom tag.

16

Unit V

Hibernate - ORM overview - Hibernate overview, environment,

configuration, sessions, persistent class - mapping files - mapping

types - examples - O/R mappings - annotations - Hibernate Query

Language - Hibernate criteria - queries - Hibernate Native SQL,

caching, batch processing, interceptors.

16

Text Books:

1. An introduction to Web Design and Programming, Wang Thomson

2. Web application technologies concepts, Knuckles, John Wiley.

3. Programming world wide web, Sebesta, Pearson

4. Building Web Applications, NIIT, PHI

5. Web Warrior Guide to Web Programing, Bai, Ekedaw, Thomas, Wiley

6. Beginning Web Programming, Jon Duckett , Wrox, Wiley

7. Java server pages, Pekowsky, Pearson

Course Designer:

Prince Joy


Sulthan Bathery.




Department Name: Computer Science COURSE OUTCOME

IV Semester A14-Microprocessors-Architecture and

Programming

Credit

Core 4

Course Objective:

• To understand internals of Microprocessor.

• To learn architecture of 8085 Microprocessor

• To learn instruction set of 8085 Microprocessor

Prerequisite:

8085 microprocessor, instruction set, addressing modes

Course Outcomes:

On completing the course, the students will be able to gain an understanding of the concepts, related to microprocessor which helps to increase the knowledge about different processors .

CO1 To understand the concept and model of microprocessors Understand

CO2 To Analyse the complete structure 8085 microprocessor Understand

CO3 To study the different level of assembly language Understand

CO4 Develop various operation in practical level Apply

CO5 Assembly level languages of 8086 architecture Apply



CO1 S M S M S

CO2 M S M S S

CO3 S M S M S

CO4 S M M S S

CO5 M S S S S


Assessment Pattern

Bloom’s

Category

Internal




Apply 40% 40% 20%

Analyze --- --- ---


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

General architecture of computer, Introduction to Microprocessor,

Memory classification, Introduction to 8085,Microprocessor bus

organizations ,data bus, address bus, control bus. Memory

addressing, memory mapping. 8085 architecture in detail. General

purpose registers and special purpose registers, flag register -8085

pins and signals.

16

Unit II

Assembly language programming basics. Opcode, Mnemonics etc.

8085 instruction set ,Data transfer ,Arithmetic and Logic, Shifting

and rotating, Branching/Jump, Program control. Addressing

modes. Memory read and write cycle. Timing diagram. Instruction

cycle , machine cycle and T-states. Types of I/O addressing

.Simple programs.

16

Unit III

Types of programming techniques looping, indexing

(pointers),delay generation. Stack in 8085, call and return

Instructions. Data transfer between stack and microprocessor.

Subroutine and delay programs. Interrupts in 8085. Interrupt

driven programs. Interfacing - Programmable peripheral devices -

8255A, 8254, 8237. .

16

Unit IV

Introduction to 8086/88 microprocessors – overview, 8086 internal

architecture. The execution unit, BIU, Registers, Flags,

Segmentation, physical address calculation, addressing modes.

16

Text Books:

Reference Books:

1 . Microprocessor and Microcomputer - Based system Design - M. Rafiquzzman –

2.A.P Mathur, Introduction to Microprocessors, Tata McGraw-Hill Education

3. The Intel Microprocessors: 8086/8088, 80186/80188, 80286, 80386, 80486, Pentium,

Pentium Pro, Pentium II, III, IV and Core 2 with 64 bit Extensions, Barry B. Brey, Prentice

Hall Pearson

4. Microprocessors PC Hardware and Interfacing –N.Mathivanan – PHI

Course Designer:

Prince Joy Assistant Professor,

Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

I Semester INTRODUCTORY STATISTICS

Credit

Complementary 3

Course Objective:

1. To develop the students ability to deal with numerical and quantitative issues. 2. To enable the use of statistical, graphical and algebraic techniques wherever relevant.

3. Demonstrate knowledge of fixed-sample and large-sample statistical properties of point

and interval estimators. Prerequisite:

set theory, permutation and combination, 12th level mathematics Course Outcomes:


CO1 To identify our nearest statistical office and its working, important of statistics.

applying

CO2 Statistics play a sufficient role in the analyzis of market and are extremely useful to firms as well as individuals

Applying

CO3 To explain the data using graphical method understanding

CO4 Easy to plan a program using the time limit Applying

CO5 Analyzisststistical data using measure of central tendency. analyzing Mapping with Programme Outcomes


CO1 H

CO2 L M H

CO3 H M

CO4 M L H

CO5 H M

H-High; M-Medium; L-Low

Assessment Pattern

Bloom’s

Category

Internal




Apply 30% 50% 50%

Analyze 10% 40% ---

Evaluate --- 10% ---

Create --- --- ---

Syllabus

Module/

Unit

No.

Content Hours

Unit1

Official statistics: The Statistical system in India: The Central and State Government organizations, functions of the Central Statistical Office (CSO), National Sample Survey Organization (NSSO) and the Department of Economics and Statistics.

7

Unit2

Introduction to Statistics: Nature of Statistics, Uses of Statistics, Statistics in relation to other disciplines, Abuses of Statistics. Concept of primary and secondary data. Designing a questionnaire and a schedule. Concepts of statistical population and sample from a population, quantitative and qualitative data, Nominal, ordinal and time series data, discrete and continuous data. Presentation of data by table and by diagrams, frequency distributions by histogram and frequency polygon, cumulative frequency distributions (inclusive and exclusive methods) and ogives. Measures of central tendency (mean, median, mode, geometric mean and harmonic mean) with simple applications. Absolute and relative measures of dispersion (range, quartile deviation, mean deviation and standard deviation) with simple applications. Co-efficient of variation, Box Plot. Importance of moments, central and non-central moments, and their interrelationships. Measures of skewness based on quartiles and moments; kurtosis based on moments.

30

Unit3

Correlation and Regression: Scatter Plot, Simple correlation, Simple regression, two regression lines, regression coefficients. Fitting of straight line, parabola, exponential, polynomial (least square method).

15

Unit4

Time series: Introduction and examples of time series from various fields, Components of times series, Additive and Multiplicative models. Trend: Estimation of trend by free hand curve method, method of semi averages, method of moving averages and fitting various mathematical curves. Seasonal Component: Estimation of seasonal component by Method of simple averages, Ratio to Trend. Index numbers: Definition, construction of index numbers and problems thereof for weighted and unweighted index numbers including Laspeyre’s, Paasche’s, Edgeworth-Marshall and Fisher’s.

20

Text Books:

Reference Books:

1. S.C. Gupta and V.K. Kapoor. Fundamentals of Mathematical Statistics, Sultan Chand & Sons, New Delhi 2. Goon A.M., Gupta M.K. and Dasgupta B. (2002): Fundamentals of Statistics, Vol. I & II, 8th Edn. The World Press, Kolkata. 3. Mukhopadhyay P. (2011): Applied Statistics, 2nded. Revised reprint, Books and Allied 4. Hoel P.G. Introduction to mathematical statistics, Asia Publishing house. 5. Chatfield.C. The Analysis of Time Series: An Introduction, Chapman & Hall 6. Guide to current Indian Official Statistics, Central Statistical Office, GOI, New Delhi. 7. www.mospi.gov.in 8. www.ecostat.kerala.gov.in

Sajithbabu p r Assistant Professor,

Don Bosco College,

SulthanBathery.




Department Name: Computer science and Mathematics

COURSE OUTCOME

VI Semester Numerical Methods

Credit

Core 4

Course Objective:

1. understand the need for numerical methods, 2. go through the stages (mathematical modeling, solving and implementation) of solving a particular physical problem. Ideas of mathematical logic, concepts of set theory and Boolean Algebra. Pre requisite:

Basic calculation , eigen value and eigen vector , matrix

Course Outcomes:


CO1 How numerical methods are used to obtain approximate solutions. Knowledge

CO2 Demonstrate understanding of common numerical methods. Understand

CO3 Apply numerical methods to obtain approximate solutions to mathematical problems

Applying

CO4

Distinguish numerical methods for various mathematical operations and

tasks, such as interpolation, differentiation, integration, the solution of

linear equations, and the solution of differential equations.

Analyse

CO5 Evaluate the accuracy of common numerical methods Evaluate



CO1 S M S S

CO2 M L L

CO3 M M M

CO4 M M M

CO5 L M M S


Assessment Pattern

Bloom’s

Category

Internal




Apply 30% 30% 50%

Analyze 10% 20% ---

Evaluate --- -- ---

Create --- --- ---

Syllabus

M

o

d

ul

e/

U

ni

t

N

o.

Content H

o

u

r

s

U

ni

t1

Introduction,Bisection Method, Method of false position,Iteration method Newton‐Raphson Method, Ramanujan'smethod,The Secant Method , Finite Differences, Introduction,3.3.1 Forwarddifferences, Backward differences,3.3.3Central differences, 3.3.4 Symbolic relations and separation of symbols,3.5 Differences of a polynomial

3

0

U

ni

t2

Newton's formulae for intrapolation,3.7 Central difference interpolation formulae ,3.7.1 Gauss' Central Difference Formulae ,3.9 Interpolation with unevenly spaced points ,3.9.1 Langrange's interpolation formula ,3.10 Divided differences and their properties ,3.10.1 Newton's General interpolation formula ,3.11 Inverse interpolation , Numerical Differentiation and Integration 5.1 Introduction,5.2 Numerical differentiation (using Newton's forward and backward formulae) 5.4 Numerical Integration,5.4.1 TrapizaoidalRule,5.4.2 Simpson's 1/3‐Rule ,5.4.3 Simpson's 3/8‐Rule

2

5

U

ni

t3

Solution of Linear Systems – Direct Methods ,6.3.2 Gauss elimination ,6.3.3 Gauss‐Jordan Method, 6.3.4 Modification of Gauss method to compute the inverse ,6.3.6 LU Decomposition, 6.3.7 LU Decomposition from Gauss elimination 6.4 Solution of Linear Systems – Iterative methods,6.5 The eigen value problem ,6.5.1 Eigen values of Symmetric Tridiazonal matrix

1

5

U

ni

t4

Introduction ,7.2 Solution by Taylor's series ,7.3 Picard's method of successive approximations , 7.4 Euler's method ,7.4.2 Modified Euler's Method,7.5 Runge‐Kutta method 7.6 Predictor‐Corrector Methods,7.6.1 Adams‐Moulton Method,7.6.2 Milne's method

2

0

Text Books:

Reference Books:

1. S. SankaraRao : Numerical Methods of Scientists and Engineer, 3rd ed., PHI. 2. F.B. Hidebrand : Introduction to Numerical Analysis, TMH. 3. J.B. Scarborough : Numerical Mathematical Analysis, Oxford and IBH

Course Designer:

Sajith babu p r







COURSE OUTCOME

IV Semester STATISTICAL INFERENCE AND QUALITY CONTROL

Credit

Complementary 3

Course Objective:

To learn the development of null and alternative hypotheses. · To learn types of errors, non-parametric tests. · To perform Test of Hypothesis as well as obtain MP, UMP tests. Prerequisite:

Knowledge about sampling, population , and basic statistics

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts, related to Banking and Insurance which helps to possess a career in Banking and Insurance field.

CO1 Formulate null and alternative hypotheses and apply small, large sample and non-parametric tests in real life problems

Apply

CO2 Explain the concept of estimation of parameters Understand

CO3 Analyzis the problems related to point estimation and interval estimation.

Analyzing

CO4 Explain the concept of testing hypothesis. Understanding

CO5 Solve the problem related to testing of hypothesis.. Apply



CO1 L S M M

CO2 L M S S L

CO3 M L S M S

CO4 S M L S S

CO5 M S L M S


Assessment Pattern

Bloom’s

Category

Internal




Apply 30% 40% 30%

Analyze 20% 10% 20%


Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Estimation theory: Parametric space, sample space, point

estimation. Nayman

Factorization criteria, Requirements of good estimator:

Unbiasedness, Consistency,

30

Efficiency, Sufficiency and completeness. Minimum variance

unbiased (MVU) estimators.

Cramer-Rao inequality (definition only). Minimum Variance

Bound (MVB) estimators.

Methods of estimation: Maximum likelihood estimation and

Moment estimation methods

(Detailed discussion with problems); Properties of maximum

likelihood estimators (without

proof); Least squares and minimum variance (concepts only).

Interval estimation: Confidence interval (CI);CI for mean and

variance of Normal

distribution; Confidence interval for binomial proportion and

population correlation

coefficient when population is normal..

Unit II

Testing of Hypothesis: Level of significance, Null and Alternative

hypotheses,

simple and composite hypothesis ,Types of Errors, Critical

Region, Level of Significance,

Power and p-values. Most powerful tests, Neyman-Pearson

Lemma (without proof),

Uniformly Most powerful tests. Large sample tests: Test for single

mean, equality of two

means, Test for single proportion, equality of two proportions.

Small sample tests: t-test for

single mean, unpaired and paired t-test.

Chi-square test for equality of variances, goodness of fit, test of

independence and association

of attributes. Testing means of several populations: One Way

ANOVA, Two Way ANOVA

(assumptions, hypothesis, ANOVA table and problems)

35

Unit III

Non-parametric methods: Advantages and drawbacks; Test for

randomness,

Median test, Sign test, Mann-Whiteny U test and Wilcoxon test;

Kruskal Wallis test (Concept

only).

10

Unit IV

Quality Control: General theory of control charts, causes of

variations in quality,

control limits, sub-grouping, summary of out-of-control criteria.

Charts of variables - X bar

chart, R Chart and sigma chart. Charts of attributes – c-charts, p-

chart and np-chart.(Concepts

and problems)..

15

Text Books:

Reference Books:

1. Rohatgi V. K. and Saleh, A.K. Md. E. (2009): An Introduction to Probability and

Statistics.2ndEdn. (Reprint) John Wiley and Sons.

2. Gupta, S.P. Statistical Methods. Sultan Chand and Sons: New Delhi.

3. S.C.Gupta and V. K. Kapoor, Fundamentals of Mathematical Statistics, Sultan Chand and

Sons

4. Mood, A.M. Graybill, F.A. and Boes, D.C. (2007): Introduction to the Theory of

Statistics, 3rdEdn., (Reprint), Tata McGraw-Hill Pub. Co. Ltd.

5. John E Freund, Mathematical Statistics, Pearson Edn, NewDelhi

6. Grant E L, Statistical quality control, McGraw Hill

7. Montogomery, D. C. (2009): Introduction to Statistical Quality Control, 6th Edition,

Wiley India Pvt. Ltd.10. Inderjit Singh, RakeshKatyal& Sanjay Arora: Insurance Principles

and

Practices,Kalyani Publishers, Chennai.

Course Designer:

Sajithbabu p r


Don Bosco College, SulthanBathery.





COURSE OUTCOME

I Semester CSS1C02 – ADVANCED DATA STRUCTURES

Credit

Core 4

Course Objective:

To introduce discrete mathematics concepts necessary to understand basic Foundation of

Computer Science.

Course Outcomes:

By the end of the course the students will be able to:

CO1 Ability to analyze algorithms and algorithm correctness Analyze

CO2 Ability to summarize searching and sorting techniques Understand

CO3 Ability to describe stack, queue and linked list operation. Understand

CO4

The appropriate use of a particular data structure and algorithm to

solve a problem.

Analyze

CO5 The ability to estimate big-O timings.

Apply



CO1 S L S

CO2 M S S

CO3 S M S L

CO4 S M S

CO5 S M


Assessment Pattern

Bloom’s

Category

Internal




Apply 20% 50% 40%

Analyze 20% 20% 10%

Evaluate 10% --- 10%

Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Data structure - definition - types & operations, characteristics of data

structures -

Abstract Data Type (ADT) – algorithms - concepts - definition - objectives

of algorithms -

quality of an algorithm - space complexity and time complexity of an

algorithm.

15

Unit II

Counting Techniques: Basic counting techniques - permutations and

combinations, asymptotic behaviour of functions. Linear data structures -

Arrays - records -

representation - data structure operations - traversing, inserting and

deleting - sorting and

searching - sorting algorithms - linear search & binary search - complexity.

Linked lists -

operations and implementations, - Stack - operations and its

implementations (both array

and linked list) - Applications - parsing arithmetic expressions, conversion

and evaluating expressions. Recursion - characteristics of recursion, types

of recursion applications of recursion in algorithms - comparison of

recursive and non-recursive algorithms. Queue -

operations and its implementations (both array and linked list) - circular

queue - dequeue -priority queues, recursive lists, heterogeneous lists,

deterministic skip lists, doubly linked lists and circular lists sparse matrix-

representation.

15

Unit III

Non-linear Data Structures - trees - terminology - tree traversals algorithms

-

Binary trees - threaded binary trees - binary search trees - traversals and

operations on BST

heap Tree - balanced trees - M-way trees - B and B+ trees, Red Black Tree,

Digital Search

Tree, Tries, Treaps, Huffman algorithm for extended binary tree -

15

operations and their

implementation. Graphs - representation of graphs – operations - traversals

and their implementation.

Unit IV

Hashing - overview of hashing - hash tables - hash functions and their

computations open addressing - linear probing - quadratic probing - double

hashing

algorithms and their implementations - rehashing - extendable hashing -

separate chaining -

hashing efficiency - heaps - overview of heaps - implementation and

operations.

15

Unit V

Heap structures - Min-Max heaps - Deaps - leftist heaps - binomial heaps -

Fibonacci heaps -binary heaps - skew heaps - pairing heaps - applications -

amortized analysis an unrelated puzzle - Binomial queues - skew heaps -

Fibonacci heaps - Splay trees.

.

15

References:

Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms,

Addison-Wesley, ISBN: 978-0201000238.

2. Horowitz E and Sahni S, Fundamentals of Data Structures, Computer Science Press,

ISBN: 9780716780427.

3. Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Fundamentals of Data

Structures in C, Silicon Press, ISBN: 0929306406.

Course Designer:

Sritha S

Asst. Professor,

Don Bosco College,

Sulthan Bathery.





COURSE OUTCOME

IVSemester CSS4E03c – SYSTEM SECURITY

Credit

Core 3

Course Objective:

To provide an understanding of the differences between various forms of computer security,

where they arise, and appropriate tools to achieve them.

Course Outcomes:

On completing the course the students will be able to gain an understanding of the concepts,

related to Operating Systems and Computer security which help to possess a career in IT

field.

CO1 Distinguish between various types of attacks on computing

resources. Understand

CO2 Identify various attacks on computer programs and propose solutions

for the same. Apply

CO3 Identify the OS functions and the possible attacks on them, with

proposed solutions. Apply

CO4 Describe the importance of securing database. Understand

CO5 Develop security policies at various levels. Create



CO1 S L

CO2 M S S

CO3 M S L

CO4 M M S

CO5 S M


Assessment Pattern

Bloom’s

Category

Internal




Apply 20% 50% 40%

Analyze 20% 20% 10%

Evaluate 10% --- 10%

Create --- --- ---

Syllabus

Module/

Unit No.

Content Hours

Unit I

Notion of different types of securities - information

security - computer security - security goals, relation between

security, confidentiality, integrity, availability and authorization,

vulnerabilities - principles of adequate protection. Notions of

operating security, database security, program security, network

security. attacks - threats, vulnerabilities and controls. The kind of

problems - interception, interruption, modification, fabrication.

Computer criminals - amateurs, crackers, career criminals.

Methods of defence - control, hardware controls, software

controls, effectiveness of controls.

15

Unit II

Program security - secure programs - fixing faults,

unexpected behaviour, types of flaws. Non-malicious program

errors - buffer overflows, incomplete mediation. Viruses and other

malicious code - kinds of malicious code, how viruses attach, how

viruses gain control, prevention, control example - the brain virus,

the internet worm, web bugs. Targeted malicious code - trapdoors,

Salami attack. Controls against program threats - development

controls, peer reviews, hazard analysis.

15

Unit III

Operating system security - protected objects and methods

of protection - memory address protection - fence, relocation,

base/bounds registers, tagged architecture, segmentation, paging.

Control of access to general objects - directory, access control list.

File protection mechanism – basics forms of protection, single

permissions. Authentication - authentication basics, password,

authentication process challenge - response, biometrics. Trusted

operating systems - security policies for operating systems, models

of security - requirement of security systems, multilevel security,

access security, limitations of security systems. Trusted operating

system design - elements, security features, assurance, system

flaws and assurance methods.

15

Unit IV

Database Security - security requirements - integrity of

database, confidentiality and availability, reliability and integrity,

sensitive data, interface, multilevel database, proposals for

multilevel security.

15

Unit V

Administrating security - security planning - contents of a security

planning, team members, commitment to a security plan, business

continuity plans. Risk analysis - the nature of risk, steps of risk

analysis. Arguments for and against risk analysis, organizational

security policies - purpose and goals of organizational security.

Audience, characteristics of a good security policy. Nature of

security policies - data sensitivity policy, government agency IT

security policy. Physical security - natural disaster, human

vandals, interception of sensitive information..

15

References

1. C. P. Pfleeger and S. L. Pfleeger, Security in Computing, 4th Edition, Pearson India,

ISBN:

9788131727256.

2. Matt Bishop, Computer Security: Art & Science, 1st Edition, Pearson, ISBN:

0201440997.

3. William Stallings, Cryptography and Network Security: Principles and Practice, 6 th

Edition, Pearson India, ISBN: 9332518777.

4. Michael E. Whitman and Herbert J. Mattord, Principles of Information Security, 4th

Edition,

Course Designer:

Sritha S

Asst. Professor,

Don Bosco College,

Sulthan Bathery.

don bosco college, sulthan bathery affiliated to

Documents