III Semester Teaching Examination IA Theory (SEE ...4. Linear Algebra: Rank of a matrix by elementary transformations, solution of system of linear equations - Gauss-Elimination method,

III Semester

Course Code Course Title

Teaching Examination

L-T-P

(Hrs/Week) Credits

IA Theory (SEE) Practical (SEE)

Max.

Marks

*Max.

Marks

Duration

in hours

Max.

Marks

Duration

In hours

15UMAC300 Engineering

Mathematics –

III

4-0-0 4 50 100 3 - -

15UCSC300 Digital

Electronics 4-0-0 4

50 100 3 - -

15UCSC301 Discrete

Structures in

Computer

Science

4-0-0 4 50 100 3 - -

15UCSC302 Data Structures 4-0-0 4 50 100 3 - -

15UCSC303 Computer

Organization

4-0-0 4 50 100 3 - -

15UCSL304 Unix shell

programming 0-2-2 2

50 - - 50 3

15UCSL305 Digital

Electronics

laboratory

0-0-3 1.5

50 - - 50 3

15UCSL306 Data Structures

Laboratory

0-0-3 1.5 50 - - 50 3

Total 25 400 500 - 150 -

IA: Internal Assessment SEE: Semester End Examination

L: Lecture T: Tutorials P: Practical

*SEE for theory courses is conducted for 100 marks and reduced to 50 marks.

III Semester

15UMAC300 Engineering Mathematics-III (4 - 0 - 0) 4

Course Learning Objectives: This course is at undergraduate level for 52 contact hours / 4 credits

with the focus on following learning perspectives:

To represent a periodic function in terms of sines and cosine.

Concepts of a continuous and discrete integral transform in the form of Fourier and Z-

transforms.

Concepts of calculus of functions of complex variables.

Learn the concept of consistency, method of solution for linear system of equations

and Eigen value problems.

Understand the concepts of PDE and its applications to engineering.

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

POs 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level 2 2 - - - - - - - - - - - - - -

Course Contents:

1. Fourier series and Fourier Transform: Fourier series, Fourier series of Even and Odd

functions, exponential form of the Fourier series, half range Fourier series, practical

harmonic analysis. Infinite Fourier transform, Infinite Fourier sine and cosine transforms,

properties of Inverse transform, Convolution theorem, Parseval’s identity for Fourier

transform, Fourier Sine and Cosine transform.

14 Hrs

2. Z–Transform: Basic definitions of Z-transform, transform of standard forms, linearity

property, damping rule, shifting rule, initial and final value theorems, Inverse z-transforms

(Partial Fraction method), convolution theorem, applications of z-transforms to solve

difference equations.

6 Hrs

3. Complex variables: Functions of complex variables, Analytic function, Cauchy-

Riemann equations in Cartesian and polar coordinates, Consequences of Cauchy-Riemann 10 Hrs

CO # Description of Course Outcomes Substantial Moderate Low

CO 1 Express periodic function as a Fourier series. 1

CO 2 Describe Fourier transform and its properties. 1

CO 3 Define and describe Z transforms and properties and solve

difference equations using Z transform.

1

CO 4 Explore analytical functions and properties and describe

Bilinear transformations.

1

CO 5 Solve set of linear equations. Estimate rank, eigen value

and eigen vectors as applied to engineering problems.

1, 2

CO 6 Construct and solve partial differential equation resulting

from one dimensional heat equation and wave equation.

1,2

equations, Construction of analytic functions. Conformal Transformations: Standard

transformation2zw ,

zew , z

azw

2

(only theoretical discussions). Bi

linearTransformation.

4. Linear Algebra: Rank of a matrix by elementary transformations, solution of system of

linear equations - Gauss-Elimination method, Gauss-Seidel method and L-U decomposition

method. Eigen values and Eigen vectors. Rayleigh’s power method to find the largest Eigen

value and the corresponding Eigen vector. Application to Electric circuits, spring mass

system, parachutist problem.

12 Hrs

5. Partial Differential equations: Formulation of PDE by elimination of arbitrary

constants/functions, Solution of Lagrange’s equations. Solution of non-homogeneous PDE

by direct integration, solution of homogeneous PDE involving derivative with respect to

one independent variable only. Solution of First and Second orders PDE by method of

separation of variables. Derivation of one dimensional heat and wave equations, solutions

by variable separable method, as applied to engineering problems.

10 Hrs

Books:

1. Kreyszig E: Advanced Engineering Mathematics, 8th Edn, John Wiley & Sons, 2003.

2. B. S. Grewal: Higher Engineering Mathematics, 40th

Edition, Khanna Publishers, 2007.

3. Lathi B. P: Modern Digital and Analog Communication System, 2nd

Edition, pp. 29-63.

4. Chapra S C and Canale R P: Numerical methods for Engineers, 5th

Edition, Tata McGraw-Hill,

2007.

15UCSC300 Digital Electronics (4-0-0) 4

Course Learning Objectives:

This course is at undergraduate level for 52 contact hours / 4 credits with the focus on following

learning perspectives:

To introduce fundamental principles of digital electronics commonly used in Computer

Science Engineering.

To facilitate them to gain experience with the design of logic devices.

To provide the student with an understanding of basic digital electronics abstractions on

which analysis and design of electronic circuits/systems are based and the capability to model

and analyse complex circuits.

Course Outcomes: At the end of the course, the student should be able to:


CO 1

Identify different representations/forms of Boolean

expression and simplify for the implementation of a

cost effective/minimal gate network.

2 4 -

CO 2

Conceptualize the given problem and employ

suitable reduction technique to formulate solution for

the given real time application.

13 3 15

CO 3 Analyse and design a subsystem (ALU) to perform

different logical and arithmetic operations. 3 15 13

CO 4 Understand and apply basic storage elements to

design and implement various sequential circuits. 3 13 -

CO 5 Identify and investigate the different states of a

system to design a finite state machine. 13 3 15

CO 6 Simulate and employ a suitable circuit for given real

time application. 5 4 14

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level - 3 2.5 2 3 - - - - - - - 2.25 1 1.3 -

Prerequisites: Knowledge of Basic Electronics.

Course Contents:

1 Digital Principles, Digital Logic: Definitions for Digital Signals, Digital

Waveforms, Digital Logic, 7400 TTL Series, TTL Parameters The Basic Gates:

NOT, OR, AND, Universal Logic Gates: NOR, NAND, Positive and Negative

Logic.

4 Hrs

2 Combinational Logic Circuits: Sum-of-Products Method, Truth Table to

Karnaugh Map, Pairs Quads, and Octets, Karnaugh Simplifications, Don’t-care

Conditions, Product-of-sums Method, Product-of-sums simplifications,

Simplification by Quine-McClusky Method, Hazards.

7 Hrs

3 Data-Processing Circuits: Multiplexers, Demultiplexers, 1-of-16 Decoder,

Encoders, Exclusive-or Gates, Parity Generators and Checkers, Magnitude

Comparator, Programmable Array Logic, Programmable Logic Arrays.

7 Hrs

4 Clocks, Flip-Flops: Clock Waveforms, TTL Clock, Schmitt Trigger, Clocked D

FLIP-FLOP, Edge-triggered D FLIP-FLOP, Edge-triggered JK FLIP-FLOP, FLIP-

FLOP Timing, JK Master-slave FLIP-FLOP, Switch Contact Bounce Circuits,

Various Representation of FLIP-FLOPs, Analysis of Sequential Circuits.

7 Hrs

5 Registers: Types of Registers, Serial In - Serial Out, Serial In - Parallel out,

Parallel In - Serial Out, Parallel In - Parallel Out, Universal Shift Register,

Applications of Shift Registers.

6 Hrs

6 Counters: Asynchronous Counters, Decoding Gates, Synchronous Counters,

Changing the Counter Modulus, Decade Counters, Presettable Counters, Counter

Design as a Synthesis problem.

7 Hrs

7 Design of Synchronous and Asynchronous Sequential Circuits: Design of

Synchronous Sequential Circuit: Model Selection, State Transition Diagram, State

Synthesis Table, Design Equations and Circuit Diagram, Algorithmic State

Machine, State Reduction Technique.

Asynchronous Sequential Circuit: Analysis of Asynchronous Sequential Circuit,

Problems with Asynchronous Sequential Circuits, Design of Asynchronous

Sequential Circuit.

9 Hrs

8 D/A Conversion and A/D Conversion: Variable, Resistor Networks, Binary

Ladders, D/A Converters, D/A Accuracy and Resolution, A/D Converter-

Simultaneous Conversion, A/D Converter-Counter Method, Continuous A/D

Conversion, A/D Techniques, Dual-slope A/D Conversion, A/D Accuracy and

Resolution.

5 Hrs

Books:

1. Donald P Leach, Albert Paul Malvino and Goutam Saha: Digital Principles and Applications,

7th

Edition, Tata McGraw Hill, 2010.

2. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.

3. Charles H. Roth: Fundamentals of Logic Design, Jr., 5th Edition, Cengage Learning, 2004.

4. M Morris Mano: Digital Logic and Computer Design, 10th Edition, Pearson Education, 2008.

15UCSC301 Discrete Structures In Computer Science (4-0-0) 4



The basic terminologies of mathematical and logical reasoning, functions, and relations

associated with its properties and corresponding practical examples.

Learn various counting principle methods to solve complex problems in combinatorics.

Demonstration with examples, the basic terminologies of graphs and its types.

Identify the applications of mathematical structures in other fields of computer science such as

data structures and algorithms, databases, networks, operating systems etc.

Course outcomes (CO):

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


CO 1 Formulate problems in the language of sets and solve

them by performing appropriate set operations.

1 2 4

CO 2 Appraise the principle of mathematical inductions to

prove the given statement.

1 2 4, 15

CO 3 Verify the correctness of an argument using

propositional and predicate logic and truth tables,

using direct proof, proof by contraposition, proof by

contradiction, proof by cases

1 2 4, 15

CO 4 Demonstrate the ability to solve problems using

counting techniques and combinatorics.

1 2 4, 15

CO 5 Demonstrate the ability to identify types of functions

and relations.

1 2 4, 13

CO 6 Understand and realize the basic properties of graphs

and related discrete structures.

1 2 4, 13

CO 7 Understand the concepts and properties of algebraic

structures such as groups and coding theory

1 2 4, 15

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping Level 3 2 - 1 - - - - - - - - 1 - 1 -

Course Contents:

1. Set Theory: Sets and Subsets, Set Operations and the Laws of Set Theory,

Counting and Venn Diagrams, Countable and Uncountable Sets. 4 Hrs

2. Properties of the integers: The Well Ordering Principle – Mathematical

Induction, Recursive Definitions. 4 Hrs

3. Fundamentals of Logic: Basic Connectives and Truth Tables, Logic Equivalence

– The Laws of Logic, Logical Implication – Rules of Inference, The Use of

Quantifiers, Quantifiers, Definitions and the Proofs of Theorems

12 Hrs

4. Fundamental Counting: The Rules of Sum and Product, Permutations and

Combinations, The Binomial coefficients, The Pigeon-hole Principle, Inclusion-

Exclusion

6 Hrs

5. Relations and Functions: Cartesian Products and Relations, Functions – Plain

and One-to-One, Onto Functions , Special Functions, Function Composition and

Inverse Functions Properties of Relations, Computer Recognition – Zero-One

Matrices and Directed Graphs, Hasse Diagrams Equivalence Relations and

Partitions , Recurrence relations

14 Hrs

6. Graphs: Elements of graph theory, Types of graphs, Directed graphs,

Representation of graphs, Trees

6 Hrs

7. Groups: Definitions, Examples, and Elementary Properties, Homomorphisms,

Isomorphisms, and Cyclic Groups, Cosets and Lagrange’s Theorem. Coding

Theory and Rings: Elements of Coding Theory, The Hamming Metric, The Parity

Check, and Generator Matrices

6 Hrs

Books:

1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5th Edition, Pearson

Education. 2004.

2. Kenneth H. Rosen: Discrete Mathematics and its Applications, 6th Edition, McGraw Hill,

2007.

3. Kolman B & Busby R C, “Discrete and Mathematical Structures for Computer Science”,

5/E, Prentice Hall of India.

4. Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 2005, Reprint 2008.

15UCSC302 Data Structures (4-0-0) 4



Working of various basic data structures and their implementation.

Implementation issues of data structure in programming language.

Selection of the appropriate data structure for solving a given problem.

Course Outcomes: At the end of this course, the student should be able to:


CO 1

Apply various concepts of C like Arrays, Strings,

Structures, Unions, Files, Pointers and Functions in

solving problems.

1, 2, 13 3

CO 2

Understand and Implement the operational aspects of

linked lists (using pointers) like creation, insertion,

deletion and searching in problem solving.

1, 2, 3 12

CO 3 Realize and Implement the operational aspects of stack

in problem solving using Arrays and Pointers. 1, 2, 3 12

CO 4 Understand and Implement the operational aspects of

queue in problem solving using Arrays and Pointers. 1,2,3 12


trees in problem solving using Arrays and Pointers. 1, 2, 3 12


AVL trees in problem solving. 1, 2, 3 12

CO 7 Understand and Implement Hash concept in problem

solving. 1, 2, 3 12

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level 3 3 2.8 - - - - - - - - 2.14 - - - -

Pre-requisites: Knowledge of Problem Solving and Programming with C (PSPC)

Books:

1. Aaron M. Tenenbaum, YedidyahLangsam and Moshe J. Augenstein: Data Structures using C and

C ++, Pearson Education / PHI, 2006,

2. E. Balagurusamy: Programming in ANSI C, 4th

Edition, Tata McGraw-Hill

3. Behrouz A. Forouzan and Richard F. Gilberg: Computer Science: A Structured Programming

Approach Using C, 2nd

Edition, 2003, Cengage Learning.

4. Robert Kruse and Bruce Leung, ”Data structures and Program Design in C”, 2007, Pearson

Education

5. D. Samantha, “Classic Data Structures”, 2 /E, Eastern Economy, 2009, PHI.

15UCSC303 Computer Organization (4-0-0) 4



The relationship between instruction set architecture, micro architecture, and system

architecture and their roles in the development of the computer.

The concepts in the design of peripheral devices such as memory, I/O.

The functionalities of various units of a computer.

Course Outcomes: At the end of this course the student should be able to:


1. Structure, unions and Pointer Revisit: Motivation for using structures.

Pointer, access data from memory through pointer, pointer to structures.

Motivation for dynamic memory requirement. Realizing arrays using pointer

and dynamic memory allocation. Importance of memory management during

allocation and de-allocation of memory.

08 Hrs

2. Lists: Constructing dynamic data structures using self-referential structure

(using the same realized linked Lists), operations on lists. Doubly Linked list.

Application of Lists in sorting.

10 Hrs

3. Stack: Realization of stack and its operations using static and dynamic

structures. Application of stack in converting an expression from infix to

postfix and evaluating a postfix expression. Heterogeneous stack using

Unions.

10 Hrs

4. Queues: Realization of queues (FIFO, Double-ended queue, Priority queue)

and its operations using static and dynamic data structures. 8 Hrs

5. Trees: Types of trees and their properties, Realization of trees using static and

dynamic data structures. Operations on Binary trees and their application in

searching (BST and AVL Tree), Binary heap as priority queues.

12 Hrs

6. Hash Table: Realizing effective hash table with proper data stricture and

hash function, its application. 4 Hrs

CO 1 Explore the basic structure of computer architecture and

analyze the performance issues in computer system. 1, 2, 8

CO 2

Know the usage of machine instructions, addressing

methods, memory operations and data storage concepts

to design realistic programs for simple tasks.

3 8 1, 2, 4, 6

CO 3

Comprehend and Apply the concepts of interrupts, I/O

interface circuits and hardware/software needed to

support them for various peripherals

3,4 1 2

CO 4 Understand the memory structure and different ways of

enhancing the main memory bandwidth. 4, 8 1, 2, 3

CO 5

Demonstrate various data representation formats and

analyze the processor performance for arithmetic

operations.

4, 8 1, 2, 3

CO 6

Understand various functional units of a processor, their

interactions and handling of control signals generated by

program.

1, 2, 3, 4, 8

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level 1.83 1.66 2.16 2.16 - 2 - 2.4 - - - - - - - -

Prerequisites: Knowledge of:

1. Digital Electronics

2. Programming language

Course Contents:

1. Basic Structure of Computers: Computer Types, Functional Units, Basic

Operational Concepts, Bus Structures, Performance – Processor Clock, Basic

Performance Equation, Clock Rate, Performance Measurement, Historical

Perspective.

5 Hrs.

2. Machine Instructions and Programs: Numbers, Arithmetic Operations and

Characters, Memory Location and Addresses, Memory Operations, Instructions

and Instruction Sequencing, Addressing Modes, Assembly Language, Basic Input

and Output Operations, Stacks and Queues, Subroutines, Additional Instructions,

Encoding of Machine Instructions.

10 Hrs.

3. Input / Output Organization: Accessing I/O Devices, Interrupts – Interrupt

Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices,

Controlling Device Requests, Exceptions, Direct Memory Access, Buses

Interface Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, USB.

10 Hrs.

4. Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only

Memories, Speed, Size, and Cost, Cache Memories – Mapping Functions,

Replacement Algorithms, Performance Considerations Virtual Memories, And

Secondary Storage.

10 Hrs

5. Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast

Adders Multiplication of Positive Numbers, Signed Operand Multiplication, Fast

Multiplication, Integer Division, Floating point Numbers and Operations.

10 Hrs.

6. Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete

Instruction, Multiple Bus Organization, Hard wired Control, Micro programmed

Control.

7 Hrs.

Additional contents beyond the syllabi:

Simulation of different units of the computer using tools like VHDL.

Books:

1) Carl Hamacher, ZvonkoVranesic, SafwatZaky, “Computer Organization”, 5/E, TMH, 2002.

2) William Stallings, “ Computer Organization & Architecture”, 7/E, PHI, 2006

3) Vincent P. Heuring& Harry F. Jordan, “Computer Systems Design and Architecture”, 2/E,

Pearson education, 2004.

15UCSL304 Unix Shell Programming (0-2-2) 2


The objective of the course is to provide a comprehensive introduction to the UNIX operating system

and shell programming. At the end of the course students will have the fundamental skills required

operate and manage Unix system, manage files and directories, use Unix commands and manage

processes, use an editor and create simple shell scripts.



CO 1

Have hands on exposure over different

fundamental commands to infer some result

from any of the components of OS

2,3 1

CO 2

Design and develop shell scripting problems

by successfully designing, coding and

executing shell scripts.

1,2,3,14

CO 3

Develop scripts using the various scripting

languages to achieve administrative tasks or

configuration management

2,3,14

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level

1.4 2 1 2.5 3 - - - - - - 1 2 3 - 1.4

Prerequisites: Students must have knowledge in any programming language.

Course Contents:

1 Architecture and Basic Commands: Unix System Architecture, Salient features

of a UNIX System, Internal and External Commands, man Browsing and Manual

Pages On line cal The Calendar, date: Displaying and System Date, echo

Displaying a Message, printf: An Alternative to echo, bc: The Calculator,

script: Recording Your Session, passwd: Changing Your Password, who:Who

Are the Users?, uname: Knowing Your Machine’s Characteristics, tty: Knowing

Your Terminal, stty: Displaying and Setting Terminal Characteristics.

2 Hours

2 The File System And Some File Handling Commands: The File, What’s in a

(File)name? The Parent Child Relationship, The HOME Variable: The Home

Directory, pwd: Checking Your Current Directory, cd: Changing the Current

Directory, mkdir: Making Directories, rmdir: Removing Directories, Absolute

Pathnames, Relative Pathnames, ls: Listing Directory Contents, The UNIX File

System. cat: Displaying and Creating Files, cp: Copying a File, rm: Deleting Files,

mv: Renaming Files, more: Paging Output, The lp Subsystem: Printing a File,

file: Knowing the File Types, wc: Counting Lines, Words and Characters, cmp:

Comparing Two Files, comm: What is Common?, diff.

2 Hours

3 Editors and Communication in Unix: vi Basics, Input Mode Entering and

Replacing Text, Saving Text and Quitting – The ex Mode, Navigation, Editing

Text, Undoing Last Editing Instructions (u and U), Repeating the Last Command

(.), Searching for a Pattern (/ and ?), Substitution – Search and Replace (:s ).

2 Hours

4 Filters in Unix: Paginating Files, head: Displaying the Beginning of a File, tail:

Displaying the End of a File, cut: Slitting a File Vertically, paste: Pasting Files,

sort Ordering a File, uniq Locate Repeated and Non repeated Lines, tr Translating

Characters, An Example: Displaying a Word count List. grep Searching for a

Pattern, Basic Regular Expressions (BRE) – An Introduction, Extended Regular

Expressions (ERE) and egrep.

4 Hours

5 Shell Programming: Environment Variables, Aliases (bash ), Command History

(bash ). Shell Scripts, read and readonly commands, Using Command Line

Arguments, exit and Exit Status of Command, The Logical Operators && and ||

Conditional Execution, The if Conditional, Using test and [ ] to Evaluate

Expressions, The case Conditional, expr: Computation and String Handling, $0:

Calling a Script by Different names, while: Looping, for: Looping with a List, set

and shift: Manipulating the Positional Parameters.

10

Hours

6 Awk Scripting Language: awk program line and script structure, awk’s

operational mechanism, Records and fields, special variables $0, $1, $2, etc.,

patterns, The BEGIN and END, Variables, built in variables, built in functions,

length, split, getline, print, printf, sprintf, index, system, substr, etc., control

structures, operators in awk, associative arrays, writing simple awk scripts,

Running awk scripts from the shell.

4 Hours

Books:

1) Sumitabha Das UNIX Concepts and Applications, Third edition, Tata McGraw Hill, 2003

2) Behrouz A. Forouzan and Richard F.Gilberg Unix and Shell Programming A Text book,

Thomson, edition 2003.

3) GNU Make and CVS manual.

III / IV SEM (CSE) 2017-2018

11

III / IV SEM (CSE) 2017-2018

12

15UCSL305 Digital Electronics Laboratory (0-0-3) 1.5

Course Objectives:

After completion of the course the student should be able to analyse the function of (or design own)

and construct working versions of

Combinational circuit design and simplification techniques used for realizing them.

Sequential circuit design and working of a basic storage element.

Simple circuits using passive elements (resistors, capacitors, inductors).

Course Outcomes: At the end of this course the student should be able to


CO1 Design and implement independently

combinational circuit for real time scenarios. 1,13 2,3 12

CO2 Design and implement independently

sequential circuit for real time scenarios. 1,13 2,3 12

CO3 Design and implement any application circuit

to simulate real time problems. 1,2 15 16

PO→ 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16

Weighted

Average

3 2 2 - - - - - - - - 1 3 - 2 1

Pre-requisites: Basic Electronics

Contents:

1 Study and verify the truth table of various logic gates.

CO1

2 Realization of Boolean Functions:

i) Simplify the given Boolean expression and to realize it using Basic gates and

Universal gates.

ii) Realize the adder and subtractor circuits using basic gates and universal gates.

iii) Simplify given Boolean expression using Map Entered Variable(MEV) technique

and realize the simplified expression using 8:1 Multiplexers.

iv) To implement given Boolean function using decoders.

v) To design and realize the following code converters using basic gates.

vi) To realize Two Bit Comparator using basic gates

CO2

3 Flip-Flops ( Sequential Circuits):

i) To realize flip-flop conversions.

ii) Applications Flip-Flops:

a) To design and implement mod-n synchronous counter.

b) Design and implement a mod-n asynchronous counter.

c) To realize and study Shift Registers / Ring counter and Johnson counter.

CO3

III / IV SEM (CSE) 2017-2018

13

15UCSL306 Data Structures Laboratory (0-0-3) 1.5

Course Learning Objectives: This laboratory course is at the undergraduate level and it focuses on

the following:

Realization of fundamental data structures like stacks, queues, linked lists and trees.

Compare and contrast the benefits of dynamic and static data structure implementations.

Selection of the appropriate data structure for solving a given problem.



CO 1 Explore various concepts of C like Arrays, Strings,

Structures, Unions, and Files. 1,2,13 3

CO 2

Demonstrate the operational aspects of linked lists

(using pointers) like creation, insertion, deletion and

searching, and apply in problem solving.

1,2,3 12

CO 3 Realize the operational aspects of stack using Arrays

and Pointers. 1,2,3 12

CO 4 Exhibit the operational aspects of queue and apply it

in problem solving using Arrays and Pointers. 1,2,3 12

CO 5 Demonstrate the operational aspects of trees and

apply it in problem solving using Arrays and Pointers. 1,2,3 12

CO 6 Exhibit the operational aspects of AVL trees and

apply it in problem solving. 1,2,3 12

CO 7 Understand the need for Hash and apply it in problem

solving. 1,2,3 12

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping Level 3 3 2.8 - - - - - - - - 2.14 - - - -

Scheme for IV Semester

14

III / IV SEM (CSE) 2017-2018

Course Code Course Title

Teaching Examination

L-T-P

(Hrs/Week

)

Credi

ts

CIE Theory (SEE) Practical (SEE)

Max.

Marks

*Max.

Marks

Duration

in

hours

Max.

Marks

Duration

In hours

15UMAC400 Engineering

Mathematics –

IV

4-0-0 4 50 100 3 - -

15UCSC400 Microcontroller 4-0-0 4 50 100 3 - -

15UCSC401 Finite Automata

and Formal

Languages

4-0-0 4 50 100 3 - -

15UCSC402 Object Oriented

Programming

4-0-0 4 50 100 3 - -

15UCSC403 Analysis and

Design of

Algorithms

3-0-2 4 30+20 100 3 - -

15UCSC404 Operating

System

4-0-0 4 50 100 3 - -

15UCSL405 Object Oriented

Programming

Laboratory

0-0-3 1.5 50 - - 50 3

15UCSL406 Microcontroller

Laboratory

0-0-3 1.5 50 - - 50 3

Total 27 400 600 - 100 -

CIE: Continuous Internal Evaluation SEE: Semester End Examination

L: Lecture T: Tutorials P: Practical S: Self-study

*SEE for theory courses is conducted for 100 marks and reduced to 50 marks.

IV Semester

15

III / IV SEM (CSE) 2017-2018

15UMAC400 Engineering Mathematics-IV (4 - 0 - 0) 4

Course Leaning Objectives: This course is at undergraduate level for 52 contact hours / 4 credits


To solve algebraic and transcendental equations numerically.

Concepts of finite differences and its applications.

Concepts of PDE and its applications to engineering.

Fitting of a curve, correlation, regression for a statistical data.

Basic concepts of probability, random variables and probability distributions. Learn the

concepts of stochastic process and Markov chain.

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


CO 1 Apply numerical methods for ODE

related to engineering problems. 1

CO 2

Analysis the bivariate statistical data

and calculate correlation and

regression.

1,2

CO 3

Employ concepts of probability to solve

the problem related to engineering

field.

2

CO 4 Define analytical functions and discuss

properties and transformations. 1

CO 5

Derive and discuss the solution of

Bessel’s differential equation and its

properties.

1

CO 6 Define Markov chains and discuss the

stochastic process. 2

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level 1.5 1.6 - - - - - - - - - - - - - -

Course Contents:

1. Numerical Methods: Roots of equations: Bisection Method and Newton-

Raphson Method, Finite differences: Forward, Backward and central 10 Hrs

III / IV SEM (CSE) 2017-2018

16

differences. Newton Gregory forward and backward interpolation

formulae. Striling’s and Bessel’s interpolation formulae. Lagrange’s

interpolation formulae. Applications. Numerical integration: Simpson’s 1/3rd

rule and Weddle’s rule.

2. Numerical solution of O.D.E: Numerical solution of ordinary differential

equations of first order and first degree. Taylor’s series method, Euler’s method,

modified Euler’s method, Runge-Kutta method of fourth order. Milne’s

predictor and corrector methods (no derivations of formulae).

Numerical solution of simultaneous first order ordinary differential equations:

Runge-Kutta method of fourth- order.

10Hrs

3. Partial Differential equations: Formulation of PDE by elimination of arbitrary

constants/functions, Solution of Lagrange’s equations. Solution of non-

homogeneous PDE by direct integration, solution of homogeneous PDE

involving derivative with respect to one independent variable only. Solution of

First and Second order p.d.e by method of separation of variables. Derivation of

one dimensional heat and wave equations, solutions by variable separable

method.

10Hrs

4. Statistics and probability: Curve fitting by the method of least squares: y =

a+bx, y = a+bx+cx2, y = ab

x, y= ae

bx, y= ax

b. Correlation and regression.

Probability: addition rule, multiplication rule, conditional probability, Baye’s

rule. Discrete and continuous random variables-PDF-CDF- Binomial, Poisson,

exponential and Normal distribution. Joint probability distribution of two

random variables.

12 Hrs

5. Markov Chains: Markov chains– Introduction, probability vectors, Stochastic

Matrices, Fixed points and Regular stochastic matrices, Markov chains, higher

transition probabilities, stationary distribution of regular Markov chains and

absorbing states.

10 Hrs

Books:

1. Jain, Iyengar and Jain, “Numerical Methods for Engg. & Scientist”, PHI, 3/E, 2005.

2. Gupta S C and Kapoor V K, “Fundamentals of Mathematical Statistics”, 9/E, Sultan Chand &

Sons, New Delhi, 2002.

3. B. S. Grewal, “Higher Engineering Mathematics”, Khanna Publishers – 40/E–2007.

4. Kreyszig E., “Advanced Engineering Mathematics”, 8/E, John Wiley & sons, 2007.

11UCSC400 Microcontroller (4-0-0) 4

III / IV SEM (CSE) 2017-2018

17

Course Learning Objectives: This course is at undergraduate level for 52 contact hours / 4 credits with the focus on following learning perspectives:

Identify the differences between Microprocessor and Microcontroller, and concept of an embedded system.

Understand the internal architecture, instruction set of 8051 microcontroller, assembling process & implement small programs.

Design & develop Assembly Language Program /& C program for a given real time application.

Understand the use of interrupts & other advanced concepts related to 8051.

Demonstrate working knowledge of the necessary steps and methods used to interface a microcontroller system to devices such as motors, LCD, ADC, and DAC etc.

Course Outcomes: At the end of this course the student should be able to: CO1 Understand the basic structure of processor, its design &

functionalities of different units PO→ A,C

CO2 Demonstrate programming proficiency using the various addressing modes and 8051 instructions of the microcontroller.

PO→ A,C

CO3 Analyze the capabilities of the stack, the program counter, and the status register and demonstrate how these are used to execute a machine code program.

PO→C,D

CO4 Apply knowledge of the microcontroller’s internal registers and operations by use of a PC based microcontroller simulator.

PO→ A,B,C,D,E

CO5 Write Assembly Language Program & Embedded C programs for small real time applications.

PO→A,B,C,D,E

CO6 Develop program using the capabilities of the IO ports, the Timer/counter, and the interrupt and show how these are used to execute a machine code program

PO→A,B,C,D,E

CO7 Verify &validate an assembly language program /& C program, download the machine code that will provide solutions to real-world control problems such as fluid level control, temperature control, and batch processes.

PO→A,B,C,D,E,J


1. 11UCSC301: Analog and Digital Electronics 2. 11UCSC100/200: Problem Solving and Programming in C. 3. 11UCSC303: Computer Organization

Course Contents:

1. 8051 Microcontroller Architecture Introduction, 8051 Microcontroller hardware: The 8051 Oscillator and Clock, Program Counter and Data pointer, A & B CPU Registers, Flags and Program Status Word(PSW), Internal memory ,internal RAM, The Stack and the stack pointer, Special function registers, Internal ROM, Input/output pins, ports & circuits : Port 0, Port 1, Port 2, Port 3, External Memory : connecting external memory, Counter & Timer : Timer Counter interrupts, timing, timer mode of operation, counting, Serial Data input/output :Serial data

12 Hrs.

interrupts, data transmission, data reception, serial data transmission mode. Interrupts: Timer flag interrupt, serial port interrupt, external interrupts, reset, interrupt control, interrupt priority, interrupt destinations, software generated interrupts.

2. Addressing modes and Logical, Arithmetic operations Addressing modes: Immediate addressing more, register addressing mode, direct addressing mode, indirect addressing mode. External Data Moves, Code Memory Read-only Data moves, Push and Pop Opcodes, Data exchanges, Example programs. Logical Operations: Introduction, Byte-level logical operations, Bit-level logical operations: Internal RAM Bit Addresses, SFR Bit Addresses, Bit-level Boolean Operations, Rotate & SWAP operations, Example programs, Arithmetic operations: Introduction, Flags: Instructions Affecting Flags, Incrementing & Decrementing, Unsigned Addition.

9 Hrs.

3. Jump & Call instructions, Interrupts & Returns Introduction, The

jump & Call program Range : Relative Range, Short Absolute Range,

Long Absolute Range, Jumps : Bit Jumps, Byte jumps, Unconditional

Jumps, Calls and Subroutines : Subroutines, Calls and the Stack, Calls

and Returns, Interrupts and Returns, More Detail on Interrupts : the

Interrupt Enable (IE) Special Function Register, the Enable all

interrupts (EA) Bit, Individual Interrupt Enable Bits, The interrupt priority

(IP) Special Function Register, Interrupts and Interrupt Handler

Subroutines.

8 Hrs.

4. 8051 Programming in C Data types and time delay in 8051 C, I/O programming in 8051 C, Logic operations in 8051 C, Data conversion programs in 8051 C, Accessing code ROM space in 8051 C, Data serialization using 8051 C.

7 Hrs.

5. 8051 Timer programming Programming 8051 timers, Programming timers 0 and 1 in 8051 C.

5 Hrs.

6. Interrupts Programming 8051 interrupts, Programming timer interrupts, Programming external hardware interrupts, Programming the serial communication interrupt, interrupt priority in the 8051/52, Interrupt programming in C.

7 Hrs.

7. 8051 Interfacing & Applications Interfacing: LED, 7 segment display, LCD, DAC, ADC, Stepper & DC motor.

4 Hrs.

Additional contents beyond the syllabi: Designing a small micrcontroller based project. PO→ I,J Books: 1) Muhammad Ali Mazidi, Janice GillispieMazidi, Rolin D. McKinlay, “The 8051

Microcontroller and Embedded Systems using Assembly and C”, 2/E, Eastern Economy 2005.

2) Kenneth J. Ayala, “The 8051 Microcontroller Architecture, Programming & Application”, 3/E, 2004.

3) Dr.RamaniKalpathi and Ganesh Raja, “Microcontrollers and Applications”, 1/ Revised edition, Sanguine 2007.

4) MykePredko, “Programming and customizing the 8051 microcontroller”, 4 /E, Tata McGraw-Hill publishers, 2002.

15UCSC401 Finite Automata & Formal Languages (4-0-0) 4




To study abstract computing machines, Language representation techniques, regular

expressions, grammar constructions and associated theories and tools to realize formal

language.

Employ finite state machines to solve problems in computing.

Comprehend the hierarchy of problems arising in the computer sciences.

Understand the Turing theory and its significance.



CO 1 Understand the fundamentals concepts of automata

and formal languages. 1

CO 2 Construct grammars and automata for different

levels of formal languages. 1,2,13 5

CO 3 Analyse the merits and demerits of regular

languages and context free languages 1,2,13 5

CO 4 Understand the system tools like Lex and YACC 5 3 1

CO 5

Understand the concept of Turing machine and

relationship between Turing machine and modern

computer.

1,2 13

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level 2 3 2 - 2.33 - - - - - - - 1.66 - - -

Prerequisites: Knowledge of: Problem Solving and Programming in C

Course Contents:

1. Introduction to Finite Automata: Structural Representation. The central

concepts of Automata theory – Alphabet, Strings & Languages. Finite Automata:

Introduction, Deterministic Finite Automata (DFA), Non-Deterministic Finite

Automata (NFA), Equivalence of NFA and DFA, Applications of Finite automata,

FA with Epsilon ( €) transitions.

8 Hrs

2. Regular Expressions and languages: Regular Expressions, Finite Automata and 10 Hrs

Regular Expressions, Applications of Regular Expressions. Properties of Regular

Languages (RL): Proving Languages not to be Regular. Closure properties of

Regular Languages, Decision properties of Regular Languages, Equivalence and

Minimization of Automata.

3. Context-Free Grammars (CFG) and Languages (CFL): Context-Free

Grammars, Parse Trees, Applications of Context-Free Grammars, Ambiguity in

Grammars and Languages.

8 Hrs

4. System Applications & Tools:Lex and Yacc: The Simplest Lex Program,

Recognizing Words with Lex, Grammars, Running Lex and Yacc, Lex vs. Hand

Written Lexers Using Lex: Regular Expressions, A Word count program, parsing

a Command Line , A C Source Code Analyzer Using Yacc: Grammars, A Yacc

Parser, the Lexer, Arithmetic Expressions and Ambiguity Parser: The Role of the

Parser.

9 Hrs

5. Pushdown Automata (PDA): Definition of Pushdown Automata, The languages

of a PDA, Equivalence of PDA's and CFG'S, Deterministic Pushdown Automata.

Properties of Context Free Languages: Normal forms for Context Free Grammar,

Pumping lemma for Context Free Languages, Closure properties of Context Free

languages.

9 Hrs

6. Introduction to Turing Machines (TM): Problems that computer cannot solve,

Turing Machine, Programming Techniques for Turing Machine, Extensions to

Basic Turing Machine, Restricted Turing Machines, Turing Machines and

Computers.

8 Hrs

Books:

1) “Introduction to Automata Theory, Languages and Computation”, John E. Hopcroft, Rajeev

Motwani, Jeffrey D. Ullman, Pearson Education, 3/E, 2013.

2) “Compilers Principles, Techniques and Tools”, Alfred V Aho, Monica S. Lam, Ravi Sethi,

Jeffrey D. Ullman, Pearson Education, 2/E, 2008.

3) Lex and Yacc, “UNIX programming tools”, John R. Levine and Tony Mason and Doug Brown,

2/E, 1992.

4) “An Introduction to Formal Languages and Automata”, Peter Linz, Narosa Publishing House,

5/E, 2011.

5) “Introduction to languages and theory of computation”, John Martin, Tata McGraw-Hill, 4/E,

2010.

15UCSCS402 Object Oriented Programming (4-0-0) 4

Course Learning Objectives: This course is at undergraduate level for 52 contact hours, with focus

on following learning perspectives:

Object Oriented (OO) concepts/philosophy and its benefits and drawbacks in system

development.

Basic features of Java programming language to implement Object Oriented (OO) Key

concepts like ADT/Encapsulation, reusability (Inheritance/Composite Objects),

polymorphism etc., and other core basic features, a prerequisite to take course on advanced

features of Java Language.

Course Outcomes: At the end of the course student should be able to:

CO # Description of Course Outcomes Substantial Moderat

e Low

CO 1

Apply ADT, Class and Object concepts in

problem solving by understanding the

philosophy of Object Oriented Paradigm.

13 1

CO 2 Apply Inheritance and Composite object

concepts in problem solving. 2, 14 1, 16 3

CO 3

Use built in classes like String, Arrays,

vectors, Enumeration, Stack etc. in system

development.

2, 14 1 3

CO 4 Understand and apply abstract, interfaces

and packages in problem solving. 2, 14, 16 1 3

CO 5 Understand and apply exception handling in

construction of robust system. 2, 14 1 3

CO 6

Understand and use the multithreading

concept in problem solving and solve

conflicts due to interleaved execution of

threads.

2, 14 1 3

CO 7

Use streams concept in developing system

that needs facility for storage and retrieval of

data.

2, 14 1 3

CO 8

Develop GUI based system using applet,

frames, events and other support available in

AWT / Swings components.

2, 8, 14 1 3

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level

2 3 1 - - - - 3 - - - - 3 3 - 2.5

Prerequisites: Knowledge of any programming language

Contents:

1. Introduction to Object Oriented Paradigm (OOP): Object Oriented

Philosophy, Key Concepts of OOP, Encapsulation, Polymorphism,

Inheritance

10 Hrs

2. Basic Features of JAVA: Introduction to JAVA, Data Types, Variables

and Arrays, String Handling Operators, Control Structures, Classes,

Objects, Methods, Constructors, Overloading methods, A Closer look at

Methods and Classes, Inheritance, Packages and Interfaces

20 Hrs

3. Core Features of Java: Exception Handling, Multi Threaded

Programming, Streams, AWT and Swings, Applets, Events

22 Hrs

Beyond the syllabi:

Self-learning components on use of industry standard IDEs like Net Beans, Eclipse etc. as a platform for

programming in window and Linux operating system.

Books: 1) Herbert Schildt– “Java The Complete Reference” 7/E, Tata McGraw Hill, 2007.

2) Grady Booch – “Object-Oriented Analysis and Design with Applications”, 3 /E, Pearson

Education, 2007.




Analyze the asymptotic performance of algorithms.

Demonstrate a familiarity with major algorithms and data structures.

Apply important algorithmic design paradigms and methods of analysis.

Synthesize efficient algorithms in common engineering design situations.

Course Outcomes: At the end of this course, students should be able to:


CO 1 Understand the algorithm and list different problem

types 1

CO 2 Explain analysis frame work and discuss different

algorithm technique 2 1

CO 3

Solve recursive and non recursive problems and

apply brute force, divide and conquer, greedy,

dynamic programming, back tracking and branch

and bound to suitable problem

5 1

CO 4 Analyze and compare the time complexity of

different techniques w.r.t. problem statements. 4 13 1,3

CO 5

Synthesis brute force, divide and conquer, greedy,

dynamic programming, back tracking and branch

and bound for different problem domains

14 4 1,3

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mapping

Level 1.4 2 1 2.5 3 - - - - - - 1 2 3 - -


1. Discrete Mathematics

2. Data Structures

Course Contents:

15UCSC403 Analysis and Design of Algorithms (3-0-2) 4

1. Introduction: Algorithm, Fundamentals of problem solving, Problem types,

Principles of Algorithm Design. Analysis framework, Asymptotic notations,

Mathematical analysis of Non recursive algorithms, Recurrence relations;

Mathematical analysis of recursive analysis.

5 Hrs

2. Brute force strategy: Selection Sort, Bubble sort, string matching, concept of

exhaustive search. 5 Hrs

3. Divide and Conquer: Introduction and General method, Binary search,

Maximum and Minimum, Merge sort, Quick sort. Matrix multiplication using

stressen’s Matrix multiplication (with analysis for all applications), Heap sort,

String Matching, The median of a list of numbers.

8 Hrs

4. Basic Traversal and search techniques: Depth First search, Breadth First

Search, connected components, labeling of components, Path. 6 Hrs

5. Greedy Strategy: Introduction and General Method, Knapsack problem, Job

sequencing with dead lines, min cost spanning tree (Prim’s & Kruskal’s),

optimal storage on tapes, single source shortest path. Huffman Tree.

6 Hrs

6. Dynamic Programming: Introduction and General method, Computing a

binomial coefficient, Warshall’s algorithm, Floyd’s algorithm, knapsack

problem, multistage graphs, Traveling sales person (TSP) problem

5 Hrs

7. Back tracking and Branch and Bound: Introduction General Method for

both strategies Back Tracking: Sum of Sub sets, Knapsack problem, Traveling

Sales person (TSP).

2 Hrs

8. Limitations of Algorithm Power: Lower bound arguments, decision trees, P,

NP and NP Complete Problems.

2 Hrs

Books:

1. Anany Levitin, “Introduction to the Design and analysis of algorithms”, Pearson Education

2/E 2007

2. Horowitz, Sahani et.al “Fundamentals of Computer Algorithms”, Galgotia Publication, 2004.

3. Marks Allen Weiss, “Data Structure and Algorithm Analysis”, Pearson Education, 3 /E, 2009

4. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest,”Introduction to Algorithms”, 2/E,

PHI 2003.


This course on Operating Systems is for 52 hours which covers the classical internal algorithms and

structures of operating systems, including CPU scheduling, memory management, and device

management. Considers the unifying concept of the operating system as a collection of cooperating

sequential processes. Covers topics including file systems, virtual memory, disk request scheduling,

concurrent processes, deadlocks, security, and integrity.


CO # Description of Course Outcomes Substanti

al Moderate Low

15UCSL404 Operating System (4-0-0) 4

CO 1

Explain the basic operations of operating

systems in terms of interface, resource

allocator and the need for various system

calls.

13 2

CO 2

Write simple programs to create

threads/process, and communication among

them

14 3

CO 3 Estimate various process conflicts and resolve

them using standard tools/algorithms. 4, 14

CO 4

Compare the various memory allocation

strategies and performance issues for a given

context.

3, 13

CO 5

Classify different file systems and apply the

knowledge earned into various operating

systems.

13

PO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Mappin

g Level - 2 2 2 - - - - - - - - 2.5 1.5 - -

Course Contents:

1. Introduction to Operating Systems, System structures: What operating systems do;

Computer System organization; Computer System architecture; Operating System

structure; Operating System operations; Process management; Memory management;

Storage management; Protection and security; Distributed system; Special-purpose

systems; Computing environments. Operating System Services; User - Operating

System interface; System calls; Types of system calls; System programs; Operating

System design and implementation; Operating System structure; Virtual machines;

Operating System generation; System boot.

16 Hours

2. Process Management: Process concept; Process scheduling; Operations on processes;

Inter-process communication. Multi-Threaded Programming: Overview;

Multithreading models; Thread Libraries; Threading issues. Process Scheduling: Basic

concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling;

Thread scheduling.

7 Hours

3. Process Synchronization : Synchronization: The Critical section problem; Peterson’s

solution; Synchronization hardware; Semaphores; Classical problems of

synchronization; Monitors.

7 Hours

4. Deadlocks: Deadlocks: System model; Deadlock characterization; Methods for

handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection

and recovery from deadlock.

6 Hours

5. Memory Management: Memory Management Strategies: Background; Swapping;

Contiguous memory allocation; Paging; Structure of page table; Segmentation. Virtual

Memory Management: Background; Demand paging; Copy-on-write; Page

replacement; Allocation of frames; Thrashing.

7 Hours

6. File System, Implementation of File System: File System: File concept; Access

methods; Directory structure; File system mounting; File sharing; Protection.

Implementing File System: File system structure; File system implementation;

Directory implementation; Allocation methods; Free space management

7 Hours

7. Secondary Storage Structures, Protection : Mass storage structures; Disk structure;

Disk attachment; Disk scheduling; Disk management; Swap space management.

Protection: Goals of protection, Principles of protection, Domain of protection, Access

matrix, Implementation of access matrix, Access control, Revocation of access rights,

Capability-Based systems

6 Hours

Case Study: The Linux Operating System: Linux history; Design principles; Kernel

modules; Process management; Scheduling; Memory management; File systems, Input

and output; Inter-process communication.

6 Hours

Books:

1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Principles, 8th

edition, Wiley India, 2009. (Listed topics only from Chapters 1 to 12, 17, 21)

2. D.M Dhamdhere: Operating systems - A concept based Approach, 2 nd Edition, Tata McGraw-

Hill, 2002.

3. P.C.P. Bhatt: Introduction to Operating Systems: Concepts and Practice, 2nd Edition, PHI,

2008. 3. Harvey M Deital: Operating systems, 3rd Edition, Pearson Education, 1990.

Course Learning Objectives: This course is at undergraduate level for 2 credits with focus on

following learning perspectives:

Object Oriented (OO) concepts/philosophy and its benefits and drawbacks in system

development.

Basic features of Java programming language to implement Object Oriented (OO) Key

concepts like ADT/Encapsulation, reusability (Inheritance/Composite Objects),

polymorphism etc., and other core basic features, a prerequisite to take course on advanced

features of Java Language.

Course Outcomes: At the end of this course, the students will able to:


1

Apply ADT, Class and Object concepts in

problem solving by understanding the

philosophy of Object Oriented Paradigm

13 1

2 Apply Inheritance and Composite object

concepts in problem solving 2, 14 1, 16 3

3

Use built-in classes like String, Arrays,

Vectors, Enumeration, Stack, Streams etc. in

system development.

2, 14 1 3

4 Understand and apply abstract, interfaces and

packages in problem solving. 2, 14, 16 1 3

5 Understand and apply exception handling in

construction of robust system. 2, 14 1 3

6

Understand and use the multi-threading

concept in problem solving and solve conflicts

due to interleaved execution.

2, 14 1 3

8

Develop GUI based system using applet,

frames, events and other support available in

AWT / Swings components.

2, 8, 13, 14 1 3

15UCSL405 Object Oriented Programming Laboratory (0-0-3) 1.5

PO→ 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 16

Mapping

Level

2 3 1 - - - - 3 - - - - 3 3 - 2.5

Prerquisites: Knowledge of: Registration/Completion of the course

Object Oriented Programming.

Suggested Platforms:

Notepad (Non IDE), IDE (JCreator, Net Beans, Eclipse etc) in Windows OS and Linux OS

All programs should:

1. Be written to realize the Object Oriented Philosophy and core Java features.

2. Be written with Java Naming & Coding conventions and well documented.

3. Handle exceptions.

4. Be tested for all possible scenarios.

Course Contents:

Minimum one exercise to cover each course outcome specified above. Maximum 10 experiments to

be completed by each student independently. Course teacher to publish list of experiments along with

individual outcome for every experiments, on the first day of the semester. Examiner may set any

problem based on the published term work during tests.

Books:

1) Herbert Schildt, “Java The Complete Reference” 7/E, Tata McGraw Hill, 2007.

2) Kathy Sierra & Bert Bates, “Head First Java” 2/E, O’Reilly.

3) Patrick Niemeyer & Daniel Leuck – “Learning Java” 4 /E, O’Reilly.

4) Laura Lemay & Charles L. Perkins, “Teach Yourself Java in 21 Days”, Sams Publishing.

11UCSL405 Microcontroller Laboratory (0-0-4) 2


Understand the use of memory and its context checking, familiarity with assemblers, use of

DOS functions.

Handle macros, procedure, arrays, and instructions of 8051 programming and assembler

directives.

Handle exceptional cases and providing reliable solutions.

Test and verify programs for different scenarios.

Know basic interfacing techniques using 8255.


CO1 Write assembly level codes for a given microcontroller architecture

specific problem. PO→A,B,C,D

CO2 Write interrupt handles pgms. PO→C,D

CO3 Interfacing with real world devices such as LCD’s Keyboards, DAC,

ADC, Relays Motors etc. PO→D,E

CO4 Learn any other assembly language. PO→H

Course Contents:

I) Programming:

1) Data Transfer- Block move, exchange, sorting, finding largest/smallest

element in an array.

2) Arithmetic instructions: Addition/subtraction, ultiplication/division, square, cube.

3) Counters-johnsons, ring, updown

4) Boolean and logical instruction-(bit manipulations)

5) Code conversation-BCD to ascii, ascii to decimal, hex to decimal, decimal to hex

6) Programs using serial port and onchip timer/counter.

II) Interfacing:

1) Write a C programs to interface 8051 chip to interfacing modules:

a) Write a C program to switching ON and OFF individual LEDs, with

software delay. (Use the eight independent LEDS).

b) Write a program to blink individual led’s and make the blinking led to

move left to right and right to left continuously, with software delay.

2) Write a C program to

a) Up count BCD from 0 to N and display on 2 digit display, with software delay.

b) Down count from N to 0 and display on 2 digit display, with software delay.

c) 0 to N and N to 0 repeat the process with software delay. Where N is taken

from PORT1through DIP switch

3) Write a C program to

a) Display all odd numbers between 0 to N continuously, with software delay.

b) Display all even numbers between 0 to N continuously, with software delay.

Where N is taken from PORT1 through DIP switches and output on 2 digit

display.

4) a) Write a C program to clear and display "SDMCET", "CSE" and "DEPT"

on the LCD.

b) Write a C program to recognize the keyboard and display the key value

on 1) 7-segment display. 2) LCD

5) Write a C program to rotate the Stepper motor

1) Clockwise. 2) Anticlockwise.

6) Write a C program to rotate the DC motor

1) Clockwise. 2) Anticlockwise.

7) Write a c program to detect the key pressed form hexkeypad n display the

number on a) lcd b) 7-seg

8) Elevator interface

Documents

III Semester Teaching Examination IA Theory (SEE ...4. Linear Algebra: Rank of a matrix by elementary transformations, solution of system of linear equations - Gauss-Elimination method,