Fourth Semester - Gogte Institute of Technology · Third Semester S.No. Code Course Credits Total...

1

Third Semester

S.No. Code Course

Credits Total credits

Contact

Hours/week

Marks

L – T - P CIE SEE Total

1. 15MAT31 Engineering

Mathematics -III BS 3 – 1 - 0 4 5 50 50 100

2. 15CS32 Logic Design and

Applications PC1 4 – 1 - 0 5 6 50 50 100

3. 15CS33 Unix and Shell

Programming PC2 3 – 1 - 0 4 5 50 50 100

4. 15CS34 Computer Organization

and Architecture PC3 3– 0 - 0 3 3 50 50 100

5. 15CS35 Data Structures using C PC4 3 – 0 - 0 3 3 50 50 100

6. 15CS36 OOP with Java

PC5 3 – 0 - 0 3 3 50 50 100

7. 15CSL37 Data Structures with C

Lab(Practical) L1 0 – 0- 1.5 1.5 3 25 25 50

8. 15CSL38

OOP with JAVA

Programming Lab

( Practical)

L2 0 – 0 – 1.5 1.5 3 25 25 50

9. 15MATDIP1# Bridge course Maths

–I (Diploma) MNC

Mandatory Non

Credit Course

Total 25 31 350 350 700

* SEE: SEE (Theory exam) will be conducted for 100marks of 3 hours duration. It is reduced to 50 marks for the calculation of SGPA and CGPA

# This course is Mandatory Non - Credit course ( Marks will not be considered) for Diploma lateral entry students. The students have to pass this course before 7th

semester.

.

2

* SEE: SEE (Theory exam) will be conducted for 100marks of 3 hours duration. It is reduced to 50 marks for the calculation of SGPA and CGPA.

# This course is Mandatory Non - Credit course ( Marks will not be considered) for Diploma lateral entry students. The students have to pass this course before 7th

semester.

Fourth Semester

S.No. Code Course

Credits Total credits

Contact

Hours/week

Marks

L – T - P CIE SEE Total

1. 15MAT41 Engineering

Mathematics -IV BS 3 - 1 - 0 4 5 50 50 100

2. 15CS42 Operating System PC1 3 - 0 - 0 3 3 50 50 100

3. 15CS43 Web Programming PC2 3 - 1 - 0 4 5 50 50 100

4. 15CS44 Design and Analysis of

Algorithms PC3 3- 0 - 0 3 3 50 50 100

5. 15CS45 Microprocessors and

Microcontrollers PC4 4- 0 - 0 4 4 50 50 100

6. 15CS46 Database Management

System PC5 4- 0 - 0 4 4 50 50 100

7. 15PED49 Principles of

Engineering Design 0 - 0- 2 2 2 50 50

8. 15CSL47 DAA Lab .with C / Java (

Practical) L1 0 - 0 -1.5 1.5 3 25 25 50

9. 15CSL48

Microprocessors and

Microcontroller

Applications Lab.

(Practical )

L2 0 - 0 - 1.5 1.5 3 25 25 50

10. 15MATDIP2# Bridge course Maths

–2 (Diploma) MNC

Mandatory Non

Credit Course

Total 27 32 400 350 750

Semester III

Engineering Mathematics -III

(Common to all branches)

Subject Code: 15MAT31

Credits: 4

Course Type: BS CIE Marks: 50

Hours/week: L – T – P 3– 1– 0 SEE Marks: 50

Total Hours: 50 SEE Duration: 3 Hours for 100 Marks

Course Learning Objectives (CLOs):

Students should

1. Learn Numerical methods to solve Algebraic, Transcendental and Ordinary Differential

Equations.

2. Understand the concept of Fourier series and apply when needed.

3. Get acquainted with Curve fitting, Correlation and Linear regression.

4. Study the concept of Random variables and its applications.

5.Get acquainted with Joint Probability Distribution and Stochastic processes.

Prerequisites:

1. Basic Differentiation and Integration

2. Basic Probabilities

Unit-I 10 hours

Numerical solution of Algebraic and Transcendental equations:

Method of false position, Newton- Raphson method (with derivation), Fixed point iteration

method (without derivation).

Numerical solution of Ordinary differential equations: Taylor’s Series method, Euler and

Modified Euler method, Fourth order Runge–Kutta method.

Unit-II 10 hours

Fourier Series: Convergence and Divergence of Infinite series of positive terms (only

definitions). Periodic functions, Dirichlet’s conditions, Fourier Series, Half Range Fourier sine

and cosine Series. Practical examples. Harmonic analysis.

Unit-III 10 hours

Curve fitting and Statistics: Curve fitting by the method of Least squares, fitting of - straight

line (linear curve) y = ax + b, parabola (second degree curve) y = ax2 + bx +c , Geometric curve y

= axb Exponential curve y = ae

bx .

Statistics: Correlation and Regression–Karl Pearson’s coefficient of Correlation, Lines of

Regression. Practical examples.

Unit-IV 10 hours

Probability: Random Variables (RV), Discrete and Continuous Random variables, (DRV,CRV)

Probability Distribution Functions (PDF) and Cumulative Distribution Functions(CDF),

Expectations, Mean, Variance. Binomial, Poisson, Exponential and Normal Distributions.

Practical examples.

Unit-V 10 hours

Joint PDF and Stochastic Processes: Discrete Joint PDF, conditional Joint PDF, Expectations

(Mean, Variance and Covariance).Definition and classification of stochastic processes. Discrete

state and discrete parameter stochastic process, Unique fixed probability vector, Regular

Stochastic Matrix, Transition probability, Markov chain.

Text Books:

1. B.S. Grewal – Higher Engineering Mathematics, Khanna Publishers, 42nd

Edition, 2012.

2. P.N.Wartikar & J.N.Wartikar– Applied Mathematics (Volume I and II) Pune Vidyarthi Griha

Prakashan, 7th

Edition 1994.

3. B. V. Ramana- Higher Engineering Mathematics,Tata McGraw-Hill Publishing Company Ltd.

Reference Books:

1. Erwin Kreyszig –Advanced Engineering Mathematics, John Wiley & Sons Inc., 9th

Edition,

2006

2. Peter V. O’ Neil – Advanced Engineering Mathematics, Thomson Brooks/Cole, 7th

Edition,

2011.

3. Glyn James – Advanced Modern Engineering Mathematics, Pearson Education, 4th

Edition,

2010.

Course Outcomes (COs): At the end of the course student will be able to:

1. Use Numerical methods and Solve Algebraic, Transcendental and Ordinary differential

equations [L3].

2. Develop frequency bond series from time bond functions using Fourier series [L3].

3. Use Least Square method to fit a given curve and fit Linear regressions for the given dataL3].

4. Understand the concept of Random variables, PDF, CDF and its applications [L2].

5. Extend the basic probability concept to Joint Probability Distribution, Stochastic processes

and Apply to solve Society problems[L2,L3].

Program Outcomes (POs) of the course: Students will acquire

1. An ability to apply knowledge of Mathematics, science and Engineering. [PO1]

2. An ability to identify, formulate and solve engineering problems. [PO5]

3. An ability to use the techniques, skills and modern engineering tools necessary for

engineering practice .[PO11]

Scheme of Continuous Internal Evaluation (CIE):

Components Average of

best two tests

out of three

Average of

two

Assignments/

Mathematical

/Computation

al/Statistical

tools of 4 labs

in a semester

Quiz

Class

Participation

Total

Marks

Maximum 25 10 10 5 50

Scheme of Semester End Examination (SEE):

* Question paper contains 08 questions each carrying 20 marks. Students have to answer

FIVE full

questions.

* SEE question paper will have Two compulsory questions and choice will be given to

remaining

three units.

* SEE will be conducted for 100 marks of three hours duration. It will be reduced to 50

marks for

the calculation of SGPA and CGPA.

Number of questions

Unit-I 2

Unit-II 2

Unit-III 1 (compulsory)

Unit-IV 2

Unit-V 1 (compulsory)

III Semester

LOGIC DESIGN AND APPLICATIONS

Course Code: 15CS32 Credits: 5

Course Type: PC CIE Marks: 50

Hours/week: L – T – P 4 – 1 – 0 SEE Marks: 50



CLO 1: Introduce the basics of Minimizing Booleans functions by using various techniques like K-Map

and Quine Mclusky methods and implement by using suitable Logic gates and MSI chips.

CLO 2: Discuss the combinational logic circuits like Full Adder, Subtractor, Magnitude Comparators,

Code Converters etc. and implement by using logic gates/ ICs.

CLO 3: Present the working of various Flip- Flops, Register types, Counters, ADC/DAC and their

applications.

Prerequisites: Basic Electronics, Engineering Mathematics.

Unit I 10 hours

Simplification of Boolean functions: Revision of Logic gates and Boolean algebra, Simplification of

Boolean functions using Basic Logic gates, Universal Gates, SOP, POS form, K-Map Simplification ( upto 4

variables), Don’t-care Condition, QuineMcClusky method to generate Prime Implicants, Prime Implicants

chart.

Unit II 10 hours

Data Processing Circuits: Multiplexers, De-multiplexers, Encoders, Decoders and implementation of

Boolean functions using multiplexer, Decoders, Magnitude Comparators (1 bit and 2 bit), PLA, PAL,

Parity Generators and Checkers using XOR gates, Parallel Binary Adder/Subtractor.

Unit III 10 hours

Clocks and Flip Flops: TTL Clock and its characteristics, Basic SR Latch using NOR/NAND gates, Clocked

RS Flip Flop , Clocked D Flip Flop, D Flip Flop with Preset and Clear inputs, JK master slave Flip Flop, T Flip

Flop, Characteristic equation of Flip Flop, Flip Flop Excitation Table, Waveforms of Clocked Flip Flops

Unit IV 10 hours

Sequential Circuits: Analysis of Sequential Circuits,conversion of flip flop, Design of Synchronous

Counters (4 bit) using JK,SR Flip Flop, Asynchronous counter (4 bit), Up Counter, IC 7490 Decade counter,

Shift Register, SISO, SIPO, PISO and SIPO, Applications of Registers as Ring Counter, Johnson Counter and

Serial Adder and Applications like mod 50, mod 80, mod 100.

Unit V 10 hours

DAC, ADC and Introduction to HDL: Weighted Binary Register, R-2R Ladder, DAC resolution and

Accuracy, ADC types such as Simultaneous Conversion (Parallel Comparator), Successive Approximation

and Counter type.

HDL Introduction: Types of Model, Syntax for Data Flow model, Simple programs for SOP equation,

Multiplexer, Decoder and D-Flip Flop.

Text Book:

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

Edition, Tata McGraw Hill, 2011. [2.1,2.2,3.1 to 3.9,4.1 to 4.12, 6.7, 6.9, 7.1, 7.2, 8.1 to 8.5, 8.8 to

8.10, 8.11, 8.12, 9.1 to 9.5, 9.7, 10.1, 10.2, 10.5, 10.7, 12.1 to 12.6, 12.8, 2.5, 3.11, 4.14]

Reference Books:

1. Donald Givone: Digital Principles and Design, Palgrave Macmillan, 2003

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

3. Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss: Digital Systems Principles and Applications,

10th

Edition, Pearson Education, 2007.

Course Outcomes (COs):

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

1. Analyze different simplification methods for Boolean functions and design the logical circuits.

[L4,L5]

2. Realize the combinational and sequential logic circuits by using various logical blocks.[L4]

3. Design synchronous counters and develop sequential circuit applications using flip flop and

registers.[L6]

4. To develop an understanding the concept ADC, DAC blocks required for data conversion. [L6]

5. Write simple HDL programs for combinational logic circuits.[L3]

Program Outcomes (POs) of the course:

1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical reasoning

and engineering.[PO1]

2. Graduates will demonstrate the ability to identify, formulate and solve computer systems

engineering problems.[PO2]

3. Graduates will demonstrate the ability to design and experiment both in hardware and

software, analyze and interpret data.[PO3]

4. Graduates will demonstrate an ability to analyze the given problems and design solutions, as

per the needs and specifications.[PO4]

5. Graduates will develop confidence for self education and ability for lifelong learning.[PO10]

6. Graduate will be capable of participating and succeeding in competitive examinations.[PO11]


Components Average of best

two tests out of

three

Average of two

assignments/Activity Quiz

Class

participation

Total

Marks

Maximum

Marks 25 10 10 5 50


1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the

calculation of SGPA and CGPA.

2. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full

questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be given

in the remaining three units.

III Semester

UNIX and Shell Programming

Subject Code: 15CS33(IS) Credits: 4





CLO 1: To provide introduction to UNIX operating system and its File System

CLO 2: To gain an understanding of important aspects related to the shell and the process

CLO 3: To develop the ability to formulate regular expressions and use them for pattern matching

CLO 4: To provide a comprehensive introduction to Shell Programming, services and utilities

Prerequisites: Basic knowledge of computer concepts & programming.

Unit I 8 Hours

Introduction to UNIX and Filesystem:

Inside UNIX, General features of a command, PATH, Internal and External commands, Command

structure

The File “yste : The File, What’s i a File a e, The Pa e t-Child relationship, The UNIX File

System, pwd, Absolute pathnames, cd, Relative pathnames, mkdir, rmdir, cp, rm, mv, cat, file

File Attributes: ls, ls –l, ls –d, File Permissions, chmod, File systems and inodes, ln: Links, Symbolic

links, find.

Self Learning Topics: man documentation, General-Purpose Utilities. (2.5 Hours)

Unit II 8 Hours

Shell and Process:

The Shell: The shell as command processor, Pattern matching, Redirection, Pipes, Command

substitution, Shell variables

The Process: Understanding the Process, How a process is created, The Login shell, init, Internal and

External commands, ps, Running jobs in background, Signals, kill, Job control, cron

Make: Handling multisource C applications, A multisource application, make

Self Learning Topics: Escaping and quoting, Special Files, tee, nice, at and batch. (1.5 Hours)

Unit III 8 Hours

Advanced Filters:

Filters using Regular Expressions: grep and sed

Programming with awk: awk preliminaries, Splitting a line into fields, BEGIN and END sections, Built-

in variables, Arrays, Functions, Control flow, Looping

Self Learning Topics: Simple Filters. (1 Hour)

Unit IV 8 Hours

Shell Programming:

Shell Scripts, read: Making scripts interactive, Positional parameters, Exit status of command, Logical

operators && and||- Conditional execution, exit status of a command, if conditional, using test to

evaluate expression, case conditional, expr: Computation and String handling, Looping: using while,

until and for.

Unit V 8 Hours

Services and Utilities

The vi Editor: vi Preliminaries ,Quitting vi – The Last Line Mode, Inserting and Replacing Text , Saving

Text , Exit to the UNIX Shell, The Repeat Factor, The Command Mode , Navigation , Operators ,

Deleting , Moving and Yanking Text, Changing Text( c and - ), The Dot: Repeating the Last Command ,

Undoing Last Editing Instructions( u and U), String Search , Searching with Regular Expressions,

Search and Replace (:s). ftp: File Transfer Protocol , The Mail Service, The Web Service.

Self Learning Topics: Web server setup and configuration; gdb. (1 Hour)

Text Books:

1. “u ita ha Das: YOUR UNIX – The Ulti ate Guide , Tata M G aw Hill, rd reprint, 2012 (1.13, 2.1

– 2.4, 6.1-6.15, 7.1-7.5, 7.12-7.15, 8.1, 8.2, 8.6, 8.8, 8.10, 8.11, 10.1-10.7, 10.9-10.11, 10.13, 15.1-

15.12, 16.1, 16.2, 16.8, 16.11-16.15, 18.2-18.11, 18.14, 18.16, 4.1-4.16, 11.7, 24.7, 24.13, 24.14)

. “u ita ha Das: UNIX – Co epts a d Appli atio s , th Edition, Tata McGraw Hill, Copyright

©2006 (22.1-22.3)

Reference Books:

1. Beh ouz A. Fo ouza a d Ri ha d F. Gil e g: UNIX a d “hell P og a i g , Ce gage Lea i g, 2005.

2. M.G. Ve katesh u thy: UNIX & “hell P og a i g , Pea so Edu atio , 00 .

Course Outcome (COs):

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

1. Describe the architecture and features of the UNIX operating system and distinguish it from

other operating systems [L1, L2].

2. Demonstrate UNIX commands for file handling and process control [L3].

3. Construct regular expressions for pattern matching and apply them to various filters for a

specific task [L3].

4. Analyze a given problem and apply requisite facets of shell programming in order to devise a

shell script to solve the problem [L4, L3].



and engineering [PO 1].

2. Graduates will demonstrate an ability to analyze the given problems and design solutions, as per

the needs and specifications [PO 4].

3. Graduate will de o st ate skills to use ode e gi ee i g tools, softwa e’s a d e uip e t to analyze and provide solutions to problems [PO 6].



two tests out of

three

Average of two


Class

participation

Total

Marks

Maximum

Marks 25 10 10 5 50





questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be

given in the remaining three units

III Semester

Computer Organization & Architecture

Subject Code: 15CS34 Credits: 3


Hours/week: L – T – P 3– 0 – 0 SEE Marks: 50



CLO 1: To understand the operation of CPUs including I/O, Processor, Memory systems, Busses and

Computer Arithmetic.

CLO 2: To understand the different ways of communicating with I/O devices and to introduce the

hierarchical memory system including cache memories.

CLO 3: To implement different computer arithmetic algorithms for various arithmetic operations.

CLO 4: To analyze concepts of Computer Architecture like Pipelining and Instruction Level

Parallelism.

Prerequisites: Basic knowledge of computer concepts & Basic Electronics.

Unit I 8 Hours

Basic Structure of Computers:

Computer Types, Functional Units, Basic Operational Concepts, Bus Structures, Performance

– Processor Clock, Basic Performance Equation, Clock Rate, Performance Measurement, 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.

Self Learning: Historical Perspective. (2 Hours)

Unit II 6 Hours

Input/Output Organization:

Accessing I/O Devices, Program controlled I/O, Memory mapped I/O, Interrupts – Interrupt

Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices, Controlling Device

Requests, Direct Memory Access, Bus Arbitration Techniques: Centralized & Distributed, Buses :

Synchronous & Asynchronous

Self Learning: Exceptions. (1 Hours)

Unit III 8 Hours

Memory System:

Basic Concepts, Semiconductor RAM Memories, Read Only Memories, Speed, Size, and Cost,

Cache Memories–Mapping Functions, Replacement Algorithms, Performance Considerations.

Self Learning: Secondary Memory. (2 Hours)

Unit IV 8 Hours

Arithmetic:

Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication of

Positive Numbers, Signed Operand Multiplication, Fast Multiplication, Integer Division.

Self Learning: Floating-point Numbers and Operations. (1 Hours)

Unit V 8 Hours

Introduction to Computer Architecture:

Introduction, Definition of Computer Architecture, Dependability, Measuring, Reporting &

summarizing performance, Quantitative Principles of Computer Design, Pipelining & its

implementation, Instruction Level Parallelism- Concepts & challenges.

Self Learning: Classes of Computers. (1 Hours)

Text Books:

1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky: Computer Organization, 5th Edition, Tata

McGraw Hill, 2002. (Listed topics only from Chapters 1, 2, 4, 5, 6)

2. Computer Architecture, A Quantitative Approach – John L. Hennessey and David A.

Patterson: 5th Edition, Elsevier, (Listed topics only from Chapters 1- 1.1 to 1.3, 1.7 to 1.9,

Chapter 3- 3.1,Appendix C- C.1 to C.3)

Reference Books:

1. William Stallings: Computer Organization & Architecture, Edition, PHI, 2006.

Course Outcomes:

On completion of the course, the students will be able to,

1. Identify the functional units of the processor and the factors affecting the performance of a

computer [L1].

2. Demonstrate the ability to classify the addressing modes, instructions sets and design

programs [L3].

3. Discuss the computer arithmetic and design algorithms for various Arithmetic operations [L2].

4. Analyze design principles & implement concepts of computer architecture [L4].

Program Outcomes (POs) :


and engineering [PO1]

2. Graduate will be capable of participating and succeeding in competitive examinations. PO11]


Components

Average of

best of two

tests out of

three

Average of two

Assignments/Activity Quiz

Class

Participation Total marks

Maximum 25 10 10 05 50





questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be

given in the remaining three units.

III Semester

Data Structures using C

Course Code 15CS35 Credits 3

Course type PC CIE Marks 50

Hours/week: L-T-P 3– 0 – 0 SEE Marks 50

Total Hours: 38 SEE Duration 3 Hours for 100 Marks

Course learning objectives(CLOs):

CLO 1: To bring out the importance of data structures in a variety of applications.

CLO 2: To introduce linear (arrays, linked list, doubly linked list) and non linear data structures (Binary

Tree, Heap, AVL tree).

CLO 3: To present the advantages of data structures like priority queue and hash tables.

Prerequisites: Basic computer concepts & C programming.

Unit I 8 Hours

Basic concepts: Pointers and Dynamic Memory Allocation, Algorithm Specification.

Recursion: Definition, Sum of n numbers, factorial of given number, Tower of Hanoi.

Arrays and Structures: Arrays, Dynamically Allocated Arrays, Structures and Unions

Self Study: Fibonacci Series, GCD. 1 Hour

Unit II 8 Hours

Stacks and queues: Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic

Arrays, Operators, Evaluation of Expressions.

Self Study: Multiple Stacks and Queues. 2 Hour

Unit III 8 Hours

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

Linked Lists.

Applications on Linked List: Linked Implementation of Stacks, Linked Implementation of Queues.

Self Study: Additional List operations. 2 Hours

Unit IV 7 Hours

Trees: Introduction, binary trees, binary tree traversals, heaps, binary search trees, AVL trees.

Self Study: threaded binary trees.

Unit V 7 Hours

Priority queues Single- and Double-Ended Priority Queues,

Hashing: Introduction, Hashing methods, Collision Resolution Techniques.

Self Study: Binomial Heap. 2 Hours

Text Book:

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

Universities Press, 2007.(Unit I: 1.2,1.3, 2.1,2.2,2.3. Unit II: 3.1,3.2,3.3,3.4,3.6. UnitIII: 4.1,4.2,4.3.

Unit IV: 5.1,5.2, 5.3,5.6,5.7,10.2. Unit V: 9.1.)

2. Data Structures: A Pseudocode Approach with C by Richard.F.Gilberg, Behrouz.A.Forouzan, 2nd

edition 2007. (Latest Edition) (Unit I: 2.1,2.2,2.3. Unit V: 13.3,13.4)

Reference Books:

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

Education, 2003.

2. Debasis Samanta: Classic Data Structures, 2nd Edition, PHI, 2009.


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

1. Identify the appropriate and optimal data structure for a specified application.[L1]

2. Employ the benefits of dynamic and static data structures implementations. [L3]

3. Illustrate the use of different non-linear data structures and their applications.[L3]

4. Demonstrate the use of techniques like hashing, trees, heaps and priority queue in variety of

applications.[L3]


1. Graduate will be capable of participating and succeeding in competitive examinations[PO11]


engineering problems.[PO2]



two tests out of

three

Average of two


Class

participation

Total

Marks

Maximum

Marks 25 10 10 5 50







III Semester

Object Oriented Programming with JAVA



Hours/week: L-T-P 3 – 0 – 0 SEE Marks 50

Total Hours 40 SEE Duration 3 Hours for 100 Marks

Course learning objectives (CLOs):

CLO 1: Gain knowledge about basic Java language syntax and semantics to write Java programs and use

concepts such as variables, conditional and iterative execution methods etc.

CLO 2: Understand the fundamentals of object-oriented programming in Java, including defining classes,

objects, invoking methods etc and exception handling mechanisms.

CLO 3: Understand the principles of inheritance, packages and interfaces.

Prerequisites: C Programming Concepts.

Unit I 8 Hours

OOP PARADIGM: Object-oriented programming, two paradigms, three OOP principles, overriding and

exceptions, abstraction mechanisms.

JAVA BASICS: History of Ja a, Ja a uzz ords, type o ersio a d asti g. Ja a’s Magi : The Byte ode.

Self Learning: data types, variables, scope and life time of variables, arrays, operators, expressions,

control statements. (3 hours)

Unit II 8 Hours

INTRODUCING CLASSES : Class Fundamentals, The General Form of a Class, A Simple Class, Declaring

Objects, A Closer Look at new, Assigning Object Reference Variables, Introducing Methods, Adding a

Method to the Box Class, Returning a Value, Adding a Method That Takes Parameters, Constructors,

Parameterized Constructors, The this Keyword, Instance Variable Hiding, Garbage Collection, The

finalize( ) Method.

Self Learning: A Stack Class. (1 hour)

Unit III 8 Hours

A Closer Look at Methods and Classes: Overloading Methods, Overloading Constructors, Using Objects

as Parameters, A Closer Look at Argument Passing, Returning Objects, Recursion, Introducing Access

Control, Understanding static, Introducing final, Introducing Nested and Inner Classes.

The Collections Framework – Overview, The ArrayList Class, LinkedList Class, The TreeSet Class.

Self Learning: Exploring the String Class (1 hour)

Unit IV 8 Hours

Inheritance: Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of

inheritance- specialization, specification, construction, extension, limitation, combination, benefits of

inheritance, costs of inheritance. Member access rules, super uses, using final with inheritance,

polymorphism, method overriding, abstract classes, the Object class.

Unit V 8 Hours

Exception handling: Concepts of exception handling, benefits of exception handling, exception

hierarchy, usage of try, catch, throw, throws and finally, built in exceptions, creating own exception sub

classes.

Text Books:

1. Her ert “ hildt, Ja a the Co plete Refere e , TMH. 8th edition.

2. Kathy “ierra & Bert Bates, Head First Ja a , O’Reilly, 2nd Edition.

Reference Books:

1. E Balagurusamy, Progra i g ith Ja a A Pri er , TMH, 4th edition.

2. Patrick Naughto , Ja a Ha d ook , Osborne McGraw-Hill



1. Identify classes, objects, members of a class and relationships among them needed for a specific

problem [L4].

2. Write Java application programs using OOP principles and proper program structuring [L3].

3. Demonstrate the concepts of polymorphism and inheritance [L2].

4. Write Java programs to implement error handling techniques using exception handling [L3].


1. Graduates will demonstrate knowledge of mathematics, science and Information Science &

Engineering [PO1].

2. Graduates will demonstrate an ability to design a system, component or process as per needs and

specifications [PO4].

3. Graduate will be able to communicate effectively in both verbal and written form [PO8].

4. Graduate will develop confidence for self education, ability for life-long learning and self

employment [PO10].

5. Graduate who can participate and succeed in competitive examinations [PO11].

http://www.amazon.in/E-Balagurusamy/e/B00J23QQRM/ref=dp_byline_cont_book_1



two tests out of

three

Average of two

assignments/Activity

Quiz

Class

participation

Total

Marks

Maximum

Marks

25 10 10 5 50







III Semester

Data Structures using C Laboratory

Course Code 15CSL37(IS) Credits 1.5


Hours/week: L-T-P 0-0-3 SEE Marks 25

Total Hours: 36 SEE Duration 3 Hours


CLO1. Demonstrate the abstract properties of various data structures such as stacks, queues, lists,

and trees.

CLO2. Compare different implementations of data structures and to recognize the advantages and

disadvantages of the different implementations

CLO3. Able to demonstrate features of different data structures such as Linked List, Hash Table,

Queues.

Prerequisites: C programming Skills

List of experiments:

1. Design, develop, and execute a program in C to solve Tower of Hanio problem using recursion

technique.

2. Design, develop, and execute a program in C, which accepts the Internet Protocol (IP) address in

decimal dot format (ex. 153.18.8.105) and converts it into 32-bit long integer (ex. 2568095849)

using strtok library function and unions.

3. Design, develop, and execute a program in C to convert a given valid parenthesized infix arithmetic

expression to postfix expression and then to print both the expressions. The expression consists of

single character operands and the binary operators + (plus), - (minus), * (multiply) and / (divide).

4. Design, develop, and execute a program in C to evaluate a valid postfix expression using stack.

Assume that the postfix expression is read as a single line consisting of non-negative single digit

operands and binary arithmetic operators. The arithmetic operators are + (add), - (subtract), *

(multiply) and / (divide).

5. Design, develop, and execute a program in C to implement baggage carousel at airport, where the

carousel rotates circularly with a maximum capacity of 10 bags. Each passenger should pick up

his/her baggage with token provided. Perform following operations:

a. Addition of new bag to carousel.

b. Picking of bag from the carousel.

c. Show carousel status.

6. Design, develop, and execute a program in C to simulate the working of a queue of jobs, queued up

for processing where each job is defined with the following structure {job_id ,job_description

,deadline}. Provide the following operations for the same:

a. Insert

b. Delete

c. Display.

7. Design develop and execute a program in C to implement a hash table using array where customer

information like (custid, custname, & custphno) are stored as a structure, and custid will be used as

hash key. Implement the following operations for the same:

a. Insertion of a new data entry.

b. b. Search for customer information using custid.

c. Display the records. (Demonstrate collision and its handling using linear probing method).

8. Design, develop, and execute a program in C to implement an ascending ordered singly linked list.

9. Design, develop, and execute a program in C to implement singly-circular Linked list with header

node to do following operations:

a. To create a singly circular linked list with heard node for given polynomial.

b. To evaluate given polynomial by reading x value.

10. Design, develop, and execute a program in C to create binary tree with functions to perform

inorder, preorder and postorder and level order traversals and demonstrate all operations.

11. Design, develop, and execute a program in C to implement a stack using singly linked list.

12. Design, develop, and execute a program in C to implement doubly linked list where each node

consist of integer. The program should support the following operations:

a. Create a doubly linked list by adding each node at the start.

b. Insert a new node at the end of the list.

c. Delete the node of a given data if found, otherwise display appropriate massage.

d. Display the content of a list.

Books:

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

Universities Press, 2007

2. Data Structures: A Pseudocode Approach with C by Richard.F.Gilberg, Behrouz.A.Forouzan, 2nd

edition 2007. (Latest Edition)


1. Demonstrate the understanding of structured programming [L3].

2. Analyze the problem statement and able to choose right data structure for implementation [L4].

3. Develop an ability to construct robust, maintainable programs which satisfy the requirements of

user [L3].

Program Outcomes(POs) of the course:

1. Graduate will demonstrate an ability to design and conduct experiments, analyze and interpret

data [PO3].



3. Graduate will demonstrate skills to use modern engineering tools, softwares and equipment to

design and analyze problems [PO6].


employment [PO10].

5. Graduate who can participate and succeed in competitive examinations [PO11].


CIE

Conduct of lab 10

25 Journal writing 10

Lab test 5


SEE

Initial write up 2*10 = 20

50 Conduct of experiments 2*10 = 20

Viva- voce 10

Practical examination (SEE) of 3 hours duration will be conducted for 50 marks. It will be reduced to

25 marks for the calculation of SGPA and CGPA.

III Semester

Object-Oriented Programming with Java Lab

Course Code 15CSL38 Credits 1.5



Total Hours: 36 SEE Duration 3 Hours


CLO1. Demonstrate the abstract properties of various data structures such as stacks, queues, lists,

and trees.

CLO2. Compare different implementations of data structures and recognize the advantages and

disadvantages of the different implementations

CLO3. Demonstrate the features of object Oriented Programming such as encapsulation, inheritance

and polymorphism to design and develop programs in Java

Prerequisites: Basic knowledge of computer concepts & programming

List of Java Programs: The students are required to develop and execute the following programs in Java.

To

1. Find the common elements from two arrays and store them in a different array.

2. Perform the following operations on string object:

a. Reverse a string

b. Find the number of occurrences of a sub string

c. Remove a particular character from string

d. Change all characters of string to uppercase

3. Create a class called Circle and implement member functions to read radius of circle, calculate area

and circumference of circle, display the results with appropriate messages.

4. Simulate the working of BANK by implementing following functions:

a. Open Account (assume minimum balance)

b. Deposit

c. Withdraw

d. Balance Enquiry

5. A ept N i teger u ers as o and line arguments and display the minimum and maximum

among them.

6. Create a class called Tokenizer and demonstrate the use of StringTokenizer class.

7. Implement a linear search function by using method overloading concept for an array of integers,

double and character elements.

8. Implement a BANK class to demonstrate the dynamic polymorphism in Java by implementing get

Rate Of Interest member function for three different banks.

9. Implement a class for Complex numbers and perform basic arithmetic operations.

10. Design custom exception for validating age attribute of citizen for voting system.

11. Implement inheritance hierarchy for students, UG student and PG student and also implement

methods to find top scorer in UG and PG students. Demonstrate the program for at least 10

students.

12. Implement classes for Rectangle, Square, and Triangle. Implement area function for every shape.

Books:

1. Her ert “ hildt, Ja a The Co plete ‘efere e , TMH. 8th edito

2. Kathy “ierra, Bert Bates, Head First Ja a , 2nd Edition, O'Reilly Media.

Reference Books:

1. E Balagurusamy, Progra i g ith Ja a A Pri er , TMH, 4th edito .


1. Demonstrate the understanding of structured programming [L3].

2. Analyze the problem statement and able to choose right data structure for implementation [L4].

3. Demonstrate the ability to construct robust, maintainable programs which satisfy the requirements

of user [L3].

4. Implement, compile, test and run Java programs comprising more than one class to address a

particular software problem [L4].

5. Demonstrate the ability to employ/use a hierarchy of Java classes to provide a solution to a given

set of requirements [L3].


1. Graduate will demonstrate an ability to design and conduct experiments, analyze and interpret

data [PO3].



3. Graduate will demonstrate skills to use modern engineering tools, softwares and equipment to

design and analyze problems [PO6].


employment[PO10].

5. Graduate who can participate and succeed in competitive examinations[PO11].


CIE

Conduct of lab 10


Lab test 5

http://www.amazon.in/E-Balagurusamy/e/B00J23QQRM/ref=dp_byline_cont_book_1


SEE



Viva- voce 10



Bridge Course Mathematics –I

(Common for all branches)

Subject Code: 15MATDIP1

Credits: 0


Hours/week: L – T – P 2-0-0 SEE Marks: 50

Total Hours: 32 SEE Duration: 3 Hours


Students should

1. Be proficient in Complex number manipulations and representing them in Argand Plane.

2. Understand the concept of Ordinary Differentiation, geometric interpretation and developing

the Taylor’s and Maclaurin’s series

3. Be proficient in Integrating standard functions and Trigonometric functions of integral powers.

4. Be proficient in integrating trigonometric functions of integral powers, multiple integrals and their

applications

Prerequisites:

1.Trigonometry

Unit-I 6 hours

Complex Numbers:

Definitions, complex numbers as an ordered pair, real and imaginary parts, modulus and amplitude of

a complex number, equality of a complex number, polar form, De-Moivre’s theorem.

Unit-II 12 hours

Differentiatial Calculus :Ordinary differentiation : Differentiation of i) standard functions ii) Product

of functions iii) parametric equations. Successive differentiation. Taylor’s series, Maclaurin’s series of

simple functions for single variable

Partial Differentiation: Definition, Euler theorem, total differentiation, differentiation of composite

and implicit funtions, Jacobian illustrative examples and problems.

Unit-III 14 hours

Integral Calculus : Basic Integration of standard functions: Polynomials, Geometric functions and

Trignometric Functions, Integrations by parts. Discuss the conic sections-circle, Parabola, Ellipse and

Hyperbola. Area by single Integrals.

Reduction formulae: Reduction formula for , , (m and n

are positive integers) – Direct, Simple problems .Double and Triple Integrals. Area by Double Integrals

and volume by Triple Integrals.

Text Books:

1. Higher Engineering Mathematics- B. S. Grewal

2. Engineering Mathematics- H. K. Dass


1. Represent Complex numbers geometrically in Argand Plane. [L2]

2. Differentiate functions of single variable, Apply to develop the Taylors and Maclaurins series [L2,

L3]

3. Integrate standard functions and find area by integrals[L3]

4. Integrate trigonometric functions of integral powers and apply double and triple integrals to find

area and volume. [L3]

Program Outcomes (Pos) of the course:




engineering practice. [PO11]


Components Maximum of Two tests

Maximum marks 50

*Students have to score minimum 20 marks in CIE to appear for SEE


* Question paper contains 08 questions each carrying 20 marks.

* Students have to answer any FIVE full questions.


marks.

Note: Students have to pass Bridge Course Mathematics – I (15BCMAT31) before

advancing to 7th

semester

Semester IV

Engineering Mathematics-IV

(Computer Science / Information Science)

Subject Code: 15MAT41CS/IS

Credits: 4


Hours/week: L – T – P 3 –1– 0 SEE Marks: 50



Students should

1. Learn the concept of Interpolation and use appropriately.

2. Understand and apply the Logic of mathematics in the field of Computer science.

3. Understand the concept of Functions and Relations.

4. Get acquainted with basic concepts of Graph Theory and their applications.

5. Get acquainted with different Algebraic Structures, Prime number and their properties for

applications in Cryptography.

Prerequisites:

1. Set Theory

Unit-I 10 hours

Finite Differences and Interpolation:, For ard a d Ba k ard differe es, Ne to ’s For ard a d Ba k ard I terpolatio For ulae, Di ided Differe e, Ne to ’s Di ided Differe e For ula

(without proof). Lagra ge’s I terpolatio For ula. Illustrative examples. Numerical Integration:

Newton- Cotes Quadrature formula, Trapezoidal rule, Simpsons 1/3rd

rule, Simpsons 3/8th

rule,

Weddle’s rule.Practical Examples.

Unit-II 10 hours

Fundamentals of Logic: Basic connectives and Truth tables, Logical equivalence- Laws of Logic,

Logical Implication-Rules of Inference. Quantifiers- Universal and Existential Quantifiers.

Unit-III 10 hours

Relations and Functions: Cartesian Products, Relations, Functions – One-to-One, Onto functions,

Special functions, Properties of Relations, Computer recognition: Zero-One Matrices and Directed

Graphs, Partial Orders: Hasse Diagrams, Equivalence Relations and Partitions.

Unit-IV 10 hours

Introduction to Graph Theory: Definitions and Examples, Subgraphs, Complements and Graph

Isomorphism, Vertex, Degree. Euler Trails and Circuits, Planar Graphs, Hamiltonian Paths and

Cycles.

Unit-V 10 hours

Finite Fields and Elementary Number Theory: Groups, Rings, Fields, Modular Arithmetic, Euclids

Algorithm, Finite fields of the form GF(p).Polynomial Arithmetic. Finite fields of the form GF(2m

)

Prime Numbers, Fermat’s and Euler’s theorem. Testing of Primality, Chinese Remainder Theorem.

Elliptic Curve Arithmetic.

Text Books:

1. B.S. Grewal – Higher Engineering Mathematics, Khanna Publishers, 42nd

Edition, 2012.

2. Kol a , Bus y, Ross Dis rete Mathe ati al “tru tures , th Edition Prentice Hall of India,

2010.

3. William Stallings –Cryptography and Network Security, Pearson Prentice Hall 6th

Edition,2013.

4. Dr. D. S. Chandrasekharaih, Graph Theory a d Co i atori s , Pris Books P t. Ltd, th

Edition, 2012

5. Dr. D. S.Chandrasekharaih, Dis rete Mathe ati al “tru tures , Pris Books P t. Ltd, th

Edition, 2012

Reference Books:

1. Erwin Kreyszig –Advanced Engineering Mathematics, John Wiley & Sons Inc., 9th

Edition,

2006

2. Peter V. O’ Neil – Advanced Engineering Mathematics, Thomson Brooks/Cole, 7th

Edition,

2011.

3. Glyn James – Advanced Modern Engineering Mathematics, Pearson Education, 4th

Edition,

2010.

4. Ralph P Gri aldi, Dis rete and Co i atorial Mathe ati s , th Edition, Pearson

Education, 2004

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

1. Use Finite differences in Interpolation.[L3]

2. Understand and Apply the Logic of mathematics in the field of Computer science [L2,L3]

3. Explain and Analyze different Relations Functions.[L2, L3]

4. Understand basic concepts of Graph Theory and Use in Computer Science. [L2, L3]

5. Explain the concept of Finite Fields and Apply in Cryptograhy. [L2,L3]

Program Outcomes (POs) of the course: Students will acquire







best two tests

out of three

Average of

two

Assignments/

Mathematical

/Computation

al/Statistical

tools of 4 labs

in a semester

Quiz/Seminar/

Project

Class

Participation

Total

Marks

Maximum 25 10 10 5 50


* Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE

full questions.

* SEE question paper will have Two compulsory questions and choice will be given to

remaining three units.

* SEE will be conducted for 100 marks of three hours duration. It will be reduced to 50 marks

for the calculation of SGPA and CGPA.

IV Semester

Operating Systems






CLO 1: To introduce the functions of operating system, design, structure and associated system

calls.

CLO 2: To study and analyze various scheduling algorithms and process synchronization

techniques.

CLO 3: To develop an understanding about deadlocks and deadlock recovery techniques.

CLO 4: To discuss and realize the importance memory management techniques.

CLO 5: To gain the knowledge of file systems and secondary storage structures.

Prerequisites: Basic Electronics, Basic knowledge of computer concepts & programming.

Unit I 7 Hours

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; Operating System Services; User - Operating System interface; System calls; Types of

system calls; Operating System design and implementation; Operating System structure; Virtual

machines; System boot.

Self Learning Topics: Operating System structure; Virtual machines; System boot. (2 Hours)

Unit II 8 Hours

Process Management: Process concept; Process scheduling; Operations on processes; Multi-Threaded

Programming: Overview; Multithreading models; Process Scheduling: Basic concepts; Scheduling

criteria; Scheduling algorithms.

Process Synchronization: “y hro izatio : The Criti al se tio pro le ; Peterso ’s solutio ; Synchronization hardware; Semaphores; Classical problems of synchronization.

Unit III 7 Hours

Deadlocks: Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks;

Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Unit IV 8 Hours

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.

Case Study: Creating Shared memory, calculating page/segment size of a user process in Linux/Windows

Self Learning Topics: Case Study: Creating Shared memory, calculating page/segment size of a user

process in Linux/Windows. (2 Hours)

Unit V 8 Hours

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.

Case Study: i-Node Structure in UNIX and DOS FAT File system respective management APIs.

Secondary Storage Structures: : Mass storage structures; Disk structure; Disk attachment; Disk

scheduling;

Self Learning Topics: Case Study: i-Node Structure in UNIX and DOS FAT File system respective

management APIs. (2 Hours)

Text Book:

1. A raha “il ers hatz, Peter Baer Galvi , Greg Gag e, Operati g “yste Pri iples , /E, Wiley-

India, 2013. (Chapter No. )

2. D.M Dha dhere, Operati g syste s , A o ept ased Approa h , /E, Tata McGraw- Hill,

2002.

Reference Books:

1. Gary Nutt, Operati g “yste , rd /E, Pearso Edu atio . 2. Harvey M Deital, Operati g syste s , /E, Addiso Wesley, .


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

1. Identify the system calls, protection, and interrupts of any general operating systems.[L2]

2. Write application keeping concurrency and synchronization, semaphores/monitors, shared

memory, mutual exclusion, process scheduling services of GOS in the mind.[L3]

3. Explain memory management, file management and secondary memory management

techniques. [L2]



engineering problems. [PO2]


the needs and specifications. [PO4]

3. Graduates will develop confidence for self education and ability for lifelong learning [PO10]

4. Graduate will be capable of participating and succeeding in competitive examinations. [PO11]


Components Average of best two

tests out of three

Average of two

assignments Quiz/Seminar/

Project

Class

participation

Total

Marks

Maximum

Marks 25 10 10 5 50

IV Semester

Web Programming






CLO 1: Introduce the fundamentals of internet and World Wide Web. Describe web browsers, web

servers, URLs, MIME types and HTTP.

CLO 2: Discuss Extensible Markup Language and explain the XHTML document structure and the different

tags used to display text, images, links, tables, frames, forms and lists.

CLO 3: Present the capabilities of JavaScript and demonstrate the use of expressions, screen output and

keyboard input, arrays, functions and pattern matching.

CLO 4: Associate the use of JavaScript with XHTML documents and implement XHTML program to handle

events from body elements using DOM and DOM2. Create a XML document and describe its

structure, namespace and schema

CLO 5: Apply PHP to accept and process form details and store it in a database.

Prerequisites:

Basic computer science concepts such as procedures, decision statements, and loops.

Basic data structures such as lists, dictionaries, and hash tables.

Object-oriented programming.

UNIT I 8 Hours

Fundamentals of Web, XHTML and CSS:

Fundamentals of Web:Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; The Web

Programmers Toolbox.

XHTML: Basic syntax; Standard structure; Basic text markup; Images; Hypertext Links; Lists, tables, Forms,

Frames, Bootstrap.

Self Learning: CSS: Introduction; Levels of style sheets; Selector forms; Property value forms; Font

properties; List properties; Color; Alignment of text; The box model; Background images; The <span>

and<div> tags, Conflict resolution. (3 hrs)

UNIT II 6 Hours

Javascript and XHTML Documents

Overview of Javascript: Syntactic characteristics; Primitives, operations, and expressions; Screen output

and keyboard input; Control statements; Object creation and modification; Arrays; Functions; Constructor;

Pattern matching using regular expressions; Errors in scripts; Examples. The Javascript execution

environment.

UNIT III 6 Hours

Javascript with DOM and XML

The Document Object Model: Element access in Javascript; Events and event handling; Handling events

from the Body elements, Button elements, Text box and Password elements; The DOM 2 event model; The

navigator object

XML: Introduction to XML – Syntax , XML document structure, Document Type definition , Name spaces ,

XML Schemas , Displaying Raw XML documents, Displaying XML documents with CSS , XSLT style sheets,

XML processors.

Self Learning: The DOM 2 event model; The navigator object. (2 hrs)

UNIT IV 10 Hours

PHP Introduction , Database Access through the Web

PHP: Origins and uses of PHP; Overview of PHP; General syntactic characteristics;; Functions; Pattern

matching; Form handling; Files; Cookies; Session tracking.

Database Access Through the Web: Relational Databases, Multi-valued Attributes, Structured Query

Language, Client/Server Database Architecture, PHP and Database Access, The Java JDBC Architecture,

Database Access Architecture, The MySQL Database System, MySQL Commands, The DBI Module.

Self Learning: PHP Primitives, operations and expressions; Output; Control statements; Arrays DB Access

with PHP and MySQL, Connecting to MySQL, JDBC and MySQL, Metadata. (2 hrs)

UNIT V 8 Hours

MVC-Framework for Php

Introduction to MVC: What Is MVC?, Popular MVC Frameworks Foundation: Autoloading, Exceptions, Type

Methods, Metadata Base Class : Getters and Setters, Magic Methods, Adding Introspection, Transparent

Getters/Setters; Configuration: Associative Arrays, INI Files

Caching: Performance Bottlenecks, The Code; Registry: Singleton, Registry.

Books:

Text Books:

1. Robert W. Sebesta: Programming the World Wide Web, 5th edition, Pearson education, 2006.

2. Chris Pitt: ProPHP MVC, Distributed to Book world trade worldwide by Springer science and

Business Media, 2012

Reference Books:

1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to program, 3rd Edition, Pearson

education, 2004.

2. Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley India,2006.

3. Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003.

4. Robin Nixon , Learning PHP, MySQL & JavaScript: O Reily 2005.


Indicate the Bloom’s level at the end of each outcome. Highlight the action verb representing the Bloom’s

level.

1. To explain the internet related internet concepts that are vital in understanding web development.

[L 1]

2. To paraphrase the insights of internet programming and implement complete application over the

web. [L 2]

http://www.amazon.com/Robin-Nixon/e/B002K8U1WC/ref=dp_byline_cont_book_1

3. To demonstrate the important HTML tags for designing static pages and separate design from

content using Cascading Style sheet. [L 2]

4. To summarize the concepts of JavaScript and XML. [L 5]

5. To compose web application development programming and scripting languages, PHP and

CSS, mysql etc. and identify the environments currently available on the market to design web

sites. [L 5]

6. To demonstrate the application of MVC framework in a web application. [L 2]


1. An ability to understand the basic concepts of Internet programming and protocols used. [PO1]

2. To create applications using HTML, XHTML, CSS and Java Script. [PO2]

3. To develop web applications using php. [PO3]

4. To work with mysql, Web Database interaction with php. [PO4]



two tests out of

three

Average of two


Project

Class

participation

Total

Marks

Maximum

Marks 25 10 10 5 50





questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be given in

the remaining three units. (Kindly incorporate/mention the changes in the pattern of SEE question paper,

if required, based on the content of course)

IV SEMESTER

Design and Analysis of Algorithm






CLO 1: To discuss the importance of the study of algorithms.

CLO 2: To study and analyze time complexity of various algorithms

CLO 3: To discuss various algorithm design techniques.

CLO 4: To develop an understanding among the working of the efficient algorithms.

CLO 5: To discuss various string matching algorithms

Prerequisites:



Basics of Graph theory

Unit I 8 Hours

Introduction: Fundamentals of Algorithmic Problem Solving, Analysis Framework, Asymptotic Notations

and basic efficiency classes, Mathematical Analysis of Non-Recursive and Recursive Algorithms, Brute

Force Approaches: Introduction, Selection Sort, linear search.

Self Learning: Short Tutorial on Recurrence Relations, Bubble Sort( 1Hr)

Unit II 8 Hours

Divide and Conquer: Divide and Conquer technique, Binary Search, Merge Sort, Quick Sort and their

performance comparison.

Decrease-and-Conquer: Decrease and Conquer techniques, Insertion Sort, Depth First Search and

Breadth First Search

Transform and Conquer: T a sfo a d Co ue St ategy, Heaps a d Heap So t, Ho e ’s Rule a d Binary Exponentiation.

Self Learning: Multiplicatio of Large I tegers a d Strasse ’s Matrix Multiplicatio (2 Hrs)

Unit III 8 Hours

The Greedy Method: The General Method, Knapsack Problem, Minimum-Cost Spa i g T ees: P i ’s Algo ith , Si gle Sou e Sho test Paths: Dijkst a’s Algorithm, Bellman-Ford Algorithm, Huffman Trees.

Self Learning: Kruskal’s Algorith ( 1 Hr)

Unit IV 8 Hours

Dynamic Programming: The Ge e al Method, Wa shall’s Algo ith , Floyd’s Algo ith fo the All-Pairs

Shortest Paths Problem, Single-Source Shortest Paths: General Weights, 0/1 Knapsack, The Traveling

Salesperson problem.

Self Learning: String Editing (1 Hr)

Unit V 7 Hours

String Matching: Input Enhancement in String Matching, Rabin- Karp Algorithm

Backtracking: n - Quee s’s p o le , Ha ilto ia Ci uit P o le , Su set –Sum Problem.

Branch-and-Bound: Assignment Problem, Knapsack Problem, Traveling Salesperson Problem.

Self Learning: Naïve String Matching Algorithm (1Hr)

Text Books:

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

Edition,

2007. (1.2, 2.1, 2.2, 2.3, 2.4; 3.1, 4.1, 4.2, 4.3, 4.5; 5.1, 5.2, 6.4, 6.5, 7.2, 9.1, 9.2, 9.3, 9.4; 12.1, 12.2,

20.1, Appendix B)

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

Universities Press, 2nd Edition, 2007. (4.1, 4.3, 4.9, 5.1, 5.3, 5.4, 5.6, 5.7, 5.9)

3. Kenneth Berman, Jerome Paul, Algorithms, Cengage Learning, 2002 (12.2.1, 20.2)

4. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, introduction to Algorithms,

PHI, 3rd

Edition, 2010.

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

Strategic Approach, TataMcGraw Hill, 2005

6. Narasimha Karumanchi, Data structures and Algorithms Made Easy, Career Monk Publications, 2nd

Edition, 2015


Upon completion of the course the students will be able to:

1. Identify an appropriate algorithm design technique for a given problem.[L1]

2. Formulate and Solve recurrence equation and compute time complexity of recursive and iterative

algorithms.[L3]

3. Construct iterative and recursive techniques for some select algorithms.[L3]

4. Construct graph search algorithms, string matching algorithms, sorting algorithms.[L3]

Program Outcomes(POs) of the course:

1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical reasoning and

engineering. [PO1]


engineering problems [PO2]



4. Graduates will develop confidence for self education and ability for lifelong learning. [PO10]




two tests out of

three

Average of two


Project

Class

participation

Total

Marks

Maximum

Marks 25 10 10 5 50

IV Semester

Microprocessor and Microcontroller

Course Code: 15CS45 Credits: 3





CLO 1: To study the i ter al ar hite ture of I tel s 8 8 i ropro essor a d 8 Mi ro o troller. CLO 2: To develop the skill of designing and writing assembly language programs for 8086

Microprocessor.

CLO 3: To program the 8051 microcontroller for Timers, Serial Ports and Interrupts in C.

CLO 4: To present the techniques of interfacing the LCD, Keyboard, ADC, DAC and Sensors with 8051

Microcontroller.

Prerequisites:

Basic Electronics


Logic Design & Applications

Unit I 7 hours

8086 Microprocessor Architecture:

Overview of microcomputer structure and operation, , 8086 internal architecture, introduction

to programming the 8086 microprocessor, data and memory addressing modes of 8086 microprocessor.

Self Learning: Microprocessor evolution and types, the 8086 microprocessor family overview (1 Hr)

Unit II 8 hours

Instruction Set and Programming of 8086 microprocessor:

Instruction set of 8086 microprocessor, , Instruction template with example of MOV instruction,

writing simple assembly language program, delay calculation and programming, interfacing RAM to

8086 microprocessor.

Self Learning: Assembler Directives (1 Hr)

Unit III 7 hours

Introduction to 8051 Microcontroller:

Internal architecture of 8051 microcontroller, 8051 programming model, 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.

Self Learning: Accessing code ROM space in 8051 C, Data serialization using 8051 C (2 Hrs)

Unit IV 8 hours

Timer, Serial Port and Interrupt Programming in 8051 C:

Programming 8051 timers, counter programming, programming timers 0 and 1 in 8051 C, basics

of serial communication, 8051 connection to RS232, serial port programming in C. 8051 interrupts,

programming timer interrupts, programming external hardware interrupts, programming serial

communication interrupt,

Self Learning: Interrupt priority in 8051 C, interrupt programming in C (2 Hrs)

Unit V 8 hours

LCD and Keyboard Interfacing:

LCD interfacing, Keyboard interfacing. ADC, DAC and Sensor Interfacing: Parallel ADC 0804

interfacing with 8051, DAC 0808 interfacing with 8051,

Self Learning: Signal conditioning and interfacing the temperature sensor LM35 to the 8051 (1 Hr)

Text Books:

1. Douglas V Hall: Microprocessors and Interfacing, 2nd

Edition, The McGraw-Hill Companies. [2.6,

2.9, 2.11, 2.12, 2.16 , 3.13 to 3.18, 4.31 to 4.33, 6.1 to 6.36].

2. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay: The 8051 Microcontroller and

Embedded Systems Using Assembly and C, 2nd

Edition, Pearson Prentice Hall. [1.1, 1.2, 7.1 to

7.6, 9.1 to 9.3, 10.1, 10.2, 10.5, 11.1 to 11.6, 12.1, 12.2, 13.1 to 13.3].

Reference Books:

1. Barry B Brey: The Intel Microprocessors, 8thEdition, Pearson Education, 2009

2. Kenneth Ayala: The 8051Microcontroller, 3rd

Edition, Cengage Learning.



1. Design and write the assembly language programs for simple computing tasks using 8086

Microprocessor. [L3]

2. Design a d rite C progra s for Ti ers, Serial ports a d I terrupts usi g 8 Mi ro o troller. [L3]

3. Demonstrate the a ility to rite a d de elop C progra s to i terface LCD, Keyboard, ADC/

DAC and Sensors using 8051 Microcontroller.[L3]



and engineering. [PO1]


software, analyze and interpret data. [PO3]





best two tests

out of three

Average of

two

assignments

Quiz/

Seminar/Project

Class

Participation

Total Marks

Maximum

Marks

25 10 10 5 50






in the remaining three units. (Kindly incorporate/mention the changes in the pattern of SEE question

paper, if required, based on the content of course)

IV SEMESTER

DATABASE MANAGEMENT SYSTEMS






CLO 1: To discuss and realize the importance of Database Architecture Design notations, ER Modeling,

Relational algebra and Transactions.

CLO 2: To gain the knowledge of writing SQL, PL/SQL for various real-time business applications.

CLO 3: To introduce normalization and discuss various normal forms.

Prerequisites:

Basic computer science concepts

Data structures.

Unit I 10 Hours

Introduction: Introduction to database, Characteristics of Database approach, Advantages of using DBMS

approach, When not to use a DBMS. Data models, schemas and instances. Three-schema architecture and

data independence; Database languages and interfaces, The database system environment, Centralized and

client-server architectures, Classification of Database Management systems.

Entity-Relationship Model: Using High-Level Conceptual Data Models for Database Design; An Example

Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship Sets,

Roles and Structural Constraints; Weak Entity Types, Naming Conventions and Design Issues.

Self Learning Topics: The database system environment, Centralized and client-server architectures,

Classification of Database Management systems.(2 Hours)

Unit II 10 Hours

Relational Model and Relational Algebra: Relational Model Concepts; Relational Model Constraints and

Relational Database Schemas; Update Operations, Transactions and dealing with constraint violations;

Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary

Relational Operations: JOIN and DIVISION; Additional Relational Operations; Examples of Queries in

Relational Algebra; Relational Database Design Using ER- to-Relational Mapping.

Unit III 10 Hours

SQL : SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in

SQL; Basic queries in SQL; More complex SQL Queries. Insert, Delete and Update statements in SQL,

Specifying constraints as Assertion and Trigger, Views.

Unit IV 10 Hours

PL/SQL : PL/SQL Block Structure, PL/SQL Variables, PL/SQL Function , PL/SQL Procedure , PL/SQL Nested

Block , PL/SQL IF Statement , PL/SQL LOOP Statement , PL/SQL WHILE Loop Statement, PL/SQL FOR Loop

Statement ,PL/SQL Exception Handling, PL/SQL Cursor.

http://www.plsqltutorial.com/plsql-block-structure/

http://www.plsqltutorial.com/plsql-variables/

http://www.plsqltutorial.com/plsql-function/

http://www.plsqltutorial.com/plsql-procedure/

http://www.plsqltutorial.com/plsql-nested-block/

http://www.plsqltutorial.com/plsql-nested-block/

http://www.plsqltutorial.com/plsql-if-statement/

http://www.plsqltutorial.com/plsql-loop-statement/

http://www.plsqltutorial.com/plsql-while-loop/

http://www.plsqltutorial.com/plsql-for-loop/

http://www.plsqltutorial.com/plsql-for-loop/

http://www.plsqltutorial.com/plsql-exception/

http://www.plsqltutorial.com/plsql-cursor/

Self Learning Topics: PL/SQL Exception Handling, PL/SQL Cursor. (2 Hours)

Unit V 10 Hours

Database Design: Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal

Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms; Boyce-Codd Normal

Form, Multivalued Dependencies and Fourth Normal Form; Join Dependencies and Fifth Normal Form,

Inclusion Dependencies; Other Dependencies and Normal Forms.

Transaction Management: The ACID Properties; Transactions and Schedules; Concurrent Execution of

Transactions; Lock- Based Concurrency Control; Performance of locking; Transaction support in SQL;

Introduction to crash recovery; 2PL, Serializability and Recoverability; Lock Management; Introduction to

ARIES, The write-ahead log protocol.

Self Learning Topics: Introduction to ARIES, The write-ahead log protocol. (3 Hours)

TEXT BOOKS:

1. Elmasri and Navathe: Fundamentals of Database Systems, 5th

Edition, Addison-Wesley, 2007 (Chapter

No. 1, 2, 3, 5, 6, 7.1, 8, 10)

2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3rd

Edition, McGraw-Hill,

2003. (Chapter No. 16)

3. PL/SQL course material

REFERENCE BOOKS:

1. Silberschatz, Korth and Sudharshan: Data base System Concepts, 5th Edition, Mc-GrawHill, 2006.

2. C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, 8th Edition, Pearson

education, 2006.


1. Apply the database concepts and design database for given information system.[L 3]

2. Create database and develop database programming skills in SQL and PL/SQL.[L 5]

3. Apply the concepts of Normalization and design database which possess no anomalies.[L 3]

4. Explain the issues of transaction like concurrency control, recovery and security. [L 2]


1. Graduates will demonstrate the ability to identify, formulate and solve computer systems engineering

problems. [PO2]

2. Graduates will demonstrate the ability to design and experiment both in hardware and software, analyze

and interpret data. [PO3]

3. Graduates will demonstrate an ability to analyze the given problems and design solutions, as per the

needs and specifications. [PO4]

4. Graduates will develop confidence for self education and ability for lifelong learning [PO10]


http://www.plsqltutorial.com/plsql-exception/

http://www.plsqltutorial.com/plsql-cursor/



two tests out of

three

Average of two


Project

Class

participation

Total

Marks

Maximum

Marks 25 10 10 5 50





questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be given in

the remaining three units.

IV Semester

Design and Analysis of Algorithms Laboratory

Course Code 15CSL47 Credits 1.5

Course Type PC CIE 25

Hours/week: L-T-P 0-0-3 SEE Marks: 25

Total Hours 40 SEE Duration: 03 Hours


CLO 1. Illustrate the importance of algorithms in a variety of applications.

CLO 2. Illustrate the use of recursive/iterative sort algorithms in different scenarios.

CLO 3. Demonstrate time complexity of various algorithms using various design techniques.

CLO 4. Demonstrate efficient algorithms by drawing comparisons.

CLO 5. Illustrate the use of algorithms for graph search problems.

Prerequisites:



Platforms:

C/Java Language in LINUX /Windows environment.

List of Programs:

1. Implement Insertion Sort algorithm and determine the time required to sort the elements.

Repeat the experiment for different values of n, the number of elements in the list to be sorted

and plot a graph of the time taken versus n.

2. Implement Heap Sort algorithm and determine the time required to sort the elements. Repeat

the experiment for different values of n, the number of elements in the list to be sorted and plot

a graph of the time taken versus n.

3. Implement Quick Sort algorithm and determine the time required to sort the elements. Repeat

the experiment for different values of n, the number of elements in the list to be sorted and plot

a graph of the time taken versus n.

4. Implement Merge Sort algorithm to sort a given set of elements and determine the time

required to sort the elements. Repeat the experiment for different values of n, the number of

elements in the list to be sorted and plot a graph of the time taken versus n.

5. Implement 0/1 Knapsack problem using Dynamic Programming.

6. From a given vertex in a weighted connected graph, find shortest paths to other vertices using

Dijkstra's algorithm.

7. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm.

8. Find a subset of a given set S = {sl, s2,.....,sn} of n positive integers whose sum is equal to a given

positive integer d. For example, if S={1, 2, 5, 6, 8} and d = 9 there are two

solutions{1,2,6}and{1,8}. A suitable message is to be displayed if the given problem instance

doesn't have a solution.

9. Find the Mi i u Cost Spa i g Tree of a give u directed graph usi g Pri ’s algorith .

10. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.

11. Implement DFS algorithm and check if the graph is connected.

12. Implement N Queen's problem using Back Tracking.


Upon completion of the course the students will be able to:

1. Identify and implement an appropriate algorithm design technique for a given problem.[L1]

2. Implement and Compute time required for recursive and iterative algorithms.[L3]

3. Design algorithms for specific applications using appropriate techniques.[L6]

4. Design graph search and sorting algorithms.[L6]


1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical reasoning and

engineering. [PO1]


engineering problems [PO2]






CIE

Conduct of lab 10


Lab test 5


SEE



Viva- voce 10



IV Semester

Microprocessor and Microcontroller Laboratory

Subject Code: 15CSL48 Credits: 1.5





CLO 1: To develop the skill of designing and writing assembly language programs for 8086

Microprocessor.

CLO 2: To present the techniques of interfacing the LCD, ADC, DAC and stepper motor with 8051

Microcontroller in C.

Prerequisites:

Basic Electronics


Logic Design & Applications

List of Experiments:

PART A

1. a) Write a ALP to add N u sig ed i ar u ers a d store result i the e or lo atio SUM.

b) Write an ALP to perform block data transfer from LOC1 to LOC2.

2. Write an ALP to find GCD and LCM of two 8-bit unsigned numbers.

3. Write an ALP to find largest and smallest number in an array and store in memory location.

4. Write an ALP to calculate the function y= 4 +10, here is u sig ed 8 it binary

number.

5. Write a ALP to ou t u er of s i a gi e it i ar u er. 6. Write an ALP to sort unsigned 16-bit binary numbers in ascending/descending order using

bubble sort.

7. Write an ALP to find factorial of a single digit unsigned integer using recursive procedure.

8. Write an ALP to illustrate the significance of Procedures and Macros.

PART B

1. Write 8 C progra to i terfa e stepper otor to rotate the otor i spe ified dire tio (clockwise or counter-clockwise) by N steps. Introduce suitable delay between successive steps.

2. Write 8 C progra to ge erate the follo i g a efor s usi g DAC i terfa e

i) Square/ Rectangular

ii) Triangular

3. Write 8 C progra to ge erate the follo i g a efor s usi g DAC i terfa e

i) Staircase

ii) Sine

4. Write 8 C progra to i terfa e LCD displa to displa the stri g GITC“E . 5. Write 8 C progra to i terfa e ADC to o ert a alog i put to digital.

Text Book:

1. Douglas V Hall: Microprocessors and Interfacing, 2nd

Edition, The McGraw-Hill Companies.

2. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay: The 8051 Microcontroller and

Embedded Systems Using Assembly and C, 2nd

Edition, Pearson Prentice Hall.

Reference Books:

1. Barry B Brey: The Intel Microprocessors, 8thEdition, Pearson Education, 2009

2. Kenneth Ayala: The 8051Microcontroller, 3rd

Edition, Cengage Learning.



1. Design and write the assembly language programs for simple computing tasks using 8086

Microprocessor. [L3]

2. Demonstrate the a ilit to rite a d de elop C progra s to i terfa e LCD, ADC/ DAC a d Stepper motor using 8051 Microcontroller.[L3]



and engineering. [PO1]


software, analyze and interpret data. [PO3]




CIE

Conduct of lab 10


Lab test 5


SEE



Viva- voce 10



Principles of Engineering Design 15PED49

Syllabus yet to be finalized

Bridge Course Mathematics -II

Subject Code: 15MATDIP2

Credits: 0





Students should

1. Study the properties of Straight Lines and Planes in space.

2. Understand the geometry of Vectors and also the geometrical and physical

interpretation

of their derivatives.

3. Be proficient in Laplace Transforms and solve problems related them.

4. Get acquainted with Inverse Laplace Transform and solution of differential equations.

Prerequisites:

1. Trigonometry

2. Basic Differentiation

3. Basic Integration

Detailed Syllabus

Unit-I 12 hours

Linear Algebra:

Rank of a matrix by elementary transformation, Solution of system of linear equations-

Gauss Jordan method and Gauss-seidal method. Eigen values and Eigen vectors, Largest

Eigen value by Rayleigh’s Power method.

Unit-II 10 hours

Vectors

Vector Algebra: Vector addition, multiplication (Dot and Cross products) Scalar produt,

Vector product and Triple product, Vector differentiation- Velocity, Acceleration of a Vector

point function, Gradient, Curl and Divergence, Solenoidal and Irrotational fields, simple

and direct problems.

Unit-III 10 hours

Laplace Transforms:Definition, Laplace transforms of elementary functions, derivatives and

integrals

Inverse Laplace Transforms:Inverse transforms, applications of Laplace transform to

differential equations.

Text Books:

1. Higher Engineering Mathematics- B. S. Grewal

2. Higher Engineering Mathematics- H K Dass


1. Understand and Interpret the System of equations and various solutions. [L2, L3]

2. Interpret the geometry of Vectors and the applications of their derivatives. [L3]

3. Evaluate Laplace Transforms and their properties and solve problems related them. [L3]

4. Evaluate Inverse Laplace transform and Use Laplace Transforms in solving Differential

Equations. [L3]

Program Outcomes (Pos) of the course: Students will acquire






Components Maximum of two tests

Maximum marks 50

*Students have to score minimum 20 marks in CIE to appear for SEE


* Question paper contains 08 questions each carrying 20 marks.

* Students have to answer any FIVE full questions.


marks.

Note : Students have to pass Bridge course Mathematics – II (15BCMAT41) before

advancing to 7th

semester

.

Fourth Semester - Gogte Institute of Technology · Third Semester S.No. Code Course Credits Total...

Documents

Transcript of Fourth Semester - Gogte Institute of Technology · Third Semester S.No. Code Course Credits Total...