7/31/2019 Scheme 2009 - 13

1/32

1 of 32

PES INSTITUTE OF TECHNOLOGY100 Feet Ring Road, BSK III Stage

Bangalore 560085

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Syllabus

of

1st 4th Semester

for

Scheme 2009 2013

7/31/2019 Scheme 2009 - 13

2/32

2 of 32

Scheme for B.E. I & II Semesters

Common to all Branches

Course No

CourseCode

Course Title L* T* P* Credits Category

1MA101

MA151

Mathematics I

Mathematics II

4

4

-

-

-

-

4

4BS

2

PH101/

CY101

Physics Theory & Laboratory /

Chemistry Theory & Laboratory4 - 2 5 BS

3

HS103/

ME101

Principles of Economics /

Engineering Mechanics.

4 - - 4MBA/HS

ME

4

ME104/

CS101

Mechanical Engineering Sciences- Theory &Laboratory

Concepts of Computer ProgrammingTheory &Laboratory

4 - 2 5ME

CS/IS

5EE101 /

EC101

Basic Electrical Engg Theory & Laboratory /

Basic Electronics Engg. Theory & Laboratory4 - 2 5

EE /

EC

6*

HS101

/HS102

Constitution of India & Professional Ethics /

Environmental Studies.- 2 - 2 HS

7* HS104 Kannada (for non kannadigas) - 1 - 0 HS

Total 20 3 6 25

L* : Lecture;

7/31/2019 Scheme 2009 - 13

3/32

3 of 32

T* : Tutorial;P* : Practical6* : Self learning Courses7* : Mandatory Learning Course

7/31/2019 Scheme 2009 - 13

4/32

4 of 32

Scheme for B.E. III & IV Semesters

B.E 3rd

SEMESTER COMPUTER SCIENCE AND ENGINEERING

SubjectCode

Title of the Course

Remarks

Lecture Tutorial Laboratory Credits

MA 201 Linear Algebra 4 0 0 4

CS 201Discrete Mathematics &Combinatorics

3 0 0 3

CS 202Digital Design

(Theory & Laboratory)3 1 2 5

CS 203Data Structures

(Theory & Laboratory)3 1 2 5

CS 204OOP with C++**

(Theory & Laboratory)3 0 2 4

CS 205Computer Architecture andOrganization 4 0 0 4

Total 20 02 06 25

** Exempted for Lateral Entry Students

B.E 4th

SEMESTER COMPUTER SCIENCE & ENGINEERING (2009-2013 Scheme)

SubjectCode Title of the Course

Remarks

Lecture

Tutorial Laboratory Credits

MA 251 Methods of Applied Mathematics 4 0 0 4

CS 251Analysis and Design of Algorithms

(Theory & Laboratory)3 1 2 5

CS 252 Object oriented Programming using 3 0 2 4

7/31/2019 Scheme 2009 - 13

5/32

5 of 32

Java

(Theory & Laboratory)**

CS 253 System Software 3 1 0 4

CS 254Microcontrollers

(Theory & Laboratory)3 1 2 5

CS 255

Finite Automata and Formal

Languages 3 0 0 3

Total 19 03 06 25

**Exempted for Lateral Entry Students.

7/31/2019 Scheme 2009 - 13

6/32

6 of 32

CS 101: CONCEPTS OF

COMPUTERPROGRAMMING (4-0-2)

PART A - THEORY

Objective:The objective of this course is to introduce the basic concepts of computing, problem solving and programming using Clanguage as a tool. The course encompasses the aspects of structured program development, control structures, functions,arrays, pointers, text processing and formatting, and files.

UNIT 1Introduction to Computers : Computer Systems, Computing Environments, Computer Languages, Creating and RunningPrograms, System Development.Introduction to C Language : Background, C Programs, Identifiers, Types, Variables, Constants, Input / Output,Programming Examples.Structure of a C program : Expressions, Precedence and Associativity, Side Effects, Evaluating Expressions, TypeConversion, Statements.

UNIT 2Selection Making decisions: Logical data and Operators, Two-Way Selection, Multi-way Selection, More StandardFunctions.Repetitions : Concept of a loop, Pretest and Post-test Loops, Initialization and updating, Event-and Counter-ControlledLoops, Loops in C, Loop Examples, Recursion.

UNIT 3Functions : Designing structured programs, Functions in C, user-Defined functions, Inter-Function Communication,Standard Functions, Scope.Arrays : Concepts, Using Arrays in C, Inter-Function Communication, Sorting, Searching, Two-Dimensional Array,Multidimensional Arrays.

UNIT 4Pointers : Introduction, Pointers for Inter-Function Communication, Arrays and pointers, Pointer Arithmetic and Arrays,passing an Array to a Function, Memory Allocation Functions, Array of Pointers.Strings: String Concepts, C Strings, String input / Output Functions, Arrays of Strings, String Manipulation Functions,

String / Data Conversion.Enumerated, Structure and Union types: The Type Definition (typedef), Enumerated Types, Structure, Unions.

UNIT 5 :Text Input / Output : Files, Streams, Standard Library Input / Output functions, Formatting Input / Output functions,character Input / Output functions

Binary Input / Output : Text versus binary Streams, Standard Library Functions for Files, Converting File Type.Bitwise Operators : Exact Size Integer types, Logical Bitwise Operators, Shift Operators, Masks

7/31/2019 Scheme 2009 - 13

7/32

7 of 32

REFERENCE: Computer Science A Structured Programming Approach using C , Behrouz A Forouzan & Richard F Gilberg , ThirdEdition Thomson Course Technology ( First Indian Reprint 2007 )

Unit 1 : 1.1 to 1.5, 2.1 to 2.8, 3.1 to 3.6Unit 2 : 5.1 to 5.4, 6.1 to 6.9

Unit 3 : 4.1 to 4.6, 8.1 to 8.8, 9.1, 9.2, 10.1 to 10.5Unit 4 : 9.1, 9.2, 10.1 to 10.5, 11.1 to 11.6, 12.1 to 12.4Unit 5 : 7.1 to 7.5, 13.1 to 13.3, 14.1 to 14.4

CS 101: CONCEPTS OFCOMPUTER

PROGRAMMING (3-1-1)

PART B LABORATORY

1a. Write C Program to find the Roots of a Quadratic equation

1b. Write C Program to find factorial of a number using recursion and without using recursion.

2a. Write C Program to find the Sum of the individual digits of a given long integer.

2b. Write C Program to find the sum of first N Natural Numbers.

3a. Write C Program to compute trace and Norm of a Matrix.

3b. Write C Program to find Saddle Point in a Matrix.

4a. Write C Program to multiply two Matrices.

4b. Write C Program to find whether given Matrix is Symmetric or not.

5a. Write C Program to sort the given elements of an array using Bubble sort and selection sort.

5b. Write C Program to search for an element using binary and linear search.

6a. Write a C program to f ind the number of vowels and consonants in a given string.

6b. Write a C program to check whether the string is palindrome

7a. Write a C program to swap the contents of two variables A and B using call by value and call byreference.

7b. Write a C program using pointers to find the largest substring in the given string.

8a. Write a C program to implement a typical employee record using pointers to structures

8b. Write a C program to define a structure with data members register number, student name and totalmarks obtained. Create a menu to implement entry, deletion and updation of the student record.

9a. Write a C program that defines a macro with one argument to compute the volume of a sphere.The program should compute the volume for spheres for a given radius and print the results intabular format.

7/31/2019 Scheme 2009 - 13

8/32

8 of 32

9b. Write a C program to copy the contents of one file to another file. The Program should check for allvalidations.

10a. Write a C program that sorts a set of integers in to ascending or descending order. The programshould use command line arguments to pass either argument a for ascending order ord fordescending order.

10b. Write a C program to create your own print and simulate the same function using ellipse signature

MA 201: LINEARALGEBRA (4-0-0)

OBJECTIVE:Linear Algebra deals with the analysis of systems of linear equations with the aid of matrices, vector spaces, lineartransformations and so on. The course is discussed with algebraic as well as geometric perspectives.Fourier series, an important mathematical tool used often in different fields of engineering and science, is also introduced.

UNIT IMatrices and Gaussian Elimination: Introduction to 3-D geometry, geometry of system of linear equations , GaussianElimination, Matrix notation and multiplication, Triangular factorization, Inverses and transposes.

UNIT II

Vector spaces & Linear Equations: Vector spaces, subspaces, linear independence, basis and dimension, fundamentalsubspaces, linear transformations.

UNIT III

Orthogonality: Orthogonal subspaces, inner products, projections and least squares approximations. Gram- SchmidtOrthogonalization.

UNIT IVEigen Values and Eigen Vectors: Eigen values and eigen vectors, Cayley-Hamilton theorem, Power method of finding thedominant eigenvalue and the corresponding eigen vector, Diagonalization.

UNIT V

Fourier Series: Periodic and orthogonal functions. General orthonormal expansions. Even and odd functions. Dirichletsconditions. Fourier Series expansions, harmonics. Half-range SeriesText book:

T1: G. Strang, Linear Algebra and its applications, 4th edition, Thomson Brooks/Cole, 2nd Indian reprint2007.

7/31/2019 Scheme 2009 - 13

9/32

9 of 32

T2: B S Grewal, Higher Engineering Mathematics 39 t Edition, Khanna Publishers, 2005.

UNIT# Sections

UNIT I T1: 1.1 1.6, T2: 2.5 2.8

UNIT II T1: 2.1, 2.3 ,2.4, 2.6, T2: 2.9 2.11

UNIT III T1: 3.1-3.4

UNIT IV T1: 5.1,5.2, T2: 2.15, 2.17, 2.20

UNIT V T2: 10.1, 10.2, 10.6, 10.7

CS 201: DISCRETEMATHEMATICS AND

COMBINATORICS (3-0-0)

PART A THEORY

OBJECTIVE:

Discrete mathematics concepts and notations are useful in studying and describing objects and problems in computeralgorithms and programming languages and have applications in cryptography, automated theorem proving and softwaredevelopment. The objective of combinatorial mathematics is to demonstrate an understanding of the theory underlyingexact approaches to combinatorial optimization problems, prove and interpret standard results in graph theory and develop,implement, and critically evaluate the correctness and performance of standard graph algorithms and recurrence relationsof different orders..

UNIT

IINTRODUCTION TO GRAPH THEORY: Definitions and Examples, Subgraphs, Complements and Graph Isomorphism,Vertex degree: Euler Trails and Circuits, Planar Graphs, Hamilton Paths and Cycles, Graph Coloring and ChromaticPolynomials

UNIT II

FUNDAMENTAL PRINCIPLES OF COUNTING, PROBABILITY AND MATHEMATICAL LOGIC: The Rules Of Sum AndProduct, Permutations, Combinations: The Binomial Theorem, Combinations with Repetition, a First Word on Probability,The Axioms of Probability, Conditional Probability: Independence, Mathematical Logic: Rules of Inference, MathematicalLogic: Use of Quantifiers

UNIT IIIFUNCTIONS, PRINCIPLES OF INCLUSION AND EXCLUSION: Cartesian Products And Relations, Functions: Plain AndOne-To-One, Onto Functions: Sterling Numbers Of The Second Kind, Special Functions, The Pigeonhole Principle,Function Composition And Inverse Functions, The Principle Of Inclusion Exclusion, The Generalizations Of The Principles,Derangements Nothing Is In Its Right Place, Rook Polynomials, Arrangements With Forbidden Positions

UNIT IV

7/31/2019 Scheme 2009 - 13

10/32

10 of 32

GENERATING FUNCTIONS: Introductory Examples, Definition & Examples: Calculational Techniques, Partitions OfIntegers, The Exponential Generating Functions, The Summation Operator.

UNIT V

RECURRENCE RELATIONS: The First - Order Linear Recurrence Relation, The Second - Order Linear HomogeneousRecurrence Relations With Constant Coefficients, The Non-Homogeneous Recurrence Relations, The Method Of

Generating Functions

Text book:T1. Discrete and Combinatorial Mathematics by Ralph P Grimaldi, B.V Ramana, 5th Edition-PearsonEducation- 2007

UNIT# Sections

UNIT I 11.1, 11.2, 11.3, 11.4, 11.5, 11.6

UNIT II 1.1, 1.2, 1.3, 1.4, 2.3, 2.4, 3.4, 3.5, 3.6

UNIT III 5.1, 5.2, 5.3, 5.4, 5.5, 5.6, 8.1, 8.2, 8.3, 8.4, 8.5

UNIT

IV 9.1, 9.2, 9.3, 9.4, 9.5UNIT V 10.1, 10.2, 10.3, 10.4

CS 202: DIGITALDESIGN THEORY &

LABORATORY (3-1-2)

PART A THEORY

OBJECTIVE:

Digital systems have become a part of everyday life. The objective is to provide a thorough understanding of thefundamental principles of digital design. Students are introduced to the discipline of system design and will be able todesign basic combinatorial and sequential components.

UNIT I

Binary Numbers and Boolean Algebra: Signed Binary Numbers, Binary codes, Boolean functions, Canonical andStandard forms

Gate-Level Minimization: Introduction, The Map method, Four-Variable Map, Product-of-Sums Simplification, Dont-CareConditions, NAND and NOR implementation, Other Two-Level implementations, Exclusive-OR Function.

UNIT II

Combinational Logic: Introduction, Combinational circuits, Analysis Procedure, Design Procedure, Binary Adder-Subtractor, Decimal Adder, Binary multiplier, Magnitude comparator, Decoders, Encoders, Multiplexers.

UNIT III

7/31/2019 Scheme 2009 - 13

11/32

11 of 32

Synchronous Sequential Logic: Introduction, Sequential circuits, Storage elements: Latches, Flip-Flops, Analysis ofClocked sequential circuits, State reduction and assignment, Design Procedure.

Registers and Counters: Registers, Shift Registers, Ripple counters, Synchronous Counters, Other Counters.

UNIT IV

Design at the Register Transfer Level: Introduction, RTL Notation, RTL in HDL, ASMs, Design example, Sequential

Binary Multiplier, Control Logic, Design with Multiplexers, Race-Free design, Latch-Free design.

UNIT V

Asynchronous Sequential Logic: Introduction, Analysis Procedure, Circuits with latches, Design procedure, Reduction ofState and Flow Tables, Race-Free state assignment, Hazards, Design examples.

Text book:

T1. Digital Design, M. Morris Mano & Michael D. Ciletti , Fourth Edition, PHI 2007UNIT# Sections

UNIT I 1- 1.6, 1.7, 2.5, 2.6, 3.1-3.3, 3.5-3.9

UNIT II 2- 4.1-4.11UNIT III 5.1-5.5, 5.7, 5.8, 6.1-6.5

UNIT IV 8.1-8.5, 8.7, 8.8, 8.10-8.12

UNIT V 9.1-9.8

CS 202: DIGITALDESIGN THEORY &

LABORATORY (3-1-2)PART B

LABORATORY

Programming Language: Verilog

Software Tool : ISE Xilinx , ModelSim

Program #1

Implementation of all basic gates.

Program #2Implementation of Half adder & Full Adder

Program #3

Implementation of 1:4 and 4:1 Multiplexer

Program #4

Implementation of encoder (with and without priority) and Decoder

7/31/2019 Scheme 2009 - 13

12/32

12 of 32

Program #5

Implementation of BCD Adder

Program #6

Implementation of 4-bit Magnitude Comparator

Program #7

Implementation of Flip flops [JK, D and T].Program #8

Implementation of counters [Ripple, up down].

Program #9

Implementation of counters [Ring, Johnson].

Program #10

Implementation of 4- bit serial adder

Program #11

Implementation of universal shift register.

Program #12Implementation of Sequential Binary Multiplier.

Suggested Reading

Verilog HDL-A guide to Digital Design & Synthesis bySamir Palnitkar, 2nd

Edition, Pearson Education , Year 200x

CS 203: DATA

STRUCTURESTHEORY &LABORATORY (3-1-2)

PART A THEORY

OBJECTIVE:

In the course on data structures which has theory and laboratory components, students understand the importance ofvarious data structures such as lists, stacks and queues, binary, AVL and other trees and learn how to implement them inprograms. They also learn how to implement various sorting and searching algorithms and advanced structures such aspriority queues. The emphasis of the course is learn by example.

UNIT I

Introduction: Algorithm Analysis , Mathematical Back ground, Model, Running Time Calculation, Lists, Stacks andQueues Abstract Data Types

UNIT II

Trees : Binary Trees, Search Tree, AVL Trees, Splay Trees, Tree Traversals, B-Trees

7/31/2019 Scheme 2009 - 13

13/32

13 of 32

Hashing: Hash Function, Separate Chaining, Open Addressing, Rehashing, Extendible Hashing

UNIT III

Priority Queues : Simple Implementations, Binary Heap, Applications of Priority Queues, d-Heaps, Leftist Heaps, SkewHeaps, Binomial Queues

Sorting : Insertion Sort, Shell Sort, Heap Sort, Merge Sort, Quick Sort, Sorting Large structures, Lower bound for sorting,

Bucket Sort, External Sorting

UNIT IV

The Disjoint Set: Equivalence Relations, Dynamic Equivalence problem, Basic Data Structure, Smart Union algorithm,Path Compression, Worst case Union by rank, An Application

Graph Algorithms: Definitions, Topological Sort, Shortest Path Algorithms, Network Flow algorithms, Minimum spanningTree

UNIT V

Amortized Analysis: Unrelated Puzzle, Binomial Queues, Skew Heaps, Fibonacci Heaps, Splay Trees

Advanced Data structures: Implementation Top Down Splay Trees, Red Black Trees, Deterministic Skip Lists, AA-Trees, Treaps, k-d Tress, Pairing Heaps

Text book:

T1. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2nd Edition, Pearson Education, 1996.

UNIT# Sections

UNIT I Ch-1, Ch-2,Ch-3 (pp17-pp101)

UNIT II Ch-4, Ch-5 (pp105 - pp191)

UNIT III Ch-6, Ch-7 (pp-193-pp277)

UNIT

IV Ch-8, Ch-9 ( pp279-pp347, pp353-pp359)UNIT V Ch-11, Ch-12 (pp443- pp511)

Suggested Reading:

1. Data Structures - A pseudo code approach with C, Richard F. Gilberg and Behrouz A Forouzan, 2nd Edition,Thompson India Edition

2. Data Structures and Algortihms, Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, Pearson Education

7/31/2019 Scheme 2009 - 13

14/32

14 of 32

CS 203: DATASTRUCTURES

THEORY &LABORATORY (3-1-2)

PART B THEORY

Program #1a. Program to construct a stack and perform the following operations on it:

i. Pushii. Popiii. Display

b. Program to evaluate a valid postfix arithmetic expression using stack.

Program #2Program to convert parenthesized infix arithmetic expression to postfix arithmetic expression.

Program #3Program to simulate the working of a circular queue of integers using an array. Provide the following operations:

i. Insertii. Deleteiii. Display

Program #4Program to simulate the working of a priority queue of integers using Linked list. Provide the following operations:

i. Insertii. Deleteiii. Display

Program #5Program to simulate the working of a Double ended queue of integers using an array. Provide the following operations:

i. Insert at the front endii. Insert at the rear endiii. Delete at the front end

iv. Delete at the rear endv. Display

Program #6Program to evaluate polynomial using singly linked list.

7/31/2019 Scheme 2009 - 13

15/32

15 of 32

Program #7Program for addition of long positive integers using Ci rcular linked list.

Program #8Program to support the following operations on a doubly linked list:

i. Insert node at the front.

ii. Insert node at the specified positioniii. Delete the node at the specified positioniv. Display

Program #9Program:

i. To construct a binary search tree of integers.ii. To traverse the tree using inorder, preorder and postorder.iii. To display the elements in the tree.

Program #10

Program to sort the given numbers in ascending order by Heap Sort technique.

Program #11Program to implement the Josephus problem using Circular linked list.

Program #12Program to implement the Huffman algorithm using tree data structure.

CS 204: OBJECTORIENTED

PROGRAMMINGUSING C++ (3-0-2)

PART A THEORY

OBJECTIVE:The objective of the course is to enable students to understand and identify the fundamental concepts of Object Oriented

Programming and acquaint them with terms like classes, inheritance, overloading, polymorphism etc. Students will also beable to develop programs using the object oriented paradigm.

UNIT IIntroduction: Learning C++, Design of C++, Use of C++, C and C++, Programming in C++.A Tour of C++: What is C++, Object Oriented Programming, Comments and Indentation.A Tour of the Standard Library: Introduction, Hello World, The Standard Library Namespace, Output, Strings, Input.Types and Declarations: Boolean, Character types, Integer Types, Floating point types, sizes, void, and enumerations,

7/31/2019 Scheme 2009 - 13

16/32

7/31/2019 Scheme 2009 - 13

17/32

17 of 32

Text Book:

T1. The C++ Programming Language Bjarne Stroustrup, Third Edition, Pearson Education

UNIT# Sections

UNIT

I CHAP 1 - Page# 6-8, 12-16, CHAP 2 Page# 21, 37-39, CHAP 3 Page# 45-51, CHAP 4 Page# 69-82,CHAP 5

Page# 87,88, 94-101, CHAP 7 Page# 143-154, 160-162

UNIT II CHAP 5 - Page# 87-88, 127-130, CHAP 10 Page# 223-232, 234-236, 242-248

UNIT III CHAP 11 - Page# 261-272, 275-278, 283-287

UNIT IV CHAP 12 - Page# 301-314, CHAP 15 Page# 389-399, CHAP 21 Page# 605-612, 613-618, 621, 625-629, 637-

640, 642-644

UNIT V CHAP 11 Page# 278-282, Appendix C Page# 852-853, CHAP 13 Page# 327-338, 341-345, CHAP 14 Page#

355-364, 369-378, 380-381

CS 204: OBJECTORIENTED

PROGRAMMINGUSING C++ (3-0-2)

PART B

LABORATORY

Program #1

Create a class Vehicle having non-static data member registration number and a static data member count. Non staticmember functions setregno() and getregno() are used to get & set the registration number. A static member functiongetVehiclecount() is used to return the number of vehicles in the garage. Use constructor to increment the vehicle countwhen a vehicle is created and the destructor to decrement the count when the vehicle is destroyed.

Program #2

Design a class Polar which describes a point in the plane using polar coordinates radius and angle. Overload + and toadd and subtract two Polar objects.

Note: Use the following trigonometric functions to covert polar points into rectangular coordinates. Then add and

subtract the rectangular co-ordinates and convert the result into polar co-ordinates.

x= r*cos(a); y=r*sin(a); a=atan(x/y); r=sqrt(x*x*+y*y);

Program #3

Create a class called Numbers consisting of a set of integers and doubles. Use appropriate functions to accept data andprint the sum of integers and doubles. Overload the sum() to illustrate function polymorphism

7/31/2019 Scheme 2009 - 13

18/32

18 of 32

Program #4

Create a class called Inventory having data members name, code and price. Add appropriate member function to readand print items. Use necessary I/O manipulators for formatting the output. Illustrate how the objects of Inventory classcan write to and read from disk files.

Program #5a. Create a template function to sort a list of elements.

b. Using appropriate ios functions, display the square root of number from 1 to 20 in the following format:

VALUE*********SQRT OF VALUE

+1..+1.0000 +2..+1.4142

Program #6

Implement a person Class. Each object in this class will represent a Person entity. Data members for person classname, dob, address. Derive another class called employee having its own member basic pay, DA, HRA. Compute netsalary. Include constructor, destructor, access functions and print functions

Program #7

Implementation of task to perform basic arithmetic operations on two complex numbers by overloading the arithmeticoperators +, -, *, / and I/O stream operators.

Program #8

Implement a class called Person having data members as name, dob and address. Derive a class called from Personcalled student having data members roll no and semester. Derive another class called Exam from student which hasdata members marks1, marks2 and computes the average and displays the topper of the class. Use suitable memberfunctions to accept and display data in these classes.

Program #9Task to implement an array using class templates. Implement the following operations:

i) comparing two arrays

ii) adding two arrays

iii) finding the max and min in an array

iv) sorting the array

7/31/2019 Scheme 2009 - 13

19/32

19 of 32

v) display the array object

Program #10

Implement a string class. Each object of this class will represent character string. Data members are length of thestring and actual character string. Include constructor, destructor, access functions, print function and subscriptfunction.

Program #11

Task to implement functions for computing harmonic mean and geometric mean. If the means cannot be computedcatch these exceptions and suitable handle the same.

Program #12

Task that will show the following menu to the user

i) insert an integer at the end of list

ii) insert an integer at the beginning of the list

iii) insert an integer before a specified integer in the list

iv) delete the first integer from list

v) delete the last integer from the list

vi) delete a specified integer from the list

vii) display the list of integers

viii) save the list of integers

ix) quit

Implement the above menu and associated functions using the list class of the STL.

CS 205: COMPUTERARCHITECTURE AND

ORGANIZATION(4 -0-0)

OBJECTIVE:

The objective of the course is to distinguish between computer architecture and computer organization, describe theoperation of CPU, memory, bus, and I/O, and identify and tell the purpose of different levels of memory. To have athorough understanding of the basic structure and operation of a digital computer and discuss in detail the operation of thearithmetic unit including the algorithms and implementation of fixed-point and floating-point addition, subtraction,multiplication and division. To study in detail the different types of control and the concept of pipelining, the hierarchicalmemory system including cache memories and virtual memory and different ways of communicating with I/O devices andstandard I/O interfaces

7/31/2019 Scheme 2009 - 13

20/32

20 of 32

UNIT I

Basic structure of computers: Computer Types: Functional units: Input Unit, Memory Unit, Arithmetic & Logic unit, Outputunit, Control unit Basic operational concepts: Bus structures: Software Performance: Processor clock, basic performanceequation, Pipelining & Superscalar operation, Clock rate, Performance measurement Multiprocessor & Multi-computers

Machine instructions & programs: Numbers, Arithmetic operations and characters, Memory locations and addresses:

Byte addressability, Big-endian & Little-endian assignments, Word Alignment, Accessing Numbers, Characters & CharacterStrings Memory Operations: Instruction & Instruction sequencing: Register Transfer Notation, Assembly LanguageNotation, Basic Instruction Types, Instruction Execution & Straight-line sequencing, Branching, Condition Code, GeneratingMemory address

Addressing Modes: Implementation of Variables & Constants, Indirection & Pointers, Indexing & Arrays, RelativeAddressing, Additional Modes; Assembly Language: Assembler Directives, Number Notation Basic Input / Outputoperations: Stacks and queues: Subroutines: Subroutine Nesting & processor stack, Parameter Passing, The Stack FrameAdditional Instructions: Logic Instruction, Shift & Rotate Instructions, Multiplication & Division; Encoding of MachineInstruction: General features of CISC & RISC

UNIT II

Input/output organization Accessing I/O devices: Interrupts: Interrupt Hardware, Enabling & Disabling Interrupt,Handling Multiple devices, Controlling Device Requests, Exceptions Direct Memory Access: Bus Arbitration Buses:Synchronous Bus, Asynchronous Bus, Interface circuits: Parallel Port, Serial Port, Standard I/O Interfaces, PCI bus, SCSIbus, USB.

UNIT III

The memory system Some Basic concepts: Semiconductor RAM Memories: Internal Organization of Memory Chips,Static Memories, Asynchronous DRAMs, Synchronous DRAMs, Structure of Larger Memories, Memory SystemConsiderations, Ram bus memory Read-only Memories: ROM, PROM, EPROM, EEPROM, Flash memory Speed, size andcost: Cache memories: Mapping functions Performance considerations: Interleaving, Hit Rate & Miss Penalty Virtualmemory: Address Translation

Secondary Storage: Magnetic Hard Disks, Optical Disks

UNIT IV

Arithmetic unit :Addition and subtraction of signed numbers: Addition/ Subtraction logic unit; Design of fast adders: Carry-Look-ahead Addition Multiplication of positive numbers: Signed operand multiplication: Booth Algorithm

Fast multiplication: Bit-pair Recoding of Multipliers Integer division: Floating point numbers and operations: IEEEStandard for Floating-point Numbers, Arithmetic Operations on Floating-Point Numbers, Implementing Floating-pointOperations

7/31/2019 Scheme 2009 - 13

21/32

21 of 32

UNIT V

Basic processing unit

Some Fundamental concepts: Register Transfers, Performing an Arithmetic or Logic operation, Fetching a Word fromMemory, Storing a Word in Memory, Execution of a complete instruction: Branch instruction; Multiple-Bus organization:Hardwired control: A Complete Processor Micro-programmed control: Microinstruction, Micro-program Sequencing,Microinstruction with Next-address field.

Text book:

T1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, 5thEdition Computer Organization, McGraw-Hill, 2002.

UNIT# Sections

UNIT I 1.1-1.6.4, 1.6.7-1.7, Ch 2: 2.1-2.6.1, 2.6.3-2.10.3, 2.12

UNIT II 4.1-4.2.5, 4.4-4.7.3

UNIT III 5.1-5.5.1, 5.6-5.6.2, 5.7, 5.9-5.9.2

UNIT IV 6.1-6.5.1, 6.6-6.7.2, 6.7.4

UNIT V 7.1-7.5.2, 7.5.4

MA251 METHODS OFAPPLIED

MATHEMATICS (4-0-0)

OBJECTIVE:OBJECTIVE: The aim of the course is to provide a strong platform for the students by equipping them with thefundamentals of applied mathematics such as Complex Analysis, Numerical Methods and Partial Differential Equations.Complex Functions are useful in the study of fluid mechanics, thermodynamics and electric fields. Study of variousnumerical methods provides approximate solutions with specified degree of accuracy useful in the cases where analyticalsolutions are non-existent. An introduction to partial differential equations enables the students to solve problems that arisein mechanics, electromagnetic theory and other areas of engineering.

UNIT IComplex Variables: Limits, Continuity and differentiability of functions of complex variables. Analytic functions. Cauchy Riemann equations in Cartesian and Polar forms- consequences. Conformal transformations: z

2, e

Z, trigonometric

functions, z + a2

/ z (z 0) and Bilinear transformations.

UNIT IIComplex Integration: Line integral, Cauchys theorem and corollaries, Cauchys integral formula. Taylors and Laurentsseries expansions of functions. Isolated singularities and Cauchys Residue theorem

UNIT IIINumerical Methods: Roots of transcendental equations using Bisection, Regula - Falsi and Newton-Raphson Methods.

7/31/2019 Scheme 2009 - 13

22/32

22 of 32

Finite Differences, Newton Gregory forward and backward interpolation formulae. Stirlings and Bessels interpolationformulae, Lagranges interpolation formulae and Newtons divided difference interpolation formula. Numerical Integrationusing Trapezoidal Rule, Simpsons one third rule, Simpsons three eighth rule and Weddles rule. Numerical solutions offirst order Ordinar y Differential Equations - Taylors series method, Modified Eulers, Runge - Kutta 4 order methods

UNIT IVPartial Differential Equations (P.D.E) Part 1: Formation of Partial differential equations by elimination of arbitrary constants

and arbitrary functions. Solution by direct integration. Solutions of equations of the type: Pp + Qq = R and Charpitsmethod.

UNIT VPartial Differential Equations(P.D.E) Part 2: Solution of PDEs by the method of separation of variables, one dimensionalHeat and Wave equations. Solution of two dimensional Laplaces equation in Cartesian and Polar systems. Solution ofHomogeneous and Non-Homogeneous Linear PDEs. Solution of non-linear PDEs using Monges method.

Text Book:

T1. B S Grewal, Higher Engineering Mathematics 39th

Edition, Khanna Publishers.

Suggested Reading:R1. KA Stroud, Advanced Engineering Mathematics 4th

Edition, MacMillan Publications, 2003.R2. Murray R Spiegel, Complex Variables, Schaums Outline Series, Tata McGraw Hill Publications, 1981

UNIT# SectionsUNIT I T1: 20.1-20.4, 20.7, 20.9, 20.10UNIT II T1: 20.12-20.14, 20.16-20.19UNIT III T1: 8.1-8.21UNIT IV T1:17.2-17.11UNIT V T1: 17.2, 17.4, 17.5, 17.7, 18.2, 18.7, 18.8, 18.11-18.12, 17.8-17.12

CS 251: ANALYSISAND DESIGN OFALGORITHMS THEORY& LABORATORY(3-1-2)

PART A THEORY

OBJECTIVE:

Algorithms are the essence of computer-based solutions to problems. This course introduces students to basic techniquesfor algorithm design such as divide-and-conquer, dynamic programming, greedy algorithms and backtracking fordeveloping correct and efficient programs for solving a variety of problems. Students are also introduced to the importantconcept of the complexity of an algorithm and to rigorous mathematical analysis of the complexity. Throughout the course,examples of classical and state-of-the-art algorithms are provided for illustration.

UNIT IIntroduction : What is an algorithm, fundamentals of algorithmic problem solving, important problem types, analysis

7/31/2019 Scheme 2009 - 13

23/32

23 of 32

framework, asymptotic notations and basic efficiency classes, mathematical analysis of non recursive and recursivealgorithms, examples

UNIT IIBrute Force : Selection sort, Bubble sort, sequential searching, string matching, Exhaustive search.Divide & Conquer : Mergesort, Quicksort, Binary search, multiplication of large integers and Strassens matrixmultiplication.

UNIT IIIDecrease and Conquer : Insertion sort, depth first and breadth first search, topological sortingTransform and Conquer: Pre-sorting, Gaussian Elimination, Balanced Search Trees, Heaps & Heap sort, Horners ruleand Binary exponentiation.

UNIT IVDynamic Programming: Computing a binomial coefficient, Warshalls and Floyds algorithms, knapsack problem andmemory functions.Greedy Technique: Prims algorithm, Kruskals algorithm, Dijkstras algorithm, Huffman trees.

UNIT V

Limitations of Algorithm Power: Lower bound arguments, decision trees, P, NP and NP complete problems.Coping up with Limitations of Algorithm Power: Backtracking, Branch and Bound, Approximation algorithms for NPhard problems.

Text book:T1. Introduction to The Design and Analysis of Algorithms, Anany Levitin, Second Edition, PEARSON Education, 2009

UNIT# Sections

UNIT I 1.1 to 1.3, 2.1 to 2.5UNIT II 3.1, 3.2, 3.4, 4.1, 4.2, 4.3, 4.5UNIT III 5.1 to 5.3, 6.1 to 6.5UNIT IV 8.1, 8.2, 8.4, 9.1 to 9.4UNIT - V 11.1 to 11.3, 12.1 to 12 .3

CS 251: ANALYSISAND DESIGN OF

ALGORITHMS PART B LABORATORY

Program #1

Write a recursive routine to sort the elements using quick sort.

Program #2

a. Implement Travelling salesman problem using exhaustive search

7/31/2019 Scheme 2009 - 13

24/32

24 of 32

b. Implement Assignment problem using exhaustive search

Program #3a. Find minimum cost spanning tree using Kruskals algorithm.b. Find minimum cost spanning tree using Prims algorithm.

Program #4

Implement Dijkstras algorithm for single source shortest path.

Program #5

Implement Floyds algorithm for all pair shortest path

Program #6

Program to implement Knapsack Problem using Dynamic Programming.

Program #7

Program to implement Binomial Coefficient using Dynamic Programming.

Program #8

a. Print all nodes reachable from a given starting node in a digraph using BFS method.b. Check whether a given graph is connected or not using DFS method

Program #9

Program to obtain topological ordering of a graph.

Program #10

Sort a given set of elements using heap sort and determine the time required.

Program #11

Implement N queens problem using backtracking.

Program #12Find a subset of a given set S = {s1, s2, . . . sn } of n positive integers whose sum is equal to a given positive integer M.For ex : If S is { 11, 13, 24, 7 } and M = 31 then the two desired subsets are : Subset 1 : { 11, 13, 7 } and Subset 2 : { 24, 7 }

7/31/2019 Scheme 2009 - 13

25/32

25 of 32

CS 252: OOP WITHJAVA THEORY AND

LABORATORY ( 3-0-2)PART A THEORY

OBJECTIVE:The course is designed to impart knowledge and develop skills required to solve real world problems using an objectoriented approach and Java Language constructs. The course introduces the Java programming language including basicdata structures in Java, objects and classes, super Class, sub-class, interfaces, inner classes and multithreading.

UNIT I

An Introduction to JAVA : JAVA as a programming platform.The JAVA White Paper Buzzwords.JAVA Applets andInternet,A short history of JAVA.Common misconceptions about JAVA

The JAVA Programming Environment: Installing JDK.Choosing a development environment,Using commandlinetools.Using an integrated development environment.Building and running Applets

Fundamental Programming Structures in JAVA: Simple JAVA Program,Comments,DataTypes,Variables,Operators,Strings,Input and Output,Control Flow,Big Numbers,Arrays.

UNIT IIObjects and Classes : Introduction to object oriented programming,using predefined classes,defining your ownclasses,static fields and methods,method parameters,object construction,packages,class path,documentationcomments,class design hints.

UNIT IIIInheritance : Classes,super classes and sub classes.Object::The Cosmic super class.Generic array list.Object Wrappersand autoboxing,methods with a variable number of parameters,enumeration classes,reflection,design hints for inheritance.

UNIT IVInterfaces and inner classes : Interfaces,object cloning,interfaces and call backs,inner classes,proxies.Deploying Application and Applets : JAR files,JAVA Web starts,Applets,Storage of application preferences.

UNIT VExceptions, Logging, Assertions : Dealing with errors,catching exceptions,tips for using exceptions,usingassertions,logging.Multi Threading : What are threads,Interrupting threads.thread states,thread propertiesText book:T1. Core Java Vol 1.Fundamentals Eighth Edition, Cay S. Horstmann & Gary Cornell

UNIT# SectionsUNIT I Page No. 1 to 104UNIT II Page No. 105 to 169

7/31/2019 Scheme 2009 - 13

26/32

26 of 32

UNIT III Page No. 171 to 240UNIT IV Page No. 241 to 280, Page No. 493 to 550UNIT - V Page No. 551 to 591, Page No. 715 to 736

CS 252: OOP WITHJAVA THEORY PART B

LABORATORY

Program #1

Program to demonstrate use of arrays.

Program #2

Program to demonstrate use of parameterized constructors.

Program #3

Program to demonstrate String operations

Program #4

Program to demonstrate use of inheritance and polymorphism.

Program #5

Program to demonstrate use of abstract class.

Program #6

Program to demonstrate use of interfaces.

Program #7

Program to demonstrate use of inner classes.

Program #8

Program to demonstrate use of final keyword in class.

Program #9Program to demonstrate use of singleton class

Program #10

Program to demonstrate use of exception handling.

7/31/2019 Scheme 2009 - 13

27/32

27 of 32

Program #11

Program to demonstrate use of applets and multi-threading.

Program #12

Program to demonstrate use of AWT in applets.

CS 253: SYSTEMSOFTWARE (3-1-0)

OBJECTIVE:This course is an introduction to the design and implementation of system software. It introduces the Simplified InstructionalComputer (SIC) that is used to present fundamental system software concepts. In assemblers, the basic concepts ofprogram assembly are presented using the SIC and SIC - XE machines as teaching aids. It describes the design andimplementation of loaders, linkers, macro processors, text editors, and interactive debugging systems. It also includes ashort overview of compiler design in preparation for a full elective course on the subject.

UNIT IMachine Architecture: Introduction, System and Machine Architecture, Simplified Instructional Computer (SIC) SICMachine Architecture, SIC/XE Machine Architecture, SIC Programming Examples,Lex and Yacc: Lex and Yacc The simplest Lex Program, Recognizing Words with LEX, Symbol Tables, Grammars,Parser Lexer Communication. A Yacc Parser, Running Lex and Yacc, Lex vs Hand Written Lexers, Using LEX Regular Expression, Examples of Regular Expressions, A Word Counting Program, Parsing a Command Line, Using YACC

Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser, Symbol Values andActions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and TypedTokens.

UNIT IIAssemblers : Basic Assembler Function A Simple SIC Assembler, Assembler Algorithm and Data Structures, MachineDependent Assembler Features Instruction Formats and Addressing Modes, Program Relocation, Machine IndependentAssembler Features Literals, Symbol Definition Statements, Expressions, Program Blocks, Control Sections andProgram Linking, Assembler Design Operations One Pass Assembler, Multi Pass Assembler, Implementation Examples SPARC Assembler.

UNIT IIIBasic Loader functions design of absolute loader, a simple boot strap loader, Machine dependent loader featuresrelocation, Program linking, Algorithm and data structures for a linking loader, Algorithm and data structures for a linkingloader continued, Machine independent loader features automatic library search, loader options. Loader design options linkage editor, dynamic linkage, boot strap loaders.

UNIT IVMacro Processor: Basic Macro Processor Functions Macro Definitions and Expansion, Macro Processor Algorithm and

7/31/2019 Scheme 2009 - 13

28/32

28 of 32

Data Structures, Machine Independent Macro Processor Features Concatenation of Macro Parameters, Generation ofUnique Labels, Conditional Macro Expansion, Keyword Macro Parameters, General Purpose Macro Processors, MacroProcessing within Language Translators.

UNIT VCompilers: Basic Compiler Function Grammars, Lexical Analysis, Syntactic Analysis, Code Generation, MachineDependent Compiler Features Intermediate Form of the Program, Machine Dependent Code Optimization, MachineIndependent Compiler Features Structured Variables, Machine Independent Code Optimization, Storage Allocation, BlockStructured Languages, Compiler Design Options Division into Passes, Interpreters, P Code Compilers, CompilerCompilers.

Text book:T1. Leland L. Beck, D. Manjula, System Software, 3

rdEdition, Pearson Education

T2. John R. Levine, Tony Mason, and Doug Brown, Lex and Yacc, OReilly, 2nd

Edition, SPD, 1999.

UNIT# SectionsUNIT I T1 Page No. 1 22 , T2 Page No. 1 38, 51 65UNIT II T1 Page No. 46 107, 111 113UNIT III T1 Page No. 130 165

UNIT

IV T1 Page No. 181 212UNIT V T1 Page No. 233 301

CS 254MICROCONTROLLER

THEORY &

LABORATORY (3-1-2)PART A THEORY

OBJECTIVE:OBJECTIVE: The objective of the course is to describe the types of microcontroller elements, their functions and typical bussystems. Understand the basic building block of microcontroller device, architectural and salient features of the 8051microcontroller. This course provides assembly language experience and enables the students to write code that providesa good, intuitive model of the computing environment.

UNIT IIntroduction to Microcontrollers: Introduction, Terminology, The central processing unit, Semiconductor Memory,Input/Output devices, Programs, Micros, Minis, Mainframes, Microprocessor Vs. Microcontrollers, New concepts, Gains andLosses: A design example

UNIT IIHardware Summary: MCS-51 Family overview, Once around the pins, I/O port structure, Timing and the machine cycle,Memory organization, Special function registers, External, 8032/ 8052 enhancement, Reset operation. Instruction SetSummary: Introduction, Addressing Modes, Instruction types.

7/31/2019 Scheme 2009 - 13

29/32

29 of 32

UNIT IIITimer Operation: Introduction, TMOD,TCON, Timer modes and the overflow flag, Clocking sources, Starting, Stopping andcontrolling the timers, Initializing and accessing timer registers, Short, Medium, and Long intervals, Producing exactfrequencies, 8052 Timer 2, Baud Rate generation.Serial Por t Operation: Introduction Serial communication, SBUF, SCON, Modes of operation, Full duplex serialcommunication: Issues, Initialization and Accessing serial port registers, Multiprocessor Communications, Serial Port BaudRates

UNIT IVInterrupts: Introduction, 8051 Interrupt Organization, Processing Interrupts, Program Design using interrupts, TimerInterrupts, Serial port interrupts, External Interrupts, Interrupt Timings

UNIT VDesign and Interface Examples: Introduction, The SBC:51, Hexadecimal Keypad Inter face, Interface to Multiple 7-segmentLEDs, Interface to LEDs, Loud Speaker Inter face, Non-Volatile Interface, Input/Output Expansion, RS-232 Serial Interface, Centronics Parallel Interface, Analog Output, Analog Input, Interface to Sensors, Interface to Relays, Stepper MotorInterface. **

Text book:T1: The 8051 Microcontroller, 4

thEdition by I. Scott Mackenzie & Raphael C. W. Pan Pearson Education 2007.

UNIT SECTIONSUnit I Ch 1.1 1.11Unit II Ch 2.1 2.9, Ch 3.1 3.3Unit III Ch 4.1 4.11, Ch 5.1 5.9Unit IV Ch 6.1 6.8Unit V Ch 11.1 11.15** Unit V Design Concepts to be thought from Chapter 11 along with Assembly Programs and for C Programs of same interface design concepts, to bethought from Chapter 12 of the t ext book.

CS 254MICROCONTROLLERPART B

LABORATORY

Program #1Programs to illustrate Data Transfer - Block move, Exchange, Sorting, Finding largest element in an array

Program #2Programs to illustrate Counters

Program #3Programs to illustrate Boolean & Logical Instructions (Bit manipulations).

Program #4

7/31/2019 Scheme 2009 - 13

30/32

30 of 32

Programs to illustrate Conditional CALL & RETURN.

Program #5Programs to illustrate Code conversion: BCD ASCII; ASCII Decimal; Decimal - ASCII; HEX - Decimal and Decimal -HEX

Program #6Programs to illustrate I/O Ports programming

Program #7Programs to illustrate delay generation using Timers.

Program #8Program to illustrate Decimal up counter.

Program #9Program to illustrate ADC.

Program #10

Program to illustrate Programmable counter Array.

Program #11Program to illustrate Serial communication.

Program #12Program to illustrate temperature sensor.

CS 255: FINITE

AUTOMATA ANDFORMAL LANGUAGES

(3-0-0)

OBJECTIVE:

This course introduces the fundamental theory of computation. Starting with the most primitive computing device, a finiteautomaton, the course gradually introduces additional components to the device to enhance its computing power. The

course also introduces students to the twin concepts of languages and grammars that correspond to classes of computingdevices. Finally the course introduces the idea of a universal computing device and brings out theoretical limits of the veryidea of computing.

UNIT I

Introduction: Mathematical Preliminaries and Notation, Three Basic Concepts: Languages, Grammars and Automata,Some applications.

7/31/2019 Scheme 2009 - 13

31/32

31 of 32

Finite Automata: Deterministic Finite Accepters, Nondeterministic Finite Accepters, Equivalence of Deterministic andNondeterministic Finite Accepters, Reduction of the Number of States in Finite Automata

UNIT II

Regular languages and Regular Grammars: Regular Expressions, Connection between Regular Expressions andRegular Languages, Regular Grammars.

Properties of Regular Languages: Closure Properties of Regular Languages, Elementary questions about Regular

Languages, Identifying Non-regular Languages

UNIT III

Context-Free Languages and grammars: Context-Free Grammars, Parsing and Ambiguity, Context-Free Grammars andProgramming Languages.

Simplification of Context-free Grammars and Normal Forms: Methods for Transforming Grammars, Chomsky andGreibach Normal Forms, A Membership Algorithm for Context-Free Grammars

UNIT IV

Pushdown Automata: Nondeterministic Pushdown Automata, Pushdown Automata and Context-Free Languages,

Deterministic Pushdown Automata and Deterministic Context-Free Languages, Grammars for Deterministic Context-FreeLanguages.

Properties of Context-Free Languages: Two Pumping Lemmas, Closure Properties and Decision Algorithms for Context-Free LanguagesTuring Machines: The Standard Turing Machine, Combining Turing Machines for Complicated Tasks, Turings Thesis,Minor Variations on the Turing Machine Theme, Turing Machines with More Complex Storage, Nondeterministic TuringMachines, A Universal Turing Machine, Linear Bounded Automata.

A Hierarchy of Formal Languages and Automata: Recursive and Recursively Enumerable Languages, UnrestrictedGrammars, Context-Sensitive Grammars and Languages, The Chomsky Hierarchy.

Limits of Algorithmic Computation: Some Problems that Cannot Be Solved by Turing Machines, Undecidable Problemsfor Recursively Enumerable Languages, The Post Correspondence Problem, Undecidable Problems for Context-Free

Languages.

Textbook:

T1. An Introduction to FORMAL LANGUAGES and AUTOMATA, PETER LINZ, Narosa, 4th Edition, Narosa PublishingHouse, 2007.

UNIT# SectionsUNIT I 1.1 1.3, 2.1 2.4

7/31/2019 Scheme 2009 - 13

32/32

32 of 32

UNIT II 3.1 3.3, 4.1 4.3UNIT III 5.1 5.3, 6.1 6.3UNIT IV 7.1 7.4, 8.1 8.2UNIT V 9.1 9.3, 10.1 10.5, 11.1 11.4, 12.1 12.5

Suggested readingIntroduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev Motwani,Jeffrey D. Ullman, 2

ndedition, Pearson Education