SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU

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

SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY, TUMAKURU

(A Constituent College of Sri Siddhartha Academy of Higher Education, Tumakuru)
SCHEME OF TEACHING AND EXAMINATION – 2018
Choice Based Credit System (CBCS) (Effective from the academic year 2018-19)
DEPARTMENT OF INFORMATION SCIENCE& ENGINEERING
III SEMESTER
III Semester B.E. Computer Science& Engineering / Information Science
& Engineering. Teaching Examination
Hours/week
Sl. Course and Course Title Teaching Board of L T P C Duration CIE SEE Total
No. Course Code Department Exam in Hrs. Marks

Integral Transforms and

01 BS 18MA301 Numerical Techniques MA MA 4 - - 4 3 50 50 100
02 PC 18CS302 Programming with Python CS/IS CS/IS 2 - 2 3 3 50 50 100
03 PC 18CS303 Data Structures CS/IS CS/IS 3 2 - 4 3 50 50 100
Analog and Digital
Electronic Circuits
04 PC 18CS304 CS/IS CS/IS 3 2 - 4 3 50 50 100
Discrete Mathematical
05 PC 18CS305 Structures CS/IS CS/IS 3 - - 3 3 50 50 100
Computer Organization /
06 PC/ 18CS306/ Fundamental CS/IS/MA CS/IS/MA 3 - - 3 3 50 50 100
MA 18DIP300 Mathematics(Mathematics
for Diploma
students)
07 PC 18CS3L01 Data Structures Lab CS/IS CS/IS - - 3 1.5 3 50 50 100
Analog and Digital Circuits
08 PC 18CS3L02 Lab CS/IS CS/IS - - 3 1.5 3 50 50 100
09 HS 18SK301 Skill Development - I HS HS - - 2 1 3 50 50 100
Total 18 4 10 25 27 450 450 900
L-Lecture, T-Tutorial, P-Practical, CIE-Continuous Internal Evaluation, SEE-Semester End Examination
 SRI SIDDHARTHA INSTITUTE OF TECHNOLOGY- TUMAKURU
(A constituent College of Siddhartha Academy of Higher Education, Tumakuru)

COURSE ASSESSMENT METHODS (THEORY)

CIE SEE
TESTS 20
MID. TERM EXAM 20 50
ASSIGNMENT/QUIZ 10 50
/SURPRISE TEST

COURSE ASSESSMENT METHODS (PRACTICAL)

CIE SEE
TESTS 20
DEMONSTRATION/ 30 50 50
DOCUMENTATION

PROGRAMMING WITH PYTHON (18CS302)

COURSE ASSESSMENT METHOD

CIE SEE
MID. TERM EXAM 20 50 50
PRACTICAL 30

Information Science and Engineering

 Syllabus for the Academic Year – 2019 - 2020
Department: Mathematics Semester: 3

Subject Name: Integral Transforms and Numerical Techniques

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

Course Objectives:

Sl. No Course Objectives

Introduce the concept of Laplace Transform and problems on periodic
1 function.
Introduce the concept of solvingLinear Differential Equations by the method of
2 LaplaceTransform.

Represent a periodic function as a Fourier Series and Computethe Fourier

3
coefficients numerically.

To develop the proficiency in Numerical techniques and solving Ordinary

4 Differential Equations arising in engineering applications.

Course Outcomes:

Course Descriptions
outcome
Understand the basic concepts of Fourier series and Integral transforms.
CO1
Apply Laplace transform and inverse Laplace transform in solving
differential equation and integral equation arising in network analysis,
CO2 control system and others fields ofengineering.

Demonstrate Fourier series and Integral transforms to study behaviour of

CO3 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
CO4 engineering problems.
UNIT Description Hours
10
Laplace Transforms: Definition, Laplace transforms ofelementary
functions and problems, periodic functions, unit step functions -
I problems.
Inverse Laplace transforms: Inverse Laplace transforms, problems.
Solution of linear differential equations by Laplace transformsmethod.

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

series of periodic functions with period 2and with arbitra y period 2l.
II Fourier series of even and odd functions. Half range Fourier series.
Practical harmonic analysis. Applications- frequency spectrum and
examples from engineering field.

Fourier Transforms :Infinite Fourier transforms. Fourier Sine and 10

Cosine transforms. Inverse Fourier transforms, and simple problems.
Z-Transforms: Difference equations, basic definitions, Z-transform-
III definition, Standard Z-transforms, Dampingrule, Shifting rule, Initial
value and Final value theorems(without proofs) and problems, Inverse
Z-transform, Simple problems. Applications-solutionsof
difference equations using Z-transforms.
10
Numerical solution of ordinary differential equations of first order
and first degree: Taylor’s series method, Modified Euler’s method,
IV Runge- Kutta method of fourth order, Milne’s and Adams-Bashforth
Predictor and Corr ctor methods (No derivation of formulae).

Numerical solution of second order ODE: Runge- Kutta method 10

and Milne’s Predictor and Correctormethod (No derivation of formulae).
rd th
Numerical Integration: Trapezoidal rule,Simpson’s 1 3 ,3 8 rule,
V Weddle’s rule, Romberg integration, Newton-cotes integration (without
proof)-problems.

Question paper Pattern:

From each unit, two questions of 20 marks each have to be prepared, the student has
to answer one full question of his/herchoice.
Text Books:

Sl Text Book title Author Volume and Year

No of Edition
1 Higher Engineering Mathematics B.S.Grewal 43rd Ed.,2015.

2 Advanced Engineering Mathematics E.Kreyszig

10th Ed.,2015.

Reference Book:

Sl Text Book title Author Volume and Year

No of Edition
A text book ofEngineering N.P.Bali and 7th Ed.,2010.
1 Mathematics Manish Goyal
Higher Engineering Mathematics B.V.Ramana 2006
2
Higher Engineering Mathematics H.K.Das and 1stedition 2011.
3 Er.RajnishVerma
 Syllabus for the Academic Year – 2019 - 2020

Semester: 3
Department: ISE

Subject Name: Programming with Python

L-T-P-C: 2-0-2-3
Subject Code:18CS302

Course Objectives:

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, tuples, dictionaries and sets in Python.

Course Outcomes:

Course Descriptions
outcome

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

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

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

Create, run and manipulate the Python programs using core data
CO4
structures like tuples, dictionaries and sets.
UNIT Description Hours
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 Longer Python program.

Values and Variables

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

Expressions and 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, Multi-way Decision Statements,
Conditional Expressions, Errors in ConditionalStatements.
Iteration 5
II
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 the Proper
Input.
Implement programs using Conditional Execution and Iteration.
Using Functions
Introduction to Using Functions, Functions and Modules, The Built-in
Functions, Standard Mathematical Functions, time Functions,Random
Numbers, System-specificFunctions.
Writing Functions
5
Function Basics, Parameter Passing, Documenting Functions,Function
III Examples, Better Organized Prime Generator, Command
Interpreter ,Restricted Input, Better Die Rolling Simulator, Tree
Drawing Function , Floating-pointEquality.
More on Functions
Global Variables, Default Parameters, Recursion,Makin Functions
Reusable, Functions asData.
Design programs usingFunctions.
 Lists
Motivation, List Structures, Lists (Sequences) in Python, Iterating Over
Lists (Sequences) in Python, More on Python Lists.
IV 5
Objects
Using Objects, String Objects, ListObjects.
Demonstrate programs using Lists and objects.

Tuples, Dictionaries, andSets

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

Question paper Pattern:

From each unit, two questions of 20 marks each have to be given, the student has to
answer one full question of his/her choice.

Text Books:

Sl Text Book title Author Volume and Year

No of Edition

1 Fundamentals of Python Richard L. Southern Adventist

Programming Halterman University2019

2 Introduction to Computer Science Charles Dierbach Jhon Wiley &

Using Python: A Computational Sons, Inc.
Problem-Solving Publications.

Reference Book:

Sl Text Book title Author Volume and Year

No of Edition

1 Think Python Allen Downey Version 2.0.15

March 2015, Green
Tea Press

2 Learning Python B.NageshRao A cyberplus

publication
 Syllabus for the Academic Year – 2019-2020
Department: ISE Semester: 3

Subject Name: Data Structures

SubjectCode:18CS303 L-T-P-C:3-2-0-4

Course Objectives:

Sl.No Course Objectives

Understand, Practice and Assimilate fundamentals of d ta structures and

1
their applications essential for programming/problem solving.

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

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

3
Trees, Tries.

Assess appropriate data structure during program development/problem

4
solving.

Course Outcomes:

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

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

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

Apply concepts of linear and non-linear data structures to solve a
CO4 problem.
UNIT Description Hours
Stacks and Queues: Structures and Pointers revisited.
Stacks: Definition and Examples, Representing Stacks in C. Stack
Applications: Reversing Data: Reverse a list and convert decimal to
I binary, Parsing, Postponement: infix to postfix transformation, 8
evaluating a postfix expression. Recursion. Queues: The Queue and its
Sequential Representation, C implementation ofQueue.

Circularqueue,PriorityqueueandLinkedlist:CircularQueue,and The
priority queue – Array implementation of priority queue. Queue
applications: Queue Simulation and categorizing data. Self-referential
structure, linking self –referential structures. List: In erting and
II removing nodes from a list, the getnode and free node operations, the 8
linked list as a d ta structure, examples of list operations, Header
nodes. Lists in C. Array implementation of lists, limitations of array
implementation.

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

Trees: Basic tree concepts: Terminology, tree representation, Binary

trees: properties, binary tree structure. Binary tree traversals: Tree
traversal techniques: preorder, inorder and postorder, Expression
IV trees: infix, postfix and prefix traversal. General trees: Changing 8
general tree to binary tree, insertion into general trees, general tree
deletions.

Lexical Search Tree and Graphs: Tries: Introduction to Tries, Trie

structure,Trie search. Graphs:Terminologies, An ap lication of graphs,
C representation of graphs, transitive closure, Warshall’s algorithm,Graph
V 8
traversal techniques: Depth – First traversal, Breadth – Firsttraversal.

Question paper Pattern:

From each unit, two questions of 20 marks each have to be prepared, the student has
to answer one full question of his/herchoice.
Text Books:

Sl Text Book title Author Volume and Year

No of Edition
1 Data Structure using C Aaron M. First edition, 2019,
Tenenbaum, ISBN-13:
YedidyahLangsam 9789332543546.
and Moshe J.
Augenstein,
Pearson
publication
2 Data Structures: A Pseudocode Richard F. Gilberg Second
Approach with C and Behrouz A. Edition,Cengage
Forouzan publication, 2007,
ISBN-13:
9788131503140

Reference Books:

Sl Text Book title Author Volume and Year

No of Edition
1 Data Structures and Program Robert Kruse, C L PHI, 2nd Edition,
Design inC Tondo, Bruce 2015, ISBN-
Leung, 13: 978-
ShashiMogalla 0132883665.

2 Data Structures with C Seymour Lipschutz McGraw Hill

publications, 2018,
ISBN-13: 978-0-
07-070198-4
 Syllabus for the Academic Year – 2019 - 2020

Subject Name: ANALOG AND DIGITAL ELECTRONIC CIRCUITS

Department: ISE Semester: 3

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

Course Objectives:

Sl.No Course Objectives

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

2 To analyze and design simple analog and digital circuits.

3 To simulate digital circuits using Verilog coding.

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

Course Outcomes:

Course Descriptions
outcome
Understand the operating principles of basic analog and digital electronic
CO1
devices
Design simple analog electronic circuits such as rectifiers, amplifier and
CO2 clock circuits, ADC and DAC and to design combinational and sequential
digital circuits
Apply the concepts of analog and digital electronic in real time
CO3
applications
CO4 Simulate simple analog and digital circuits using Verilog code.
UNIT Description Hours
Basics of Semiconductor devices (Diodes and Transistors): P-N
junction diode, Characteristics and Parameters, Diodeapproximations,
alf-wave rectifier, Full-waverectifier, Bridge rectifier, Zener diode
I voltageregulators: Bipolar Junction Transistors: BJT operation, 8
Common Base, Common Emitter and Common Collector
configurations. Frequency responseof CE
amplifier.
Operational amplifier and its Applications: Introduction to
Operational Amplifiers: Ideal OPAMP, Inverting and Non Inverting
OPAMP circuits, OPAMP applications: voltage follower, adder,
subtractor, integrator, differentiator,IC555 timer as Astable multi-
vibrator, ADC (counter type) and DAC (binary weighted resistor)
II circuits. 8

Sensors and transducers: Introduction, basic operating principles of

sensors 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: Laws of

Boolean Algebra, De Morgan’s theorem. Logic gates: NOT, AND, OR,
III XOR, NAND, NOR and X-NOR Gates. Algebraic Simplification using 8
SOP and POS techniques, Karnaugh’s map (4 Variables) and QuineMc-
Cluskey methods (Algorithm). Introduction to HDL.

CombinationalCircuits:HalfandFulladders,4bitadder(IC7483),
Multiplexers, De-multiplexers, Decoder, BCD to Decimal Decoders,
IV Seven Segment Decoders, Combinational circuit design using MUX IC 8
74153 and Decoder IC 74138. Encoders, Magnitude Comparator and
ALU IC74181. HDL Implementation of combinationalCircuits.

Sequential logic circuits: Introduction to Flip-Flops, Basic RSlatch,

RS Flip-Flop, Gated Flip-Flops: JK FF, D FF, T FF. Various
representations of flip flops and Flip flop conversions.Registers: Types
of Registers, Serial In – Serial Out, Serial In – Parallel out, Parallel In –
V 8
Serial Out, Parallel In – Parallel Out, Universal Shift Register, and
Applications of Shift Registers. Counters: Asynchronous Counters,
Decoding Gates, Synchronous Counters, Changingthe
Counter Modulus. HDL implementation of sequential circuits.
Question paper Pattern:

From each unit, two questions of 20 marks will be given. Student has to answer one
full question of his/her choice.

Text Books:
Sl Text Book title Author Volume and Year of
No Edition
1 Electronic Devices and Circuit Robert L. ISBN: 9789332542600,
Theory Boylestad, Louis 11th Edition, Prentice
Nashelsky Hall, 2015
2 Digital principles and Applications Donald P Leach, ISBN:9789339203405,
Albert Paul 9339203402, 8e
Malvino Mcgraw Hill
3 Sensors and Transducers D. Patranabis ISBN-13: 978-
81203219, Prentice Hall
India Learning Private
Limited; 2 edition
(2003)

Reference Book:
Sl Text Book title Author Volume and Year of
No Edition
1 Op-amp and linear Integrated Ramakant A. ISBN-13: 978-
circuits Gaikwad 9332549913, Pearson
Education; Fourth
edition (29 May 2015).
2 Basic Electronics D.P. Kothari, I. J. ISBN-13: 978-
Nagrath 9352606467, McGraw
Hill Education; Second
edition (29 November
2017).
 Syllabus for the Academic Year – 2019 - 2020
Department: ISE Semester: 3

Subject Name: Discrete Mathematical Structures

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

Course Objectives:

Sl.No Course Objectives

1 Solve problems using counting techniques and combinatorics.

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

2
or sequences.

3 Solve problems involving recurrence relations and generatingfunctions.

4 Apply algorithms and use definitions to solve problems.

Course Outcomes:

Course Descriptions
outcome

CO1 Recall the basics of Discrete Mathematical Structure.

CO2 Formulate and solve abstract mathematicalproblems.

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

CO4 Develop mathematical model for a given problem.

UNIT Description Hours
8
Introduction to Graph Theory: Definitions and Examples,
Subgraphs, Complements, and Graph Isomorphism, Vertex Degree:
I Euler Trails and Circuits, Planar Graphs, Hamilton Paths and Cycles,
Graph Colouring and Chromatic Polynomials.
Trees: Definitions, Properties and Examples, Rooted Tree.
8
Relations and Functions : Cartesian products and relations.
Functions- plain, One to One and On to functions. Stirling number of
second kind. Special functions. Function composition and inverse
functions. The Pigeonhole principle.
II
Properties of Relations: Computer Recognition – Zero-one matrices
and directed graphs, Partial orders and Hasse Diagrams, Equivalence
relations and partitions.

8
FundamentalPrinciplesofCounting:TherulesofSumandproduct-
Permutations and Combinations, Binomial Theorem, Combinations
withrepetitions.
III The principles of Inclusion and Exclusion: The principles of
Inclusion and Exclusion, Generalization of Principle. Derangements-
Nothing is in its right place. Rook Polynomials, Arrangements with
forbidden positions

8
Groups and Rings: Definitions examples and elementary properties.
Homomorphism, Isomorphism and Cyclic groups. Cosets and
IV Lagrange’s Theore .
Ring structure- definitions and examples. Ring property and
substructures. Ring integer modulo n.

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

Question paper Pattern:

From each unit, two questions of 20 marks each have to be given , the student has to
answer one full question of his/her choice.
Text Books:

Sl Text Book title Author Volume and Year of Edition

No
1 Discrete and Ralph P. Grimaldi 5th Edition, PHI/ Pearson
Combinatorial Education, 2004,
Mathematics
ISBN-13: 978-0201726343,

ISBN-10: 0201726343

Reference Book:

Sl Text Book title Author Volume and Year

No of Edition
Discrete Mathematics and its Kenneth H Rosen 6th Edition,
1
applications McGraw Hill 2007.
Discrete Mathematics Trembly and McGraw Hill
2
Manohar Education,1st
edition (1 July
2017)ISBN-10:
9780074631133

ISBN-13: 978-
0074631133
 Syllabus for the Academic Year – 2019 - 2020

Department: ISE Semester: 3

Subject Name: Computer Organization

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

Course Objectives:

Sl.No Course Objectives

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

2 Understand the instruction formats used in the design fprocessors.

3 Know the various design philosophy of central processing unit

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

Course Outcomes

Course Descriptions
outcome
Acquire the knowledge of basic structures of computers and machine
CO1 Instructions.
Describe various data representational methods and explain the
CO2 Arithmetic and logical operations performed incomputers.
Discuss the working principles of input/output units and internal
CO3 organization of computer.
Analyze the performance issues and design tradeoffs in designing and
CO4 constructing a computer processor including memory.
UNIT Description Hours
Introduction to Computer Organization: Basic structure of 8
computers, Bus Structures, Performance of a Computer: Processor
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:
Byte addressability, Big-endian & Little-endian assignments, Word
I
Alignment, Accessing Numbers, Characters & Character strings;
Memory operations, Instruction & Instruction Sequencing: Register
Transfer Notation, Assembly Language Notation. Basic Instruction
Types, Instruction execution & Straight-line sequencing, Branching,
Condition codes.
Case Study: Intel 8085 and 8086 Family.

Machine Instructions and Programs (Contd...) and Basic 8

Processing Unit: Addressing Modes: Addressing modes, Assembly
language: Assembler Directives, Stacks and Queues, Subroutines:
Subroutine nesting & processor stack, Parameter passing, The Stack
Frame.
Basic Processing Unit: Some fundamental concepts: Register
Transfers, Performing an Arithmetic or Logic operation, Fetching a
II
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 Dual Core Processor, Intel
Core i3Processors, Intel Core i5 Processors, Intel Core i7 Processors.

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

Input/output Organization: Accessing I/O devices, Interrupts, 8

Interrupt hardware, Enabling & Disabling Interrupts, Handling
Multiple devices, Controlling Device Requests, Exceptions; Direct
memory access: Bus arbitration; Buses: Synchronous Bus,
IV Asynchronous bus.Interface circuits: Parallel port, Serial port;
Standard I/O interfaces: PCI bus, SCSIbus, USB,
Case Study:SATA,IrDA, Ethernet,AGP,HDMI, Interrupt Controller,
DMAController.
 The Memory System: Some Basic concepts: Semiconductor RAM 8
memories: Internal organization of Memory chips, static memories,
Asynchronous Drams, Synchronous DRAMs, Memory system
considerations,Read-onlymemories:ROM,PROM,EPROM,EEPROM,
V Flash memory; Cache memories: Mapping function s; Virtual
memories: Addresstranslation.
Case Study: HD Card, USB Memory.
Note: Case Studies are for internal evaluation only.

Question paper Pattern:

From each unit , two questions of 20 marks each have to be given, the student has to
answer one full question of his/her choice.

Text Books:

Sl Text Book title Author Volume and Year

No of Edition
Computer Organization Carl Hamacher, Z 5th Edition,
1 Vranesic& S Zaky, McGraw Hill, 2011.
ISBN-13:978-
1259005275

Reference Books:

Sl Text Book title Author Volume and Year of

No Edition
Computer Organization and William Stallings 10thedition, 2010
1 Architecture: Desig ing for Pearson.
performance ISBN:978-0-13-
410161-3
Computer System Architecture Morris Mano 3rd Edition, 2016
2 PHI,
ISBN-10:
978-9332585607
Computer Organization and Design, David A 5th Edition 2014
3 The Hardware Software interface. Patterson Elsevier
ISBN:
978-0-12-407726-3
 SyllabusfortheAcademicYear–2019-2020
Department: Mathematics Semester: 3

Subject Name: Fundamental Mathematics

SubjectCode: 18DIP300 L-T-P-C: 3 – 0 – 0 -3

Course Objectives:

Course Objectives
The purpose of this course is to make students to develop a basic Mathematical
knowledge required for higher semesters with few examples of its engineering
applications.

Course Outcomes:

Course Descriptions
outcome
To understand the basic concept of calculus like differentiation and
CO1 integration.
To understand the concepts of partial differentiation and differential
CO2 equations arising in a variety of engineeringapplications.
To understand the double and triple integral.
CO3
To apply the concept of probability in problem solving and relate the
CO4 solutions to the various engineering streams.
UNIT Description Hours
8
Differential Calculus: nth derivatives of some standard functions
(without proof), Leibnitz’s Theorem(statement),Polar curves –angle
I betweenthe radius vector and the tangent pedal equation- Problems.
Taylor’s and Maclaurin’s series expansions of onevariable
- Illustrative examples.

8
Partial Differentiation: Partial derivatives, Euler’s theorem for
homogeneous functions of two variables. Total derivatives, Total
II
differential, differentiation of composite andimplicit function, Jacobians.

8
n n
Integral Calculus: Statement of reduction formulae for sin x, cos x,
III m n
and sin xcos x and evaluation of these with standard limits-
Examples. Double and triple integrals-Simple examples.

9
Ordinary differential equations (ODE’s): Introduction-solutions of
first order and first degree differential equations,exact, linear
differentialequations.
IV
Higher order ODE’s: Linear differential equations of second and
higher order equations with constant coefficients. Homogeneous /non-
homogeneous equations. Solutions of initial valueproblems.

6
Probability: Introduction, Sample space and events. Axioms of
V probability. Addition and multiplication theorems, Conditional
probability-illustrative examples. Baye’s theorem-problems.

Question paper Pattern:

From each unit , two ques ions of 20 marks each have to be given, the student has to
answer one full question of his/her choice.
Text Books:

Sl Text Book title Author Volume and Year

No of Edition
Higher Engineering Mathematics B.S.Grewal 43rd Ed.,2016
1
Advanced Engineering Mathematics E.Kreyszig 10th Ed.,2016
2

Reference Books:

Sl Text Book title Author Volume and Year

No of Edition
Advanced Engineering Mathematics Peter V. O’Neil 7th Edition
1
Advanced Modern Engineering Glyn James 4th Edition, 2011
2 Mathematics
EngineeringMathe atics K.A.Stroud
3 MACMILLAN
(London)
 Syllabus for the Academic Year – 2019 - 2020
Department: ISE Semester: 3

Subject Name: Data StructuresLab

Subject Code:18CS3L01 L-T-P-C:0-0-3-1.5

Course Objectives:

Sl.
Course Objectives
No
To develop skills to design and analyze simple linear and nonlinear data
1 structures.
To Strengthen the ability to identify and apply suitable data structure for
2 the given real world problem.

3 To gain knowledge in practical applications of data structures.

Course Outcomes:

Course Descriptions
outcome
Understand and use pointers, files, structures and unions in program
CO1 development.
Use data structures like stacks and queues to solve problems in
CO2 Computer field.
Apply the concept of linked lists in solving problems.
CO3
Design and implement solutions based on advanced d ta structures.
CO4
Design and develop C programs on the following concepts:

LAB Description
CYCLES

I Structures, Pointers and memory allocationfunctions.

II Stacks, Queues and Linked lists

III Trees

Pattern for practical exam conduction:

 For laboratories having only one part: Students are allowed to pick one experiment
from the lot with equalopportunity.
 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.
 Subject Name: ANALOG AND DIGITAL ELECTRONIC CIRCUITS LAB

Department: ISE Semester: 3

Subject Code: 18CS3L02 L-T-P-C: 0-0-3-1.5

Course Objectives:

Sl.No Course Objectives

To get an exposure to design, test and evaluate the performance of basic
1
electronic devices and circuits.
To study, analyse, design, verify and evaluate the performance of
2
combinational and sequential logic circuits

Course Outcomes:

Course Descriptions
outcome
To identify various electronic components and to test the working of
CO1 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-
CO2
spice
To design and verify the working of simple combinational and sequential
CO3
logic circuits
To simulate and verify the working of simple digital circuits
CO4
 Lab Description
cycles
1. To simulate the operationof
i) Half w ve and full waverectifier
ii) RC coupled CE amplifier and to plot thefrequency response
I
2. Tosimulate
i) Diode clipping and clampingcircuit
ii) Inverting and non-inverting amplifiers using Op-amp IC741
3. To simulate the operationsof
i) Op-amp such as: integrator,differentiator
ii) A-stable multi-vibrator using IC555 timer for the given Duty
cycle
II
4. To simulate the workingof
i) ADC andDAC
ii) To study the working of sensors such as: LDR andPIR
5. To Realize the given Boolean equation (4 variables) using minimum
number ofgates.
i) Using basicgates
ii) Using universalgates
6. To Implement 4-bit adder/subtractor using IC7483.

7. Multiplexers&Demultiplexers
III
To verify the truth tables of 8:1 MUX and 1:8 DEMUX using IC 74151
and IC74149

8. Adders&Subtractors

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

9. Torealize
i) 1-bit comparator using logicgates.
ii) 4 bit magnitude comparator using IC7485.
Decoders and Encoders.
IV i) Display the digits from 0 to 9 using BCD-to-7 Segment ii)
Decoder (IC7447).
ii) Implement Decimal-to-BCD Encoder using IC74148.

10. Flip-Flops.
i) VerifythetruthtablesofSRandDflipflopsusingNAND
 gates.
ii) Verify the truth table of JK Master-Slave flip flop using IC
7476.

11. ToRealizeandstudyRingandJohnsoncountersusingIC7495.
12Design a 3-bit asynchronous up counter and down counter
(ripple counter) using IC 7476 for the given modul s.

13Design a 3-bit synchronous counter using IC 7476 for the

given modulus.

14i) Write the verilog/VHDL code for full adder. Simulate

V
and verify ts working.
ii) Write the verilog/VHDL code for an 8:1 multiplexer.
Simulate and verify its working.
15i) 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.

Pattern for practical exam conduction:

 Studentsareallowedtopickoneexperimentfromthelot(1to15)
 For questions having subsections i) ,ii) – student should execute both the
experiments to obtain passingmarks
 Partialoutputsarenotconsideredforpassingtheexam
 Change of experiment is allowed only once and 20%ofthe maximum
marks will be deducted for change ofexperiment

Marks distribution:

Particulars Max marks

Procedure/Write-up 10
Conduction/Execution 30
Viva 10