detail teaching schemerku.ac.in/syllabus/syllabus/0003-2017-2018-rku.pdf · 2018-07-03 · syllabus...

DETAIL TEACHING SCHEME

SCHOOL OF ENGINEERING PROGRAM : B. TECH – INFORMATION TECHNOLOGY

ACADEMIC YEAR - 2018-19 SEMESTER – III (Batch: 2017-21)

DEFINATION OF ONE CREDIT : 1. Lecture(L): 1 hour / week / semester, 2. Practical(P): 2 hour / week / semester, 3. Tutorial(T): 2 hour /

week / semester

Course

Code Course Name

Teaching Hours Credits

Audit

course CIE PSEE

Theory Tutorial Practical

CE322 Object Oriented Programming

with C++ 3 0 4 5 N Y Y

CE317 Data Structures 3 0 4 5 N Y Y

EC308 Basic Electronics 3 0 2 4 N Y Y

CE519 Database Management

Systems 3 0 2 4 N Y Y

APS301 Differential Equations 4 0 0 4 N Y N

CE318 Computer Peripherals and

Maintenance 0 0 2 1 N Y Y

Total 16 00 14 23

Total Hours 30

N- No CIE – Continuous internal evaluation

Y – Yes PSEE – Practical semester end examination including ITD, Dissertation, Industrial project, Industrial training etc..

SYLLABUS

2018-19 B.TECH 3rd SEM INFORMATION TECHNOLOGY (2017-21 BATCH) Page 1

Course Title Basic Electronics

Course Code EC308

Course Credit

Theory : 03

Practical : 01

Tutorial : 00

Credits : 04

Course Learning Outcomes

After completion of the course students will be able to:

Understand the internal structure and performance of semiconductor devices Understand the basic electronics engineering principles Design and Perform experimental analysis of various electronic circuits Compare mathematical representations of circuit behavior with corresponding

practical effects Develop proficiency in simulation of basic electronics circuits using simulation

tools in Laboratory and verify the same on hardware

Detailed Syllabus

Sr. No.

Name of chapter & details Hours

Allotted

Section – I

1 Transport Phenomena in Semiconductors Mobility and Conductivity, Electrons and Holes in an Intrinsic Semiconductor, Donor and Acceptor Impurities, Charge Densities in a Semiconductor, Electrical Properties of Ge and Si, The Hall Effect, Conductivity Modulation, Generation and Recombination of Charges, Diffusion, The Continuity Equation

06

2 Junction –Diode Characteristics Open –Circuited p-n Junction, p-n Junction as a Rectifier, Volt-Ampere Characteristic, Temperature Dependence of the V/I Characteristic, Diode Resistance, Space Charge, Transition Capacitance, Diffusion Capacitance , Junction Diode Switching Times, Breakdown Diodes, Tunnel Diode, Semiconductor Photodiode, Photovoltaic Effect, Light –Emitting Diodes

06

3

Diode Circuits Diode as a Circuit Element, Load-Line Concept, Piecewise Linear Diode Model, Clipping Circuits, Clipping at Two Independent Levels, Comparators, Rectifiers, Other Full-Wave Circuits, Capacitor Filters.

05

SYLLABUS


Instructional Method and Pedagogy:

Lectures will be conducted with the aid of multi-media projector, blackboard, OHP etc. Assignments based on course contents will be given to the students at the end of each unit/topic and will be evaluated at regular interval

Minimum ten experiments shall be there in the laboratory related to course contents

Reference Books:

1. J. Millman, C. Halkias and C. Parikh, “Integrated Electronics”, Tata McGraw Hill Publication, 2nd Ed, New Delhi

2. R. Boylestad and L. Nashelsky, "Electronic Devices and Circuit Theory", Pearson, 10th Ed, New Delhi

3. A. Malvino, “Electronics Principles”, Tata McGraw Hill Publication, 6th Ed, New Delhi

Additional Resources

http://pveducation.org/pvcdrom/pn-junction/pn-junction-diodes http://www.electronics-tutorials.ws/ http://www.engineersgarage.com/electronic-circuits http://www.eleccircuit.com/simple-electronic-circuits/ http://www.nptel.ac.in/courses/Webcourse-contents/IIT-ROORKEE/BASIC-

ELECTRONICS/home_page.htm

4

Communication and Interfacing Ports Introduction to COM port, USB2.0 port, USB3.0 port, HDMI port.

04

Section – II

5 Transistor Characteristics Junction Transistor, Transistor Current Components, Transistor as an Amplifier, Transistor Construction, CB Configuration, CE Configuration, CE Cut-off region, CE Saturation Region, Typical Transistor, CE Current Gain, CC Configuration, Phototransistor

08

6 Transistor Biasing and Thermal Stabilization Operating Point, Bias Stability, Self-Bias , Stabilization against Variations in ICO, VBE and, General Remarks on Collector-Current Stability, Bias Compensation, Thermal Runaway, Thermal Stability

05

7 Field Effect Transistors Junction FET, Pinch-Off Voltage, JFET Volt-Ampere Characteristics, Biasing the FET, FET Small-Signal Model, MOSFET, Digital MOSFET Circuits.

04

8 Operational Amplifier Introduction to Op amps, The 741 Op amp, The Inverting Amplifier, The Non Inverting Amplifier, Applications – adder, subtractor, integrator, differentiator and comparator, practical op -amps.

04

2018-19 B.TECH 3rd SEM INFORMATION TECHNOLOGY (2017

Course Title Data

Course Code CE317

Course Credits

Theory

Practical

Tutorial

Credits

Course Learning Outcomes:

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

Understand the characteristics of linear and non Write programs using various data structures. Analyse different sorting and searching algorithms. Demonstrate hashing and hashing methods.

Detailed Syllabus

Sr. No.

Name of chapter & details

1 Review of User defined function, Recursion, pointer, structure.Introduction to Data Structures.Types of Data Structure. Linear & NonNon-Primitive, Application of Data Structure

2 Stack & Queues: Introduction of Stack, Basic Postfix Conversion and Evaluation of Postfix Expression. Basic Operations on QueuePriority Queue, Applications: Simulation, Priority Queue

3 Linked List : Overview of Linked list, Dynamic Memory AllocationLinked List Operations: Insert node, delete nodecopy linked list, merge linked list. Types of Linked list: Doubly, Sorted. Application

SEM INFORMATION TECHNOLOGY (2017-21 BATCH)

Data Structures

317

Theory :3

Practical :2

Tutorial :0

Credits :5



the characteristics of linear and non-linear data structures.programs using various data structures.

different sorting and searching algorithms. hashing and hashing methods.


SECTION-I

Review of User defined function, Recursion, pointer, structure.Introduction to Data Structures. Types of Data Structure. Linear & Non-Linear, Data types – Primitive and

Primitive, Application of Data Structure.

Introduction of Stack, Basic Operations, Applications of Stacknd Evaluation of Postfix Expression.

ueue, Types of Queue: Circular Queue, DApplications: Simulation, Priority Queue.

inked list, Dynamic Memory Allocation : Insert node, delete node, search node, traversal,

linked list, merge linked list. Types of Linked list: Singly, Circular, . Application of Linked List.

SYLLABUS

Page 1

linear data structures.

Hours Allotted

Review of User defined function, Recursion, pointer, structure.

Primitive and

03

, Applications of Stack-Infix to

ircular Queue, D-Queue,

9

, search node, traversal, Singly, Circular,

9

Total 21


5 Sorting & Searching: Introduction to Sorting, Selection Sort, Bubble Sort, Insertion Sort, Shell Sort, Heap Sort, Radix Sort, Sequential Search, Binary Search.

6 Nonlinear Data Structures: Tree & GraphTree: Introduction to Tree, Representations of Tree,Binary Search Tree (insert, traversal, search, delete) Conversion of General Tree to Binary Tree, Expression Tree, Balanced binary tree [AVL Tree]. Graphs: Introduction to graph, Representation of Graphs, Traversal of Graph

7 Hashing and collision: Introduction, Has table, Hash function, Types of Hash function, Collisions resolution overview.


Lectures will be conducted on the basis of Classroom Response Systems with the

use of multimedia projector and black board.

Assignments based on course contentswill be evaluated at regular interval.

Experiments will be based on the practical curriculum and will be evaluated at regular interval.

Reference Books:

Title : “ Data Structure using C “, Oxford University press, Third edition, 2012Author : Reema Thareja

Title : “ Data Structure Using C

Author : Y.Kanitkar

Title : “Data Structure thr

Author : G S Baluja

Title : “Data structure using C and C++Author : Aaron M. Tenenbaum



SECTION-II

Introduction to Sorting, Selection Sort, Bubble Sort, Insertion Sort, Shell

Heap Sort, Radix Sort, Sequential Search, Binary Search.

Nonlinear Data Structures: Tree & Graph

ree, Representations of Tree, Operations on binary Tree & ree (insert, traversal, search, delete) Conversion of

General Tree to Binary Tree, Expression Tree, Balanced binary tree [AVL

Introduction to graph, Representation of Graphs, Traversal of Graph

Introduction, Has table, Hash function, Types of Hash function, Collisions,

ollisions resolution overview.

ethod and Pedagogy:


use of multimedia projector and black board.

Assignments based on course contents will be given at the end of each unit/topic and will be evaluated at regular interval. Experiments will be based on the practical curriculum and will be evaluated at regular

: “ Data Structure using C “, Oxford University press, Third edition, 2012Author : Reema Thareja

Data Structure Using C “, Second Edition, PHI

Data Structure through C “, 2009, Dhanpat Rai & Co

Data structure using C and C++ “,PHI ron M. Tenenbaum

SYLLABUS

Page 2

Introduction to Sorting, Selection Sort, Bubble Sort, Insertion Sort, Shell 07

Operations on binary Tree & ree (insert, traversal, search, delete) Conversion of

General Tree to Binary Tree, Expression Tree, Balanced binary tree [AVL

Introduction to graph, Representation of Graphs, Traversal of Graph

11

Collisions, 03

Total 21


will be given at the end of each unit/topic and

Experiments will be based on the practical curriculum and will be evaluated at regular

: “ Data Structure using C “, Oxford University press, Third edition, 2012


NPTEL Video Lectures of …

1) Data structures and Algorithms of Computer Science & Engineering by Prof.

Naveen Garg, IIT Delhi [Available at:

2) Programming, Data Structures and Algorithms by Prof. Hema A. Murthy, IIT

Madras [Available at:

3) Data Structures and Program M

Guwahati [Available at: http://nptel.ac.in/courses/106103069/]


s of …

Data structures and Algorithms of Computer Science & Engineering by Prof.

Naveen Garg, IIT Delhi [Available at: http://nptel.ac.in/courses/106102064/]

Programming, Data Structures and Algorithms by Prof. Hema A. Murthy, IIT

Madras [Available at: http://nptel.ac.in/courses/106106127/2]

Data Structures and Program Methodology by Prof. Pradeep K. Das, IIT


SYLLABUS

Page 3

Data structures and Algorithms of Computer Science & Engineering by Prof.

http://nptel.ac.in/courses/106102064/]

Programming, Data Structures and Algorithms by Prof. Hema A. Murthy, IIT

ethodology by Prof. Pradeep K. Das, IIT



Course Title Computer Peripherals and

Course Code CE318

Course Credits

Theory

Practical

Tutorial

Credits


On the completion of the course, students will be able to: Understand design and working of each internal and external component of

computer. Understand connections between various components of computer. Make own computer by assembling different Perform troubleshooting when fault arises.

Detailed Syllabus

Sr. No.


1. Introduction to computer and its componentsIntroduction, Basic block diagram of computer system, brief description various components of computer system, history of coof computers: personal, mainframe, super computers, laptop

2. Introduction to Input devicesIntroduction, types of input devices, working of keyboard, mouse and trackball, introduction of inputs from various devices like digital camera, mobile, PDA’s, smart phone, tablet pc s etc. Introduction to scanner and reading devices, optical scanners, optical readers (OCR, OMR, BCR, RFID Reader, Biometric input.

3. Introduction to Output DevicesIntroduction to display devices (flat panel displays, CRT monitors, LED etc), working of impact printer (dot matrix printer), working of non impact printer (ink-jet printer, laser printer), working of multifunction peripheral, installing and sharing of printers.


Computer Peripherals and Maintenance

CE318

Theory : 0

Practical :1

Tutorial :0

Credits : 1


On the completion of the course, students will be able to: design and working of each internal and external component of

connections between various components of computer.own computer by assembling different components.

troubleshooting when fault arises.


SECTION-I

to computer and its components Introduction, Basic block diagram of computer system, brief description various components of computer system, history of computer, categories

personal, mainframe, super computers, laptop

Introduction to Input devices Introduction, types of input devices, working of keyboard, mouse and

introduction of inputs from various devices like digital camera, mobile, PDA’s, smart phone, tablet pc s etc. Introduction to scanner and reading devices, optical scanners, optical readers (OCR, OMR, BCR, RFID

to Output Devices Introduction to display devices (flat panel displays, CRT monitors, LED etc), working of impact printer (dot matrix printer), working of non impact

jet printer, laser printer), working of multifunction peripheral, and sharing of printers.

SYLLABUS

Page 1

Maintenance

design and working of each internal and external component of

connections between various components of computer.

Hours Allotted

Introduction, Basic block diagram of computer system, brief description of mputer, categories

02

Introduction, types of input devices, working of keyboard, mouse and introduction of inputs from various devices like digital camera,

mobile, PDA’s, smart phone, tablet pc s etc. Introduction to scanner and reading devices, optical scanners, optical readers (OCR, OMR, BCR, RFID

03

Introduction to display devices (flat panel displays, CRT monitors, LED etc), working of impact printer (dot matrix printer), working of non impact

jet printer, laser printer), working of multifunction peripheral, 03


4. Introduction to Storage DevicesIntroduction, basic principle, disk drive types, disk drive block diagram, floppy disk, hard and soft sector format, floppy disk drive, hard disk drive, CD-ROM drive, DVD, special Digitizer or Graphic tablet, Magnetic tape drives.

5. Introduction to MemoriesBasic concept of memory, types of memory, memory organization, virtual memory, cache memory.

6. Assembly of Peripherals & IIdentification and Assembly of Various Computer Peripherals, OS installation, driver installation, creating bootable media for reinstallation.

7. PC Maintenance Creating Data Backup Discs, Unused Programs, Running the Disk Cleanup Program, Running the Disk Defragmenter Program, Checking for Hard Disk Drive Errors, Understanding Hard Disk Drive Space, Recommended Maintenance Schedule.

8. Troubleshooting of Hardware ProblemsIntroduction of BIOS and POST, Audio, Video, CD and DVD Drives, Hard Disk Drive, Hardware Installation, Internet Access, Keyboard and Mouse, Power, Performance Optimization.

9. Troubleshooting of Software ProblemsSoftware Repair Overview, Restarting Your PC, Turning Off Your PC, Updating Drivers, Microsoft System Restore, Application and Driver Recovery, System Recovery Overview, Creating System Recovery Discs, Creating a Recovery Tools CD, Running System Recovery from RecoDiscs, Running System Recovery from the Hard Disk Drive.


Assignments based on course contents will be given at the end of each unit/topic and will be evaluated at regular interval.

Experiments will be based on the practical curriculum and will be evaluated at regular interval.


Introduction to Storage Devices Introduction, basic principle, disk drive types, disk drive block diagram, floppy disk, hard and soft sector format, floppy disk drive, hard disk drive,

ROM drive, DVD, special peripherals(Plotters, Light pen, Joystick, Digitizer or Graphic tablet, Magnetic tape drives.

SECTION-II

Introduction to Memories Basic concept of memory, types of memory, memory organization, virtual memory, cache memory.

Assembly of Peripherals & Installation of Operating system Identification and Assembly of Various Computer Peripherals, OS installation, driver installation, creating bootable media for

Creating Data Backup Discs, Creating System Recovery Discs, Removing Unused Programs, Running the Disk Cleanup Program, Running the Disk Defragmenter Program, Checking for Hard Disk Drive Errors, Understanding Hard Disk Drive Space, Recommended Maintenance

oting of Hardware Problems Introduction of BIOS and POST, Audio, Video, CD and DVD Drives, Hard Disk Drive, Hardware Installation, Internet Access, Keyboard and Mouse, Power, Performance Optimization.

Troubleshooting of Software Problems Repair Overview, Restarting Your PC, Turning Off Your PC,

Updating Drivers, Microsoft System Restore, Application and Driver Recovery, System Recovery Overview, Creating System Recovery Discs, Creating a Recovery Tools CD, Running System Recovery from RecoDiscs, Running System Recovery from the Hard Disk Drive.

ethod and Pedagogy:

Assignments based on course contents will be given at the end of each unit/topic and will be evaluated at regular interval.

based on the practical curriculum and will be evaluated at regular

SYLLABUS

Page 2

Introduction, basic principle, disk drive types, disk drive block diagram, floppy disk, hard and soft sector format, floppy disk drive, hard disk drive,

peripherals(Plotters, Light pen, Joystick, 03

Total 11

Basic concept of memory, types of memory, memory organization, virtual 03

03

Creating System Recovery Discs, Removing Unused Programs, Running the Disk Cleanup Program, Running the Disk Defragmenter Program, Checking for Hard Disk Drive Errors, Understanding Hard Disk Drive Space, Recommended Maintenance

04

Introduction of BIOS and POST, Audio, Video, CD and DVD Drives, Hard Disk Drive, Hardware Installation, Internet Access, Keyboard and Mouse,

03

Repair Overview, Restarting Your PC, Turning Off Your PC, Updating Drivers, Microsoft System Restore, Application and Driver Recovery, System Recovery Overview, Creating System Recovery Discs, Creating a Recovery Tools CD, Running System Recovery from Recovery

04

Total 17

Assignments based on course contents will be given at the end of each unit/topic and

based on the practical curriculum and will be evaluated at regular


Reference Books:

Title: ”Guide to managing & maintaining your PC,”, Cengage LearningAuthor(s): Jean Andrews

Title: “IBM PC and Clones Hardware, troubleshooting and

Publications

Author(s): B.Govindarajalu


http://www.tutorialspoint.com/computer_fundamentals/

http://openbookproject.net/courses/intro2ict/hardware/activities/identify_peripherals_l

ab.html

http://www.iitg.ernet.in/asahu/cs421/

http://en.wikipedia.org/wiki/Peripheral

http://en.wikipedia.org/wiki/Category:Computer_peripherals


Title: ”Guide to managing & maintaining your PC,”, Cengage LearningAuthor(s): Jean Andrews Title: “IBM PC and Clones Hardware, troubleshooting and maintenance”, TMH

Author(s): B.Govindarajalu

http://www.tutorialspoint.com/computer_fundamentals/


http://www.iitg.ernet.in/asahu/cs421/

http://en.wikipedia.org/wiki/Peripheral

http://en.wikipedia.org/wiki/Category:Computer_peripherals

SYLLABUS

Page 3

Title: ”Guide to managing & maintaining your PC,”, Cengage Learning

maintenance”, TMH



Course Title Object Oriented Programming with C++

Course Code CE322

Course Credits

Theory

Practical

Tutorial

Credits



Understand the concept and underlying principles of Object

Apply the techniques of object

Design, write and test

facilities common to many object

and inheritance

Understand implementation issues related to object

develop the skill to solve real world problems

Implement the file handling techniques for back

Detailed Syllabus

Sr. No.


1. Principles of Object-Oriented Programming Introduction OOP, Procedural Vs. Object Oriented Programming, Concepts of OOP, Benefits and Applications of OOP

2. Language Basics Overview, Program Structure, Namespace, Identifier and Constants, Reference Variable, enum, Operators, Typecasting, Control Structures, Looping Statements, Standard and Formatted Input/ Output

3. Functions Introduction, Anatomy of Function, Call and Return by Reference, Inline functions, Macro vs. Inline functions, Overloading of functions, Default Arguments, const Arguments


Object Oriented Programming with C++

22

Theory : 3

Practical :2

Tutorial : 0

Credits :5


the course, students will be able to:

the concept and underlying principles of Object-Oriented Programming

the techniques of object-oriented programming to solve real problems

programs that make appropriate use of object

facilities common to many object-oriented languages such as classes, overloading

implementation issues related to object-oriented techniques and to

ve real world problems

the file handling techniques for back-end storage problems solutions


SECTION-I

Oriented Programming Procedural Vs. Object Oriented Programming, Concepts

of OOP, Benefits and Applications of OOP

Overview, Program Structure, Namespace, Identifier and Constants, Reference Variable, enum, Operators, Typecasting, Control Structures, Looping Statements, Standard and Formatted Input/ Output

Introduction, Anatomy of Function, Call and Return by Reference, Inline functions, Macro vs. Inline functions, Overloading of functions, Default Arguments, const Arguments

SYLLABUS

Page 1

Object Oriented Programming with C++

Oriented Programming

oriented programming to solve real problems

programs that make appropriate use of object-oriented

oriented languages such as classes, overloading

oriented techniques and to

end storage problems solutions

Hours Allotted

Procedural Vs. Object Oriented Programming, Concepts 3

Overview, Program Structure, Namespace, Identifier and Constants, Reference Variable, enum, Operators, Typecasting, Control Structures,

4

Introduction, Anatomy of Function, Call and Return by Reference, Inline functions, Macro vs. Inline functions, Overloading of functions, Default

4


4. Classes and Objects Concept of Class, Class vs. Structure, Creating an Objects, Defining and Declaring members of Class, Accessing Members, Access Specifiers, Arrays within a Class, Static Members and Methods, Object as an Argument, Returning Objects, Frie

5. Constructors and DestructorsIntroduction, Characteristics of Constructors, Types of Constructor, Overloading, Dynamic Initialization of Objects, Destructors

6. Operator Overloading and Type Basic Concepts, Rules for Operator Overloading, Overloading using Member Functions, Overloading using Friend Functions, Manipulation of Strings, Type Conversions

7. Inheritance Introduction, Basics of Base and Derived Classes, Implementation Various types of Inheritance, Access Specifiers with Inheritance, Function Overriding, Virtual Base Classes, Constructors in Derived Classes, Abstract Classes

8. Polymorphism Pointers in C++, Pointers to Objects, this pointer, Virtual and Pure Functions, Implementing Polymorphism

9. I/O and File ManagementConcept of Streams, C++ Stream Classes, Unformatted I/O Operations, File Stream, C++ File Stream Classes, File Management Functions, File Modes, Manipulators, Binary and Random

10. Templates, Exceptions and STLIntroduction, Function Templates and Class Templates, Introduction to Exception, Exception Handling Mechanism, Throwing and Rethrowing Exceptions, Specifying ExceptionsOverview and use of Standard Template Library

Instructional method and Pedagogy:


Concept of Class, Class vs. Structure, Creating an Objects, Defining and Declaring members of Class, Accessing Members, Access Specifiers, Arrays within a Class, Static Members and Methods, Object as an Argument, Returning Objects, Friend Functions, Local Classes,

Constructors and Destructors Introduction, Characteristics of Constructors, Types of Constructor, Overloading, Dynamic Initialization of Objects, Destructors

SECTION-II

Operator Overloading and Type Conversion Basic Concepts, Rules for Operator Overloading, Overloading using Member Functions, Overloading using Friend Functions, Manipulation of Strings, Type Conversions

Introduction, Basics of Base and Derived Classes, Implementation Various types of Inheritance, Access Specifiers with Inheritance, Function Overriding, Virtual Base Classes, Constructors in Derived Classes, Abstract

Pointers in C++, Pointers to Objects, this pointer, Virtual and Pure Functions, Implementing Polymorphism

I/O and File Management Concept of Streams, C++ Stream Classes, Unformatted I/O Operations, File Stream, C++ File Stream Classes, File Management Functions, File Modes, Manipulators, Binary and Random Files, Command Line Arguments

Templates, Exceptions and STL Introduction, Function Templates and Class Templates, Introduction to Exception, Exception Handling Mechanism, Throwing and Rethrowing Exceptions, Specifying Exceptions

Standard Template Library


SYLLABUS

Page 2

Concept of Class, Class vs. Structure, Creating an Objects, Defining and Declaring members of Class, Accessing Members, Access Specifiers, Arrays within a Class, Static Members and Methods, Object as an

nd Functions, Local Classes,

6

Introduction, Characteristics of Constructors, Types of Constructor, 4

Total 21

Basic Concepts, Rules for Operator Overloading, Overloading using Member Functions, Overloading using Friend Functions, Manipulation of

4

Introduction, Basics of Base and Derived Classes, Implementation of Various types of Inheritance, Access Specifiers with Inheritance, Function Overriding, Virtual Base Classes, Constructors in Derived Classes, Abstract

5

Pointers in C++, Pointers to Objects, this pointer, Virtual and Pure Virtual 3

Concept of Streams, C++ Stream Classes, Unformatted I/O Operations, File Stream, C++ File Stream Classes, File Management Functions, File

Files, Command Line Arguments

4

Introduction to Exception, Exception Handling Mechanism, Throwing and

5

Total 21


Lectures will be conducted with the aid of multi

The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Assignments based on course content will be given to the students at the end of each unit/topic and will be evaluated at regular interval.

Reference Books:

Title: “Objet Oriented Programming with C++”, TMH

Author: E Balagurusamy

Title: “The Complete Reference of C++”, TMH Publications

Author: Herbert Schildt

Title: “Mastering in C++”, TMH Publications

Authors: Venugopal, Rajkumar & T Ravishankar

Title: “C++ Programming, Black Book”, Dreamtech

Author: Steven Holzner


https://www.programiz.com/cpp

http://www.cplusplus.com/doc/tutorial/

https://www.tutorialspoint.com/cplusplus/

http://www.learncpp.com/


Lectures will be conducted with the aid of multi –media projector, blackboard.

The course includes tutorials, where students have an opportunity to practice the concepts being taught in lectures.


Title: “Objet Oriented Programming with C++”, TMH Publications

Author: E Balagurusamy

Title: “The Complete Reference of C++”, TMH Publications

Title: “Mastering in C++”, TMH Publications

Authors: Venugopal, Rajkumar & T Ravishankar

Title: “C++ Programming, Black Book”, Dreamtech Publications

https://www.programiz.com/cpp-programming

http://www.cplusplus.com/doc/tutorial/

https://www.tutorialspoint.com/cplusplus/

SYLLABUS

Page 3

media projector, blackboard.

The course includes tutorials, where students have an opportunity to practice the

Assignments based on course content will be given to the students at the end of each

Publications


Course Title Database Management Systems

Course Code CE519

Course Credits

Theory

Practical

Tutorial

Credits


At the end of this course, students will be able to: Understand underlying concepts of database management systems

Apply database constraints to maintain data consistency and to avoid data

redundancy.

Analyze and Design

requirement

Design entity-relationship diagrams to represent database application

scenarios

Perform simple and complex SQL query for various data operations.

Detailed Syllabus

Sr. No.


1. An overview of Database Basic Concepts: data, database, database systems, database management system, Instance, schema, database applications, advantages and disadvantages of DBMS over file systems, three level architecture, database user and administrators Data Models: Introduction, types of hierarchical, network and object Oriented)

2. Entity-Relationship model:Overview of the design process. Erelationship and types of relationships, attributes,constraints. E-R notations, Efeatures: specialization, generalization, aggregation, reduction to relational schemas.


Database Management Systems

519

Theory :03

Practical :01

Tutorial :00

Credits :04


students will be able to:

underlying concepts of database management systems

database constraints to maintain data consistency and to avoid data

Design normalized database based on an organization’s

relationship diagrams to represent database application

simple and complex SQL query for various data operations.


SECTION-I

An overview of Database Management Basic Concepts: data, database, database systems, database management system, Instance, schema, database applications, advantages and disadvantages of DBMS over file systems, three level architecture, database user and administrators

s: Introduction, types of data models (ER, relational, hierarchical, network and object Oriented)

Relationship model: Overview of the design process. E-R Model: entities, types of entities, relationship and types of relationships, attributes, types of attributes,

R notations, E-R diagram, ER design issues, extended Efeatures: specialization, generalization, aggregation, reduction to relational

SYLLABUS

Page 1

underlying concepts of database management systems

database constraints to maintain data consistency and to avoid data

normalized database based on an organization’s

relationship diagrams to represent database application

simple and complex SQL query for various data operations.

Hours Allotted

Basic Concepts: data, database, database systems, database management system, Instance, schema, database applications, advantages and disadvantages of DBMS over file systems, three level

ata models (ER, relational,

05

R Model: entities, types of entities, types of attributes,

R diagram, ER design issues, extended E-R features: specialization, generalization, aggregation, reduction to relational

08


3. Relational Model: Basic structure, database schema, keys: super primary key, and foreign key. Fundamental and additional relational algebra operations, extended relational algebra operations.

4. Relational Database design:Functional Dependency(FD) of FD set, closure of attributes, irreducible set of FDs, normalization 1NF, 2NF, 3NF, decomposition using FDBCNF. Data Dictionary: Introduction to Data Dictionary, Data Dictionary Storage

5. Transaction ProcessingIntroduction to transaction concepts, transaction execution and problems, transaction states, ACID properties, transaction logs.

6. Query Processing & Query Optimization:Overview, phases of query processing, selection operation, and sorting and joins evaluation of expressions

7. Structured Query LanguageIntroduction to SQL, Components of SQL Types, constraints, Create, Insert, Alter, Update, Select, Delete, Sorting, Drop, Truncate, Rename. Types of Operators, Aggregate Functions Single Row Functions, Group by Clause, Having Clause, Sub Queries, Joins, Set Operators Advance SQL Indexes, Views, Sequences, DCL commands, DTC commands


Lectures will be conducted

multimedia projector and black board.


will be evaluated at regular interval.


interval.

Students will be guided to develop the real

concepts of application development.

SQL topics will be discussed in detail du


Basic structure, database schema, keys: super key, candidate key, primary key, and foreign key. Fundamental and additional relational algebra operations, extended relational algebra operations.

SECTION-II

Relational Database design: Functional Dependency(FD) – definition, trivial and non-trivial FD, closure of FD set, closure of attributes, irreducible set of FDs, normalization 1NF, 2NF, 3NF, decomposition using FD- dependency preservation,

Data Dictionary: Introduction to Data Dictionary, Data Dictionary Storage

Transaction Processing Introduction to transaction concepts, transaction execution and problems, transaction states, ACID properties, transaction logs.

Query Processing & Query Optimization: of query processing, measures of query

selection operation, and sorting and joins evaluation of expressions

Structured Query Language Introduction to SQL, Components of SQL -DDL, DML and DCL, Data Types, constraints, Create, Insert, Alter, Update, Select, Delete, Sorting,

Truncate, Rename. Types of Operators, Aggregate Functions Single Row Functions, Group by Clause, Having Clause, Sub Queries,

Indexes, Views, Sequences, DCL commands, DTC commands

Pedagogy:

Lectures will be conducted based on Classroom Response Systems with the use of

multimedia projector and black board.


will be evaluated at regular interval.


Students will be guided to develop the real-world applications with the advanced

concepts of application development.

SQL topics will be discussed in detail during laboratory hours.

SYLLABUS

Page 2

key, candidate key, primary key, and foreign key. Fundamental and additional relational

08

Total 21

trivial FD, closure of FD set, closure of attributes, irreducible set of FDs, normalization –

dependency preservation,

Data Dictionary: Introduction to Data Dictionary, Data Dictionary Storage

07

Introduction to transaction concepts, transaction execution and problems, 04

measures of query cost, selection operation, and sorting and joins evaluation of expressions

04

DDL, DML and DCL, Data Types, constraints, Create, Insert, Alter, Update, Select, Delete, Sorting,

Truncate, Rename. Types of Operators, Aggregate Functions Single Row Functions, Group by Clause, Having Clause, Sub Queries,

06

Total 21

Classroom Response Systems with the use of



world applications with the advanced


Reference Books:

Title: Database System Concepts, 5th Edition, Tata McGraw

Author(s): Silberschatz, Korth, Sudarshan

Title: An Introduction to Database Systems, Eighth Edition, Pearson Education Author(s): C.J.Date, a

Title: Database Systems, Concepts, Design and Applications, Pearson Education

Author(s): S.K. Singh

Title: SQL, PL/SQL –

Author(s): Ivan Bayross

Title: Database Management Systems, ThiAuthor(s): Ramakrishnan, Gehrke

Title: Fundamentals of Database Systems, Fifth Edition, Pearson Education

Author(s): Navathe


http://nptel.ac.in/video.php?subjectId=106106093

https://www.tutorialspoint.com/dbms/

http://www.w3schools.in/dbms/

http://beginnersbook.com/2015/04/dbms

http://www.learnerstv.com/Free


Title: Database System Concepts, 5th Edition, Tata McGraw-

Author(s): Silberschatz, Korth, Sudarshan

Title: An Introduction to Database Systems, Eighth Edition, Pearson Education Author(s): C.J.Date, a Kannan, S Swaminathan


Author(s): S.K. Singh

– The programming Language Oracle, BPB Publication

Author(s): Ivan Bayross

Title: Database Management Systems, Third Edition, Tata McGraw Hill Author(s): Ramakrishnan, Gehrke Title: Fundamentals of Database Systems, Fifth Edition, Pearson Education

http://nptel.ac.in/video.php?subjectId=106106093

https://www.tutorialspoint.com/dbms/

http://www.w3schools.in/dbms/

http://beginnersbook.com/2015/04/dbms-tutorial/

http://www.learnerstv.com/Free-Computer-Science-Video-lectures

SYLLABUS

Page 3

-Hill

Title: An Introduction to Database Systems, Eighth Edition, Pearson Education


The programming Language Oracle, BPB Publication

rd Edition, Tata McGraw Hill

Title: Fundamentals of Database Systems, Fifth Edition, Pearson Education

lectures-ltv048-Page1.htm

SYLLABUS


Course Title DIFFERENTIAL EQUATIONS

Course Code APS301

Course Credit

Lecture : 4

Practical : 0

Tutorial : 0

Total : 4

Course Learning Outcomes

After Successful completion of the above course, students will be able:

To know, formulate and solve differential equations.

Illustrate Fourier series and Laplace transforms thorough practical applications.

Learn to solve boundary value problems.

To apply applications of PDE in two dimensional heat equation.

To explain the application of Fourier series and transform.

Use Laplace transforms to solve initial value problem.

Detailed Syllabus

Sr. No.

Name of chapter & details Hours

Allotted Section – I

1.

Higher order ODE: Linear differential equations of second and higher order, Superposition principle, Initial value problems, Linear dependence and independence of functions- Wronskians, Abel-Liouville formula, Method of obtaining general solution of non homogeneous linear differential equation with constant coefficients, Method of obtaining Particular Integral – Shorter methods for finding P. I. for special form of R(x), Method of undetermined coefficients, Method of variation of parameter, Linear ODEs of higher order with variable coefficients, Cauchy-Euler equation, Legendre’s Linear differential equation with variable coefficients and its applications.

12

2. Partial Differential Equation Introduction, Basic concepts and definitions, Formation of partial differential equation, Discussion about solutions of P.D.Es, Partial differential equation of first order, Linear partial differential equation of first order, Nonlinear partial differential equation of first order, Method of separation of variables, Classification of partial equations of mathematical physics and their origins(vibrating strings, vibrating

8

SYLLABUS

2018-19 B.TECH 3rd SEM COMPUTER ENGINEERING (2017-21 BATCH) Page 2

membranes heat conduction in solids etc.), Solving PDEs via the method of separation of variables, The Laplace operator in cylindrical and spherical polar coordinates, Brief discussion of Fourier Bessel series, Solution via Fourier series/Fourier-Bessel series for rectangular and circular domains in R2and spherical and cylindrical domains R3.

3. Series solution of ODEs: Ordinary differential equations with regular singular points and the method of Frobenious and Power series, Illustrative examples as the equations of Legendre.

8

Total 28 Section – II

5. Laplace Transforms Laplace transform of �� ⁄ and ��(�), Convolution theorem, Use of Laplace transform for solving IVP for ODEs and systems of ODEs Heaviside unit step function and Second shifting theorem, Applications of Laplace transforms.

10

6. Fourier Series Basic formulae in Fourier series, Theorem of existence of Fourier series, Fourier series for discontinuous function, Fourier series of even and odd functions, Half range Fourier series, Parseval’s formula (statement only) and Bessel’s inequality with examples, Applications of Fourier series

8

7. Fourier Transforms Fourier transforms and its basic properties, Fourier transform of the Gaussian and the Fourier inversion theorem (statement only), Riemann Lebesgue lemma for Fourier series and Fourier transforms (statement only).

4

8. Legendre and Bessel’s functions Legendre polynomial, Rodrigue’s formula, generating function of the Legendre polynomial and their orthogonality, Recurrence relation for ��(�), Bessel’s equation and Bessel’s function of first kind only, Basic properties of ��(�), the recurrence relation ��(�) and Integral representation of ��(�).

6

Total 28

SYLLABUS



Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.


Surprise tests/Quizzes/Seminar/ will be conducted.

The course includes tutorials, where students have an opportunity to practice the examples for the concepts being taught in lectures.

Reference Books:

1. Erwin Kreyzig, Higher Engineering Mathematics, Wiley India Publications –

8th Edition.

2. Dr. R.C. Shah, Differential equations, Books India Publications – 5th Edition.

3. Elementary Differential Equations, W. E. Boyce and R. Di Prima and John

Wiley,(2005), 8th Edition.

4. R. V. Churchill and J. W. Brown ,Fourier series and boundary value

problems, McGraw-Hill (2006), 7th Edition.

5. T. M. Apostol, Calculus, Volume-2, , Wiley Eastern, 1980, 2nd Edition.

6. B. S. Grewal, Higher Engineering Mathematics, Khanna Publishers Co.

Ltd., New Delhi – 39th Edition.

7. Thomas George, B. weir Maurice, D. Hass Joel Giordano Frank,

8. Prajapati Jyotindra, Calculus, Pearson Education, Delhi – 1st Edition.

detail teaching schemerku.ac.in/syllabus/syllabus/0003-2017-2018-rku.pdf · 2018-07-03 · syllabus...

Documents