3 and 4 Semester CSE Syllabus

M.S. RAMAIAH INSTITUTE OF TECHNOLOGY

BANGALORE

(Autonomous Institute, Affiliated to VTU)

Computer Science and Engineering

Outcomes Based Education Curricula

(for the Academic year 2014 – 2015)

III & IV Semester B.E

History of the Institute

M. S. Ramaiah Institute of Technology was started in 1962 by the late Dr. M.S. Ramaiah, our

Founder Chairman who was a renowned visionary, philanthropist, and a pioneer in creating

several landmark infrastructure projects in India. Noticing the shortage of talented engineering

professionals required to build a modern India, Dr. M.S. Ramaiah envisioned MSRIT as an

institute of excellence imparting quality and affordable education. Part of Gokula Education

Foundation, MSRIT has grown over the years with significant contributions from various

professionals in different capacities, ably led by Dr. M.S. Ramaiah himself, whose personal

commitment has seen the institution through its formative years. Today, MSRIT stands tall as

one of India’s finest names in Engineering Education and has produced around 35,000

engineering professionals who occupy responsible positions across the globe.

History of Department of Computer Science and Engineering

Year of Establishment 1984

Names of the Programmes offered 1. UG: B.E. in Computer science and Engineering

2. PG: M.Tech. in Computer Science and Engineering

3. Ph.D

4. M.Sc(Engg.) by research

Faculty Sl. No. Name Qualification Designation

1. Dr. K G Srinivasa M.E, Ph.D Professor

2. Dr. Ramamurthy Badrinath Ph.D AICTE-INAE distinguished

Visiting Professor

3. Dr. R. Srinivasan D.Sc. Professor(Emeritus)

4. Dr. S. Ramani Ph.D Professor(Emeritus)

5. Dr. Anita Kanavalli M.E., Ph.D Professor

6. Dr. Seema S M.S., Ph.D Associate Professor

7. Dr. Annapurna P. Patil M. Tech, Ph.D Associate Professor

8. Jagadish S Kallimani M.Tech, (Ph.D) Associate Professor

9. D.S. Jayalakshmi M.Sc(Engg), (Ph.D) Associate Professor

10. Dr. Monica R Mundada M.Tech, Ph.D Associate Professor

11. Sanjeetha R M.Tech Assistant Professor

12. A Parkavi M.E. (Ph.D) Assistant Professor

13. Veena GS M.Tech (Ph.D) Assistant Professor

14. J Geetha M.Tech, (Ph.D) Assistant Professor

15. T.N.R. Kumar M. Tech (Ph.D) Assistant Professor

16. Mamatha V. M.Tech Assistant Professor

17. Chethan C T B.E. Assistant Professor

18. Sini Anna Alex M.E, (Ph.D) Assistant Professor

19. Vandana Sardar M.E. Assistant Professor

20. Meera Devi M.Tech Assistant Professor

21. Mallegowda M M.Tech Assistant Professor

22. Divakar Harekal M.E. Assistant Professor

23. Chandrika Prasad M.Tech Assistant Professor

24. S. Rajarajeswari M.E, (Ph.D) Assistant Professor

25. Sowmyarani C N M.E. (Ph.D) Assistant Professor

26. Pramod C Sunagar M.Tech Assistant Professor

27. Sowmya B.J. M.Tech Assistant Professor

28. Pradeep Kumar D M.Tech Assistant Professor

29. Chetan Shetty M.Tech Assistant Professor

30. Ganeshayya Shidaganti M.Tech Assistant Professor

31. Darshana A Naik M.Tech Assistant Professor

32. Shravanthi T. M.Tech Assistant Professor

33. Srinidhi H. M.Tech Assistant Professor

Visiting Faculty Members from Industry

34. N. Pramod B.E.

Application Engineering

at Thoughtworks Pvt.

Ltd.

35. Jayasimha Rao

M.S. in Machine Learning and

Data Mining from Aalto

University School of Science

Entrepreneur

Vision and Mission of the Institute

Vision

To evolve into an autonomous institution of International standards for imparting quality

Technical Education

Mission

MSRIT shall deliver global quality technical education by nurturing a conducive learning

environment for a better tomorrow through continuous improvement and customization.

Quality Policy “We at M. S. Ramaiah Institute of Technology, Bangalore strive to deliver comprehensive,

continually enhanced, global quality technical and management education through an established

Quality Management system complemented by the synergistic interaction of the stake holders

concerned”.

Vision and Mission of the Department

Vision

To build a strong learning and research environment in the field of Computer Science and

Engineering that responds to the challenges of 21st century.

Mission

To produce computer science graduates who, trained in design and implementation of

computational systems through competitive curriculum and research in collaboration with

industry and other organizations.

To educate students in technology competencies by providing professionally committed

faculty and staff.

To inculcate strong ethical values, leadership abilities and research capabilities in the

minds of students so as to work towards the progress of the society.

Process for Defining the Vision and the Mission of the Department

Programme Educational Objectives (PEOs)

A B.E. (Computer Science & Engineering) graduate of M. S. Ramaiah Institute of Technology

should, within three to five years of graduation

1. Pursue a successful career in the field of Computer Science & Engineering or a related field

utilizing his/her education and contribute to the profession as an excellent employee, or as

an entrepreneur

2. Be aware of the developments in the field of Computer Science & Engineering,

continuously enhance their knowledge informally or by pursuing graduate studies

3. Engage in research and inquiry leading to new innovations and products

4. Be able to work effectively in multidisciplinary and multicultural environments

5. Be responsible members and leaders of their communities, understand the human, social

and environmental context of their profession and contribute positively to the needs of

individuals and society at large

PEOs Derivation Process

Programme Outcomes (POs)

The outcomes of the Bachelor of Engineering in Computer Science & Engineering Programme

are as follows:

A B.E. (Computer Science & Engineering) graduate must demonstrate

1. An ability to apply knowledge of mathematics, science, and engineering as it applies to

Computer Science & Engineering to solve engineering problems.

2. An ability to use research methods to design and conduct experiments to investigate

complex problems, as well as to analyze and interpret data

3. An ability to design a system, component, or process to meet the desired economic, social,

and environmental needs with appropriate consideration for public health and safety.

4. An ability to function effectively individually and in team, and in multi-disciplinary

environment.

5. An ability to identify, formulate, study, analyze and solve problems using the first

principles of mathematics and natural sciences as well as computer science & engineering

techniques.

6. An understanding of professional and ethical responsibilities in professional engineering

practice.

7. An ability to communicate effectively.

8. The broad education necessary to understand the impact of engineering solutions in an

environmental and societal context.

9. Recognition of the need for, and an ability to engage in life-long learning.

10. An ability to create and use the techniques, algorithms, models and processes, and modern

software/hardware tools necessary for computer engineering practice.

11. An ability to apply knowledge of contemporary issues to assess the societal, legal and

cultural issues related to the practice of computer science and engineering.

12. An understanding of the engineering and management principles required for project and

finance management.

PO Derivation Process

Mapping of PEOs and POs

Sl.

No.

Programme

Educational

Objectives

Programme Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

1 Excel in

career X X X X X X X X X X X X

2 Life-long

learning X X X X X X X X X X

3 Research and

Innovations X X X X X X X X X X X

4

Work in

diverse

teams

X X X X X X X X

5

Leadership

and

contribution

to society

X X X X X X X X

Curriculum Breakdown Distribution

Sl. No. Courses Weightage

1 Basic Science Core Courses 13%

2 Basic Engineering Science Core Courses 13%

3 Humanities and Social Science Core Courses 3%

4 Professional Courses and Electives 62%

5 Major Project 9%

6 Mandatory Learning Courses 0%

Board of Studies for the Term 2014-2015

1. Head of the Department concerned:

2. At least five faculty members at different

levels covering different specializations

constituting nominated by the Academic

Council

3. Special invitees

4. Two experts in the subject from outside

the college

5. One expert from outside the college,

nominated by the Vice Chancellor

6. One representative from

industry/corporate sector allied area

relating to placement nominated by the

Academic Council

7. One postgraduate meritorious alumnus

to be nominated by the Principal

Dr. K G Srinivasa

Dr. Anita Kanavalli

Prof. Seema S

Dr. Annapurna Patil

Prof. Jayalakshmi D S

Prof. Sanjeetha R

Dr. R. Srinivasan

Dr. T. S. B. Sudarshan, Head, Amrita School of

Engg, Bangalore

Dr. Kavi Mahesh, Professor, PESIT

Dr. N.K. Srinath, Professor, RVCE

Dr. A Srinivas, Professor, Dept of CSE, PESIT

Dr. K G. Mohan, Prinicipal, KGIT, Kolar

Dr. Udaya Kumar K, Former Principal, BNMIT,

Bangalore

Dr. Shyam Vasudev, Director, Philips Healthcare

Dr. R Badrinath, HP Labs, India

Mr. Lawrence Mohanraj, IBM

Mr. Sachin Kumar R.S., IBM

Krishnaprasad C, Qikwell Technologies,

Bangalore

Chairperson

Member

Member

Member

Member

Member

Member

Member

Member

Member

Member

Member

Member

Member

Member

Member

Member

Department Advisory Board for the term 2014-2015

1. Head of the Department concerned

2. Experts from other organizations for

Department Advisory Board

Dr. K G Srinivasa

Dr. L M Patnaik, Honorary Professor, IISc

Prof. Rajkumar Buyya, Director, CLOUDS Lab,

Dept of Computing and Information Systems,

University of Melbourne

Dr. T S B Sudarshan

Professor and Chair, Dept of CSE, Amrita

School of Engg, Bangalore

Member

Member

Member

Member

Industry Advisory Board for the Term 2014-2015

1. Head of the Department concerned

2. Experts from industry constituting

the Industry Advisory Board

Dr. K G Srinivasa

Dr. Badrinath Ramamurthy, HP Labs, India

Dr. N.C. Narendra, CTS

Mr. Raghu Hudli, Object orb

Mr. Sreekanth Iyer, IBM

Mr. Nishant Kulkarni, IBM

Mr. Rohith Athanikar, Yahoo

Mr. Pramod N., Thoughtworks Inc

Member

Member

Member

Member

Member

Member

Member

Member

Scheme of Studies for Second Year B.E. (CSE) for the batch 2013-2017

III Semester Total Credits: 25

Code Subject L T P Credit

CSMAT301 Engineering Mathematics III 4 0 0 4

CS311 Electronics Circuits 3 0 0 3

CS312 Digital Design with VHDL 3 0 0 3

CS313 Data Structures with C 3 1 0 4

CS314 Discrete Mathematical Structures 3 1 0 4

CS315 Object Oriented Programming with C++ 3 0 0 3

CSL316 Programming Laboratory 0 0 2 2

CSL317 Analog & Digital Circuits Laboratory 0 0 2 2

IV Semester Total Credits: 26

Code Subject L T P Credit

CSMAT401 Engineering Mathematics IV 4 0 0 4

CS411 Theory of Computation 3 1 0 4

CS412 Computer Organization 4 0 0 4

CS413 Design and Analysis of Algorithms 4 0 0 4

CS414 Introduction to Microprocessors 4 0 0 4

CS415 Data Communication 4 0 0 4

CSL413 Algorithms Laboratory 0 0 1 1

CSL414 Microprocessors Laboratory 0 0 1 1

Course Title: Engineering Mathematics – III Course Code: CSMAT301

Credits (L:T:P) : 4:0:0 Core/ Elective: Core

Type of course: Lecture Total Contact Hours:56

Prerequisites: Nil

Course Objectives:

The students will

1. Learn the concepts of finite differences and its applications.

2. Learn to represent a periodic function in terms of sines and cosines.

3. Understand the concepts of a continuous and discrete integral transform in the form of Fourier and Z-transforms.

4. Understand the concepts of PDE and its applications to engineering.

5. Learn the concepts of linear transformation through matrix algebra.

Course Content:

Unit 1

Finite Differences and Interpolation: Forward and backward differences, Interpolation, Newton-Gregory forward and

backward Interpolation formulae, Lagrange’s interpolation formula, Newton’s divided difference interpolation formula

(no proof).

Numerical Differentiation and Numerical Integration: Derivatives using Newton-Gregory forward and backward

interpolation formulae, Newton-Cote’s quadrature formula, Trapezoidal Rule, Simpson’s(1/3)rd

rule, Simpson’s(3/8)th

rule.

Unit 2

Fourier Series: Convergence and divergence of infinite series of positive terms, Periodic functions, Dirichlet’s

conditions, Fourier series of periodic functions of period 2 and arbitrary period, Half range Fourier series, Practical

harmonic analysis.

Unit 3

Fourier Transforms: Infinite Fourier transform, Fourier sine and cosine transform, Properties, Inverse transform.

Z-Transforms: Definition, Standard Z-transforms, Single sided and double sided, Linearity property, Damping rule,

Shifting property, Initial and final value theorem, Inverse Z-transform, Application of Z-transform to solve difference

equations.

Unit 4

Partial differential equation: Formation of partial differential equations (PDE) by elimination of arbitrary

constants and functions, Solution of PDE - Lagrange’s linear form, Method of Separation of Variables. Application of

partial differential equations: Finite difference approximation to derivatives, Numerical solution of second order

partial differential equations – Elliptic, Parabolic & Hyperbolic equations (Laplace, Heat & Wave equations).

Unit 5

Linear Transformations: Introduction to Linear transformations, Composition of matrix transformations, Rotation about

the origin, Dilation, Contraction and Reflection, Kernel and Range ,Change of basis.

Text Books :

1. Erwin Kreyszig-Advanced Engineering Mathematics-Wiley-India publishers- Abridged edition-2008.

2. B.S.Grewal - Higher Engineering Mathematics - Khanna Publishers - 40th

edition-2007.

3. Ganeth Williams – Linear Algebra with Applications – Jones and Bartlett Press – 4th

edition – 2001.

Reference Books:

1. Peter V. O’Neil – Advanced Engineering Mathematics – Thomson Brooks/Cole – 5th

edition – 2007.

2. B. V. Ramana – Engineering Mathematics – Tata McGraw Hill Pub. Co. Ltd. – New Delhi – 2008.

3. Serge Lang – Linear Algebra-Springer-3rd

edition-1987.

Course Outcomes:

Students are expected to do the following

1. Will be able to use a given data for equal and unequal intervals to find a polynomial function for estimation.

2. Computing maxima, minima, curvature, radius of curvature using numerical differentiation.

3. Computing the arc length, area, surface area and volume using numerical integration.

4. Finding the expansion of function as a Fourier series/Half range Fourier series in a given range of values of the

variable.

5. Obtaining the various harmonics of the Fourier series expansion for the given numerical data.

6. To find Fourier transforms, Fourier sine and Fourier cosine transforms of functions.

7. Solving difference equations using Z-transforms.

8. Formation and solution of partial differential equations.

9. Solutions of heat, wave and Laplace equations using numerical methods.

Course Title: Electronic Circuits Course Code: CS311


Type of course: Lecture Total Contact Hours: 42 Hrs

Prerequisites: EC201: Elements of Electronics

Course Objectives:

At the end of the course students should be able to:

1. Understand the basic concepts of Opamp and study of varous application circuits of opamp.

2. Compare the working of different waveshaping circuits using diodes, transistirs and timer ICs.

3. Understand the basics of BJT working and hybrid parameters.

4. Distinguish between different types of amplifiers.

5. Explain the construction of the linear power supply and converter circuits.

Course Contents:

Unit 1

Op amps: Introduction, inside of the op amp, ideal op amp versus practical op amp, performance parameters. Op amp

Application circuits: Inverting amplifier, non inverting amplifier, voltage follower, summing amplifier, integrator, peak

detector, first order filter, relaxation oscillator

Unit 2

Wave shaping circuits: Semiconductor devices; resistance levels, diode equivalent circuit, zener diodes, load line analysis.

Series and parallel diode configurations for dc inputs, sinusoidal inputs. Basic RC low pass circuits, RC low pass circuit

as integrator, Basic RC high pass circuit, RC high pass as differentiator, diode clipper circuits, diode clamper circuit,

integrated circuit multivibrators using 555 (Timer IC)

Unit 3

Small signal analysis of amplifiers:. DC biasing for BJT, operating point, fixed biasing, emitter stabilized

biasing,voltage divider biasing , dc biasing with feed back, transistor switching networks. Hybrid h parameter model for

an amplifier, Transistor hybrid model, Analysis of a transistor amplifier using complete h parameter model CE.

Unit 4

fet : Construction transfer characteristics, depletion mosfet, enchancment mosfet, cmos various biasing , fet small signal

analysis.

Feedback amplifiers: Classification of amplifiers, amplifiers with negative feedback, advantages of negative feedback,

feedback topologies,

Unit 5

Linear Power Supplies: Constituents of a linear power supply, designing mains transformer, linear regulators, linear IC

voltage regulators, regulated power supply parameters.

Linear Digital Ics: D/A converters: R to R Ladder and Binary Weighted, A/D convertors

Text Books:

1. Robert L Boylestad, Louis Nashelsky: Electronic Devices and Circuit Theory, 10th Edition. Pearson, 2009.

2. Anil K Maini, Varsha Agarwal: Electronic Devices and Circuits, Wiley, First Edition, 2009.

Reference Books:

1. Robert L Boylestad, Louis Nashelsky: Electronic devices and circuit theory, 9th edition. 2007.

2. Albert Malvino & David J Bates: Electronic Principles, TMH, 7th edition, 2007.

3. David A Bell: Electronic devices and Circuits, PHI,4th edition, 2006.

Course Delivery:

The Course will be delivered through classroom teaching, interactions with the students, discussing interesting electronic

systems in the class room where the subsystems are being used.

Course Assessment and evaluation:

Course Outcomes:

This course uses assigned readings, lectures, and homework to enable the students to:

1. Explain the basic concepts of the Opamp, derive expression for the performance parameters and study the

different application circuits.

2. Analyze the working of the different waveshaping circuits built with diodes and ICs.

3. Understand the basics of biasing and hybrid parameters.

4. Identify and discuss the characteristics of FET and study of feedback amplifiers.

5. Design the linear power supplies and converter circuits.

Mapping Course Outcomes with Programme Outcomes:

What To Whom

When/ Where (Frequency in the course)

Max Marks

Evidence Collected

Contribution to Course Outcomes

Dir

ect

Ass

essm

ent

Met

hod

s

CIE

Internal

Assessment

Tests

Students

Thrice(Average of the best two will be computed)

30 Blue Books 1,2 & 5

Class-room

Surprise Quiz

Twice(Summation of the

two will be computed)

20

Quiz papers

3 & 4

SEE Standard Examination

End of Course (Answering 5 of 10 questions)

100 Answer scripts 2 & 3

Indir

ect

Ass

essm

e

nt

Met

hod

s

Students

Feedback

Students

Middle of the course - Feedback

forms

1, 2 & 3, Delivery of the

course

End of Course

Survey End of the course - Questionnaire

1, 2 & 3, Effectiveness of Delivery of instructions &

Assessment Methods

Course Outcomes Programme Outcomes

1 2 3 4 5 6 7 8 9 10 11 12

1. Explain the basic concepts of the Opamp, derive expression for

the performance parameters and study the different application

circuits.

X X X X X X

2. Analyze the working of the different waveshaping circuits built

with diodes and ICs. X X X X X X

3. Understand the basics of biasing and hybrid parameters. X X X X X X

4. Identify and discuss the characteristics of FET and study of

feedback amplifiers. X X X X X X

5. Design the linear power supplies and converter circuits. X X X X X X

Course Title: Digital Design with VHDL Course Code: CS312


Type of Course: Lecture Total Contact Hours: 42Hrs

Prerequisites: The student must have knowledge in Boolean algebra and Basic electronics.

Course Objectives:

This course will help students to achieve the ability to:

1. Understand the basic digital principles and working of various logic gates, to analyze and simplify a boolean

function using K-map, Quine-McCluskey techniques as to find the minimal SOP/POS solution for designing a

cost effective combinational circuit. Introduction to vhdl programming

2. Design and implement complex arithmetic and logic circuits, to understand the working logic, design and

applications of multiplexers, decoders, encoders, code converters their vhdl equivalent code

3. Understand the behavior, timing issues and internal structure of various bistable elements (flip-flops) and their

applications in shift registers, counters.

4. Analyze and design Synchronous sequential circuit paradigm using both Moore and Mealy models.

5. Analyze Asynchronous sequential circuit paradigm and design circuits and testing of digital circuits

Course Contents:

Unit 1

Synthesis using AND, OR and NOT gates, NAND and NOR logic circuits, Introduction to VHDL, K map, strategy of

minimization, minimization of POS forms, incompletely specified functions, multiple output circuits, multilevel synthesis,

analysis of multilevel circuits, tabular method for minimization

Unit 2

Combinational circuits: Half adder, full adder(realization using NAND gates), adder subtractor unit, fast adders,

multiplexers, decoders, encoders, code converters, arithmetic comparison circuits, VHDL for combinational circuits.

Unit 3

FFs, registers and counters: Basic latch, gated D latch, T, flip flop, JK flip flop, registers, counters, reset synchronization,

other type of counters, registers and counters in VHDL code

Unit 4

Synchronous sequential circuits: Basic design steps, mealy state model, mealy type FSM for serial adder, design of a

counter using sequential circuit approach

Unit 5

Asynchronous sequential circuits: Asynchronous behavior, analysis of asynchronous circuits, synthesis of asynchronous

circuits, state reduction, state assignment. Testing of logic circuits: fault model, path sensitizing, testing of sequential

circuits

Text Books:

1. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, Tata McGraw Hill, 3rd

Edition, 2012.

2. Donald P Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and Applications, Tata McGraw Hill,

7th Edition, 2011.

Reference Books:

1. Donald D Givone: Digital Principles and Design, 2nd edition, Tata McGraw Hill, 2006.

2. Charles H Roth, Jr : Digital Systems Design using VHDL, Thomson, 2nd Edition.

3. John M Yarborough: Digital Logic Applications and Design, Thomson Learning, 2004

Course Delivery:

The course will be delivered through lectures, class room interaction, group discussion, exercises and self study cases.

Course Assessment and Evaluation:

What To

Whom

When/ Where

(Frequency in the

course)

Max

Mar

ks

Evidence

Collected

Contribution to

Course Outcomes

Dir

ect

Ass

essm

en

t

Met

ho

ds CIE

Internal

Assessment Tests

Students

Thrice(Average of

the best two will be

computed)

30 Blue Books 1-5

Surprise Quiz Twice 20 Quiz Papers 1-5

SEE Standard

Examination

End of Course

(Answering

5 of 10 questions)

100 Answer scripts 1-5

Ind

irec

t

Ass

essm

en

t M

eth

od

s Mid sem survey

Students


forms Delivery of the course

End of Course


Effectiveness of

Delivery of instructions

& Assessment Methods

Course Outcomes:

This course uses assigned readings, lectures and homeworks to enable the students to :

1. Demonstrate the minimization of combinational functions using various techniques.

2. Apply the knowledge of Combinational circuits for various applications.

3. Understanding of sequential circuits like up/down counter, shift registers, Johnson counter with vhdl

4. Design of synchronous sequential circuits using moore and mealy models

5. Analyse and design of asynchronous sequential circuits and testing methods of digital circuits

Mapping Course Outcomes with Program Outcomes


1 2 3

c 4 5 6 7 8 9 10 11 12

1 Demonstrate the minimization of combinational functions

using various techniques.

X X X - - - - X - X -

2 Apply the knowledge of Combinational circuits for various

applications X X X - - - - X - X X -

3 Understanding of sequential circuits like up/down counter,

shift registers, Johnson counter with vhdl X X X - - - - X - X X -

4

Design of synchronous sequential circuits using moore and

mealy models

X X X - - - - X - X -

5 Analyse and design of asynchronous sequential circuits and

testing methods of digital circuits X X X - X - - - - - - -

Course Title: Data Structures with C Course Code: CS313



Pre-requisite: CS101/201: Fundamentals of Computing

Course Objectives:

The objectives of this course are to:

1) Understand the concept of pointers, arrays, structures and unions and strings.

2) Understand the operations of data structures such as stacks and queues.

3) Illustrate different types of linked lists and operations on them.

4) Describe various types of tress and operations on trees.

5) Understand graph representations and their operations, priority queues and AVL trees.

Course Contents:

Unit 1

Basic Concepts: Pointers and Dynamic Memory Allocation, Algorithm Specification, Data Abstraction. Arrays and

Structures: Arrays, Dynamically Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, Representation

of Multidimensional Arrays, Strings.

Unit 2

Stacks And Queues: Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic Arrays, Evaluation

of Expressions, Multiple Stacks and Queues.

Unit 3

Linked Lists: Singly Linked lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials,

Additional List operations, Sparse Matrices, Doubly Linked Lists.

Unit 4

Trees: Introduction, Binary Trees, Binary Tree Traversals, Additional Binary Tree Operations, Threaded Binary Trees,

Heaps, Binary Search Trees, Selection Trees, Forests, Representation of Disjoint Sets, Counting Binary Trees.

Unit 5

Graphs: The Graph Abstract Data Type, Elementary Graph Operations. Priority Queues: Single- and Double-Ended

Priority Queues, Leftist Trees. Efficient Binary Search Trees: AVL Trees.

Text Books:

1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition, Universities Press, 2008.

Reference Books:

1. Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2nd Edition, Pearson Education, 2003.

2. Data Structures, Seynour Lipschutz and GAV Pai, Schaum’s Outlines, McGraw Hill, 2008.

3. Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A Pseudocode Approach with C, Cengage

Learning, 2005.


What To Whom

When/ Where

(Frequency in

the course)

Max

Marks

Evidence

Collected

Contribution to Course

Outcomes

Dir

ect

Ass

essm

en

t

Met

ho

ds

CIE

Internal

Assessment Tests Students

Thrice

(Average of

the best two

will be

computed)

30 Blue Books 1,2,3,4 &5

Assignements/Quiz Once 20 Assignments/ 1,2,3,4 &5

Course Outcomes:


1) Understand the concepts of pointers, arrays, structures, unions and strings.

2) Design any application based on the concept of stack and queue.

3) Demonstrate different types of lists and apply various operations on them.

4) Understand various types of trees and demonstrate various operations on them

5) Describe various graph representations and their operations, types of priority queues and AVL trees.

Mapping Course Outcomes with Program Outcomes:

Course Outcomes Program Outcomes

1 2 3 4 5 6 7 8 9 10 11 12

1. Understand the concepts of pointers, arrays,

structures, unions and strings. X X X X

2. Design any application based on the concept of stack

and queue. X X X X X

3. Demonstrate different types of lists and apply various

operations on them. X X X X X

4. Understand various types of trees and demonstrate

various operations on them. X X X X X

5. Describe various graph representations and their

operations, types of priority queues and AVL trees. X X X X X

/Mini Projects /

Puzzles

Quiz/

Mini Projects/

Puzzles Sheets

SEE Standard

Examination

End of Course

(Answering

5 of 10

questions)

100 Answer scripts 1,2,3,4 &5

Ind

irec

t

Ass

essm

en

t

Met

ho

ds

Students

Feedback

Students

Middle of the

course -

Feedback

forms 1, 2 & 3, Delivery of the course

End of Course

Survey

End of the

course - Questionnaire

4, 5 Effectiveness of Delivery of

instructions & Assessment

Methods

Course Title: Discrete Mathematical Structures Course Code: CS314

Credits (L:T:P) : 3:1:0 Core/ Elective: core

Type of course: Lecture/ Practical/Mini Project Total Contact Hours: 56 Hrs

Prerequisites: Nil

Course Objectives:

The objectives of this course are to

1. Distinguish between the notion of discrete and continuous mathematical structures.

2. Analyze the basic concepts of set theory and relations .

3. Understand to solve problems using counting techniques and combinatorics in the context of discrete probability

4. Identify the basic properties of graphs and use these concepts to model simple applications.

5. Model problems in computer science using trees and groups , demonstrate understanding of traversal, and relate

graphs and trees to data structures, algorithms, and counting.

Course Content:

Unit 1

Logics and Proofs: The laws of Logic, Logical implication, Rules of inference, Quantifiers, Proofs of theorems.

Unit 2

Relations: Relations, Properties of relations, Computer Recognition- Zero-one Matrices and directed Graphs,

Equivalence Relations and partitions. POSETS, Hasse Diagrams, Lattices..

Unit 3

Combinatorics: Fundamentals of counting, permutation, combination, Combination with repetition, Binomial

Coefficient, Principle of inclusion and exclusion, Pigeon hole principle. The Principle of Inclusion and Exclusion: The

Principle of Inclusion and Exclusion, Generalizations of the Principle, Derangements – Nothing is in its Right Place, Rook

Polynomials.

Unit 4

Graph Theory: Introduction to Graph theory- Definitions, subgraphs, complements, and graph isomorphism, Euler’s

trails and circuits, Hamilton paths and Cycles. Planar graphs, Euler’s Theorem, Graph Coloring.

Unit 5

Trees: Definitions, Properties, and Examples, Routed Trees, Trees and Sorting, Weighted Trees and Prefix Codes.

Groups: Definitions, Elementary Properties, Homomorphism, Isomorphism, and cyclic groups, Cosets and Lagrange’s

Theorem

Text Book:

1. Ralph P. Grimaldi: Discrete and Combinatorial mathematics, 5th Edition, PHI/ Pearson Education, 2004.

Reference Books:

1. Kenneth H. Rosen: Discrete Mathematics and its Applications.

2. Thomas Koshy: Discrete Mathematics with Applications.

3. Kenneth H. Rosen: Discrete Mathematics and its Applications

Course Delivery: The course will be delivered through lectures, presentations, classroom discussions, and practical

implementations. Questions for CIE and SEE are designed in accordance with the Bloom’s taxonomy.


What To Whom

When/ Where

(Frequency in

the course)

Max

Mark

s

Evidence

Collected

Contribution to

Course Outcomes

Dir

ect

Ass

essm

en

t

Met

ho

ds

CIE

Internal

Assessment

Tests Students

Thrice(Average

of the best two

will be

computed)

30 Blue Books 1,2,3,4,5

Quiz/Online

Course Once 20 Quiz Papers 2,3,4

Course Outcomes (CO):


1. Construct mathematical arguments using logical connectives and verify the correctness of an argument using

propositional and predicate logic. Analyze its application in the field of computer science.

2. Understand and analyze the applications of sets, functions, relations.

3. Demonstrate the ability to solve problems using counting techniques and combinatorics in the context of discrete

probability. Understand the principle of inclusion-exclusion, rook polynomial.

4. Understand some basic properties of graphs and related discrete structures, and be able to relate these to practical

examples.

5. Learn the concepts of Trees and its applications. Learn the concept of groups and their applications.

Mapping of Course Outcomes with Programme Outcomes:


1 2 3 4 5 6 7 8 9 10 11 12

Construct mathematical arguments using logical connectives and

verify the correctness of an argument using propositional and

predicate logic. Analyze its application in the field of computer

science

X X X X -- X X X

Understand and analyze the applications of sets, functions,

relations X X X X X X X

Demonstrate the ability to solve problems using counting

techniques and combinatorics in the context of discrete probability.

Understand the principle of inclusion-exclusion, rook polynomial

X X X X -- X X X

Understand some basic properties of graphs and related discrete

structures, and be able to relate these to practical examples. X X X -- X X X X

Learn the concepts of Trees and its applications. Learn the concept

of groups and their applications.

X X -- X X

SE

E

Standard

Examination

End of Course

(Answering

5 of 10 questions)

100 Answer

scripts 1,2,3,4,5,

Ind

irec

t

Ass

essm

en

t

Met

ho

ds

Students

Feedback

Students

Middle of the

course -

Feedback

forms

1, 2, 3,4,5

Delivery of the course

End of Course


1, 2

,3,4,5Effectiveness of

Delivery of

instructions &

Assessment Methods

Course Title: Object Oriented Programming with C++ Course Code: CS315


Type of course: Lecture Total Contact Hours:42 Hrs

Prerequisites: CS101/201: Fundamentals of Computing

Course Objectives:


1. Justify the approach of object-oriented design technique and the concepts of encapsulation, abstraction,

inheritance, and polymorphism.

2. Implement the concept of constructors and destructors in the Object Oriented Language C++.

3. Design and test the implementation among objects using a class hierarchy and inheritance.

4. Identify the relationship between the run time polymorphism and compile time polymorphism.

5. Implement file I/O operations and exception handling mechanism.

Course Contents:

Unit 1

Introduction: Overview of C++, Sample C++ program, Different data types, operators, expressions, and statements,

arrays and strings, pointers & function components, recursive functions, user-defined types, function overloading, inline

functions.

Classes & Objects – I: classes, Scope resolution operator, passing objects as arguments, returning objects, and object

assignment.

Unit 2

Classes & Objects –II: Constructors, Destructors, friend functions, Parameterized constructors, Static data members,

Functions, Arrays of objects, Pointers to objects, this pointer, and reference parameter, Dynamic allocation of objects,

Copy constructors, Operator overloading using friend functions such as +, - , pre-increment, post-increment, [ ] etc.,

overloading <<.

Unit 3

Templates: Generic functions and Generic classes, Inheritance : Base Class, Inheritance and protected members,

Protected base class inheritance, Inheriting multiple base classes, Constructors, Destructors and Inheritance, Passing

parameters to base class constructors, Granting access, Virtual base classes.

Unit 4

Virtual functions, Polymorphism: Virtual function, calling a Virtual function through a base class reference, Virtual

attribute is inherited, Virtual functions are hierarchical, pure virtual functions, Abstract classes, Using virtual functions,

Early and late binding.

Unit 5

Exception Handling, I/O System Basics, File I/0: Exception handling fundamentals, Exception handling options. C++

stream classes, Formatted I/O, C++ File I/O: <fstream> and the File classes, Opening and closing a file, Reading and

writing text files.

Assignment: C++ File I/O: Unformatted and Binary I/O, STL.

Note: Assignment component is of 20 marks.

Text Book:

1. Herbert Schildt: The Complete Reference C++, 4th

Edition, Tata McGraw Hill, 2011.

Reference Books:

1. Stanley B.Lippmann, Josee Lajoie: C++ Primer, 4th

Edition, Addison Wesley, 2012.

2. Paul J Deitel, Harvey M Deitel: C++ for Programmers, Pearson Education, 2009.

3. K R Venugopal, Rajkumar Buyya, T Ravi Shankar: Mastering C++, 1st edition, Tata McGraw Hill, 2011.

Course Delivery:

The course will be delivered through lectures, class room interaction, group discussion, exercises and self study cases.


What To Whom

When/ Where

(Frequency in

the course)

Max

Marks

Evidence

Collected

Contribution to

Course Outcomes

Dir

ect

Ass

essm

en

t

Met

ho

ds

CIE

Internal

Assessment

Tests

Students

Thrice(Average of

the best two will

be computed)

30 Blue Books 1,2,3,4 & 5

Assignments Once 20 Assignment

copies 1,2,3,4,5

SEE Standard

Examination

End of Course

(Answering

5 of 10 questions)

100 Answer

scripts 1,2,3,4 & 5

Ind

irec

t A

sses

smen

t

Met

ho

ds

Midsem survey

Students

Middle of the

course -

Feedback

forms

1, 2, 3

Delivery of the

course

End of Course

Survey End of the course -

Questionnair

e

1, 2 ,3,4,5

Effectiveness of

Delivery of

instructions &

Assessment

Methods

Course Outcomes:

1. At the end of the course students should be able to:

2. Identify classes, objects, members of a class and the relationships among them needed to solve a specific

problem.

3. Demonstrate the concept of constructors and destructors.

4. Create function templates, overload function templates, understand and demonstrate the concept data

encapsulation and inheritance

5. Demonstrate the concept of polymorphism with virtual functions.

6. Demonstrate the concept of file operations, streams in C++ and various I/O manipulators.



1 2 3 4 5 6 7 8 9 10 11 12

1. Identify classes, objects, members of a class and

the relationships among them needed to solve a

specific problem.

X X X

2. Demonstrate the concept of constructors and

destructors.

X X X

3. Create function templates, overload function

templates, understand and demonstrate the

concept data encapsulation and inheritance

X X X

4. Demonstrate the concept of polymorphism with

virtual functions.

X X X X

5. Demonstrate the concept of file operations,

streams in C++ and various I/O manipulators.

X X X X

Course Title: Programming Laboratory Course Code: CSL316


Type of course: Practical Total Contact Hours: 28 Hrs

Prerequisites: CS101/201: Fundamentals of Computing

Course Objectives:

This course will help students to achieve the following objectives:

1. Design and apply appropriate data structures for solving computing problems.

2. Develop computer programs to implement different data structures and related algorithms.

3. Design and develop programs based on the principles of object-oriented programming.

4. Apply the concepts of data encapsulation, inheritance, and polymorphism.

Course Contents:

There shall be a minimum of 2 exercises conducted on each of the following topics.

Part A: - Data Structures with C

1. Pointers, Structures, Unions and string manipulation functions.

2. Stack operations, infix to postfix conversion and evaluation of expressions.

3. Polynomial operations using arrays/linked lists

4. Queue and circular queue operations using arrays.

5. Singly linked list operations

6. Doubly linked lists operations

7. Circular linked lists operations

8. Binary tree traversals.

9. Threaded binary tree operations

10. Binary search tree operations.

11. Breadth first search and Depth first search

12. Single- and Double-Ended Priority Queue operations

Part B: - Object Oriented Programming with C++.

1. Inline functions & function overloading.

2. Classes & objects.

3. Constructors, destructors & static data members.

4. Friend functions & generic functions.

5. Operator overloading.

6. Inheritance - protected members, protected base class inheritance, inheriting multiple base classes.

7. Passing parameters to base class constructors, granting access and virtual base class.

8. Virtual functions and polymorphism.

9. Pure virtual functions and abstract classes.

10. Formatted I/O, I/O manipulators.

11. File operations

12. Exception handling.

Textbooks:

1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition, Universities Press, 2008


Edition, Tata McGraw Hill, 2011

Reference Books:

1. Programming Lab Manual by the Department

2. Behrouz A. Forouzan and Richard F. Gilberg: Computer Science- A Structured Programming Approach Using

C, Second Edition, Course Technology, 2009.

3. Aaron M. Tenenbaum, Y.Langsam, M.J.Augenstein: Data Structures Using C, 1st Edition, Pearson Education

Ltd, 2012.

4. Richard F. Gilberg and Behrouz A. Forouzan: Data Structures- A Pseudocode Approach with C, 2nd Edition,

Cengage Learning, 2012.


Edition, Tata McGraw Hill, 2011.

6. Stanley B.Lippmann, Josee Lajoie: C++ Primer, 4th

Edition, Addison Wesley, 2012.

Topics: General principles of language design: Design goals, Typing regimes, Data structure models, Control structure

models and Abstraction mechanisms.

Part A: - Data Structures with C.

Part B: - Object Oriented Programming with C++.

Course Delivery: The course will be delivered through lectures in the laboratory with exercises.


What To

Whom

When/ Where

(Frequency in the

course)

Max

Marks

Evidence

Collected

Contribution to

Course Outcomes

Dir

ect

Ass

essm

en

t

Met

ho

ds CIE

Lab Test

Students

1Lab Test 30 Data sheets 1-5

Record

Every Week(Average

of the total score will

be computed)

10 Record 1-5

Viva

Every Week(Average

of the total score will

be computed)

10

Viva Result

Sheets

Recollection Skills

SEE Lab

Examination

End of Course

(Executing 2

programs)

50 Answer

scripts 1-5

Ind

irec

t

Ass

essm

en

t

Met

ho

d

Students

Feedback

Students


forms Delivery of the course

End of Course


Effectiveness of

Delivery of

instructions &

Assessment Methods

Course Outcomes:


1. Understand various data structures like stacks, queues, linked lists, trees and graphs

2. Develop well documented programs containing complex data structures.

3. Create classes incorporating object-oriented techniques.

4. Design, implement, test, and debug simple programs in an object-oriented programming language.

5. Use data abstraction, polymorphism and exception handling.



1 2 3 4 5 6 7 8 9 10 11 12

Understand various data structures like stacks,

queues, linked lists, trees and graphs X X X X

Develop well documented programs containing

complex data structures X X X X

Create classes incorporating object-oriented

techniques X X X X X X

Design, implement, test, and debug simple programs

in an object-oriented programming language X X XX X X

Use data abstraction, polymorphism and exception

handling X X X X X

Course Title: Analog & Digital Circuits Laboratory Course Code: CSL317


Type of course: Practical Total Contact Hours: 28 Hrs

Prerequisites: EC201 Elements of Electrical Engineering

Course Objectives

This course will help students to achieve the ability to:

1. Design, assembly and testing of electronic circuits that use diodes, transistors and operational amplifiers in

configurations typically encountered in practical applications.

2. Hands-on design, implementation, and debugging of digital logic circuits.

3. Use of computer-aided design tools for schematic capture and simulation.

Course Contents:

There shall be a minimum of 2 exercises conducted on each of the following topics

Part A: - Electronic Circuits

1. RC Coupled Amplifiers

2. Drain Characteristics of FET

3. Rectifiers

4. Clippers

5. Clampers

6. Applications of Operational Amplifier

7. Applications of 555 Timer

8. ADC

9. DAC

10. Line Regulators

11. Voltage Regulators

Part B: - Digital design with VHDL

1. Boolean Function Realization Using Basic Gates and Universal Gates

2. VHDL Simulation of Boolean functions

3. Realization and VHDL simulation of combinational circuits

4. Code Converter Circuits

5. Decoders – realization and simulation

6. Multiplexers – realization and simulation

7. Encoders – realization and simulation

8. Basic latch and flip-flops

9. Asynchronous Counters

10. Synchronous Counters

11. Shift Registers

12. Ring & Johnson counters

Text Books

1. Robert L Boylestad, Louis Nashelsky: Electronic Devices and Circuit Theory, 10th Edition. Pearson, 2009.

2. Anil K Maini, Varsha Agarwal: Electronic Devices and Circuits, Wiley, First Edition, 2009.

Reference Books:

1. Albert Malvino & David J Bates: Electronic Principles, TMH, 7th edition, 2007.

2. David A Bell: Electronic devices and Circuits, PHI,4th edition, 2006.

Course Delivery:

The course will be delivered through lectures in the laboratory with exercises.


What To

Whom

When/ Where

(Frequency in the

course)

Max

Marks

Evidence

Collected

Contribution to

Course

Outcomes

Dir

ect

Ass

essm

en

t

Met

ho

ds CIE

Lab Test

Students

1Lab Test 30 Data sheets 1-5

Record

Every Week(Average of

the total score will be

computed)

10 Record 1-5

Viva

Every Week(Average of

the total score will be

computed)

10

Viva Result

Sheets

Recollection

Skills

SEE Lab

Examination

End of Course

(Executing 2 programs) 50 Answer scripts 1-5

Ind

irec

t

Ass

essm

en

t

Met

ho

d

Mid-Term Survey

Students


forms

1, 2, 3

Delivery of the

course

End of Course


Effectiveness of

Delivery of

instructions &

Assessment

Methods

Course Outcomes:

At the end of the course the students should be able to:

1. Experimental analysis of I/O characterstics of Transistors and Feedback circuits

2. Design and implementation of Clipper and Clamper Circuits, Multivibrator Circuits, Rectifier Circuits, voltage

Regulators

3. Design and Implementation of Various applications of OPAMPs

4. Analysis ,Design, and implement of combinational and sequential logic circuits.

5. Simulation and analysis of logic circuits in VHDL using Modelsim


Course OutComes

Program Outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 P11 P12

Experimental analysis of I/O

characteristics of Transistors and

Feedback circuit

X X X

Design and implementation of

Clipper and Clamper Circuits,

Multivibrator Circuits, Rectifier

Circuits, voltage regulators

X X X

Design and Implementation of

Various applications of OPAMPs

X X X

Design, implementation and

analysis of combinational and

sequential logic circuits.

X X X

Simulation and analysis of logic

circuits in VHDL using Modelsim. X X X

Course Title: Engineering Mathematics - IV Course Code: CSMAT401



Prerequisites: Nil

Course Objectives:

The students will

1. Learn to solve algebraic and transcendental equations numerically.

2. Learn fitting a curve, correlation, regression for a statistical data.

3. Learn the basic concepts of probability and Random variables.

4. Learn the concepts of probability distributions.

5. Construct the various tests essentially needed for the testing of small samples for testing for different attributes.

6. Learn the concepts of stochastic process and queuing theory.

Course Contents:

Unit 1

Numerical Solution of Algebraic and Transcendental equations: Method of false position, Newton-Raphson method.

Statistics: Curve fitting by the method of least squares, Fitting a Linear curve, Quadratic curve, Geometric curve,

Correlation and Regression.

Unit 2 Theory of Probability: Classical and axiomatic definition of probability, Addition law, Conditional probability,

Multiplication law, Baye’s theorem.

Random Variables: Discrete, Continuous, Mathematical expectation, Variance, Moment Generating Function (MGF).

Unit 3

Probability Distribution: Binomial, Negative Binomial, Poisson, Geometric, Exponential, Gamma and Normal

distribution.

Joint probability distribution: Concept of joint probability distribution, Discrete random variables, Independent random

variables, Problems on expectation and variance.

Unit 4

Sampling Theory : Sampling, Sampling distributions, Standard error, Central limit theorem, Test of Hypothesis for

means, Confidence limits for means, Student’s t-distribution, F-distribution, Chi-Square distribution as a test of goodness

of fit.

Unit 5

Markov Chain: Introduction, Classification of stochastic process, Probability vectors, Stochastic matrices,

Fixed points, Regular stochastic matrices, Markov chains, Discrete Time Markov chains, Computation of n-

step Transition Probabilities, States classification and limiting Probabilities.

Queuing theory: Introduction, Concepts and M/G/1 and M/M/1 queuing systems with numerical illustration.

Text Books :

1. B.S.Grewal - Higher Engineering Mathematics - Khanna Publishers - 40th

edition-2007.

2. R.E. Walpole, R. H. Myers, R. S. L. Myers and K. Ye – Probability and Statistics for Engineers and Scientists –

Pearson Education – Delhi – 8th

edition – 2007.

Reference Books :

1. Murray R Spiegel, John Schiller & R. Alu Srinivasan – Probability and Statistics – Schaum’s outlines –

2nd

edition –2007.

2. Erwin Kreyszig - Advanced Engineering Mathematics-Wiley-India publishers- Abridged edition-2008.

3. Kishor S. Trivedi – Probability & Statistics with reliability, Queuing and Computer Science Applications – PHI –

2nd

edition – 2002.

Course Outcomes:

The students are expected to do the following:

1. Will be able to solve the problems of algebraic and transcendental equations using numerical methods.

2. Fit a suitable curve for tabulated values by the method of least squares.

3. Will be able to solve problems on probability of practical importance.

4. Express the probability distribution arising in the study of engineering problems and their applications.

5. Using the concepts of sampling student will be able to take decision about the hypothesis.

6. Will be able to apply the stochastic process and Markov Chain in prediction of future events.

7. Calculate the various parameters of the queuing models.

Course Title: Theory of Computation Course Code: CS411


Type of course: Lecture, Tutorial Total Contact Hours: 70

Prerequisites: Nil

Course Objectives:

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

1. To classify machines by their power to recognize languages

2. Employ finite state machines to solve problems in computing.

3. Design deterministic and non-deterministic machines.

4. Design grammars and recognizers for different formal languages

5. To recognize the decidability of language which are not regular.

Course Contents:

Unit 1

Introduction to Finite Automata: The central concepts of Automata theory; Deterministic finite automata;

Nondeterministic finite automata. An application of finite automata, Finite automata with Epsilon transitions.

Unit 2

Regular Expressions: Finite Automata and Regular Expressions Applications of Regular Expressions. Regular

languages; Proving languages not to be regular languages; Closure properties of regular languages; Decision properties of

regular languages; Equivalence and minimization of automata.

Unit 3

Context–free grammars: Parse trees; Applications; Ambiguity in grammars and Languages. Definition of the Pushdown

automata; the languages of a PDA; Equivalence of PDA’s and CFG’s..

Unit 4

Deterministic Pushdown Automata: Normal forms for CFGs; The pumping lemma for CFGs; Closure properties of

CFLs. Problems that Computers cannot solve.

Unit 5

The Turing machine: Programming techniques for Turing Machines. Undecidability, A Language that is not recursively

enumerable; An Undecidable problem that is RE; Post’s Correspondence problem..

Text Book:

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

Computation, 3rd Edition, Pearson Education, 2011.

Reference Books:

1. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata McGraw-Hill, 2007.

2. Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley & Sons, 2009.

3. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science, Languages and Machines, 3rd

Edition,Pearson Education, 2006

Course Delivery:

The course will be delivered through lectures, class room interaction, group discussion and exercises and self-study cases.


What To

Whom

When/ Where

(Frequency in

the course)

Max

Marks

Evidence

Collected

Contribution to

Course

Outcomes

Dir

ect

Ass

ess

men

t

Met

ho

d

s CIE

Internal

Assessment

Tests

Students

Thrice(Average

of the best two

will be

computed)

30 Blue

Books 1,2 3,4,5

Surprise Quiz Once 20 Quiz

Answers 1,2,3,4 & 5

SEE Standard

Examination

End of Course

(Answering

5 of 10

questions)

100 Answer

scripts 1,2,3,4 &5

Ind

irec

t A

sses

smen

t

Met

ho

ds

Mid of the Course

Survey

Students

Middle of the

course -

Questionn

aire

1,2&3

Delivery of the

course

End of Course

Survey

End of the

course -

Questionn

aire

1,2,3,4, &5

Effectiveness of

Delivery of

instructions &

Assessment

Methods

Course outcomes:

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

1. Demonstrate an understanding of electrical circuits in practical applications.

2. Design the analog circuits using integrated circuits

3. Simulate the different analog circuits using a simulation tool

4. Demonstrate an understanding of digital circuits in practical applications

5. Simulate the different digital circuits using simulation tool

Mapping Course Outcomes with program Outcomes:


1 2 3 4 5 6 7 8 9 10 11 12

1. Demonstrate an understanding of electrical circuits in practical

applications. X X X X X X

2. Design the analog circuits using integrated circuits X X X X X X

3. Simulate the different analog circuits using a simulation tool X X X X X X

4. Demonstrate an understanding of digital circuits in practical

applications X X X X X X

5. Simulate the different digital circuits using simulation tool X X X X X X

Course Title: Computer Organization Course Code: CS412

Credits (L:T:P:S) : 4:0:0 Core/ Elective: Core


Prerequisites: Nil

Course Objective:

The objective of this course is to make the students to

1. To have a thorough knowledge of representing the instructions in the computer and ARM addressing modes

2. To learn high-speed multiplier, circuit that perform division operation and also the representation of the floating

point number in IEEE format.

3. To build a datapath and analyze the advantages of using Pipelining technique.

4. To understand cache performance and the importance of virtual memory.

5. Learning I/O interface and how to accelerate I/O performance.

Course Contents:

Unit 1

Language of the Compuer: Operation of the computer hardware, Operands of the Computer Hardware, Signed and

Unsigned numbers, Representing Instructions in the Computer, Logical Operations, Instructions for making Decisions,

Supporting procedures in the computer hardware, Communicating with people: ASCII versus Binary numbers, compiling

a string copy procedure, showing how to use C strings, ARM addressing for 32-bit immediates and more complex

addressing modes.

Unit 2

Arithmetic unit: Multiplication of two numbers, A signed operand multiplication, Booth algorithm, Bit pair recoding and

CSA – integer division, IEEE standard for floating point numbers, Operations, Guard bits and truncation.

Unit 3

The Processor: Introduction, A basic MIPS Implementation, Logic Design Conventions: Clocking methodology,

Building a datapath, An overview of pipelinig: Designing instruction sets for pipelining, Pipeline hazards, Pipelined

datapath and control: Graphically representing pipelines, Data hazards: Forwarding versus stalling.

Unit 4

Memory unit: Introduction, The basics of Caches: Accessing a cache, Handling cache misses, Handling writes,

Designing the memory system to support caches, Measuring and improving cache performance: Reducing cache misses

by more flexible placement of blocks, Locating a block in the cache, choosing which block to replace, Reducing the miss

penalty using multilevel caches, Virtual memory: Placing a page and finding it again, Page faults, TLB.

Unit 5

Input Output Unit: Introduction, Dependability, Reliability, and availability, Disk storage, Flash memory, Connecting

processors, memory, and I/O devices, Interfacing I/O devices to the processor, memory, and operating system, I/O

performance measures, Designing an I/O system, parallelism and I/O, Real stuff: Sun Fire x4150 server.

Text Book:

1. David A. Petterson, John L. Hennessy: Computer Organization and Design, M.K Publishers, 4th edition, 2010

2. C Hamacher, Z Vranesic, S Zaky: Computer Organization, Tata McGraw Hill, 5th edition, 2011.

Reference Books:

1. W. Stallings: Computer Organization and Architecture: Designing For Performance, 8th edition, Prentice hall,

2012.

2. L L Wear: Computer - An introduction to hardware and software design, McGraw Hill international edition,

1991.

Course Delivery:

The course will be delivered through lectures, class room interaction, exercises and self-study cases.


What To

Whom

When/ Where

(Frequency in the

course)

Max

Marks

Evidence

Collected

Contribution to

Course Outcomes

Dir

ect

Ass

essm

en

t

Met

ho

ds CIE

Internal

Assessment Tests

Students

Thrice(Average of

the best two will be

computed)

30 Blue Books 1, 2, 3, 4 and 5

Surprise Quiz Once 10 Quiz Answers 1,2,3

Assignments Once 10 Assignments

Sheets 4,5

SEE Standard

Examination

End of Course

(Answering

5 of 10 questions)


Ind

irec

t A

sses

smen

t

Met

ho

ds

Mid Sem Survey

Students

Middle of the


1,2&3

End of Course Survey End of the course - Questionnaire

1,2,3,4, &5

Effectiveness of

Delivery of

instructions &

Assessment

Methods

Course Outcomes:

At the end of this course the students will be able to:

1. Understand the operations & operands of the computer, representing instruction and ARM addressing modes.

2. Implement different algorithms used to perform fast multiplication and division also represent the floating-point

number in IEEE format.

3. Analyze the logic design convention, datapath elements and understand the importance of pipelining.

4. Learn how to measure and improve the cache memory performance and also recognize the advantages of using

virtual memory technique.

5. Evaluate I/O system also demonstrate the connection and interfacing of I/O devices with the system.



1 2 3 4 5 6 7 8 9 10 11 12

1. Understand the operations & operands of the computer, representing

instruction and

2. ARM addressing modes.

X X X

3. Implement different algorithms used to perform fast multiplication and

division & also

4. represent the floating-point number in IEEE format.

X X X

5. To analyze the logic design convention, datapath elements and understand

the

6. importance of pipelining.

X X X

7. Learn how to measure and improve the cache memory performance and also

recognize the advantages of using virtual memory technique. X X X

8. Evaluate I/O system and demonstrate connection and interfacing of I/O

devices with the system.

X X X

Course Title: Design and Analysis of Algorithms Course Code: CS413



Prerequisites: Knowledge of Data Structures with C/ C++.

Course Objectives:


1. Present fundamental concepts for algorithm design and provide necessary background for writing algorithms in a

formal way.

2. Identify, for a certain problem, adequate algorithm design strategies.

3. Present fundamental concepts and techniques for complexity analysis of algorithms.

4. Design, implement and test an appropriate algorithm for different application problems.

5. Analyze the efficiency of different algorithms for the same problem and classify them according to their

complexity

Course Contents:

Unit 1

Introduction: What is an Algorithm? Algorithm Specification, Performance Analysis. Elementary Data Structures:

Stacks and Queues, Trees, Dictionaries, Priority Queues, Sets and Disjoint set Union, Graphs.

Unit 2

Divide-and-Conquer: General Method, Binary Search, Finding Maximum and Minimum, Merge Sort, Quick Sort. The

Greedy Method: The General Method, Knapsack Problem, Minimum-Cost Spanning Trees, Single-Source Shortest

Paths.

Unit 3

Dynamic Programming: General Method, All-Pair Shortest Paths, Single Source Shortest Paths, 0/1 Knapsack,

Travelling Salesperson problem. Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for

Graphs, Connected Components & Spanning Trees, Biconnected Components & DFS. Unit 4

Backtracking: General method, 8 Queens Problem, Sum of Subsets, Graph Coloring, Knapsack Problem. Branch and

Bound: The method (FIFO & LC Branch & Bound), 0/1 Knapsack Problem.

Unit 5

NP-Hard and NP-Complete Problems: Basic Concepts, NP-Hard Graph problems: Travelling Salesman problem &

AND/OR Graph Decision problems, Approximation Algorithms: Introduction, Absolute Approximations, ε-

Approximations, Polynomial Time Approximation Schemes

Text Books:

1. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Fundamentals of Computer Algorithms, 2nd

Edition,

Universities Press, 2007.

Reference Books:

1. Anany Levitin: Introduction to The Design & Analysis of Algorithms, 2nd Edition, Pearson Education, 2007.

2. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: Introduction to Algorithms, 3rd

Edition, PHI, 2010.

3. R.C.T. Lee, S.S. Tseng, R.C. Chang & Y.T.Tsai: Introduction to the Design and Analysis of Algorithms A

Strategic Approach, Tata McGraw Hill, 2005.

Course Delivery:



What To Whom

When/ Where

(Frequency in the

course)

Max

Marks

Evidence

Collected


Outcomes

Di

re ct

As

se ss m en t M et ho

ds CIE

Internal

Assessment Students

Thrice

(Average of the 30 Blue Books 1,2,3,4 &5

Tests best two will be

computed)

Implementation

of application

based on design

strategies learnt

/ certification

course

Once 20

Softcopy of

the programs/

certificate

Implementation skills

SEE Standard

Examination

End of Course

(Answering

5 of 10 questions)


Ind

irec

t

Ass

essm

en

t

Met

ho

ds

Students

Feedback

Students

Mid of Course - Feedback

forms

1,2 & 3


End of Course

Survey End of the course Questionnaire

1,2,3, 4,& 5 Effectiveness of

Delivery of instructions &

Assessment Methods

Questions for CIE and SEE will be designed to evaluate the various educational components (Bloom’s

taxonomy) Course Outcomes:


1. Explain the basic concepts of time and space complexity and various design strategies and brief out the analysis of

elementary data structures.

2. Describe the methodologies of how to analyze an algorithm based on divide and conquer, and Greedy strategies.

3. Identify the working strategy of dynamic programming and analyze the basic traversal and search techniques.

4. Apply the ideas of backtracking and branch and bound design strategies and analyze their performance on

optimization problems.

5. Demonstrate an understanding of NP-Hard, NP-Complete Problem types and analyze the importance of

Approximation Algorithms.


Course Outcomes

Program Outcomes

1 2 3 4 5 6 7 8 9 10 11 12

Explain the basic concepts of time and space

complexity and various design strategies and brief

out the analysis of elementary data structures

X - X - - - -

Describe the methodologies of how to analyze an

algorithm based on divide and conquer, and Greedy

strategies.

X X X - - X X -

Identify the working strategy of dynamic

programming and analyze the basic traversal and

search techniques.

X X X - X X -

Apply the ideas of backtracking and branch and

bound design strategies and analyze their

performance on optimization problems

X X X X - X - -

Demonstrate an understanding of NP-Hard, NP-

Complete Problem types and analyze the importance

of Approximation Algorithms.

X X X - - X - -

Course Title: Introduction to Microprocessors Course Code: CS414


Type of course: Lecture Total Contact Hours:56 Hrs

Prerequisites: Nil

Course Objectives:


1. Understand the internal architecture of microprocessor and the addressing modes used for the instruction in

designing a processor.

2. Design a processor to perform operations using assembly level language.

3. Understand the hardware specification of various processors and demonstrate the basic understanding of

operation between the microprocessor and memory device.

4. Provide the fundamental understanding of interfacing I/O devices using peripheral devices to microprocessors.

5. Provide the interrupt structure and operations of Intel family, also the DMA technique.

Course Contents:

Unit 1

The Microprocessor and its Architecture: Internal Microprocessor Architecture, Real Mode Memory Addressing,

Introduction to Protected Mode Memory Addressing, Memory Paging, Flat Mode Memory, Addressing Modes, Data

Movement Instructions.

Unit 2

Arithmetic and Logic Instructions: Program Control Instructions, Simple Assembly Language Programs. Using

Assembly Language with C/C++: Using Assembly Language with C++ for 16-Bit DOS Applications. Programming the

Microprocessor: Modular Programming, Using the Keyboard and Video Display, Data Conversions, Example Programs

Unit 3

8086 Hardware Specifications: Pin-Outs and the Pin Functions, Clock Generator, Bus Timings, Ready and Wait, 8288

Bus Controller, Memory and IO interfacing – static memory interfacing, introduction to dynamic memory interfacing.

Unit 4

Basic I/O Interface: Introduction to I/O Interface, I/O Port Address Decoding, The Programmable Peripheral Interface,

ADC/DAC Converters

Unit 5

Interrupts: Basic Interrupt Processing, Hard Interrupts, Interrupt Examples. Direct Memory Access and DMA-

Controlled I/O: Basic DMA Operation,The 8237 DMA Controller.

Text Book:

1. Barry B Brey: The Intel Microprocessors-Architecture, Programming and Interfacing, Eighth Edition, Pearson

Education, 2009.

References:

1. A.K Ray, K.M.Bhurchandi : Advanced Microprocessors and Peripherals, 2nd

edition, TMH, 2004

2. Uffen Beck: 8086:Architecture and Interfacing, 2nd

edition, John Wiley, 2005.

3. Internet Resources for Intel Multi Core and ARM Processors.

Course Delivery:



What To

Whom

When/ Where

(Frequency in

the course)

Max

Marks

Evidence

Collected

Contribution

to Course

Outcomes

Dir

e

ct

Ass

e

ssm

e

nt

Met

h

od

s

CIE Internal

Assessment Tests Students

Thrice (Average

of the best two

will be

30 Blue Books 1,2 3,4,5

computed)

Implementation of

Interfacing

Techniques

Quiz 1

Quiz 2 20

Quizzes are

conducted

online and the

scores are

recorded

1,2,3,4 & 5

SEE Semester End

Examination

End of Course

(Answering

5 of 10 questions)


Ind

irec

t

Ass

essm

en

t

Met

ho

ds

Middle of the course

survey

Students

Middle of the


1, 2 & 3

Delivery of the

course

End of Course


1, 2, 3,4,5

Effectiveness of

Delivery of

instructions &

Assessment

Methods

Course Outcomes:


1. Demonstrate the architecture and design of different microprocessor.

2. Apply and design individual components of microprocessors in real time applications.

3. Identify and differentiate the hardware specifications of different processor and, demonstrate the process between

the processor and various memory devices.

4. Design a interfacing between the I/O devices and microprocessors using peripheral devices microprocessors.

5. Understand the significance of interrupts in designing a processor.



1 2 3 4 5 6 7 8 9 10 11 12

Demonstrate the architecture and design of different microprocessor. X X X X X

Apply and design individual components of microprocessors in real

time applications. X X X X X X

Identify and differentiate the hardware specifications of different

processor and, demonstrate the process between the processor and

various memory devices.

X X X X X

Design a interfacing between the I/O devices and microprocessors

using peripheral devices microprocessors. X X X X X

Understand the significance of interrupts in designing a processor. X X X X X

Course Title: Data Communication Course Code: CS415

Credits (L:T:P) : 4:0:0 Core : Core

Type of Course: Lecture Total Contact Hours: 56 Hrs

Prerequisites: Nil

Course Objectives:


1. Identify the components of a data communication system, factors which impact performance of data communication systems

and solve numerical examples related to these.

2. Understand & Analyze Analog to Digital conversions and vice versa, Multiplexing and various types of transmission media

used in computer networks and methods to optimize utilization of their capacities.

3. Understand the different types of circuit switched Networks and discuss various error detection and correction techniques

employed in data link layer

4. Analyze the various ARQ protocols, frame construction protocols like HDLC, PPP and also the multiple access protocols

employed by Data link layer.

5. Understand the structure of 802.3 and 803.11 protocols along with associated headers and algorithms used and also learn

about the connecting devices.

Course Contents:

Unit 1

Data Communications, Networks, The Internet, Protocols and standards, Network Models - Reference models OSI , Reference models

OSI (Contd.) TCP/IP Model, Addressing, Data & Signal - Analog and Digital, Transmission impairment, Date Rate Limits,

Performance,

Unit 2

Digital Transmissions – Digital to Digital Conversions, Analog to Digital Conversions, Transmission Modes. Analog Transmission

Digital to analog conversion, Analog to Analog conversion, , Multiplexing – FDM, WDM, STDM, Stastical TDM, Spread Spectrum

Guided Media – Twisted pair cable, Co-axial cable, Fiber optic Cable, Unguided media – Wireless – Radio waves, Microwaves,

Infrared,

Unit 3

Circuit switched networks, Datagram networks, virtual circuit networks, Structure of a switch – Structure of Circuit Switches & Packet

Switches, Data Link Layer- Types of Errors, redundancy, Detection VS Correction, Forward error Correction VS Retransmission,

Block Coding - Error detection and correction, Hamming Distance, Minimum Hamming Distance, Linear Block Codes, Cyclic Codes –

CRC, Polynomials, Checksum

Unit 4

Data Link Layer: Data Link Control – Framing, Flow and error control, protocols, Noiseless Channels – Simplest protocol, Noiseless

Channels – Stop and wait protocol, Noisy Channel – Stop and wait Automatic Repeat Request, Go- back N Automatic Repeat Request,

Selective Repeat, Automatic Repeat Request, piggybacking, HDLC – Configurations and Transfer Modes, Frames, Point to Point

Protocols – Framing, Transition phases, Multiplexing, Multiple Access and Wired LANs-Random access – Aloha, CSMA,

CSMA/CD,CSMA/CA, Controlled access – reservation, polling, token passing, Channelization – FDMA, TDMA, CDMA.

Unit 5

IEEE standards – Data link and Physical Layer, Standard Ethernet – MAC sublayer, Standard Ethernet – physical layer, Bridged

Ethernet, Switched Ethernet, Full duplex Ethernet, Fast Ethernet, Gigabit Ethernet Wireless LANs, IEEE 802.11- Architecture, MAC

sub layer, Addressing Mechanisms and physical layer, Bluetooth – Architecture, Bluetooth layers, Connecting Devices – Hub,

Repeater, Bridges, Transparent Bridges, Switches, Router, Gateway, Backbone Networks – Bus, Star, Connecting Remote LANs,

Virtual LANs

Text Book:

1. Data Communication and Networking, Behrouz A.Forouzan, McGraw Hill, 4th Edition, 2008.

Reference Books:

1. Data and Computer Communication, William Stallings, 8th Edition, Pearson Education, 2007.

2. Introduction to Data Communications and Networking – Wayne Tomasi, Pearson Education, 2005.

3. Communication Networks-Fundamental Concepts and key architectures, Alberto Leon-Garcia and Indra Widjaja, Tata Mc-Graw-

Hill 2nd Edition, Pearson Education, 2005.

Course Delivery:

The Course will be delivered through classroom teaching, interactions with the students, discussing interesting electronic systems in the

class room where the subsystems are being used.


Course Outcomes:

At the end of the course, the students will be able to:

1. Identify and recognize the ISO OSI and TCP models and the layers associated functionalities.

2. Understand and analyze the types of digital transmissions and also know in detail about the types of transmission media.

3. Recognize the different types of networks and learn to solve problems in Error detection and corrections carried at data link

layer.

4. Design algorithms for the different ARQ protocols and also able to know the detailed frame format of HDLC and PPP.

5. Recognize the different types of Ethernet and get to understand the architecture of different types of wireless networks.



1 2 3 4 5 6 7 8 9 10 11 12

Identify and recognize the ISO OSI and TCP models and the

layers associated functionalities. X X

Understand and analyze the types of digital transmissions and

also know in detail about the types of transmission media. X X X X X

Recognize the different types of networks and learn to solve

problems in Error detection and corrections carried at data link

layer.

X X X X X

Design algorithms for the different ARQ protocols and also

able to know the detailed frame format of HDLC and PPP. X X X X X

Recognize the different types of Ethernet and get to

understand the architecture of different types of wireless

networks.

X X X

What To

Whom

When/ Where

(Frequency in the

course)

Max

Marks

Evidence

Collected


Outcomes

Dir

ect

Ass

ess

men

t

Met

ho

ds CIE

Internal Assessment

Tests

Student

s

Thrice(Average of the

best two will be

computed)

30 Blue Books 1,2 3,4,5

Quiz/ Lab test/

Demonstration of

OPNET exercises

Depends on the

component 20

Quiz

papers/

Data sheets/

reports

1,2,3,4 & 5

SEE Standard

Examination

End of Course

(Answering

5 of 10 questions)

100 Answer

scripts 1,2,3,4 &5

Ind

irec

t

Ass

essm

ent

Met

ho

ds

Students

Feedback Student

s


forms

1, 2 & 3


End of Course Survey End of the course - Questionnai

re

1, 2, 3,4,5 Effectiveness of

Delivery of instructions &

Assessment Methods

Course Title: Algorithms Laboratory Course Code: CSL413


Type of course: Practical Total Contact Hours: 28

Prerequisites: Knowledge of Data Structures and any one programming language.

Course Objectives:


1. Implement the most common quadratic and O (n log n) sorting algorithms.

2. Design and implement an appropriate hashing function for an application.

3. Design and implement a collision-resolution algorithm for a hash table.

4. Discuss factors other than computational efficiency that influence the choice of algorithms, such as programming

time, maintainability, and the use of application-specific patterns in the input data.

5. Solve problems using the fundamental graph algorithms, including depth-first and breadth-first search, single

source and all-pairs shortest paths, transitive closure, topological sort, and at least one minimum spanning tree

algorithm.

Course Contents:

Note: Student is required to solve minimum of 2 exercises. The questions are allotted based on lots. Both questions carry

equal marks.

Implement the following concepts using C and evaluate the time complexity for algorithms

1. Brute Force techniques

2. String Matching Algorithms.

3. Divide and Conquer Techniques.

4. Decrease and Conquer Techniques.

5. Input enhancement methods in string matching.

6. Open and closed Hashing.

7. Transform and Conquer Techniques

8. Dynamic Programming and Greedy Algorithms

9. Backtracking and Branch and Bound Techniques

Text Books:

1. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Fundamentals of Computer Algorithms, 2nd

Edition,

Universities Press, 2007.

Reference Books:

1. Anany Levitin: Introduction to The Design & Analysis of Algorithms, 2nd Edition, Pearson Education, 2007.

2. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: Introduction to Algorithms, 3rd

Edition, PHI, 2010.

3. R.C.T. Lee, S.S. Tseng, R.C. Chang & Y.T.Tsai: Introduction to the Design and Analysis of Algorithms A

Strategic Approach, Tata McGraw Hill, 2005.

Course Delivery:

The course will be delivered through algorithmic concepts to confirm the learnt concepts by simulating some simple

exercises.


What To

Whom

When/ Where

(Frequency in

the course)

Max

Marks

Evidence

Collected

Contribution to

Course Outcomes

Dir

ect

Ass

essm

en

t M

eth

od

s

CIE Internal

Assessment Tests

Students

Twice

50 (

25marks each)

Data Sheets 1,2,3,4 & 5

SEE Standard

Examination

End of Course

(Answering

5 of 10

questions)


Mid of the Course

Survey

Middle of the

Course -- Questionnaire

1, 2, 3 & Effectiveness

of Delivery of

instructions &

Assessment Methods

End of Course

Survey

End of the


1, 2, 3,4,5

Effectiveness of

Delivery of

instructions &

Assessment Methods

Course Outcomes:


1. Distinguish between the basic concepts of time and space complexity and various design strategies

2. Apply the methodologies of Brute force and Divide and conquer and evaluate the complexity.

3. Solve a problem using Transform and conquer algorithms and evaluate its correctness.

4. Formulate the time-complexity analysis for Dynamic programming and greedy techniques.

5. Apply, analyze and Design Branch and Bound techniques.



1 2 3 4 5 6 7 8 9 10 11 12

Distinguish between the basic concepts of time

and space complexity and various design

strategies

X X X

Apply the methodologies of Brute force and

Divide and conquer and evaluate the

complexity.

X X X X X X

Solve a problem using Transform and conquer

algorithms and evaluate its correctness. X X X X X X

Formulate the time-complexity analysis for

Dynamic programming and greedy techniques. X X X X X X

Apply, Analyze and Design Branch and Bound

techniques X X X X X X

Course Title: Microprocessors Laboratory Course Code: CSL414


Type of course: Practical Total Contact Hours:28 Hrs

Prerequisites: Nil

Course Objectives:


1. Present the method to write, execute the assembly level language programs using MASM environment.

2. Design the programs for real time applications.

3. Provide the details of the hardware specification of 8086 and use them in programming.

4. Present the method and design for interfacing the processor with other peripheral devices.

5. Identify the different interrupts and their significance in designing a processor.

Course Content:

There shall be a minimum of 2 exercises conducted on each of the following topics:

1. Computing GCD

2. Computing LCM

3. Searching Methods

4. Sorting Methods

5. Usage of DOS and BIOS interrupts

6. String instructions usage

7. Stack programming

8. Interfacing exercises with

a. Logical Controller

b. Stepper Motor

c. Display

d. Keypad

e. DAC

Reference Books:

1. Barry B Brey: The Intel Microprocessors-Architecture, Programming and Interfacing, Eighth Edition, Pearson

Education, 2009.

2. A.K Ray, K.M.Bhurchandi: Advanced Microprocessors and Peripherals, TMH, 2004.

3. Barry B Brey: Microprocessors – Architecture and Interfacing, Pearson, 5e, 2006.

4. Uffen Beck: 8086: Architecture and Interfacing, John Wiley, 2005.

5. Internet Resources for Intel Multi Core and ARM Processors

Course Delivery:

The course will be delivered through assembly level language programming to confirm the learnt concepts by simulating

some simple exercises.


What To Whom

When/ Where

(Frequency in

the course)

Max

Marks

Evidence

Collected


Outcomes

Dir

e

ct

Ass

e

ssm

e

nt

Met

h

od

s

CIE

Internal

Assessment

Tests

Students

Twice 50 Datasheets 1,2,3,4 & 5

SEE Standard

Examination

End of Course

(Answering

2 questions )

50 Answer

scripts 1,2,3,4 & 5

Ind

irec

t

Ass

essm

en

t

Met

ho

ds

Middle of the course

survey

Students

Middle of the


1, 2 & 3


End of Course

Survey

End of the


1, 2, 3,4,5

Effectiveness of Delivery

of instructions &

Assessment Methods

Course Outcomes:


1. Identify and write the basic programs addition, subtraction, swapping, GCD, LCM in 8086.

2. Demonstrate sorting techniques, searching techniques in 8086

3. Recognize and execute programs using stack.

4. Classify and interface 8086 and Logical Controller, Stepper Motor, Display, Keypad, DAC.

5. Understand the significance of interrupts ion designing a processor



1 2 3 4 5 6 7 8 9 10 11 12

Identify and write the basic programs addition,

subtraction, swapping, GCD, LCM in 8086. X X - - X - - - - X X -

Demonstrate sorting techniques, searching techniques

in 8086 X X - X - - - - X X -

Recognize and execute programs using stack. X X - X - - - - X X -

Classify and interface 8086 and Logical Controller,

Stepper Motor, Display, Keypad, DAC. X X X - X - - - - X X -

Understand the significance of interrupts ion designing

a processor X X X - X - - X X -

Course Exit Survey Form Dept of CSE, MSRIT, Bangalore

Name & USN of the student: Course code:

Contact details: Course name:

Sl

No. Question

Responses

Excellent Very Good Good Satisfactory Poor

1. Quality of the course content

2. For the number of credits, the course workload

was

3. Relevance of the textbook to this course

4. Ideas/Concepts that you have found difficult

to grasp List

5. Concepts/topics that should be removed from

the syllabus List

6. New inclusions in the syllabus List

7. Were the lectures clear/well organized and

presented at a reasonable pace? Yes/No

8. Did the lectures stimulate you intellectually? Yes/No

9. What approaches/aids would facilitate your

learning? You can check multiple options.

Lectures/ Programming Assignments/ Presentations/ Tutorials/ Demonstrations/ Practical

Exercises/ Mini projects/ Group discussions/ Student seminars/ Expert guest lectures

10.

Did the problems worked out in the classroom

help you to understand how to solve questions

on your own?

Yes/No

11. Is the grading scheme clearly outlined and

reasonable/fair? Yes/No

12. Are the assignment/lab experiment procedures

clearly explained? Yes/No

13. Attainment level of CO1





Signature of the student with date

Midsem Survey Form Dept of CSE, MSRIT, Bangalore

Name & USN of the student: Course code:

Contact details: Course name:

Sl

No. Question

Responses

Excellent Very Good Good Satisfactory Poor

18. Quality of the course content

19. For the number of credits, the course workload

was

20. Relevance of the textbook to this course

21. Ideas/Concepts that you have found difficult

to grasp List

22. Concepts/topics that should be removed from

the syllabus List

23. New inclusions in the syllabus List

24. Were the lectures clear/well organized and

presented at a reasonable pace? Yes/No

25. Did the lectures stimulate you intellectually? Yes/No

26. What approaches/aids would facilitate your

learning? You can check multiple options.

Lectures/ Programming Assignments/ Presentations/ Tutorials/ Demonstrations/ Practical

Exercises/ Mini projects/ Group discussions/ Student seminars/ Expert guest lectures

27.

Did the problems worked out in the classroom

help you to understand how to solve questions

on your own?

Yes/No

28. Is the grading scheme clearly outlined and

reasonable/fair? Yes/No

29. Are the assignment/lab experiment procedures

clearly explained? Yes/No





Employer Survey Form Dept of CSE, MSRIT, Bangalore

Name of the Company:

Name & Designation of the assessor:

Assessor’s contact details:

Name & Designation of the employee:

Experience (in yrs) of the employee under the current assessor:

Sl.

No. Questions

Responses

Strongly

agree Agree Neutral Disagree

Strongly

Disagree

NA/

Can’t

say

1. He/She is sufficiently capable of applying mathematics and science to

solve engineering problems in your field

2. He/She is capable of identifying and formulating problems in

engineering field

3. He/She is quite innovative and can design engineering products,

processes or service

4. He/She is capable of comprehending and analyzing the real life

engineering problems

5. He/She is capable of designing and conducting engineering

experiments on their own and satisfactorily interpret the results

6. He/She possesses skills to handle modern machines and software to

analyze engineering problems

7. He/She is well aware of professional and ethical responsibilities

8. He/She is well inclined to life-long learning

9. He/She gels well with coworkers/colleagues when they are a part of

team’s problem solving effort and can take leadership role too.

10.

He/She is able to see engineering problems in the backdrop of

contemporary issues, and able to explain the impact of their

engineering solution on those issues

11. He/She is able to easily communicate even complex technical

ideas/thoughts to their colleagues

12. He/She has appreciated the need for multi-disciplinary approach to

solve modern engineering problems

Signature of the assessor with date

Alumni Survey Form Dept of CSE, MSRIT, Bangalore

Name: Organization:

Year of graduation: Contact details:

Name of the degree:

Sl

No. Questions Responses

1. Do you work for a tier 1, tier 2 or a tier 3 company?

2. How many promotions have you received so far? (In figures)

3. What position do you hold currently?

4. Have you made significant technical contributions to your employer or research group? (Y/N). Indicate its nature if yes.

5. Have you served as a leader of a computer engineering project or design team?

6. Have you authored or co-authored any technical white papers/proposals?

7. Have you mentored any junior employee/intern/new hire?

8. Have you taken any significant decisions requiring you to analyze engineering/business tradeoffs?

9. How do you rate your contribution towards delivering a product/process?

10. Have you enrolled/completed higher studies? (Y/N) If yes, indicate the degree obtained / enrolled and the corresponding University/ Institute.

11. Have you learnt a new skill, tool, or system independently during your career?

12. How many certification courses do you have in your credit? (In figures)

13. How many technical conferences/ symposiums/ workshops/ tutorials have you attended during your employment?

14. Are you a member of any professional body (IEEE, ACM etc)? (Y/N) If yes, which?

15. How many papers have you published in journal/ conference?

16. How many patents have you under your credit or have you applied for?

17. Have you encountered situations in your workplace that required you to make an ethical decision?

18. How often have you utilized the existing knowledge in varied applications?

19. How often have you worked across teams consisting of people from diverse disciplines, cultures and nationalities?

20. Have you made effective utilization of tools for collaboration such as teleconferencing, video conferencing, etc?

21. Have you been able to communicate effectively with your clients/teammates?

22. Have you taken appropriate decisions regarding delegation of work, allocation of resources (time, man power, and hardware and software

assets) and responsibilities?

23. Do you have the ability to foresee a problem and take appropriate team decisions to resolve it?

24. Have you been elected or appointed a to leadership position in a professional society?

25. Have you participated in/lead any competitive activities like team sports, quiz, debates, etc.?

26. Have you participated in/lead any community outreach activities as in cultural events, civic actions, health initiatives?

27. Do you have any suggestions for improving the BE program curriculum, courses, assessments, skills?

Signature of the alumnus with date

Programme Outcome Survey Form Dept of CSE, MSRIT, Bangalore

Name & USN of the student: Contact details:

Sl.

No. Questions

Responses

Strongly

agree Agree Neutral Disagree

Strongly

disagree

1. I have gained the necessary capability for applying mathematics and science to solve

engineering problems in my field

2. I feel confident of identifying and Formulating engineering problems in my field

3. I am able to innovative and design new engineering products and processes in future

4. I have developed the capability to understand and analyze the real life engineering problems

5. I am able to design and conduct engineering experiments on my own and satisfactorily

interpret the results

6. I am acquiring skills to handle modern machines and software to analyze engineering

problems

7. I am being well enlightened about my professional and ethical responsibilities

8. The programme has convinced me about the need for lifelong learning

9. The programme has been helping me to be a team player in various academic nonacademic

activities and take leadership role too.

10.

The programme is designed to see engineering problems in the backdrop of contemporary

issues helping me to be able to explain the impact of their engineering solution on those

issues

11. The programme has helped me to develop good communication skills to be able to easily

explain even complex engineering ideas/thoughts to my friends and teachers

12. In this programme, I have been able to appreciate the need for multidisciplinary approach to

solve modern engineering problems

13. I believe that, by the time I acquire engineering degree, I would be capable of qualifying in

national-level competitive exams in engineering (For. Eg. Indian Engineering Service).


Documents

3 and 4 Semester CSE Syllabus