Syllabus for the Academic Year –––– 2020 2020 2020 ...

SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Computer Science and Engineering

Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year

Department: Mathematics Subject Name: Integral Transforms and Numerical Techniques

Subject Code: 18MA301

Course Objectives:

UNIT

I

Laplace Transforms: functions and problems, periodic functions, unit step functions problems. Inverse Laplace transforms:Solution of linear differential equations by Laplace transform method

II

Fourier Series: Periodic functions, Dirichlet’s conditions. Fourier

series of periodic functions with period

.2l Fourier series of even and odd functions. Half range Fourier

series. Practical harmonic analysis. Applicationsspectrum and examples from engineering field.

III

Fourier Transforms :Cosine transforms. Inverse Fourier transforms, and simple problems.Z-Transforms: Difference equations, basic definitions, Zdefinition, Standard ZInitial value and Final value theorems(without proofs)Inverse Z-transform, Simple problems. Applicationsdifference equations using Z

IV

Numerical solution of ordinary differential equations of first order and first degreemethod, Runge- Kutta method of fourth order, Milne’s and AdamsBashforth Predictor and Corrector methods (No derivation of formulae).

Course Objectives

1 Introduce the concept of Laplace Transform and problems on periodic function.

2 Introduce the concept of solving Linear Differential Equations by the method of Laplace Transform.

3 Represent a periodic function as a Fourier Series and Fourier coefficients numerically.

4 To develop the proficiency Differential Equations arising in engineering applications.

SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)


Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2020 2020 2020 2020 ---- 2021202120212021

Mathematics

Transforms and Numerical Techniques

Subject Code: 18MA301

Description

Laplace Transforms: Definition, Laplace transforms of elementary functions and problems, periodic functions, unit step functions

Inverse Laplace transforms: Inverse Laplace transforms, problems. Solution of linear differential equations by Laplace transform method

Periodic functions, Dirichlet’s conditions. Fourier

series of periodic functions with period π2 and with arbitrary period

Fourier series of even and odd functions. Half range Fourier

series. Practical harmonic analysis. Applications- spectrum and examples from engineering field.

Fourier Transforms :Infinite Fourier transforms. Fourier Sine and Cosine transforms. Inverse Fourier transforms, and simple problems.

Difference equations, basic definitions, Z-definition, Standard Z-transforms, Damping rule, Shifting rule,

Final value theorems(without proofs) and problems, transform, Simple problems. Applications-solutions of

difference equations using Z-transforms.

Numerical solution of ordinary differential equations of first order and first degree: Taylor’s series method, Modified Euler’s

Kutta method of fourth order, Milne’s and AdamsBashforth Predictor and Corrector methods (No derivation of

Course Objectives

Introduce the concept of Laplace Transform and problems on periodic

Introduce the concept of solving Linear Differential Equations by the method of Laplace Transform.

Represent a periodic function as a Fourier Series and coefficients numerically.

To develop the proficiency in Numerical techniques and solving Ordinary Differential Equations arising in engineering applications.

TUMAKURU (A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

Semester: 3

L-T-P-C: 3-1-0-4

Hours

Definition, Laplace transforms of elementary functions and problems, periodic functions, unit step functions -

Inverse Laplace transforms, problems. Solution of linear differential equations by Laplace transform method.

10

Periodic functions, Dirichlet’s conditions. Fourier

and with arbitrary period

Fourier series of even and odd functions. Half range Fourier

frequency spectrum and examples from engineering field.

10

ourier transforms. Fourier Sine and Cosine transforms. Inverse Fourier transforms, and simple problems.

-transform- transforms, Damping rule, Shifting rule,

and problems, solutions of

10

Numerical solution of ordinary differential equations of first Taylor’s series method, Modified Euler’s

Kutta method of fourth order, Milne’s and Adams-Bashforth Predictor and Corrector methods (No derivation of

11

Introduce the concept of Laplace Transform and problems on periodic

Introduce the concept of solving Linear Differential Equations by the

Represent a periodic function as a Fourier Series and Compute the

techniques and solving Ordinary Differential Equations arising in engineering applications.



V

Numerical solution of second order ODE: and Milne’s Predictor and Corrector method (No derivation of formulae).

Numerical Integration:

Weddle’s rule, Romberg integration, Newton(without proof)-problems.

Text Books:

Sl No

Title

1 Higher Engineering Mathematics

2 Advanced Engineering Mathematics

Reference Books:

Sl No

Title

1 A text book ofEngineering Mathematics



Course Outcomes

Course outcome

Descriptions

CO1 Understand the basic concepts of Fourier series and Integral transforms.

CO2 Apply Laplace transform and inverse Laplace transform in solving differential equation and integral equation arising in network analysis, control system and others fields of

CO3 Demonstrate Fourier series and Integral transforms to study behaviour of periodic functions, discrete/continuous functions arising in single and system, field theory and system communication

CO4 Analyze and apply single step and multisteengineering problems.



Numerical solution of second order ODE: Runge- Kutta method Predictor and Corrector method (No derivation of

Numerical Integration: Trapezoidal rule,Simpson’s rd31

Weddle’s rule, Romberg integration, Newton-cotes integration problems.

Author(s) Edition, Publisher, Year, ISBN

Higher Engineering B.S.Grewal 43rdEdition, Khanna Publications,2015, ISBN-13:978

Advanced Engineering E.Kreyszig 10th Edition2015, ISBN:978-0


A text book ofEngineering N.P.Bali and Manish Goyal

7th Edition ,LakshmiPublishers,2010ISBN:978-8131808030

Higher Engineering B.V.Ramana 1st Edition, Hill,2006, ISBN:978-0070634190

Higher Engineering H.K.Das and Er.RajnishVerma

1st Edition,Chandpublishing,2011, ISBN:9788121938907

Descriptions

Understand the basic concepts of Fourier series and Integral transforms.

Apply Laplace transform and inverse Laplace transform in solving differential equation and integral equation arising in network analysis, control system and others fields of engineering.

Demonstrate Fourier series and Integral transforms to study behaviour of periodic functions, discrete/continuous functions arising in single and system, field theory and system communication

Analyze and apply single step and multistep numerical methods in engineering problems.


Kutta method Predictor and Corrector method (No derivation of

thrd 83, rule,

cotes integration

11

Edition, Publisher, Year,

Edition, Khanna Publications,2015,

13:978-8174091956

Edition,JonWiley&Sons,

0-470-91361-1


,LakshmiPublishers,2010, 8131808030

dition, TataMcGraw-

0070634190

dition,Chandpublishing, ISBN:9788121938907

Understand the basic concepts of Fourier series and Integral transforms.

Apply Laplace transform and inverse Laplace transform in solving differential equation and integral equation arising in network analysis,

Demonstrate Fourier series and Integral transforms to study behaviour of periodic functions, discrete/continuous functions arising in single and

p numerical methods in




Department: Computer Science and Engineering Subject Name: Programming with Python

Subject Code: 18CSI302

Course Objectives:

UNIT

I

The Context of Software DevelopmentPython, The Python Interpreter, Python editors and IDEs, Learning Programming with Python, Writing a Python Program, A Python program. Values and VariablesIdentifiers, FloatingUser Input, Controlling the print Function, String Formatting, Multi line Strings. Expressions and ArithmeticOperator Precedence and Associativity, Formatting Expressions, Comments, Errors, Syntax Errors, RunArithmetic Examples, More Arithmetic Operators, Algorithms. Demonstrate program

II

Conditional ExecutionStatement The if/else Statement, Compound Boolean Expressions, The pass Statement, FloatingMulti-way Decision Statements, Conditional Expressions, Errors in Conditional Statements.Iteration: The while Statement, Definite Loops vs. Indefinite Loops, The for Statement, Nested Loops, Abnormal Loop Termination, while/else and for/else, Infinite Loops, IteratSquare Root, Drawing a Tree, Printing Prime Numbers, the Proper Input. Implement programs using Conditional Execution and Iteration.

III

Using Functions: Modules, The Builttime Functions, Random Numbers, SystemWriting Functions

Sl.No Course Objectives

1 Learn the procedure of Python interpreter installation and its working.

2 Understand the concepts of conditional and loop statements

3 Implement built-in and user defined functions.

4 Build and execute lists,





Programming with Python

Description

The Context of Software Development: About Python, Installing Python, The Python Interpreter, Python editors and IDEs, Learning Programming with Python, Writing a Python Program, A

Values and Variables: Integer Values, Variables and Assignment, Identifiers, Floating-point Numbers, Control Codes within Strings, User Input, Controlling the print Function, String Formatting, Multi

Arithmetic: Expressions, Mixed Type Expressions, Operator Precedence and Associativity, Formatting Expressions, Comments, Errors, Syntax Errors, Run-time Errors, Logic Errors, Arithmetic Examples, More Arithmetic Operators, Algorithms. Demonstrate programs on variables, expression and Arithmetic.

Conditional Execution: Boolean Expressions, The Simple if Statement The if/else Statement, Compound Boolean Expressions, The pass Statement, Floating-point Equality, Nested Conditionals,

Decision Statements, Conditional Expressions, Errors in Conditional Statements.

The while Statement, Definite Loops vs. Indefinite Loops, The for Statement, Nested Loops, Abnormal Loop Termination, while/else and for/else, Infinite Loops, Iteration Examples, Computing Square Root, Drawing a Tree, Printing Prime Numbers, Insisting on

Implement programs using Conditional Execution and Iteration.

: Introduction to Using Functions, Functions and The Built-in Functions, Standard Mathematical Functions,

time Functions, Random Numbers, System-specific Functions.Writing Functions: Function Basics, Parameter Passing,

Course Objectives

Learn the procedure of Python interpreter installation and its working.

Understand the concepts of conditional and loop statements

in and user defined functions.

Build and execute lists, tuples, dictionaries and sets in Python.


Semester: 3

L-T-P-C: 3-0-2-4

Hours

About Python, Installing Python, The Python Interpreter, Python editors and IDEs, Learning Programming with Python, Writing a Python Program, A Longer

Integer Values, Variables and Assignment, point Numbers, Control Codes within Strings,

User Input, Controlling the print Function, String Formatting, Multi

Expressions, Mixed Type Expressions, Operator Precedence and Associativity, Formatting Expressions,

time Errors, Logic Errors, Arithmetic Examples, More Arithmetic Operators, Algorithms.

s on variables, expression and Arithmetic.

8

Boolean Expressions, The Simple if Statement The if/else Statement, Compound Boolean Expressions,

point Equality, Nested Conditionals, Decision Statements, Conditional Expressions, Errors in

The while Statement, Definite Loops vs. Indefinite Loops, The for Statement, Nested Loops, Abnormal Loop Termination,

ion Examples, Computing Insisting on

Implement programs using Conditional Execution and Iteration.

7

Introduction to Using Functions, Functions and in Functions, Standard Mathematical Functions,

specific Functions. Function Basics, Parameter Passing,

Learn the procedure of Python interpreter installation and its working.

Understand the concepts of conditional and loop statements

tuples, dictionaries and sets in Python.



Documenting Functions, Function Examples, Better Organized Prime Generator, Command Simulator, Tree Drawing FunctMore on FunctionsMaking Functions Reusable, FunctiDesign programs using Functions.

IV

Lists: Motivation, List Structures, Lists (Sequences) in Python, Iterating Over Lists (Sequences) in Python, More on Python Lists.Objects: Using Objects, String Objects, List Objects.Demonstrate programs using Lists and objects.

V

Tuples, Dictionaries, and SetsDictionaries, Using Dictionaries, Counting with Dictionaries, Grouping with Dictionaries, Keyword Arguments, Sets, Set Quantification with all and any, Enumerating the Elements of a Data Demonstrate programs using Tuples, Dictionaries, and Sets.

Text Books:

Sl No

Title

1 Fundamentals of Python Programming

2 Introduction to Computer Science Using Python: A Computational ProblemSolving

Reference Books:

Sl No

Title

1 Think Python

2 Learning Python

Course Outcomes

Course outcome

Descriptions

CO1 Explain the Python and iterations.

CO2 Explicate the type of operators, built

CO3 Analyze and Design Python programs using List and object concepts.

CO4 Create, run and manipulate the structures like tuples, dictionaries and sets.



Documenting Functions, Function Examples, Better Organized Prime Generator, Command Interpreter ,Restricted Input, Better Die Rolling Simulator, Tree Drawing Function , Floating-point Equality.More on Functions: Global Variables, Default Parameters, Recursion, Making Functions Reusable, Functions as Data.

esign programs using Functions.

Motivation, List Structures, Lists (Sequences) in Python, Iterating Over Lists (Sequences) in Python, More on Python Lists.

Using Objects, String Objects, List Objects. Demonstrate programs using Lists and objects.

Tuples, Dictionaries, and Sets: Tuples, Arbitrary Argument Lists, Dictionaries, Using Dictionaries, Counting with Dictionaries, Grouping with Dictionaries, Keyword Arguments, Sets, Set Quantification with all and any, Enumerating the Elements of a Data Structure.Demonstrate programs using Tuples, Dictionaries, and Sets.


Fundamentals of Python Richard L. Halterman

Southern Adventist University2019, E-book,ISBN:9781539530268

Introduction to Computer Science Using Python: A Computational Problem-

Charles Dierbach

1st Edition, JhonInc. Publications, 2012,ISBN:9780470555156

Author(s) Edition, Publisher,

Allen Downey 2nd Edition, O’Reilly Media, ISBN: 9781491939369

B.NageshRao 1st Edition, A cyberplus publication, 2017,ISBN:9788193392300

Explain the Python syntax and be fluent in the use of Python flow control and iterations.

Explicate the type of operators, built-in libraries and functions.

Analyze and Design Python programs using List and object concepts.

Create, run and manipulate the Python programs using core data structures like tuples, dictionaries and sets.


Documenting Functions, Function Examples, Better Organized Prime Interpreter ,Restricted Input, Better Die Rolling

point Equality. Global Variables, Default Parameters, Recursion,

8

Motivation, List Structures, Lists (Sequences) in Python, Iterating Over Lists (Sequences) in Python, More on Python Lists.

8

Tuples, Arbitrary Argument Lists, Dictionaries, Using Dictionaries, Counting with Dictionaries, Grouping with Dictionaries, Keyword Arguments, Sets, Set Quantification with

Structure. Demonstrate programs using Tuples, Dictionaries, and Sets.

8

Edition, Publisher, Year, ISBN

Southern Adventist University, book,

ISBN:9781539530268

JhonWiley & Sons, Inc. Publications, 2012, ISBN:9780470555156


Edition, O’Reilly Media, 1491939369

A cyberplus , 2017,

ISBN:9788193392300

syntax and be fluent in the use of Python flow control

in libraries and functions.

Analyze and Design Python programs using List and object concepts.

Python programs using core data




Department:Computer Science and Engineering Subject Name: Data Structures

Subject Code: 18CS303

Course Objectives:

UNIT

I

Stacks and Queues:

Stacks: Definition and Examples, Representing Stacks in C. Stack Applications: Reversing Data: Reverse a list and convert decimal to binary, Parsing, Postponement: infix to postfix transformation, evaluating a postfix expression. Recursion. Queues: The Queue and its Sequential Representation, C implementation of Queue.

II

Circular queue, Priority queue and Linked list:The priority queue applications: Queue Simulation and categorizing data. Selfstructure, linking self removing nodes from a list, linked list as a data structure, examples of list operations, Header nodes. Lists in C. Array implementation of lists, limitations of array implementation.

III

Doubly linked list, Circular list and linear list implementation of Stack, linked implementation of queues. Doubly linked lists: Inserting and removing nodes from a double linked list. Circular lists: primitive operations on circular list. Circular double linked list. Linear list appllists.


1 Understand, Practice and Assimilate fundamentals of data structures and their applications essential for pr

2 Describe, Analyze, Design and Evaluate the Linear Data Structures: Stack, Queues, and Lists.

3 Describe, Analyze, Design and Evaluate the NonTrees, Tries.

4 Assess appropriate data structure during solving.





Data Structures

Description

Stacks and Queues: Structures and Pointers revisited.

Definition and Examples, Representing Stacks in C. Stack Applications: Reversing Data: Reverse a list and convert decimal to binary, Parsing, Postponement: infix to postfix transformation, evaluating a postfix expression. Recursion. Queues: The Queue and its Sequential Representation, C implementation of Queue.

Circular queue, Priority queue and Linked list: Circular Queue, and The priority queue – Array implementation of priority queue. Queue applications: Queue Simulation and categorizing data. Selfstructure, linking self –referential structures. List: Inserting and removing nodes from a list, the getnode and free node operations, the linked list as a data structure, examples of list operations, Header nodes. Lists in C. Array implementation of lists, limitations of array

Doubly linked list, Circular list and linear list applications:implementation of Stack, linked implementation of queues. Doubly linked lists: Inserting and removing nodes from a double linked list. Circular lists: primitive operations on circular list. Circular double linked list. Linear list applications: Append linked lists, Array of linked

Course Objectives

Understand, Practice and Assimilate fundamentals of data structures and their applications essential for programming/problem solving.

Describe, Analyze, Design and Evaluate the Linear Data Structures: Stack, Queues, and Lists.

Describe, Analyze, Design and Evaluate the Non-Linear Data Structures:

Assess appropriate data structure during program development/problem


Semester: 3

L-T-P-C: 4-0-0-4

Hours

Definition and Examples, Representing Stacks in C. Stack Applications: Reversing Data: Reverse a list and convert decimal to binary, Parsing, Postponement: infix to postfix transformation, evaluating a postfix expression. Recursion. Queues: The Queue and

10

Circular Queue, and Array implementation of priority queue. Queue

applications: Queue Simulation and categorizing data. Self-referential referential structures. List: Inserting and

the getnode and free node operations, the linked list as a data structure, examples of list operations, Header nodes. Lists in C. Array implementation of lists, limitations of array

11

applications: Linked implementation of Stack, linked implementation of queues. Doubly linked lists: Inserting and removing nodes from a double linked list. Circular lists: primitive operations on circular list. Circular double

ications: Append linked lists, Array of linked

11

Understand, Practice and Assimilate fundamentals of data structures and ogramming/problem solving.

Describe, Analyze, Design and Evaluate the Linear Data Structures: Stack,

Linear Data Structures:

program development/problem



IV

Trees: Basic tree concepts: Terminology, tree representation, Binary trees: properties, binary tree structure. Binary tree traversals: Tree traversal techniques: preorder, inorder and postorder, trees: infix, postfix and prefix traversal. General trees: Changing general tree to binary tree, insertion into general trees, general tree deletions.

V

Lexical Search Tree and Graphs:structure, Trie search. Graphs:Terminologies, An application of graphs, C representation of graphs, transitive closure, Warshall’s algorithm, Graph traversal techniques: Depth Breadth – First traversal

Text Books:

Sl No

Title

1 Data Structure using C

2 Data Structures: A Pseudocode Approach with C

Reference Books:

Sl No

Title

1 Data Structures and Program Design in C

2 Data Structures with C

Course Outcomes:

Course outcome

Descriptions

CO1 Define the basic concepts of data structures and their operations.

CO2 Explain the working principle of linear and non

CO3 Develop a code snippet for the implementation of data structures.

CO4 Apply concepts ofproblem.



Basic tree concepts: Terminology, tree representation, Binary trees: properties, binary tree structure. Binary tree traversals: Tree traversal techniques: preorder, inorder and postorder, trees: infix, postfix and prefix traversal. General trees: Changing general tree to binary tree, insertion into general trees, general tree

Lexical Search Tree and Graphs: Tries: Introduction to Tries, Trie structure, Trie search. Graphs:Terminologies, An application of graphs, C representation of graphs, transitive closure, Warshall’s algorithm, Graph traversal techniques: Depth – First traversal,

First traversal.


Data Structure using C Aaron M. Tenenbaum, YedidyahLangsam and Moshe J. Augenstein

1st

publicationISBN9789332543546.

Pseudocode Approach with C Richard F. Gilberg and Behrouz A. Forouzan

2nd

publication, 2007, ISBN9788131503140


Data Structures and Program Robert Kruse, C L Tondo, Bruce Leung, ShashiMogalla

2nd

2015, ISBN0132883665.

Data Structures with C Seymour Lipschutz 1st

Hill publications, 2018, ISBN0-07

Descriptions

Define the basic concepts of data structures and their operations.

Explain the working principle of linear and non-linear data structures.

Develop a code snippet for the implementation of data structures.

Apply concepts of linear and non-linear data structures to solve a


Basic tree concepts: Terminology, tree representation, Binary trees: properties, binary tree structure. Binary tree traversals: Tree traversal techniques: preorder, inorder and postorder, Expression trees: infix, postfix and prefix traversal. General trees: Changing general tree to binary tree, insertion into general trees, general tree

10

Tries: Introduction to Tries, Trie structure, Trie search. Graphs:Terminologies, An application of graphs, C representation of graphs, transitive closure, Warshall’s

First traversal, 10


st Edition,Pearson publication, 2019, ISBN-13: 9789332543546.

ndEdition,Cengage publication, 2007, ISBN-13: 9788131503140


ndEdition, PHI, 2015, ISBN-13: 978-0132883665.

st Edition, McGraw Hill publications, 2018, ISBN-13: 978-

07-070198-4

Define the basic concepts of data structures and their operations.

linear data structures.

Develop a code snippet for the implementation of data structures.

linear data structures to solve a




Department:Computer Science and Engineering Subject Name: Analog and Digital Electronic Circuits

Subject Code: 18CS304 L

Course Objectives:

UNIT

I

Basics of Semiconductor devices (Diodes and Transistors): junction diode, Characteristics and Parameters, Diode approximations, Halfrectifier, Zener diode voltage regulators: Bipolar Junction Transistors: BJT operation, Common Base, Common Emitter and Common Collector configurations. Frequency response of CE amplifier.

II

Operational amplifier and its Applications: Operational Amplifiers: Ideal OPAMP, Inverting and Non Inverting OPAMP circuits, OPAMP applications: voltage follower, adder, subtractor, integrator, differentiator,IC555 timer as Astable multivibrator, ADC (counter type) and DAC (binary weighted resistor) circuits. Sensors and transducers: sensors and their features. Types of sensors: Temperature sensor (Thermistor), Light sensor(Photodiode and LDR), Moisture/rain sensor, Motion sensors(IR sensors)

III

Boolean laws, basic gates and simplification techniques: Boolean Algebra, De Morgan’s theorem. Logic gates: NOT, AND, OR, XOR, NAND, NOR and XSOP and POS techniques, Karnaugh’s map (4 Variables) and QuineMc-Cluskey methods (Algorithm). Introduction to HDL.

IV

Combinational Circuits:Multiplexers, De-multiplexers, Decoder, BCD to Decimal Decoders, Seven Segment Decoders, Combinational circuit design using MUX IC 74153 and Decoder IC 74138. Encoders, Magnitude Comparator and ALU IC74181. HDL Implementation of combinational Circuits.


1 To acquire the basic knowledge of analog and digital electronic circuit principles.

2 To analyze and design

3 To simulate digital circuits using Verilog coding.

4 To apply the basic concepts of analog and digital circuits to develop simple engineering applications.





nd Digital Electronic Circuits

Code: 18CS304 L

Description

Basics of Semiconductor devices (Diodes and Transistors): junction diode, Characteristics and Parameters, Diode approximations, Half-wave rectifier, Full-wave rectifier, Bridge rectifier, Zener diode voltage regulators: Bipolar Junction

: BJT operation, Common Base, Common Emitter and Common Collector configurations. Frequency response of CE

Operational amplifier and its Applications: Introduction to Operational Amplifiers: Ideal OPAMP, Inverting and Non Inverting

circuits, OPAMP applications: voltage follower, adder, subtractor, integrator, differentiator,IC555 timer as Astable multivibrator, ADC (counter type) and DAC (binary weighted resistor)

Sensors and transducers: Introduction, basic operating prisensors and their features. Types of sensors: Temperature sensor (Thermistor), Light sensor(Photodiode and LDR), Moisture/rain sensor, Motion sensors(IR sensors)

Boolean laws, basic gates and simplification techniques: Algebra, De Morgan’s theorem. Logic gates: NOT, AND, OR,

XOR, NAND, NOR and X-NOR Gates. Algebraic Simplification using SOP and POS techniques, Karnaugh’s map (4 Variables) and

Cluskey methods (Algorithm). Introduction to HDL.

Circuits: Half and Full adders, 4 bit adder ( IC7483), multiplexers, Decoder, BCD to Decimal Decoders,

Seven Segment Decoders, Combinational circuit design using MUX IC 74153 and Decoder IC 74138. Encoders, Magnitude Comparator and

IC74181. HDL Implementation of combinational Circuits.

Course Objectives

To acquire the basic knowledge of analog and digital electronic circuit

To analyze and design simple analog and digital circuits.

To simulate digital circuits using Verilog coding.

To apply the basic concepts of analog and digital circuits to develop simple engineering applications.


Semester: 3

Code: 18CS304 L-T-P-C: 3-1-0-4

Hours

Basics of Semiconductor devices (Diodes and Transistors): P-N junction diode, Characteristics and Parameters, Diode

wave rectifier, Bridge rectifier, Zener diode voltage regulators: Bipolar Junction

: BJT operation, Common Base, Common Emitter and Common Collector configurations. Frequency response of CE

10

Introduction to Operational Amplifiers: Ideal OPAMP, Inverting and Non Inverting

circuits, OPAMP applications: voltage follower, adder, subtractor, integrator, differentiator,IC555 timer as Astable multi-vibrator, ADC (counter type) and DAC (binary weighted resistor)

Introduction, basic operating principles of sensors and their features. Types of sensors: Temperature sensor (Thermistor), Light sensor(Photodiode and LDR), Moisture/rain

10

Boolean laws, basic gates and simplification techniques: Laws of Algebra, De Morgan’s theorem. Logic gates: NOT, AND, OR,

NOR Gates. Algebraic Simplification using SOP and POS techniques, Karnaugh’s map (4 Variables) and

Cluskey methods (Algorithm). Introduction to HDL.

11

Half and Full adders, 4 bit adder ( IC7483), multiplexers, Decoder, BCD to Decimal Decoders,

Seven Segment Decoders, Combinational circuit design using MUX IC 74153 and Decoder IC 74138. Encoders, Magnitude Comparator and

IC74181. HDL Implementation of combinational Circuits.

11

To acquire the basic knowledge of analog and digital electronic circuit

simple analog and digital circuits.

To apply the basic concepts of analog and digital circuits to develop simple



V

Sequential logic circuits: RS Flip-Flop, Gated Fliprepresentations of flip flops and Flip flop conversions. RegisteTypes of Registers, Serial In Parallel In – Serial Out, Parallel In Register, and Applications of Shift Registers. Counters: Asynchronous Counters, Decoding Gates, Synchronous CounCounter Modulus. HDL implementation of sequential circuits.

Text Books:

Sl No

Title

1 Electronic Devices and Circuit Theory

2 Digital principles and Applications

3 Sensors and Transducers

Reference Books:

Sl No

Title

1 Op-amp and linear Integrated circuits

2 Basic Electronics

Course Outcomes

Course outcome

Descriptions

CO1 Understand the operating principles of basic analog and digital electronic devices

CO2 Design simple analog electronic circuits such as rectifiers, amplifier and clock circuits, ADC and DAC and to design combinational and sequential digital circuits

CO3 Apply the concepts of analog and digital electronic in real time applications

CO4 Simulate simple analog and digital circuits using Verilog code.



Sequential logic circuits: Introduction to Flip-Flops, Basic RS latch, Flop, Gated Flip-Flops: JK FF, D FF, T FF. Various

representations of flip flops and Flip flop conversions. RegisteTypes of Registers, Serial In – Serial Out, Serial In – Parallel out,

Serial Out, Parallel In – Parallel Out, Universal Shift Register, and Applications of Shift Registers. Counters: Asynchronous Counters, Decoding Gates, Synchronous Counters, Changing the Counter Modulus. HDL implementation of sequential circuits.

Author(s) Edition, Publisher, Year,

Electronic Devices and Robert L. Boylestad, Louis Nashelsky

11th Edition, Prentice Hall, 2015, ISBN:

Digital principles and Donald P Leach, Albert Paul Malvino

8th Edition, 2014, ISBN:

Sensors and Transducers D. Patranabis 2nd Edition India Learning Private Limited, 200381203219

Author(s) Edition, Publisher, Year,

Ramakant A. Gaikwad

4th Edition, EducationISBN-13: 978

D.P. Kothari, I. J. Nagrath

2nd Edition, Hill EducationISBN-13: 978

Descriptions

Understand the operating principles of basic analog and digital electronic devices

Design simple analog electronic circuits such as rectifiers, amplifier and clock circuits, ADC and DAC and to design combinational and sequential digital circuits

Apply the concepts of analog and digital electronic in real time

Simulate simple analog and digital circuits using Verilog code.


Flops, Basic RS latch, Flops: JK FF, D FF, T FF. Various

representations of flip flops and Flip flop conversions. Registers: Parallel out,

Parallel Out, Universal Shift Register, and Applications of Shift Registers. Counters: Asynchronous

ters, Changing the Counter Modulus. HDL implementation of sequential circuits.

10


Edition, Prentice Hall, ISBN: 9789332542600

Edition, Mcgraw Hill, ISBN:9789339203405

dition ,Prentice Hall India Learning Private

2003, ISBN-13: 978-


Edition, Pearson Education, 2015,

978-9332549913

Edition, McGraw Hill Education, 2017,

978-9352606467

Understand the operating principles of basic analog and digital

Design simple analog electronic circuits such as rectifiers, amplifier and clock circuits, ADC and DAC and to design combinational and

Apply the concepts of analog and digital electronic in real time

Simulate simple analog and digital circuits using Verilog code.




Department: Computer Science and Engineering

Subject Name:Discrete Mathematical Structures


Course Objectives:

UNIT

I

Introduction to Graph Theory: Subgraphs, Complements, and Graph Isomorphism, Vertex Degree: Euler Trails and Circuits, Planar Graphs, Hamilton Paths and Cycles, Graph Colouring and Chromatic Polynomials.Trees: Definitions, Properties and Examples, Rooted Tree.

II

Relations and FunctionsFunctions- plain, One to One and On to functions. Stirling number of second kind. Special functions. Function composition and inverse functions. The Pigeonhole principle.Properties of Relations:and directed graphs, Partial orders and Hasse Diagrams, Equivalence relations and partitions.

III

Fundamental Principles of Counting:Permutations and Combinations, Binomial Thewith repetitions. The principles of Inclusion and Exclusion: Inclusion and Exclusion, Generalization of Principle. DerangementsNothing is in its right place. Rook Polynomials, Arrangements with forbidden positions

IV

Groups and RingsHomomorphism, Isomorphism and Cyclic groups. Cosets and Lagrange’s Theorem.

Ringstructure- definitions and examples. Ring property and substructures. Ring integer

V

Generating Functions: Examples: Calculation Techniques, Partitions of Integers, The Exponential Generating function Recurrence Relations: Formulation and Examples. Second order linear Homogeneous Recurrence Relations with constant coefficients.


1 Solve problems using counting techniques and combinatorics.

2 Perform operations on discrete structures such as sets, functions, relations or sequences.

3 Solve problems involving recurrence

4 Apply algorithms and use definitions to solve problems.





Discrete Mathematical Structures

Description

Introduction to Graph Theory: Definitions and Examples, Subgraphs, Complements, and Graph Isomorphism, Vertex Degree:

and Circuits, Planar Graphs, Hamilton Paths and Cycles, Graph Colouring and Chromatic Polynomials.

Definitions, Properties and Examples, Rooted Tree.

Functions: Cartesian products and relations. plain, One to One and On to functions. Stirling number of

second kind. Special functions. Function composition and inverse functions. The Pigeonhole principle. Properties of Relations: Computer Recognition – Zero-one matrices and directed graphs, Partial orders and Hasse Diagrams, Equivalence relations and partitions.

damental Principles of Counting: The rules of Sum and productPermutations and Combinations, Binomial Theorem, Combinations

The principles of Inclusion and Exclusion: The principles of Inclusion and Exclusion, Generalization of Principle. DerangementsNothing is in its right place. Rook Polynomials, Arrangements with forbidden positions

Groups and Rings: Definitions examples and elementary properties. sm, Isomorphism and Cyclic groups. Cosets and

Lagrange’s Theorem. definitions and examples. Ring property and Ring integer modulo n.

Generating Functions: Introductory Examples, Definitions and Examples: Calculation Techniques, Partitions of Integers, The Exponential Generating function Recurrence Relations: First order linear recurrence relations. Formulation and Examples. Second order linear Homogeneous

ecurrence Relations with constant coefficients.

Course Objectives

Solve problems using counting techniques and combinatorics.

Perform operations on discrete structures such as sets, functions, relations

Solve problems involving recurrence relations and generating functions.

Apply algorithms and use definitions to solve problems.


Semester: 3

L-T-P-C: 3-0-0-3

Hours

Definitions and Examples, Subgraphs, Complements, and Graph Isomorphism, Vertex Degree:

and Circuits, Planar Graphs, Hamilton Paths and Cycles,

Definitions, Properties and Examples, Rooted Tree.

8

Cartesian products and relations. plain, One to One and On to functions. Stirling number of

second kind. Special functions. Function composition and inverse

one matrices and directed graphs, Partial orders and Hasse Diagrams, Equivalence

8

The rules of Sum and product- orem, Combinations

The principles of Inclusion and Exclusion, Generalization of Principle. Derangements- Nothing is in its right place. Rook Polynomials, Arrangements with

7

: Definitions examples and elementary properties. sm, Isomorphism and Cyclic groups. Cosets and

definitions and examples. Ring property and

8

Introductory Examples, Definitions and Examples: Calculation Techniques, Partitions of Integers, The

First order linear recurrence relations. Formulation and Examples. Second order linear Homogeneous

8

Solve problems using counting techniques and combinatorics.

Perform operations on discrete structures such as sets, functions, relations

relations and generating functions.



Text Books:

Sl No

Title

1 Discrete and Combinatorial Mathematics

Reference Book:

Sl No

Title

1 Discrete Mathematics and its applications

2 Discrete Mathematics

Course Outcomes

Course outcome

Descriptions

CO1 Recall the basics of Discrete Mathematical Structure.

CO2 Formulate and solve abstract mathematical problems.

CO3 Apply the knowledge of mathematics in the field of computer science.

CO4 Develop mathematical model for a given problem.




Ralph P. Grimaldi 5thEdition, PHI/ Pearson Education, 2004,ISBN-13: 978ISBN-10: 0201726343


Kenneth H Rosen 7thEdition, McGraw HillISBN-13: 9780073383095ISBN-10: 0073383090

Trembly and Manohar

1st Edition,McGraw Hill Education, 2017,ISBN-13: 978

Descriptions

Recall the basics of Discrete Mathematical Structure.

Formulate and solve abstract mathematical problems.

knowledge of mathematics in the field of computer science.

Develop mathematical model for a given problem.



Edition, PHI/ Pearson Education, 13: 978-0201726343,

0201726343


Edition, McGraw Hill,2011, 13: 9780073383095 10: 0073383090

McGraw Hill Education, 13: 978-0074631133

Formulate and solve abstract mathematical problems.

knowledge of mathematics in the field of computer science.




Department: Computer Science and Engineering Subject Name: Computer Organization


Course Objectives:

UNIT

I

Introduction to Computer Organizationcomputers, Bus Structures, Performance of a Computer: clock, Basic Performance equation, Pipelining and Superscalar Operation, Clock rate, Instruction set: CISC and RISC, Performance Measurements, Multiprocessors and Multicomputers.Machine Instructions and Programs: Byte addressability, BigAlignment, Accessing Numbers, Characters & Character strings; Memory operations, Instruction & Instruction Sequencing: Register Transfer Notation, Assembly Language Notation. Basic Instruction Types, Instruction execution & StraightCondition codes.Case Study:

II

Machine Instructions and Programs (Contd...) and Basic Processing Unit: language: Assembler Directives, Stacks and Queues, Subroutines: Subroutine nesting & processor stack, Parameter passing, The Stack Frame. Basic Processing Unit: Transfers, Performing an Arithmetic or Logic operation, Fetching a word from Memory, storing a word in Memory; Execution of a complete instruction: Branch instruction; Multiple bus organization: Hardwired control, A complete processor; Micro programmed control, Micro instructions. Case Study: Pentium Processors, Pentium DuaCore i3Processors, Intel Core i5 Processors, Intel Core i7 Processors.

III

Arithmetic: Addition & subtractions of signed Numbers: Addition/Subtraction logic UNIT; Multiplication of positive numbers: Signed operand multiplication:Bit-pair recording of multipliers; Integer division, IEEE standard for floating-point numbers.


1 Study the basic structure and operation of a digital computer.

2 Understand the instruction formats used in the design of processors.

3 Know the various design

4 Understand the organization of control unit, I/O unit and memory unit.





Computer Organization

Description

Introduction to Computer Organization: Basic structure of computers, Bus Structures, Performance of a Computer: clock, Basic Performance equation, Pipelining and Superscalar Operation, Clock rate, Instruction set: CISC and RISC, Performance Measurements, Multiprocessors and Multicomputers. Machine Instructions and Programs: Memory Locations & Address:

addressability, Big-endian & Little-endian assignments, Word Alignment, Accessing Numbers, Characters & Character strings; Memory operations, Instruction & Instruction Sequencing: Register Transfer Notation, Assembly Language Notation. Basic Instruction ypes, Instruction execution & Straight-line sequencing, Branching,

Case Study: Intel 8085 and 8086 Family.

Machine Instructions and Programs (Contd...) and Basic : Addressing Modes: Addressing modes, Assembly

Assembler Directives, Stacks and Queues, Subroutines: Subroutine nesting & processor stack, Parameter passing, The Stack

Basic Processing Unit: Some fundamental concepts: Register Transfers, Performing an Arithmetic or Logic operation, Fetching a

rd from Memory, storing a word in Memory; Execution of a complete instruction: Branch instruction; Multiple bus organization: Hardwired control, A complete processor; Micro programmed control,

Pentium Processors, Pentium Dual Core Processor, Intel

Core i3Processors, Intel Core i5 Processors, Intel Core i7 Processors.

: Addition & subtractions of signed Numbers: Addition/Subtraction logic UNIT; Multiplication of positive numbers: Signed operand multiplication: Booth algorithm; Fast Multiplication:

pair recording of multipliers; Integer division, IEEE standard for point numbers.

Course Objectives

Study the basic structure and operation of a digital computer.

Understand the instruction formats used in the design of processors.

Know the various design philosophy of central processing unit

Understand the organization of control unit, I/O unit and memory unit.


Semester: 3

L-T-P-C: 3-0-0-3

Hours

: Basic structure of computers, Bus Structures, Performance of a Computer: Processor clock, Basic Performance equation, Pipelining and Superscalar Operation, Clock rate, Instruction set: CISC and RISC, Performance

Memory Locations & Address: endian assignments, Word

Alignment, Accessing Numbers, Characters & Character strings; Memory operations, Instruction & Instruction Sequencing: Register Transfer Notation, Assembly Language Notation. Basic Instruction

line sequencing, Branching,

8

Machine Instructions and Programs (Contd...) and Basic Addressing Modes: Addressing modes, Assembly

Assembler Directives, Stacks and Queues, Subroutines: Subroutine nesting & processor stack, Parameter passing, The Stack

Some fundamental concepts: Register Transfers, Performing an Arithmetic or Logic operation, Fetching a

rd from Memory, storing a word in Memory; Execution of a complete instruction: Branch instruction; Multiple bus organization: Hardwired control, A complete processor; Micro programmed control,

l Core Processor, Intel Core i3Processors, Intel Core i5 Processors, Intel Core i7 Processors.

8

: Addition & subtractions of signed Numbers: Addition/Subtraction logic UNIT; Multiplication of positive numbers:

Booth algorithm; Fast Multiplication: pair recording of multipliers; Integer division, IEEE standard for

7

Study the basic structure and operation of a digital computer.

Understand the instruction formats used in the design of processors.

philosophy of central processing unit

Understand the organization of control unit, I/O unit and memory unit.



IV

Input/output OrganizationInterrupt hardware, Enabling & Disabling Interrupts, Multiple devices, Controlling Device Requests, Exceptions; Direct memory access: Bus arbitration; Buses: Synchronous Bus, Asynchronous bus.Interface circuits: Parallel port, Serial port; Standard I/O interfaces: PCI bus, SCSI bus, USB,Case Study:SATA,IrDA, Ethernet,AGP,HDMI, Interrupt Controller, DMA Controller.

V

The Memory Systemmemories: Internal organization of Memory chips, static memories, Asynchronous Drams, Synchronous DRAMs, Memory system considerations, ReadFlash memory; Cache memories: Mapping functions; Virtual memories: Address translation.Case Study: HD Card, USB Memory.Note: Case Studies are for internal evaluation only.

Text Books:

Sl No

Title

1 Computer Organization

Reference Books:

Sl No

Title

1 Computer Organization and Architecture: Designing for performance

2 Computer System Architecture

3 Computer Organization and Design, The Hardware Software interface.

Course Outcomes

Course outcome

Descriptions

CO1 Acquire the knowledge of basic structures of computers and machine instructions.

CO2 Describe various arithmetic and logical operations performed in computers.

CO3 Discuss the working principles of input/output units and internal organization of computer.

CO4 Analyze the performance issues and design tradeoffconstructing a computer processor including memory.



Input/output Organization: Accessing I/O devices, Interrupts, Interrupt hardware, Enabling & Disabling Interrupts, Multiple devices, Controlling Device Requests, Exceptions; Direct memory access: Bus arbitration; Buses: Synchronous Bus, Asynchronous bus.Interface circuits: Parallel port, Serial port; Standard I/O interfaces: PCI bus, SCSI bus, USB,

SATA,IrDA, Ethernet,AGP,HDMI, Interrupt Controller,

The Memory System: Some Basic concepts: Semiconductor RAM memories: Internal organization of Memory chips, static memories, Asynchronous Drams, Synchronous DRAMs, Memory system

erations, Read-only memories: ROM, PROM, EPROM, EEPROM, Flash memory; Cache memories: Mapping functions; Virtual memories: Address translation.

HD Card, USB Memory. Case Studies are for internal evaluation only.


Computer Organization Carl Hamacher, Z Vranesic& S Zaky,

5th Edition, McGraw Hill, 2011.ISBN-13:978


Organization and Architecture: Designing for

William Stallings 10thedition, ISBN:978

Morris Mano 3rdEdition, PHI,ISBN: 978

Computer Organization and Hardware

David A Patterson 5th EditionISBN: 978

Descriptions

Acquire the knowledge of basic structures of computers and machine

Describe various data representational methods and explain the arithmetic and logical operations performed in computers.

Discuss the working principles of input/output units and internal organization of computer.

Analyze the performance issues and design tradeoffconstructing a computer processor including memory.


: Accessing I/O devices, Interrupts, Interrupt hardware, Enabling & Disabling Interrupts, Handling Multiple devices, Controlling Device Requests, Exceptions; Direct memory access: Bus arbitration; Buses: Synchronous Bus, Asynchronous bus.Interface circuits: Parallel port, Serial port;

SATA,IrDA, Ethernet,AGP,HDMI, Interrupt Controller,

8

: Some Basic concepts: Semiconductor RAM memories: Internal organization of Memory chips, static memories, Asynchronous Drams, Synchronous DRAMs, Memory system

only memories: ROM, PROM, EPROM, EEPROM, Flash memory; Cache memories: Mapping functions; Virtual

8


Edition, McGraw Hill, 13:978-1259005275


edition, Pearson, 2010, ISBN:978-0-13-410161-3

Edition, PHI, 2016 978-9332585607

Edition, Elsevier, 2014, ISBN: 978-0-12-407726-3

Acquire the knowledge of basic structures of computers and machine

data representational methods and explain the arithmetic and logical operations performed in computers.

Discuss the working principles of input/output units and internal

Analyze the performance issues and design tradeoffs in designing and constructing a computer processor including memory.



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Department: Mathematics Subject Name: Fundamental Mathematics Subject Code: 18DIP306

Course Objectives:

UNIT

I

DifferentialCalculu(without proof), Leibnitz’s anglebetweenthe Problems. Taylor’s andIllustrative example

II

Partial DiffEuler’stheoremforhotwovariables.Totaldcomposite and imp

III IntegralCalculus:S

sinm

xcosn

x

Examples.Doublean

IV

OrdinarydifferentisolutionsoffirstorderadifferentialequationHigherorderODE’s:orderequations with homogeneous equa

V Probability: Introduction, probability. Addition and multiplication theorems, Conditional probability-illustrative examples. Baye’s theorem


1 The purpose of this course is to make students to develop a basic Mathematical knowledge required for higher semesters

2 Introduce the concept of nth differentiation and polar curves.

3 Introduce the concept of differentiation and integration arising in engineering applications.

4 The concept of probability and their applications in different engineering, science and social science fields.




Mathematics

Fundamental Mathematics

L-T-

Description

us: nth derivatives of some standard functions (without proof), Leibnitz’s Theorem (statement),Po

e radiusvectorand the tangentpedales. Taylor’s andMaclaurin’sseries expansions of one variable

examples.

fferentiation: Partial derivatives, homogeneous fderivatives, Total differential, and differentiationplicitfunction, Jacobians.

Statementofreductionformulae forsinn

x, c

andevaluationof thesewithstandnd tripleintegrals-Simpleexamples.

ialequations(ODE’s): Inerandfirstdegree differentialequations,ns.

rODE’s:Linear differential equations of second ons with constant coefficients. Homogene

ations. Solutions of initial valueproblems.

: Introduction, Sample space and events. Axioms of probability. Addition and multiplication theorems, Conditional

illustrative examples. Baye’s theorem-problems.

Course Objectives

The purpose of this course is to make students to develop a basic Mathematical knowledge required for higher semesters

Introduce the concept of nth differentiation and polar curves.

Introduce the concept of differentiation and integration arising in engineering applications.

The concept of probability and their applications in different engineering, science and social science fields.


Semester: 3

-P-C: 3 – 0 – 0 - 3

Hours

derivatives of some standard functions olarcurves–alequation-

s of one variable -

8

Partial derivatives, functionsof

and differentiationof

8

x, cosn

x, and

ndardlimits-

8

ntroduction-exact,linear

ond and higher ous /non-

lems.

7

Sample space and events. Axioms of probability. Addition and multiplication theorems, Conditional

problems.

8

The purpose of this course is to make students to develop a basic

Introduce the concept of nth differentiation and polar curves.

Introduce the concept of differentiation and integration arising in

The concept of probability and their applications in different engineering,



Text Books:

Sl No

Title



Reference Books:

Sl No

Title


2 Advanced Modern Engineering Mathematics

3 Higher Engineering

Course Outcomes

Course outcome

Descriptions

CO1 To understand the basic concept of calculus like differentiation and integration.

CO2 To understand the concepts of partial differentiation and differential equations

CO3 To understand the double and triple integral.

CO4 To apply the concept of probability in problem solving and relate the solutions to the various engineering streams.




Higher Engineering B.S.Grewal 43rdEdition, Khanna Publications,2015, ISBN-13:978-8174091956

Advanced Engineering E.Kreyszig 10th Edition,JonWiley&Sons,ISBN:978-0-470-91361


A text book ofEngineering N.P.Bali and Manish Goyal

7thEdition, Lakshmi Publishers,2010,ISBN:978

Advanced Modern Engineering Glyn James 4thEdition,ISBN:9788131711248

Higher Engineering Mathematics B.V.Ramana 1stEdition, TataMcGrawHill, 2006,ISBN:9780070634190

Descriptions

To understand the basic concept of calculus like differentiation and integration.

To understand the concepts of partial differentiation and differential equations arising in a variety of engineering applications.

To understand the double and triple integral.

To apply the concept of probability in problem solving and relate the solutions to the various engineering streams.



Edition, Khanna Publications,2015, 8174091956

,JonWiley&Sons, 2015, 91361-1


dition, Lakshmi Publishers,2010, ISBN:978-8131808030

Edition, Pearson, 2011, ISBN:9788131711248

Edition, TataMcGraw-Hill, 2006, ISBN:9780070634190

To understand the basic concept of calculus like differentiation and

To understand the concepts of partial differentiation and differential in a variety of engineering applications.

To apply the concept of probability in problem solving and relate the




Department: Computer Science and Engineering Subject Name: Data Structures Lab


Course Objectives:

Design and develop C programs on the following concepts:

LAB CYCLES

I Structures, Pointers

II Stacks, Queues

III Trees

Pattern for practical exam conduction:

� For laboratories having only one part: Students are allowed to pick one experiment from the lot with equal opportunity.

� For laboratories having PART A and PART B: Students are allowed to pick one experiment from PART A and one experiment from PART B, with equal opportunity.

� Change of experiment is allowed only once and 20% of the maximum marks to be deducted.

Course Outcomes:

Sl. No

Course Objectives

1 To develop skills to design and analyze simple linear and nonlinear data structures.

2 To Strengthen the ability to identify and apply the given real world problem.

3 To gain knowledge in practical applications of data structures.

Course outcome

Descriptions

CO1 Understand and use pointers, files, structures and unions in program development.

CO2 Use data structures like stacks and queues to solve problems in Computer field.

CO3 Apply the concept of linked lists in

CO4 Design and implement solutions based on advanced data structures.





Data Structures Lab

Design and develop C programs on the following concepts:

Description

Pointers and memory allocation functions.

Queues and Linked lists

Pattern for practical exam conduction:

For laboratories having only one part: Students are allowed to pick one experiment from the lot with equal opportunity. For laboratories having PART A and PART B: Students are allowed to pick one experiment from PART A and one experiment from PART B, with equal

Change of experiment is allowed only once and 20% of the maximum marks to be

Course Objectives

To develop skills to design and analyze simple linear and nonlinear data

To Strengthen the ability to identify and apply suitable data structure for the given real world problem.

To gain knowledge in practical applications of data structures.

Descriptions

Understand and use pointers, files, structures and unions in program

Use data structures like stacks and queues to solve problems in Computer field.

Apply the concept of linked lists in solving problems.

Design and implement solutions based on advanced data structures.


Semester: 3

L-T-P-C: 0-0-2-1

For laboratories having only one part: Students are allowed to pick one experiment

For laboratories having PART A and PART B: Students are allowed to pick one experiment from PART A and one experiment from PART B, with equal

Change of experiment is allowed only once and 20% of the maximum marks to be

To develop skills to design and analyze simple linear and nonlinear data

suitable data structure for

To gain knowledge in practical applications of data structures.

Understand and use pointers, files, structures and unions in program

Use data structures like stacks and queues to solve problems in

Design and implement solutions based on advanced data structures.



Syllabus for the Academic Year Department: Computer Science and Engineering Subject Name: Analog and Digital Electronic Circuits Lab


Course Objectives:


1 To get an exposure to design, test and evaluate the performance of basic electronic devices and circuits.

2 To study, analyse, design, verify and evaluate thecombinational and sequential logic circuits

Lab cycles

I

1. To simulate the operation of i) Half wave and full wave rectifier ii) RC coupled CE amplifier and to plot the frequency response

2. To simulate i) Diode clipping and clamping ii) Inverting and non

II

3. To simulate the operations of i) Op-amp such as: integrator, differentiatorii) A-stable multi

4. To simulate the working of i) ADC and DAC ii) To study the working of sensors such as: LDR and PIR

III

5. To Realize the given Boolean equation (4 variables) using minimum number of gates.

i) Using basic gates ii) Using universal gates

6. To Implement 47. Multiplexers&Demultiplexers

To verify the truth tables of 8:1 MUX and 1:8 DEMUX using IC 74151 and IC74149

8. Adders &SubtractorsTo implement Full Adder and Full Subtractor using IC 74153 (MUX).

IV

9. To realize i) 1-bit comparator using logic gates. ii) 4 bit magnitude comparator using IC 7485.

Decoders and Encoders.i) Display the digits from 0 to 9 using BCD

Decoder (IC 7447).ii) Implement Decimal



Syllabus for the Academic Year – 2020 - 2021


nd Digital Electronic Circuits Lab

Course Objectives

To get an exposure to design, test and evaluate the performance of basic electronic devices and circuits.

To study, analyse, design, verify and evaluate the performance of combinational and sequential logic circuits

Description

To simulate the operation of Half wave and full wave rectifier RC coupled CE amplifier and to plot the frequency response

Diode clipping and clamping circuit Inverting and non-inverting amplifiers using Op

To simulate the operations of amp such as: integrator, differentiator

stable multi-vibrator using IC555 timer for the given Duty cycleTo simulate the working of

ii) To study the working of sensors such as: LDR and PIR

To Realize the given Boolean equation (4 variables) using minimum number of gates.

Using basic gates Using universal gates

To Implement 4-bit adder/subtractor using IC 7483. Multiplexers&Demultiplexers

To verify the truth tables of 8:1 MUX and 1:8 DEMUX using IC 74151 and IC74149

Adders &Subtractors To implement Full Adder and Full Subtractor using IC 74153 (MUX).

bit comparator using logic gates. ii) 4 bit magnitude comparator using IC 7485.

Decoders and Encoders. i) Display the digits from 0 to 9 using BCD

Decoder (IC 7447). ii) Implement Decimal-to-BCD Encoder using IC 74148.


2021

Semester: 3

L-T-P-C: 0-0-2-1

To get an exposure to design, test and evaluate the performance of basic

performance of

RC coupled CE amplifier and to plot the frequency response

inverting amplifiers using Op-amp IC 741

vibrator using IC555 timer for the given Duty cycle

To Realize the given Boolean equation (4 variables) using minimum

To verify the truth tables of 8:1 MUX and 1:8 DEMUX using IC 74151

To implement Full Adder and Full Subtractor using IC 74153 (MUX).

i) Display the digits from 0 to 9 using BCD-to-7 Segment ii)

BCD Encoder using IC 74148.



10. Flip-Flops. i) Verify the truth tables of SR gates.ii) Verify the truth table of JK Master7476.

11. To Realize and study Ring and Johnson counters using IC 7495.

V

12.Design a 3(ripple counter)

13.Design a 3given modulus.14.i) Write the verilog/VHDL code for full adder. Simulateand verify its

working. ii) Write the verilog/VHDL code for an 8:1 multiplexer.verify its working.

15.i) Write the verilog/VHDL code for D flip flop with positiveedge triggering. Simulate and verify its working.

ii) Write the verilog/VHDL code for modSimulate and verify its working.

Note: In Semester End practical exam from the lot 1 to 15.

Course Outcomes:

Course outcome

Descriptions

CO1 To identify various electronic components and to test the working of basic electronic circuits such as and few sensors

CO2 To simulate and verify the functions of basic electronic circuits using Pspice

CO3 To design and verify the working of simple combinational and sequential logic circuits

CO4 To simulate and verify the working of simple digital circuits



i) Verify the truth tables of SR and D flip flops using NAND gates. ii) Verify the truth table of JK Master-Slave flip flop using IC 7476.

To Realize and study Ring and Johnson counters using IC 7495.

Design a 3-bit asynchronous up counter and down counter (ripple counter) using IC 7476 for the given modulus.Design a 3-bit synchronous counter using IC 7476 for the

given modulus. i) Write the verilog/VHDL code for full adder. Simulateand verify its

ii) Write the verilog/VHDL code for an 8:1 multiplexer.verify its working. i) Write the verilog/VHDL code for D flip flop with positive

edge triggering. Simulate and verify its working. ii) Write the verilog/VHDL code for mod-8 up counter.Simulate and verify its working.

Semester End practical exam Students are allowed to pick one

Descriptions

To identify various electronic components and to test the working of basic electronic circuits such as rectifier, amplifier, timer, ADC, DACs and few sensors

To simulate and verify the functions of basic electronic circuits using P

To design and verify the working of simple combinational and sequential

To simulate and verify the working of simple digital circuits


and D flip flops using NAND

Slave flip flop using IC

To Realize and study Ring and Johnson counters using IC 7495.

bit asynchronous up counter and down counter using IC 7476 for the given modulus.

bit synchronous counter using IC 7476 for the

i) Write the verilog/VHDL code for full adder. Simulateand verify its

ii) Write the verilog/VHDL code for an 8:1 multiplexer. Simulate and

i) Write the verilog/VHDL code for D flip flop with positive-

8 up counter.

Students are allowed to pick one experiment

To identify various electronic components and to test the working of rectifier, amplifier, timer, ADC, DACs

To simulate and verify the functions of basic electronic circuits using P-

To design and verify the working of simple combinational and sequential

To simulate and verify the working of simple digital circuits

SRI SIDDHARTHA INSTITUTE OF (A Constituent College of Siddhartha Academy of Higher Education, Tumakuru)


Syllabus for the Academic Year

Department: Electrical & Electronics Engineering Subject Name: SKILL DEVELOPMENT

Subject Code: HS-18SK301

Course Objectives:

UNIT

I Introduction, Training Objective Advantage of learning Aptitude, Importance of Learning Aptitude, how to crack Aptitude Vedic mathematics, squaring, cubing, one to one method, two to one method Shortcuts, Basic Mathematics, Multiplication method.

II Number system, prime number concept, linear equations, age problems, HCF and LCM, Factorial Concept, Last Digit Concept, Remainders Concept, approximation, and simplifications, in equalities Square root and Cube root, Coding and Decodingmirror image.

III Percentage-percent to decimal fraction conversion, percentage to quantity, inverse case, percentage change ,relative percentage, product constancy, problems based on population, results on depreciation, Ratio and proportion, Inverse Proportion ,blood relation & family tree, Time speed and distance, relative speed and conversions ,train problems, Direction Problems, Downstream and Upstream, direction sense.

IV Verbal analogies, Spotting errors, Antonyms, Synonyms, Spellings, Ordering of words, Sentence improvement, Closet test, one

V Introduction, Soft Skills, Communication Skills, Building Skill Training, stress management, Behavioral management

Question paper Pattern:

50 questions and each question carry one mark each

Reference Book:

Sl. No.

Reference Book title

1 Quantitative aptitude for cat

2 Fast Track objective Arithmetic

SlNo Course Objectives

1 Unique shortcut techniques for mental ability to improve speed and accuracy

2 Improve logical thinking to solve various questions and puzzles in reasoning.

3 Excellent communication, time

4 Approach oriented training and interactive methodology.

5 Create amicable relationships to meet professional objectives

6 To give better idea on different topics to increase the competency of the students in the

subject.

SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURUonstituent College of Siddhartha Academy of Higher Education, Tumakuru)



Department: Electrical & Electronics Engineering

Subject Name: SKILL DEVELOPMENT-I

18SK301 L-T

Description

Introduction, Training Objective Advantage of learning Aptitude, Importance of Learning Aptitude, how to crack Aptitude Vedic mathematics, squaring, cubing, one to one method, two to one method Shortcuts, Basic Mathematics, Square root method,

Number system, prime number concept, linear equations, age problems, HCF and LCM, Factorial Concept, Last Digit Concept, Remainders Concept, approximation, and simplifications, in equalities Square root and Cube root, Coding and Decoding

percent to decimal fraction conversion, percentage to quantity, inverse case, percentage change ,relative percentage, product constancy, problems based on population, results on depreciation, Ratio and proportion, Inverse Proportion

tion & family tree, Time speed and distance, relative speed and conversions ,train problems, Direction Problems, Downstream and Upstream, direction sense.

Verbal analogies, Spotting errors, Antonyms, Synonyms, Spellings, Ordering of words, Sentence improvement, Closet test, one-word substitution

Introduction, Soft Skills, Communication Skills, LSRW, Team Building and Leadership Building Skill Training, stress management, Behavioral management


Reference Book title Author Volume and Year of Edition

Quantitative aptitude for cat Arun Sharma 2012

Arihant publications, 2016

Unique shortcut techniques for mental ability to improve speed and accuracy

Improve logical thinking to solve various questions and puzzles in reasoning.

Excellent communication, time management and problem solving

Approach oriented training and interactive methodology.

Create amicable relationships to meet professional objectives

To give better idea on different topics to increase the competency of the students in the

TUMAKURU onstituent College of Siddhartha Academy of Higher Education, Tumakuru)

Semester: III

T-P-C: 0-0-2-1

Hours

Introduction, Training Objective Advantage of learning Aptitude, Importance of Learning Aptitude, how to crack Aptitude Vedic mathematics, squaring, cubing, one to

Square root method,

03

Number system, prime number concept, linear equations, age problems, HCF and LCM, Factorial Concept, Last Digit Concept, Remainders Concept, approximation, and simplifications, in equalities Square root and Cube root, Coding and Decoding-

06

percent to decimal fraction conversion, percentage to quantity, inverse case, percentage change ,relative percentage, product constancy, problems based on population, results on depreciation, Ratio and proportion, Inverse Proportion

tion & family tree, Time speed and distance, relative speed and conversions ,train problems, Direction Problems, Downstream and Upstream,

08

Verbal analogies, Spotting errors, Antonyms, Synonyms, Spellings, Ordering of word substitution

06

LSRW, Team Building and Leadership 05

Volume and Year of Edition

Arihant publications, 2016

Unique shortcut techniques for mental ability to improve speed and accuracy

Improve logical thinking to solve various questions and puzzles in reasoning.

To give better idea on different topics to increase the competency of the students in the



3 Quantitative Aptitude quantum cat

4 The power of soft skills

5 The 7 habits of highly effective people

Course Outcomes

Course outcome Descriptions

CO1 Understand the basic concepts of quantitative ability, logical reasoning, verbal

reasoning, and also soft skills.

CO2 Inclusive and engaging environment for a dynamic campus community

CO3 Proficient use of qualitative and quantitative methods in problem solving

CO4 Critical and analytical thinking across a range of discipline.



Sarvesh K. Verma 2015

Robert A. Johnson New edition 2019

Stephen R. Covey 2010

Descriptions

Understand the basic concepts of quantitative ability, logical reasoning, verbal

reasoning, and also soft skills.

Inclusive and engaging environment for a dynamic campus community

Proficient use of qualitative and quantitative methods in problem solving

Critical and analytical thinking across a range of discipline.


New edition 2019

Understand the basic concepts of quantitative ability, logical reasoning, verbal

Inclusive and engaging environment for a dynamic campus community

Proficient use of qualitative and quantitative methods in problem solving



COURSE ASSESSMENT METHODS (THEORY)

TESTS

MID. TERM EXAM

ASSIGNMENT/QUIZ

/SURPRISE TEST

COURSE ASSESSMENT METHODS (PRACTICAL)

TESTS

DEMONSTRATION/

DOCUMENTATION

MID. TERM EXAM

PRACTICAL



COURSE ASSESSMENT METHODS (THEORY)

CIE SEE

20

50 MID. TERM EXAM 20 50

ASSIGNMENT/QUIZ

/SURPRISE TEST

10

COURSE ASSESSMENT METHODS (PRACTICAL)

CIE SEE

20

50 DEMONSTRATION/

DOCUMENTATION

30 50

OBJECT ORIENTED PROGRAMMING (18CSI402)

COURSE ASSESSMENT METHOD

CIE SEE

MID. TERM EXAM 20 50 50

PRACTICAL 30


OBJECT ORIENTED PROGRAMMING (18CSI402)



Syllabus Syllabus Syllabus Syllabus

Department: Mathematics

Subject Name: Probability and Queuing Theory


Course Objectives:

UNIT

I

Probability Distributions: Random variables mass/density functions. Binomial distribution, Poisson’s distribution with mean and variance. Exponential distribution and Normal distribution (without derivations), problems.

II

Joint probability distribution:discrete random variables, Marginal distributions, Expectation, covariance, problems.Stochastic Process: Vector, Stochastic Matrix, Regular Stochastic Matrix, TraProbabilities and Transition probability Matrix, Higher Transition Probabilities, problems.

III

Statistical Methods: coefficient of Correlation, problems. Regression analysisregression (without proof) problems.Curve Fitting: Curve fitting by the method of least squarethe curves of the form y=ax+b or y=a+bx, y=ax

and baxy = .

IV

Markov chains: Markov chain, Stationary distribution of regular Markov chains, States of a Markov chain and problems.Queuing theory: Introduction, Concepts and M/G/1 and M/M/1 queuing systems with numerical illustration.


1 Apply least square method to fit a curve for the given data and evaluate the correlation coefficient and regression lines for the data.

2 To develop probability distribution of discrete and continuous random variables.

3 Develop the joint probability distribution occurring in digital signal processing and design engineering.

4 Estimate the parameter of a population, important role of normal distribution as a sampling distribution.



Syllabus Syllabus Syllabus Syllabus for the Academic Year for the Academic Year for the Academic Year for the Academic Year –––– 2020 2020 2020 2020 ---- 2021202120212021

Common to CSE and ISE

Department: Mathematics

Probability and Queuing Theory

Description

Probability Distributions: Review of basic probability theoryRandom variables (Discrete and Continuous), Probability of mass/density functions. Binomial distribution, Poisson’s distribution with mean and variance. Exponential distribution and Normal distribution (without derivations), problems.

Joint probability distribution: Joint probability distribution for two discrete random variables, Marginal distributions, Expectation, covariance, problems. Stochastic Process: Classification of Stochastic processes, Probability Vector, Stochastic Matrix, Regular Stochastic Matrix, TraProbabilities and Transition probability Matrix, Higher Transition Probabilities, problems.

Statistical Methods: Correlation and regression- Karl Pearson’s coefficient of Correlation, problems. Regression analysis

(without proof) problems. Curve fitting by the method of least square

the curves of the form y=ax+b or y=a+bx, y=ax2 +bx+c or y=a+bx+cx

Markov chain, Stationary distribution of regular Markov chains, States of a Markov chain and problems.

: Introduction, Concepts and M/G/1 and M/M/1 queuing systems with numerical illustration.

Course Objectives

Apply least square method to fit a curve for the given data and evaluate the correlation coefficient and regression lines for the data.

develop probability distribution of discrete and continuous random

Develop the joint probability distribution occurring in digital signal processing and design engineering.

Estimate the parameter of a population, important role of normal distribution as a sampling distribution.


Semester: 4

L-T-P-C: 3-1-0-4

Hours

Review of basic probability theory. Probability of

mass/density functions. Binomial distribution, Poisson’s distribution with mean and variance. Exponential distribution and Normal

10

Joint probability distribution for two discrete random variables, Marginal distributions, Expectation,

Classification of Stochastic processes, Probability Vector, Stochastic Matrix, Regular Stochastic Matrix, Transition Probabilities and Transition probability Matrix, Higher Transition

11

Karl Pearson’s coefficient of Correlation, problems. Regression analysis- lines of

Curve fitting by the method of least square- Fitting of +bx+c or y=a+bx+cx2

11

Markov chain, Stationary distribution of regular

: Introduction, Concepts and M/G/1 and M/M/1

10

Apply least square method to fit a curve for the given data and evaluate the

develop probability distribution of discrete and continuous random

Develop the joint probability distribution occurring in digital signal

Estimate the parameter of a population, important role of normal



V

Sampling Theory:error, Type-I and Typestudent’s t- distributions, and Chigoodness of fit. Analysis of variance:classification, verification within and between treatment, shortcut methods for obtaining variations.

Text Books:

Sl No

Title



Reference Books:

Sl No

Title




4 A First Course in Probability

5 An Introduction to Probability Theory and its Applications

Course Outcomes:

Course outcome

Descriptions

CO1 Apply probability distributions and the probability models arising in engineering field.

CO2 Make use of correlation and regression analysis mathematical

CO3 To understand the concepts of the stochastic process of a statistic and estimation of parameters arising in engineering field.

CO4 Acquire skills in analyzing queuing models and sampling distributions.



Sampling Theory: Introduction to Sampling distributions, Standard I and Type-II errors. Test of hypothesis for means, distributions, and Chi-square distribution as a test of

Analysis of variance: Definition and properties, one waclassification, verification within and between treatment, shortcut methods for obtaining variations.


Higher Engineering B.S.Grewal 43rd EditionKhanna Publications, 2015.ISBN:9788174091956

Advanced Engineering E.Kreyszig 10th Edition Jon Wiley &Sons,2015. ISBN:9780470913611


ofEngineering N.P.Bali and Manish Goyal

7th Edition Lakshmi Publishers, 2010.

Higher Engineering B.V.Ramana 1st Edition, Tata McGrawHill, 2006. ISBN:9780070634190Higher Engineering H.K.Das and

Er.RajnishVerma 1st Edition, Chand publishing, 2011. ISBN:9788121938907

S. Ross 8th Edition, Pearson, 2010, ISBN:9780136033134

Probability Theory and its W. Feller 3rd Edition, John Wiley &

Sons, Inc, 2008,ISBN9788126518050

Descriptions

Apply probability distributions and Multivariate distributionprobability models arising in engineering field.

Make use of correlation and regression analysis mathematical model for the statistical data.

To understand the concepts of the stochastic process of a statistic and estimation of parameters arising in engineering field.

skills in analyzing queuing models and sampling distributions.


Introduction to Sampling distributions, Standard II errors. Test of hypothesis for means,

square distribution as a test of

Definition and properties, one way classification, verification within and between treatment, shortcut

10


EditionKhanna Publications, 2015. ISBN:9788174091956

Edition Jon Wiley &Sons,2015. ISBN:9780470913611


Edition Lakshmi Publishers, 2010.

Edition, Tata McGraw-Hill, 2006. ISBN:9780070634190 Edition, Chand publishing, 2011. ISBN:9788121938907

Edition, Pearson, 2010, ISBN:9780136033134

Edition, John Wiley & Sons, Inc, 2008, ISBN9788126518050

Multivariate distribution in analyzing

Make use of correlation and regression analysis to fit a suitable

To understand the concepts of the stochastic process of a statistic and

skills in analyzing queuing models and sampling distributions.




Department: Computer Science and Engineering Semester: 4

Subject Name: Object Oriented Programming

Subject Code: 18CSI402

Course Objectives:

UNIT

I

Introduction to Object oriented Programming: two paradigms, Abstraction, The Three Object Oriented Programming Principles: Inheritance, Polymorphism and Encapsulation, Working together. First Simple Java program: Entering the Program, Compiling the Program, ASample Program, A Second short program, Java is a Strongly Typed Language. Class Fundamentals: The General Form of a Class, A Simple Class, Declaring Objects: A Closer Look at new, Assigning Object Reference Variables, Introducingthe Box Class, Returning a Value, Adding a Method That Takes Parameters: Parameterized Constructors, Constructors, The this Keyword: Instance Variable Hiding, Garbage Collection, The finalize() Method; A Stack Class.Simple Java programs including classes, methods and constructors.

II

Classes and Methods:Overloading Methods:Constructors, Using Object as parameter, A Closer Look at Argument Passing, Returning Object, Introducing Access Control, Understanding Static, Introducing Final, Introducing Nested and Inner Classes. Exploring the String Class, Using CommandPrograms on overloading, static members, nested and inner classes and strings.

III

Inheritance: Inheritance Basics:More Practical Example, A Superclass Variable Can Reference a Subclass Object, Using Super: Using super to Call Superclass Constructors, A Second Use for super, Creating MultiHierarchy, when Constructors are ExecutDynamic Method Dispatch: Why Overridden Methods?, Applying Method Overriding, Using Abstract Classes, Using Final with Inheritance: Using final to Prevent Overriding, Using final to Prevent Inheritance, The Object Class. Programs on Inheritance.


1 Understand the fundamentals of objectincluding defining classes, Objects,

2 Understand the principles of inheritance, packages, and interfaces.

3 Understand fundamentals of exception handling mechanisms.

4 Write Object oriented programs.



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2020 2020 2020 2020 –––– 2021202120212021

Computer Science and Engineering Semester: 4

Object Oriented Programming

Description

Introduction to Object oriented programming: Object Oriented two paradigms, Abstraction, The Three Object

Oriented Programming Principles: Inheritance, Polymorphism and Encapsulation, Working together. First Simple Java program: Entering the Program, Compiling the Program, A Closer Look at the First Sample Program, A Second short program, Java is a Strongly Typed Language. 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: Parameterized Constructors, Constructors, The this Keyword: Instance Variable Hiding, Garbage Collection, The finalize() Method; A Stack Class.

a programs including classes, methods and

Classes and Methods:Overloading Methods: Overloading Constructors, Using Object as parameter, A Closer Look at Argument Passing, Returning Object, Introducing Access Control, Understanding Static, Introducing Final, Introducing Nested and Inner Classes. Exploring the String Class, Using Command-Line Arguments.Programs on overloading, static members, nested and inner classes and strings.

Inheritance: Inheritance Basics: Member Access and Inheritance, A More Practical Example, A Superclass Variable Can Reference a Subclass Object, Using Super: Using super to Call Superclass Constructors, A Second Use for super, Creating MultiHierarchy, when Constructors are Executed, Method Overriding, Dynamic Method Dispatch: Why Overridden Methods?, Applying Method Overriding, Using Abstract Classes, Using Final with Inheritance: Using final to Prevent Overriding, Using final to Prevent Inheritance, The Object Class.

Inheritance.

Course Objectives

Understand the fundamentals of object-oriented programming in Java, including defining classes, Objects, invoking methods

Understand the principles of inheritance, packages, and interfaces.

Understand fundamentals of exception handling mechanisms.

Write Object oriented programs.


Computer Science and Engineering Semester: 4

L-T-P-C: 3-0-2-4

Hours

programming: Object Oriented two paradigms, Abstraction, The Three Object

Oriented Programming Principles: Inheritance, Polymorphism and Encapsulation, Working together. First Simple Java program: Entering

Closer Look at the First Sample Program, A Second short program, Java is a Strongly Typed Language. Class Fundamentals: The General Form of a Class, A Simple Class, Declaring Objects: A Closer Look at new, Assigning

Methods: Adding a Method to the Box Class, Returning a Value, Adding a Method That Takes Parameters: Parameterized Constructors, Constructors, The this Keyword: Instance Variable Hiding, Garbage Collection, The finalize()

a programs including classes, methods and

8

Overloading Constructors, Using Object as parameter, A Closer Look at Argument Passing, Returning Object, Introducing Access Control, Understanding Static, Introducing Final, Introducing Nested and Inner Classes.

Line Arguments. Programs on overloading, static members, nested and inner

8

Member Access and Inheritance, A More Practical Example, A Superclass Variable Can Reference a Subclass Object, Using Super: Using super to Call Superclass Constructors, A Second Use for super, Creating Multi-Level

ed, Method Overriding, Dynamic Method Dispatch: Why Overridden Methods?, Applying Method Overriding, Using Abstract Classes, Using Final with Inheritance: Using final to Prevent Overriding, Using final to Prevent

7

oriented programming in Java,

Understand the principles of inheritance, packages, and interfaces.

Understand fundamentals of exception handling mechanisms.



IV

Packages and Interface: Packages:Packages and CLASSPATH, A Short Package Example, Access protection: An Access Example, Importing Packages, Interfaces: Defining an Interface, Implementing Interfaces, Nested Interfaces, Applying Interfaces, Variables in InterfaExtended, Default Interface Methods: Default Interface Methods, A More Practical Example, Multiple Inheritance Issues, Use Static Methods in an Interface. Programs on packages

V

Exception Handling:Types, Uncaught Exceptions, Using try and catch: Displaying a Description of an Exception, Multiple Catch Clauses, Nested try Statements, throw, throws, finally, Java’s builtCreating your own Exception SubcRecently Added Exception Features. Programs on Exception handling

Text Book:

Sl No

Title

1 Java - The Complete Reference

Reference Book:

Sl No

Title

1 Introduction to JAVA Programming

Course Outcomes

Course outcome

Descriptions

CO1 Describe the fundamentals of object oriented programming.

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

CO3 Design and implement object orientedpackages & Interfaces.

CO4 Develop reliable programs by using exception handling mechanisms.



Packages and Interface: Packages: Defining a Package, Finding Packages and CLASSPATH, A Short Package Example, Access protection: An Access Example, Importing Packages, Interfaces: Defining an Interface, Implementing Interfaces, Nested Interfaces, Applying Interfaces, Variables in Interfaces, Interfaces Can Be Extended, Default Interface Methods: Default Interface Methods, A More Practical Example, Multiple Inheritance Issues, Use Static Methods in an Interface. Programs on packages- user defined and inbuilt and Interfaces.

Handling: Exception Handling Fundamentals, Exception Types, Uncaught Exceptions, Using try and catch: Displaying a Description of an Exception, Multiple Catch Clauses, Nested try Statements, throw, throws, finally, Java’s built-in Exceptions, Creating your own Exception Subclasses. Chained Exceptions. Three Recently Added Exception Features. Programs on Exception handling- user defined and inbuilt.


The Complete Herbert Schildt 9th Edition, Tata McGraw Hill, 2014, ISBN: 978-0-07-180856


Introduction to JAVA Y. Daniel Liang 10th Edition, Pearson Education, 2015, ISBN-13: 9780133761313

Describe the fundamentals of object oriented programming.

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

Design and implement object oriented solutions involving multiple objects, packages & Interfaces.

Develop reliable programs by using exception handling mechanisms.


Defining a Package, Finding Packages and CLASSPATH, A Short Package Example, Access protection: An Access Example, Importing Packages, Interfaces: Defining an Interface, Implementing Interfaces, Nested Interfaces,

ces, Interfaces Can Be Extended, Default Interface Methods: Default Interface Methods, A More Practical Example, Multiple Inheritance Issues, Use Static

user defined and inbuilt and Interfaces.

8

Handling Fundamentals, Exception Types, Uncaught Exceptions, Using try and catch: Displaying a Description of an Exception, Multiple Catch Clauses, Nested try

in Exceptions, lasses. Chained Exceptions. Three

user defined and inbuilt.

8


Edition, Tata McGraw Hill, 2014, 180856-9


Edition, Pearson Education, 13: 9780133761313

Describe the fundamentals of object oriented programming.

Identify classes, objects, members of a class and relationships among them

solutions involving multiple objects,

Develop reliable programs by using exception handling mechanisms.



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Department: Computer Science and Engineering Subject Name: Design and Analysis of Algorithms

Subject Code: 18CS403 Course Objectives:

UNIT

I

Introduction, Fundamentals of the Analysis of Algorithm Efficiency, Brute Force:algorithmic problem solving, Analysis Framework, Asymptotic Notations and Basic efficiency classes, Mathematical analysis of NonRecursive and recursive Algorithms with Examples. Brute Force: Selection Sort, String

II

Divide and Conquer:and Minimum. Decrease and Conquer:search.

III

Transform and Conquer:Heaps and Heap Sort, Red Black Trees.Space and Time Tradeoffs:Horspool’s algorithm, Hashing: hash table, hash functions, collision handling by open addressing and chaining.

IV

Greedy Technique:algorithm, Huffman trees and codes. Dynamic Programming:Memory Functions.

V

Back tracking: n-Queen’s Problem, SubsetBranch and Bound:Traveling Salesman problems.


1 Learn how to design recursive and non

2 Know different Algorithm Design Techniques for effective problem solving.

3 Learn how to analyze the algorithm with respect to space and time complexity.

4 Understand basic efficiency classes and asymptotic notations to express

the complexity.





Name: Design and Analysis of Algorithms


Description

Introduction, Fundamentals of the Analysis of Algorithm Efficiency, Brute Force: What is an Algorithm?, Fundamentals of algorithmic problem solving, Analysis Framework, Asymptotic Notations and Basic efficiency classes, Mathematical analysis of NonRecursive and recursive Algorithms with Examples.

Selection Sort, String Matching, Exhaustive Search.

Divide and Conquer:Merge Sort, Quick Sort, Finding the Maximum

Decrease and Conquer:Insertion Sort, Topological Sorting, Binary

Transform and Conquer: Binary Search tree, Balanced Search Trees, Heaps and Heap Sort, Red Black Trees. Space and Time Tradeoffs: Input Enhancement in String MatchingHorspool’s algorithm, Hashing: hash table, hash functions, collision handling by open addressing and chaining.

Greedy Technique: Prim’s algorithm, Kruskal’s algorithm, Dijkstra’s algorithm, Huffman trees and codes. Dynamic Programming: Floyd’s Algorithms, Knapsack Problem and Memory Functions.

Queen’s Problem, Subset-Sum Problem, Branch and Bound: Assignment Problem, Knapsack Problem, and Traveling Salesman Problem.P and NP problems, NP

Course Objectives

Learn how to design recursive and non-recursive algorithms.

Know different Algorithm Design Techniques for effective problem solving.

Learn how to analyze the algorithm with respect to space and time

Understand basic efficiency classes and asymptotic notations to express

the complexity.


Semester: 4

Subject Code: 18CS403 L-T-P-C: 4-0-0-4

Hours

Introduction, Fundamentals of the Analysis of Algorithm What is an Algorithm?, Fundamentals of

algorithmic problem solving, Analysis Framework, Asymptotic Notations and Basic efficiency classes, Mathematical analysis of Non-

Matching, Exhaustive Search.

10

Merge Sort, Quick Sort, Finding the Maximum

Insertion Sort, Topological Sorting, Binary 10

Binary Search tree, Balanced Search Trees,

Input Enhancement in String Matching- Horspool’s algorithm, Hashing: hash table, hash functions, collision

11

Prim’s algorithm, Kruskal’s algorithm, Dijkstra’s

Floyd’s Algorithms, Knapsack Problem and 11

Problem, and

NP problems, NP-Complete 10

recursive algorithms.

Know different Algorithm Design Techniques for effective problem solving.

Learn how to analyze the algorithm with respect to space and time

Understand basic efficiency classes and asymptotic notations to express



Text Books:

Sl No

Title

1 Introduction to the Design & Analysis of Algorithms

2 Introduction to Algorithms

Reference Books:

Sl No

Title

1 Computer Algorithms/C++

2 Fundamental of algorithms

Course Outcomes

Course outcome

Descriptions

CO1 Understand the basic concepts of design and analysis of algorithms.

CO2 Demonstrate various techniques for designing and developing algorithms.

CO3 Design an algorithm using algorithm design technique complexity to rank order of growth.

CO4 Solve the given problem instance using appropriate algorithm design technique.



Author(s)

Introduction to the Design & Analysis of Algorithms

AnanyLevitin

Introduction to Algorithms Cormen T.H, Leiserson C.E. &Rivest R.L

Author(s)

Computer Algorithms/C++ Ellis Horowitz, SatrajSahni and Rajasekaran

Fundamental of algorithms Gilles Brassard & Paul Bratley

Descriptions

Understand the basic concepts of design and analysis of algorithms.

Demonstrate various techniques for designing and developing

Design an algorithm using algorithm design technique complexity to rank order of growth.

Solve the given problem instance using appropriate algorithm design


Edition, publisher, Year, ISBN

3rdEdition, Pearson Education, 2012, ISBN-13: 978-0-13-231681-1

3rdEdition, PHI, 2009, ISBN-13: 978-0262033848


2nd Edition, 2014, Universities Press, ISBN-13:978-8173716119

2nd Edition, PHI 1999, ISBN-13:978-120311312

Understand the basic concepts of design and analysis of algorithms.

Demonstrate various techniques for designing and developing

Design an algorithm using algorithm design technique and analyze its

Solve the given problem instance using appropriate algorithm design




Department: Computer Science & Engineering Subject Name: Operating Systems Subject Code: 18CS404 Course Objectives:

UNIT

I

Introduction to Operating Systems and System Structures:What operating systems do? Computer System architecture; Operating System structure; Open source operating system. Operating System Services:System programs; Operating System structure; Virtual machines.

II

Process Management:Process concept: processes; Inter process communication. Multi Thread Programming: Overview; Multithreading models; Threading issues. Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms.

III

Process Synchronization:Synchronization: Peterson’s solution; Semaphores; Classical problems of synchronization; Monitors. Deadlocks: System model; Deadlock characterization; Methods for handling deadlockDeadlock detection and recovery from deadlock.

IV

Memory Management:Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation. Virtual Memory Management:on write; Page replacement; Allocation of frames; Thrashing.File System: File concept; Access methods; Directory structure; File system mounting; Protection. Implementing File System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management.


1 To learn the fundamentals of Operating Systems.

2 To understand what a process is and scheduled using various algorithms.

3 To gain knowledge on system concepts that includes Mutual exclusion algorithms, deadlock detection algorithms.

4 To learn the mechanisms involved in memory management in an OS




Department: Computer Science & Engineering

Operating Systems

Description

Introduction to Operating Systems and System Structures:What operating systems do? Computer System architecture; Operating System structure; Open source operating system. Operating System Services: System calls; Types of system calls; System programs; Operating System structure; Virtual machines.

Process Management: Overview; Process scheduling; Operations on

processes; Inter process communication. Multi Thread Programming: Overview; Multithreading models; Threading issues.

Basic concepts; Scheduling criteria; Scheduling

Process Synchronization: Background; The Critical section problem;

Peterson’s solution; Semaphores; Classical problems of synchronization; Monitors.

System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Memory Management: Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation.

Memory Management: Background; Demand paging; Copyon write; Page replacement; Allocation of frames; Thrashing.

File concept; Access methods; Directory structure; File system mounting; Protection. Implementing File System: File system

e; File system implementation; Directory implementation; Allocation methods; Free space management.

Course Objectives

To learn the fundamentals of Operating Systems.

To understand what a process is and how processes are synchronized and scheduled using various algorithms.

To gain knowledge on system concepts that includes Mutual exclusion algorithms, deadlock detection algorithms.

To learn the mechanisms involved in memory management in an OS


Department: Computer Science & Engineering Semester: 4

L-T-P-C: 3-1-0-4

Hours

Introduction to Operating Systems and System Structures: What operating systems do? Computer System architecture; Operating

System calls; Types of system calls; System programs; Operating System structure; Virtual machines.

10

Overview; Process scheduling; Operations on processes; Inter process communication. Multi Thread Programming: Overview; Multithreading models; Threading issues. Process

Basic concepts; Scheduling criteria; Scheduling

10

Background; The Critical section problem; Peterson’s solution; Semaphores; Classical problems of

System model; Deadlock characterization; Methods for

s; Deadlock prevention; Deadlock avoidance;

10

Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation.

Background; Demand paging; Copy-on write; Page replacement; Allocation of frames; Thrashing.

File concept; Access methods; Directory structure; File system mounting; Protection. Implementing File System: File system

e; File system implementation; Directory implementation;

11

how processes are synchronized and

To gain knowledge on system concepts that includes Mutual exclusion

To learn the mechanisms involved in memory management in an OS



V

Secondary Storage Structures: Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management. Goals of protection, Principles of protection, Domain of protection, Access matrix, Implementation of access matrix, Access control, Revocation of access rights.Case Study: The Linux System.

Text Book:

Sl No

Title

1 Operating System Principles

Reference Books:

Sl No

Title

1 Operating systems - A concept based Approach

2 Operating Systems

3 Operating systems

Course Outcomes:

Course outcome

Descriptions

CO1 Explain the structures and functional components of operating systems.

CO2 Apply appropriate process management techniques to solve machinecritical problems in multi

CO3 Select suitable techniques for efficient memory management.

CO4 Outline the concepts of file and storage management.



Secondary Storage Structures: Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management. Goals of protection, Principles of protection, Domain of protection, Access matrix, Implementation of access matrix, Access control, Revocation of access rights.

The Linux System.


Peter Baer Galvin, Greg Gagne

9thEdition, Wiley-ISBN:9788126554270, 8126554274.


D.M Dhamdhere 3rd Edition, Tata McGrawISBN:13:9781259005589,10:1259005585

P.C.P. Bhatt 4thEdition, PHI, 20ISBN: 9788120348363

Harvey M Deital 3rdEdition, Addison Wesley, ISBN: 9788131712894, 8131712893

Explain the structures and functional components of operating systems.

Apply appropriate process management techniques to solve machinecritical problems in multi-process environment.

Select suitable techniques for efficient memory management.

Outline the concepts of file and storage management.


Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management. Protection: Goals of protection, Principles of protection, Domain of protection, Access matrix, Implementation of access matrix, Access control,

11

Publisher, Year, ISBN

-India, ISBN:9788126554270, 8126554274.


Edition, Tata McGraw-Hill,2008, ISBN:13:9781259005589,10:125900

Edition, PHI, 2013, ISBN: 9788120348363.

Edition, Addison Wesley, 2007, 9788131712894, 8131712893

Explain the structures and functional components of operating systems.

Apply appropriate process management techniques to solve machine-

Select suitable techniques for efficient memory management.



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Department: Computer Science & Engineering Subject Name: Microprocessor Subject Code: 18CS405 Course Objectives:

UNIT

I

ARM Embedded Systems:Design Philosophy, Embedded System Hardware, Embedded System Software, ARM Processor FundamentalsStatus Register, Pipeline, Table, Core Extensions

II

Introduction to the ARM Instruction Set:Instructions, Branch Instructions, LoadInterrupt Instructions, Program Status Register Instructions, Constants, Conditional Execution, Simple programming exercises.

III

LPC2148 ARM based microcontrollerperipherals:General description, Architectural overview, Memory mapping, Register Description, Functional pin diagram, Features of different blocks. Description of General purpose Input/output ports(GPIO) and pin control block, Simple Application display, 4X4 key pad, Stepper motor, DAC and UART interfacing design and their programming using C.

IV

Efficient C Programming for ARM:Optimization, Basic C Data Types, C Looping Structures, Allocation, Function Calls, Pointer Aliasing, Structure Arrangement, Bit-fields, Unaligned Data and Endianness, Division, Floating Point, Inline Functions and Inline Assembly.

V

Embedded System Components:system, Classification of Embedded systems, Major applications and purpose of embedded systems. Core of an Embedded System including all types of processor/controller, Memory.


1 To understand the architecture of

2 To develop the ability to write programs in assembly and in C for microcontroller based system.

3 To learn interfacing the external devices with microcontroller

4 To understand the concepts of embedded system and




Department: Computer Science & Engineering

Microprocessor and Embedded System

5

Description

ARM Embedded Systems:The RISC design philosophy, The ARM Design Philosophy, Embedded System Hardware, Embedded System

ARM Processor Fundamentals: Registers, Current Program Status Register, Pipeline, Exceptions, Interrupts, and the Vector Table, Core Extensions

Introduction to the ARM Instruction Set:Data Processing Instructions, Branch Instructions, Load-Store Instructions, Software Interrupt Instructions, Program Status Register Instructions, Constants, Conditional Execution, Simple programming exercises.

LPC2148 ARM based microcontroller, Interfacing LPC2148 with General description, Salient features of LPC 2148,

Architectural overview, Memory mapping, Register Description, Functional pin diagram, Features of different blocks. Description of General purpose Input/output ports(GPIO) and pin

Simple Application Programming: LEDs , 7 segment display, 4X4 key pad, Stepper motor, DAC and UART interfacing design and their programming using C.

Efficient C Programming for ARM: Overview of C Compilers and Optimization, Basic C Data Types, C Looping Structures, Allocation, Function Calls, Pointer Aliasing, Structure Arrangement,

Unaligned Data and Endianness, Division, Floating Point, Inline Functions and Inline Assembly.

Embedded System Components:Embedded v/s General computing Classification of Embedded systems, Major applications and

purpose of embedded systems. Core of an Embedded System including all types of processor/controller, Memory.

Course Objectives

To understand the architecture of Microprocessor and Microcontroller.

To develop the ability to write programs in assembly and in C for microcontroller based system.

nterfacing the external devices with microcontroller

To understand the concepts of embedded system and its components


Department: Computer Science & Engineering Semester: 4

L-T-P-C: 3-0-0-3

Hours

The RISC design philosophy, The ARM Design Philosophy, Embedded System Hardware, Embedded System

Registers, Current Program Exceptions, Interrupts, and the Vector

8

Data Processing Store Instructions, Software

Interrupt Instructions, Program Status Register Instructions, Loading Constants, Conditional Execution, Simple programming exercises.

8

Interfacing LPC2148 with Salient features of LPC 2148,

Architectural overview, Memory mapping, Register Description,

Description of General purpose Input/output ports(GPIO) and pin Programming: LEDs , 7 segment

display, 4X4 key pad, Stepper motor, DAC and UART interfacing

7

Overview of C Compilers and Optimization, Basic C Data Types, C Looping Structures, Register Allocation, Function Calls, Pointer Aliasing, Structure Arrangement,

Unaligned Data and Endianness, Division, Floating Point, 8

Embedded v/s General computing Classification of Embedded systems, Major applications and

purpose of embedded systems. Core of an Embedded System 8

Microprocessor and Microcontroller.

To develop the ability to write programs in assembly and in C for

nterfacing the external devices with microcontroller

its components



Text Books:

Sl No

Title

1 ARM system developers’ guide

2 Introduction to Embedded Systems

Reference Books:

Sl No

Title

1 The Definitive Guide to the ARM Cortex-M3

2 ARM System-on-Chip Architecture

Course Outcomes:

Course outcome

Descriptions

CO1 Describe the architectures of ARM7 processor and embedded system.

CO2 Write assembly/C programs for a given problem

CO3 Design I/O interfaces with LPC2148 Microcontroller

CO4 Develop efficient C programs for ARM processor




developers’ guide Andrew N Sloss, Dominic Symes and Chris Wright, Elsevier,

3rd Edition, Kaufman publishers, 2008, ISBN1558608740.

Introduction to Embedded Shibu K V 2nd EGrawHill13:978

Author(s) Edition, publisher, Year, ISBN

The Definitive Guide to the Joseph Yiu 2ndEdition ,Newnes, 20099781856179645

Chip Steve Furber 2ndEdition, Pearson, 20158131708403

Descriptions

Describe the architectures of ARM7 processor and embedded system.

Write assembly/C programs for a given problem

Design I/O interfaces with LPC2148 Microcontroller

efficient C programs for ARM processor



Edition, Morgan fman publishers,

2008, ISBN-13:978-1558608740.

Edition, Tata Mc-GrawHill, 2017, ISBN-

978-9339219680.

Edition, publisher, Year, ISBN

Edition ,Newnes, 2009, ISBN: 9781856179645

Edition, Pearson, 2015, ISBN: 8131708403

Describe the architectures of ARM7 processor and embedded system.




Department: Computer Science & Engineering Subject Name: Data Communication Subject Code: 18CS406 L Course Objectives:

UNIT

I

Data Communications and Network ModelsIntroduction: Data communications: Components, Data Representation, Data Flow, Networks: Network Criteria, Physical structure, Network Types, Local Area Network ,Wide Area Network, switching, The Internet, Standards andStandards, Internet Administration.Layering: Scenarios, Principles of layering, Logical Connection, TCP/IP Protocol Suite: Layered architecture, Layers in the TCP/IP Protocol Suite, Description of each layAddressing, Multiplexing and Demultiplexing, The OSI Model, OSI versus TCP/IP.

II

Physical Layer and MediaData and Signals: AnalogPeriodic and Non-Digital Signal as a composite Analog signal, Transmission of Digital Signals. Transmission impairment: Attenuation, Distortion, Noise. Data rate limits: Noiseless ChannelShannon Capacity, Using both limits. Performance: Bandwidth, Throughput, Latency, Bandwidth Delay Product, Jitter. Transmission: Digitalconversion; Transmission modes.

III

Physical Layer and Media Contd...Analog Transmission: DigitalAnalog conversion.spectrum. Transmission media: GuidedSwitching: Three Methods of Switching, Switching and TCP/IP Layer, Circuit switched networks, Packet Switching: Data gram networks Virtual-circuit networks, Structure of a switch.


1 Explain the basics of data communication and various types of computer networks.

2 Comprehend the types of transmission techniques for exchange of data between two or more networks.

3 Illustrate switching and TCP/IP protocol suite.

4 Learn Medium Access Control protocols for reliable and noisy channels.




Computer Science & Engineering

Communication

Subject Code: 18CS406 L

Description

Communications and Network Models Data communications: Components, Data

Representation, Data Flow, Networks: Network Criteria, Physical structure, Network Types, Local Area Network ,Wide Area Network, switching, The Internet, Standards and Administration: Internet Standards, Internet Administration.Network models: Protocol Layering: Scenarios, Principles of layering, Logical Connection, TCP/IP Protocol Suite: Layered architecture, Layers in the TCP/IP Protocol Suite, Description of each layer, Encapsulation and Decapsulation, Addressing, Multiplexing and Demultiplexing, The OSI Model, OSI

Physical Layer and Media Data and Signals: Analog and digital Data, Analog and Digital Signals,

-periodic, Digital Signals,: Bit rate , Bit Length, Digital Signal as a composite Analog signal, Transmission of Digital Signals. Transmission impairment: Attenuation, Distortion, Noise.

ate limits: Noiseless Channel-Nyquist Bit Rate, Noisy ChannelsShannon Capacity, Using both limits. Performance: Bandwidth, Throughput, Latency, Bandwidth Delay Product, Jitter.

Digital-to-Digital conversion; Analogion; Transmission modes.

Physical Layer and Media Contd... Analog Transmission: Digital - to - Analog conversion; Analog Analog conversion.Bandwidth Utilization: Multiplexing; Spread

Transmission media: Guided media, unguided mediaSwitching: Three Methods of Switching, Switching and TCP/IP Layer,

switched networks, Packet Switching: Data gram networks circuit networks, Structure of a switch.

Course Objectives

Explain the basics of data communication and various types of computer

the types of transmission techniques for exchange of data between two or more networks.

Illustrate switching and TCP/IP protocol suite.

Learn Medium Access Control protocols for reliable and noisy channels.


Semester: 4

Subject Code: 18CS406 L-T-P-C: 3-0-0-3

Hours

Data communications: Components, Data Representation, Data Flow, Networks: Network Criteria, Physical structure, Network Types, Local Area Network ,Wide Area Network,

Administration: Internet : Protocol

Layering: Scenarios, Principles of layering, Logical Connection, TCP/IP Protocol Suite: Layered architecture, Layers in the TCP/IP Protocol

er, Encapsulation and Decapsulation, Addressing, Multiplexing and Demultiplexing, The OSI Model, OSI

8

and digital Data, Analog and Digital Signals, periodic, Digital Signals,: Bit rate , Bit Length,

Digital Signal as a composite Analog signal, Transmission of Digital Signals. Transmission impairment: Attenuation, Distortion, Noise.

Nyquist Bit Rate, Noisy Channels-Shannon Capacity, Using both limits. Performance: Bandwidth, Throughput, Latency, Bandwidth Delay Product, Jitter. Digital

Digital conversion; Analog-to-Digital

8

Analog conversion; Analog - to - : Multiplexing; Spread

media, unguided media Switching: Three Methods of Switching, Switching and TCP/IP Layer,

switched networks, Packet Switching: Data gram networks

8

Explain the basics of data communication and various types of computer

the types of transmission techniques for exchange of data

Learn Medium Access Control protocols for reliable and noisy channels.



IV

Data Link layer Introduction, Link-Introduction, Block coding; Cyclic Codes: Cyclic Redundancy Check, Polynomials, Cyclic Code Encoder using Polynomials, Cyclic Code Analysis, Advantages of Cyclic Codes, Other Cyclic Codes, Hardware Implementation, Checksum, Forward Error Correction, Data Link Control: DLC Services, DataPoint-to-Point Protocol, Media Access Control: Random Access, Controlled Access, Channelization.

V

Data Link layer Contd...Wired LANs: Ethernet, Ethernet Protocol, StEthernet,Gigabit Ethernet. Wireless LAN’s: Introduction, IEEE 802.11 Project, Architecture, Bluetooth Layers, Connecting Devices and Virtual LANs: LANs, ATM: Design goals, problems, architecture.

Text Books:

Sl No

Title

1 Data Communications and Networking,

Reference Books:

Sl No

Title

1 Communication Network Fundamental Concepts and Key Architectures 2 Data and Computer Communication,

3 Computer and Communication Networks

4 Computer Networks

Course Outcomes

Course outcome

Descriptions

CO1 Explain the structure of layered approach and its standards in computer networks.

CO2 Demonstrate the different data formats, transmission and conversions

CO3 Identify the methods for correction

CO4 Solve problems to improve the performance of computer networks



-Layer Addressing, Error Detection and Correction

Introduction, Block coding; Cyclic Codes: Cyclic Redundancy Check, Polynomials, Cyclic Code Encoder using Polynomials, Cyclic Code Analysis, Advantages of Cyclic Codes, Other Cyclic Codes, Hardware

n, Checksum, Forward Error Correction, Data Link Control: DLC Services, Data-Link Layer Protocols, HDLC,

Point Protocol, Media Access Control: Random Access, Controlled Access, Channelization.

Data Link layer Contd... Ethernet, Ethernet Protocol, Standard Ethernet, Fast

Gigabit Ethernet. Wireless LAN’s: Introduction, IEEE 802.11 Project, Bluetooth. Architecture, Bluetooth Layers, Connecting Devices and Virtual LANs: Connecting Devices

sign goals, problems, architecture.


Data Communications and Behrouz A. Forouzan

5thEdition, Tata McGraw Hill, 2006, ISBN: 978


Communication Network – Fundamental Concepts and Key Architectures

Alberto Leon-Garcia and Indra, Widjaja

2nd Edition, Tata McGraw2004, ISBN: 978

Data and Computer William Stallings

8th Edition, Pearson Education,2007, ISBN: 978317-1536-9

Communication Networks Nader F. Mir Pearson Education, 2007

978-81-317-1543

Computer Networks Andrew S. Tanenbaum

4th Edition, Pearson Education, 2008, ISBN:

Descriptions

Explain the structure of layered approach and its standards in computer

Demonstrate the different data formats, transmission and conversions

errors in data communication and apply appropriate methods for correction

Solve problems to improve the performance of computer networks


Addressing, Error Detection and Correction: Introduction, Block coding; Cyclic Codes: Cyclic Redundancy Check, Polynomials, Cyclic Code Encoder using Polynomials, Cyclic Code Analysis, Advantages of Cyclic Codes, Other Cyclic Codes, Hardware

Link Layer Protocols, HDLC, Point Protocol, Media Access Control: Random Access,

7

andard Ethernet, Fast

Bluetooth. -

Connecting Devices, Virtual

8


Edition, Tata McGraw Hill, , ISBN: 978-1-25-906475-3


, Tata McGraw-Hill, 978-0-07-059501-9

Edition, Pearson Education,2007, ISBN: 978-81-

Pearson Education, 2007, 1543-7

4th Edition, Pearson Education, 978-01-306-6102-9

Explain the structure of layered approach and its standards in computer

Demonstrate the different data formats, transmission and conversions

errors in data communication and apply appropriate

Solve problems to improve the performance of computer networks




Department: Computer Science and Engineering Subject Name: Algorithms Lab


Course Objectives:

Note: Implement the following using C / C++ / Java Language

LAB CYCLES

I

Brute Force: 1. String 2. Sort a given set of elements using

3. Solving Travelling salesman problem.Divide and Conquer:

4. Sort a given set of elements using Merge sort.5. Sort a given set of elements using Quick Sort.6. Finding the Maximum and Minimum ele

‘n’ integers.Decrease and Conquer:

7. Print the vertices of the directed acyclic graph in topological order using: i. Source Removal Methodii. DFS Method

II

Decrease and Conquer: Sort a given set of elements using

Transform and Conquer:9. Create a heap tree for a given list of .n. elements using:

i. Topii. Bottom

10. Sort ‘N’ number of elements using Heap Sort.Space and Time Tradeoffs:11. Implement Horspool algorithm for String Matching.Greedy Technique:

12. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.

13. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm.

14. From a given vertex in a weighted connected graph, find the shortest paths to other verti


1 To understand different algorithms for searching, sorting and graph problems and

2 To learn how to analyze the performance of algorithms practically.

3 To understand various Algorithm Design Techniques.



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year –––– 2020 2020 2020 2020 –––– 2021202120212021


Algorithms Lab

L

Implement the following using C / C++ / Java Language

Description

String matching. Sort a given set of elements using Selection sort.

Solving Travelling salesman problem. nd Conquer: Sort a given set of elements using Merge sort.

Sort a given set of elements using Quick Sort. Finding the Maximum and Minimum element in an array of

‘n’ integers. nd Conquer:

Print the vertices of the directed acyclic graph in topological order using:

Source Removal Method DFS Method

nd Conquer: Sort a given set of elements using Insertion Sort.

nd Conquer: Create a heap tree for a given list of .n. elements using:

Top-Down approach. Bottom-up approach.

Sort ‘N’ number of elements using Heap Sort. Space and Time Tradeoffs:

Implement Horspool algorithm for String Matching. Greedy Technique:

Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm. From a given vertex in a weighted connected graph, find the shortest paths to other vertices using Dijkstra's algorithm.

Course Objectives

To understand different algorithms for searching, sorting and graph problems and analyze the same.

To learn how to analyze the performance of algorithms practically.

To understand various Algorithm Design Techniques.


Semester: 4

L-T-P-C: 0-0-2-1

Selection sort.

ment in an array of

Print the vertices of the directed acyclic graph in topological order

Create a heap tree for a given list of .n. elements using:

Minimum Cost Spanning Tree of a given undirected graph

Find Minimum Cost Spanning Tree of a given undirected graph

From a given vertex in a weighted connected graph, find the ces using Dijkstra's algorithm.

To understand different algorithms for searching, sorting and graph

To learn how to analyze the performance of algorithms practically.



III

Dynamic Programming:15. Solve Knapsack problem and print the solution vector.16. Implement single source shortest paths problem using bellman

ford algorithm.17. Find all pair shortest path using Floyd’s Algorithm.

Back Tracking:18. Implement N Queen's algorithm.19. Find a subset of a given set S of N positive integers whose sum is

equal to a given positive integer D.Branch and Bound

20. Solve Knapsack problem and print the solution vector21. Solve Job Assignment Problem

Course Outcomes:

Course outcome

Descriptions

CO1 Identify the problem given and design the algorithm using algorithm design technique.

CO2 Implement various algorithms in a high level language.

CO3 Analyze the performance of various

CO4 Compare the performance of different algorithms for same problem.



Dynamic Programming: Solve Knapsack problem and print the solution vector.Implement single source shortest paths problem using bellmanford algorithm. Find all pair shortest path using Floyd’s Algorithm.

Tracking: Implement N Queen's algorithm. Find a subset of a given set S of N positive integers whose sum is equal to a given positive integer D.

Branch and Bound: Solve Knapsack problem and print the solution vectorSolve Job Assignment Problem and print the solution.

Descriptions

Identify the problem given and design the algorithm using algorithm design technique.

Implement various algorithms in a high level language.

Analyze the performance of various algorithms.

Compare the performance of different algorithms for same problem.


Solve Knapsack problem and print the solution vector. Implement single source shortest paths problem using bellman-

Find all pair shortest path using Floyd’s Algorithm.

Find a subset of a given set S of N positive integers whose sum is

Solve Knapsack problem and print the solution vector the solution.

Identify the problem given and design the algorithm using algorithm

Implement various algorithms in a high level language.

Compare the performance of different algorithms for same problem.



Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Syllabus for the Academic Year Department: Computer Science and Engineering Semester: 4 Subject Name: Microprocessor and Microcontroller

Subject Code: 18CS408 Course Objectives:


1 To provide practical exposure to the students to acquire coding knowledge on ARM assembly.

2 To provide practical LEDs, 7-segment Displays, DAC/ADC and various other devices using Microcontroller

3 To develop and execute few basic application programs usingAurdino Uno board

Lab cycles

I

Develop and execute the following using ARM Assembly 1) To perform arithmetic operations on a set of integers of different

sizes. 2) To perform data handling operations using Logical, Shift, Rotate and

Compare instructions.3) To perform block move and block excha4) Searching and sorting of a set of elements using different techniques.

II

Develop and execute the following using C5) Program to interface LEDs and to blink the LEDs in a specified

fashion. 6) Program to realize decimal up / down counter using

Display 7) Program to interface and rotate stepper motor in

clockwise/anticlockwise direction8) Program to interface DAC and generate waveforms9) Program to interface UART to display text messages

III

Develop and execute the following using the 10) Build a Motion detector using a PIR sensor and display appropriate

messages 11) Controlling the LED with a push button

photo resistors LDR) a particular threshold. Plot time intervals

12) Rain Indicator using a Rain sensor and a water source

Note: Semester End practical exam the lot 1 to 12.





Microprocessor and Microcontroller Lab

Course Objectives

To provide practical exposure to the students to acquire coding knowledge on ARM assembly.

To provide practical exposure on connectivity of interfacing devices like segment Displays, DAC/ADC and various other devices using

Microcontroller-LPC2148

To develop and execute few basic application programs usingAurdino Uno

Description

Develop and execute the following using ARM Assembly To perform arithmetic operations on a set of integers of different

To perform data handling operations using Logical, Shift, Rotate and Compare instructions. To perform block move and block exchange operations.Searching and sorting of a set of elements using different techniques.

and execute the following using C Program to interface LEDs and to blink the LEDs in a specified

Program to realize decimal up / down counter using

Program to interface and rotate stepper motor in clockwise/anticlockwise direction Program to interface DAC and generate waveformsProgram to interface UART to display text messages

Develop and execute the following using the GenuinoAurdino UnoBuild a Motion detector using a PIR sensor and display appropriate

Controlling the LED with a push button – turn on /turn off LED photo resistors LDR) – switch on the LED when light level goes below a particular threshold. Plot the light intensity in the room at various time intervals Rain Indicator using a Rain sensor and a water source

Semester End practical exam Students are allowed to pick one experiment from



L-T-P-C: 0-0-2-1

To provide practical exposure to the students to acquire coding knowledge

exposure on connectivity of interfacing devices like segment Displays, DAC/ADC and various other devices using

To develop and execute few basic application programs usingAurdino Uno

Develop and execute the following using ARM Assembly To perform arithmetic operations on a set of integers of different

To perform data handling operations using Logical, Shift, Rotate and

nge operations. Searching and sorting of a set of elements using different techniques.

Program to interface LEDs and to blink the LEDs in a specified

Program to realize decimal up / down counter using 7 segments

Program to interface and rotate stepper motor in

Program to interface DAC and generate waveforms Program to interface UART to display text messages

GenuinoAurdino Uno Build a Motion detector using a PIR sensor and display appropriate

turn on /turn off LED switch on the LED when light level goes below

the light intensity in the room at various

Rain Indicator using a Rain sensor and a water source

Students are allowed to pick one experiment from



Course Outcomes

Course outcome

Descriptions

CO1 Learn ARM instruction sets and gain the knowledge of how assembly language works.

CO2 Write and execute assembly programs to manipulate the data in the memory using ARM processor.

CO3 Write and execute interfacing programs in C to peripheral circuits using ARM based microcontroller LPC2148

CO4 Develop and execute simple applications programs using Aurdino Uno board and few sensors

Syllabus for the Academic Year

Department: Electrical & Electronics Engineering

Subject Name: SKILL DEVELOPMENT

Subject Code: HS-18SK401

Course Objectives:

UNIT Description

I

Introduction, Training Objective Advantage of learning Aptitude, Importance of Learning mathematics, squaring, cubing, one to one method, two to one method Shortcuts, Basic Mathematics, Square root method, Multiplication method-.

II

Number system, prime number concept, linear equations, age problems, HCF and LCM, Factorial Concept, Last Digit Concept, Remainders Concept, approximation, and simplifications, in equalities Square root and Cube root, Coding and Decoding

Sl .No

Course Objectives

1 Unique shortcut techniques for mental ability to improve 2 Improve logical thinking to solve various questions and puzzles in reasoning.3 Excellent communication, time management and problem solving

4 Approach oriented training and interactive methodology.5 Create amicable relationships 6 To give better idea on different topics to increase the competency of the students in

the subject



Descriptions

Learn ARM instruction sets and gain the knowledge of how assembly language works.

Write and execute assembly programs to manipulate the data in the memory using ARM processor.

Write and execute interfacing programs in C to control the operation of peripheral circuits using ARM based microcontroller LPC2148

Develop and execute simple applications programs using Aurdino Uno board and few sensors


Electronics Engineering

Subject Name: SKILL DEVELOPMENT-II

18SK401

Introduction, Training Objective Advantage of learning Aptitude, Importance of Learning Aptitude, how to crack Aptitude Vedic mathematics, squaring, cubing, one to one method, two to one method Shortcuts, Basic Mathematics, Square root method, Multiplication

Number system, prime number concept, linear equations, age problems, HCF and LCM, Factorial Concept, Last Digit Concept, Remainders Concept, approximation, and simplifications, in equalities Square root and Cube root, Coding and Decoding- mirror image.

Course Objectives

Unique shortcut techniques for mental ability to improve speed and accuracyImprove logical thinking to solve various questions and puzzles in reasoning.Excellent communication, time management and problem solving

Approach oriented training and interactive methodology. Create amicable relationships to meet professional objectives To give better idea on different topics to increase the competency of the students in


Learn ARM instruction sets and gain the knowledge of how assembly

Write and execute assembly programs to manipulate the data in the

control the operation of peripheral circuits using ARM based microcontroller LPC2148

Develop and execute simple applications programs using Aurdino Uno

2021

Semester: IV

L-T-P-C: 0-0-2-1

Hours

Introduction, Training Objective Advantage of learning Aptitude, Aptitude, how to crack Aptitude Vedic

mathematics, squaring, cubing, one to one method, two to one method Shortcuts, Basic Mathematics, Square root method, Multiplication

03

Number system, prime number concept, linear equations, age problems, HCF and LCM, Factorial Concept, Last Digit Concept, Remainders Concept, approximation, and simplifications, in equalities Square root

06

speed and accuracy Improve logical thinking to solve various questions and puzzles in reasoning. Excellent communication, time management and problem solving

To give better idea on different topics to increase the competency of the students in



III

Percentage-percent to decimal fraction conversion, percentage to quantity, inverse case, percentage change ,relative percentage, product constancy, problems based on population, results on depreciation, Ratio and proportion, Inverse Proportion ,blood relspeed and distance, relative speed and conversions ,train problems, Direction Problems, Downstream and Upstream, direction sense.

IV Verbal analogies, Ordering of words, Sentence improvement, Closet test, onesubstitution

V


Question paper Pattern:

50 questions and each question carry one Course Outcomes

Course outcome Descriptions CO1 Understand the basic concepts of quantitative ability, logical reasoning,

verbal reasoning and also soft skills.CO2 Inclusive and engaging environment for a dynamic campus communityCO3 Proficient use of qualitative and quantitative methods in problem solvingCO4 Critical and analytical thinking across a range of discipline.



percent to decimal fraction conversion, percentage to quantity, inverse case, percentage change ,relative percentage, product constancy, problems based on population, results on depreciation, Ratio and proportion, Inverse Proportion ,blood relation & family tree, Time speed and distance, relative speed and conversions ,train problems, Direction Problems, Downstream and Upstream, direction sense.

Verbal analogies, Spotting errors, Antonyms, Synonyms, Spellings, Ordering of words, Sentence improvement, Closet test, one



Descriptions

Understand the basic concepts of quantitative ability, logical reasoning, verbal reasoning and also soft skills. Inclusive and engaging environment for a dynamic campus communityProficient use of qualitative and quantitative methods in problem solvingCritical and analytical thinking across a range of discipline.


percent to decimal fraction conversion, percentage to quantity, inverse case, percentage change ,relative percentage, product constancy, problems based on population, results on depreciation, Ratio

ation & family tree, Time speed and distance, relative speed and conversions ,train problems, Direction Problems, Downstream and Upstream, direction sense.

08

Spotting errors, Antonyms, Synonyms, Spellings, Ordering of words, Sentence improvement, Closet test, one-word 06

Introduction, Soft Skills, Communication Skills, LSRW, Team Building and Leadership Building Skill Training, stress management, Behavioral 05

Understand the basic concepts of quantitative ability, logical reasoning,

Inclusive and engaging environment for a dynamic campus community Proficient use of qualitative and quantitative methods in problem solving Critical and analytical thinking across a range of discipline.

Syllabus for the Academic Year –––– 2020 2020 2020 ...

Documents

Transcript of Syllabus for the Academic Year –––– 2020 2020 2020 ...