I SEMESTER CURRICULUM AND SYLLABUS

B.E. Computer Science AND ENGINEERING (PART TIME)

SEMESTER I

S.NO

Course Code

THEORY

1.

*

2.

3.

4.

5.

COURSE TITLE Applied Mathematics Applied Physics Computer Programming Digital Principles and System Design Programming and Data Structures - I

LTPC 3 003 3 003 3 003 3 003 3 003 TOTAL 15 0 0 15

* The Course code will be provided shortly

1

APPLIED MATHEMATICS

LT P C 3003

OBJECTIVE: To facilitate the understanding of the principles and to cultivate the art of formulating physical problems in the language of mathematics.

UNIT I

MATRICES

9

Characteristic equation Eigenvalues and Eigenvectors of a real matrix Properties of eigenvalues

and eigenvectors Cayley-Hamilton Theorem Diagonalization of matrices - Reduction of a

quadratic form to canonical form by orthogonal transformation.

UNIT II FUNCTIONS OF SEVERAL VARIABLES

9

Partial derivatives Homogeneous functions and Eulers theorem Total derivative Differentiation

of implicit functions Change of variables Jacobians Partial differentiation of implicit functions

Taylors series for functions of two variables - Maxima and minima of functions of two variables.

UNIT III ANALYTIC FUNCTION

9

Analytic functions Necessary and sufficient conditions for analyticity Properties Harmonic

conjugates Construction of analytic function Conformal Mapping Mapping by functions w = a + z

, az, 1/z, - Bilinear transformation.

UNIT IV COMPLEX INTEGRATION

9

Line Integral Cauchys theorem and integral formula Taylors and Laurents Series Singularities

Residues Residue theorem Application of Residue theorem for evaluation of real integrals Use

of circular contour and semicircular contour with no pole on real axis.

UNIT V LAPLACE TRANSFORMS

9

Existence conditions Transforms of elementary functions Basic properties Transforms of

derivatives and integrals Inverse transforms Convolution theorem Transform of periodic functions

Application to solution of linear ordinary differential equations with constant coefficients.

OUTCOMES:

TOTAL: 45 PERIODS

To develop the use of matrix algebra techniques this is needed by engineers for Practical Applications.

To familiarize the student with functions of several variables. This is needed in many branches of engineering.

To develop an understanding of the standard techniques of complex variable theory so as to enable the student to apply them with confidence, in application areas such as heat conduction, elasticity, Fluid Dynamics and flow the of electric current.

To make the student appreciate the purpose of using transforms to create a new domain in which it is easier to handle the problem that is being investigated.

text books: 1. Grewal B.S., "Higher Engineering mathematics", Khanna Publishers, Forty Second Edition, Delhi, 2012. 2. Ramana, B.V, "Higher Engineering Mathematics", Tata McGraw Hill Publishing Company, 2008.

2

REFERENCES: 1. Glyn James, "Advanced Modern Engineering Mathematics", Fouth Edition, Prentice Hall of India, 2011. 2. Veerarajan T., "Engineering Mathematics" (For First Year), Tata McGraw-Hill Pub. Pvt. Ltd., New Delhi, 2007.

APPLIED PHYSICS

LTPC

3 003

OBJECTIVE:

To enrich the understanding of various types of materials and their applications in engineering and

technology.

UNIT I

CONDUCTING MATERIALS

9

Conductors classical free electron theory of metals Electrical and thermal conductivity

Wiedemann Franz law Lorentz number Draw backs of classical theory Quantum theory

Fermi distribution function Effect of temperature on Fermi Function Density of energy states

carrier concentration in metals.

UNIT II

SEMICONDUCTING MATERIALS

9

Intrinsic semiconductor carrier concentration derivation Fermi level Variation of Fermi level with

temperature electrical conductivity band gap determination compound semiconductors -direct

and indirect band gap- derivation of carrier concentration in n-type and p-type semiconductor

variation of Fermi level with temperature and impurity concentration Hall effect Determination of

Hall coefficient Applications.

UNIT III

MAGNETIC AND SUPERCONDUCTING MATERIALS

9

Origin of magnetic moment Bohr magneton comparison of Dia, Para and Ferro magnetism

Domain theory Hysteresis soft and hard magnetic materials antiferromagnetic materials

Ferrites and its applications

Superconductivity : properties Type I and Type II superconductors BCS theory of

superconductivity(Qualitative) - High Tc superconductors Applications of superconductors SQUID,

cryotron, magnetic levitation.

UNIT IV DIELECTRIC MATERIALS

9

Electrical susceptibility dielectric constant electronic, ionic, orientational and space charge

polarization frequency and temperature dependence of polarisation internal field Claussius

Mosotti relation (derivation) dielectric loss dielectric breakdown uses of dielectric materials

(capacitor and transformer) ferroelectricity and applications.

UNIT V ADVANCED ENGINEERING MATERIALS

9

Metallic glasses: preparation, properties and applications. Shape memory alloys (SMA):

Characteristics, properties of NiTi alloy, application, Nanomaterials Preparation -pulsed laser

deposition chemical vapour deposition Applications NLO materials Birefringence- optical Kerr

effect Classification of Biomaterials and its applications

TOTAL: 45 PERIODS

3

TEXT BOOKS: 1. Arumugam M, "Materials Science", Anuradha publishers, 2010 2. Pillai S. O, "Solid State Physics", New Age International(P) Ltd., Publishers, 2009 REFERENCES: 1. Palanisamy P.K, "Materials Science", SCITECH Publishers, 2011 2. Senthilkumar G, "Engineering Physics II", VRB Publishers, 2011 3. Mani P, "Engineering Physics II", Dhanam Publications, 2011 4. Marikani A, "Engineering Physics", PHI Learning Pvt., India, 2009

COMPUTER PROGRAMMING

L T PC 3 003

UNIT I

INTRODUCTION

8

Generation and Classification of Computers- Basic Organization of a Computer Number System

Binary Decimal Conversion Problems. Need for logical analysis and thinking Algorithm

Pseudo code Flow Chart.

UNIT II C PROGRAMMING BASICS

10

Problem formulation problem solving - Introduction to ,, C programming fundamentals structure

of a ,,C program compilation and linking processes Constants, Variables Data Types

Expressions using operators in ,,C Managing Input and Output operations Decision Making and

Branching Looping statements solving simple scientific and statistical problems.

UNIT III ARRAYS AND STRINGS

9

Arrays Initialization Declaration One dimensional and Two dimensional arrays. String- String

operations String Arrays. Simple programs- sorting- searching matrix operations.

UNIT IV FUNCTIONS AND POINTERS

9

Function definition of function Declaration of function Pass by value Pass by reference

Recursion Pointers - Definition Initialization Pointers arithmetic Pointers and arrays- Example

Problems.

UNIT V STRUCTURES AND UNIONS

9

Introduction need for structure data type structure definition Structure declaration Structure

within a structure - Union - Programs using structures and Unions Storage classes, Pre-processor

directives.

TOTAL: 45 PERIODS

TEXTBOOKS:

1. Anita Goel and Ajay Mittal, "Computer Fundamentals and Programming in C", Dorling Kindersley

(India) Pvt. Ltd., Pearson Education in South Asia, 2011.

2. Pradip Dey, Manas Ghosh, "Fundamentals of Computing and Programming in C", First Edition,

Oxford University Press, 2009

3. Yashavant P. Kanetkar. " Let Us C", BPB Publications, 2011.

4

REFERENCES: 1. Byron S Gottfried, "Programming with C", Schaums Outlines, Second Edition, Tata McGraw-Hill, 2006. 2. Dromey R.G., "How to Solve it by Computer", Pearson Education, Fourth Reprint, 2007. 3. Kernighan,B.W and Ritchie,D.M, "The C Programming language", Second Edition, Pearson Education, 2006.

DIGITAL PRINCIPLES AND SYSTEM DESIGN

LT P C

3003

OBJECTIVES:

Learn how to design digital circuits, by simplifying the Boolean functions. Also, gives an idea about

designs using PLDs, and writing codes for designing larger digital systems.

UNIT I

BOOLEAN ALGEBRA AND LOGIC GATES

9

Review of Number Systems Arithmetic Operations Binary Codes Boolean Algebra and

Theorems Boolean Functions Simplification of Boolean Functions using Karnaugh Map and

Tabulation Methods Logic Gates NAND and NOR Implementations.

UNIT II

COMBINATIONAL LOGIC

9

Combinational Circuits Analysis and design procedures Circuits for Arithmetic Operations, Code

Conversion Decoders and Encoders Multiplexers and Demultiplexers Introduction to HDL

HDL Models of Combinational circuits.

UNIT III

SYNCHRONOUS sequential logic

9

Sequential Circuits Latches and Flip Flops Analysis and Design Procedures State Reduction

and State Assignment Shift Registers Counters HDL for Sequential Logic Circuits.

UNIT IV

ASYNCHRONOUS SEQUENTIAL LOGIC

9

Analysis and Design of Asynchronous Sequential Circuits Reduction of State and Flow Tables

Race-free State Assignment Hazards.

UNIT V

MEMORY AND PROGRAMMABLE LOGIC

9

RAM and ROM Memory Decoding Error Detection and Correction Programmable Logic Array

Programmable Array Logic Sequential Programmable Devices Application Specific Integrated

Circuits.

TOTAL: 45 PERIODS

TEXT BOOK: 1. M. Morris Mano and Michael D. Ciletti, "Digital Design", IV Edition, Pearson Education, 2008.

REFERENCES: 1. John F. Wakerly, "Digital design principles and Practices", Fourth Edition, Pearson Education, 2007. 2. Charles H. Roth Jr, "Fundamentals of Logic Design", Fifth Edition Jaico Publishing House, Mumbai, 2003. 3. Donald D. Givone, "Digital Principles and Design", Tata McGraw Hill, 2003. 4. G. K. Kharate, "Digital Electronics", Oxford University Press, 2010.

5

PROGRAMMING AND DATA STRUCTURES I

LT P C 3003

AIM: The aim is to review the basics of C programming and to introduce the concepts of Data Structures.

OBJECTIVES: To introduce the basics of C programming language To introduce the concepts of ADTs To introduce the concepts of Hashing and Sorting

UNIT I

C PROGRAMMING FUNDAMENTALS - A REVIEW

9

Conditional statements Control statements Functions Arrays Preprocessor - Pointers -

Variation in pointer declarations Function Pointers Function with Variable number of arguments

UNIT II

C PROGRAMMING ADVANCED FEATURES

9

Structures and Unions - File handling concepts File read write binary and Stdio - File

Manipulations

UNIT III

LINEAR DATA STRUCTURES LIST

9

Abstract Data Types (ADTs) List ADT array-based implementation linked list implementation

singly linked lists- circularly linked lists- doubly-linked lists applications of lists Polynomial

Manipulation All operation (Insertion, Deletion, Merge, Traversal)

UNIT IV

LINEAR DATA STRUCTURES STACKS, QUEUES

9

Stack ADT Evaluating arithmetic expressions- other applications- Queue ADT circular queue

implementation Double ended Queues applications of queues

UNIT V

SORTING, SEARCHING AND HASH TECHNIQUES

9

Sorting algorithms: Insertion sort - Selection sort - Shell sort - Bubble sort - Quick sort - Merge sort -

Radix sort Searching: Linear search Binary Search Hashing: Hash Functions Separate

Chaining Open Addressing Rehashing Extendible Hashing

TOTAL: 45 PERIODS TEXT BOOKS: 1. Brian W. Kernighan and Dennis M. Ritchie, "The C Programming Language", 2nd Edition, Pearson Education, 1988. 2. Mark Allen Weiss, "Data Structures and Algorithm Analysis in C", 2nd Edition, Pearson Education, 1997.

REFERENCES: 1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, "Introduction to Algorithms", Second Edition, Mc Graw Hill, 2002. 2. Reema Thareja, "Data Structures Using C", Oxford University Press, 2011 3. Aho, Hopcroft and Ullman, "Data Structures and Algorithms", Pearson Education,1983. 4. Stephen G. Kochan, "Programming in C", 3rd Edition, Pearson Ed.,

6

doc.uments.com

About Us :: Privacy Policies :: Terms of Service :: Feedback :: Copyright :: Contact Us :: DMCA Policy

Copyright © 2018 doc.uments.com