B.Tech
Computer Engineering Syllabus
III Semester
3CS1 MATHEMATICS III (Common to Comp. Engg. & Info. Tech)
Unit IIntroduction: Engineering application of optimization, Statement and classification
of optimization problem, single variable and multivariable optimization with and
without constraints.
Unit II
Linear Programming: Formulation of Linear Programming problem, Graphical
Approach, General Linear Programming problem, Simplex Method. Duality in
Linear Programming and Transportation Problems.
Unit III
Project Scheduling: Project Scheduling by PERT and CPM Network Analysis.
Sequencing Theory: General Sequencing problem n-jobs through 2 machines & 3
machines and 2-jobs through m machines.
Unit IV
LAPLACE TRANSFORM: Laplace transform with its simple properties. Inverse
Laplace transform, convolution theorem (without proof), solution of ordinary
differential equation with constant coefficient, solution of partial differential
equation having constant coefficient with special reference to diffusion, Heat
conduction and wave equation. Boundary value problems
Unit V
NUMERICAL ANALYSIS: Difference operators forward, backward, central, shift
and average operators and relation between them. Newton’s and Gauss forward and
backward interpolation formula for equal interval, Stirling’s formula for central
difference. Lagrange’s Interpolation formula and Inverse Interpolation.
Numerical differentiation by Newton’s, Gauss and Sterling’s formula. Numerical
Integration by Simpson’s one third and there eight rule. Numerical Integration of
ordinary differential equation of first order by Picard’s method, Euler’s and modified
Euler’s method, Milne’s method and Runga-Kutta fourth order method. Solution of
difference equation.
3CS2 ELECTRONIC DEVICES & CIRCUITS (Common to Comp. Engg. & Info. Tech)
Unit I
Mobility and conductivity, charge densities in a semiconductor, Fermi Dirac
distribution, carrier concentrations and fermi levels in semiconductor, Generation
and recombination of charges, diffusion and continuity equation, Mass action Law,
Hall effect. Junction diodes, Diode as a ckt. element, load line concept, clipping and
clamping circuits, Voltage multipliers.
Unit II
Transistor characteristics, Current components, Current gains: alpha and beta.
Operating point. Hybrid model, h-parameter equivalent circuits. CE, CB and CC
configuration. DC and AC analysis of CE,CC and CB amplifiers. Ebers-Moll
model. Biasing & stabilization techniques. Thermal runaway, Thermal stability.
Unit III
SMALL SIGNAL AMPLIFIERS AT LOW FREQUENCY : Analysis of BJT and
FET, RC coupled amplifiers. Frequency response, midband gain, gains at low and
high frequency. Miller’s Theorem. Cascading Transistor amplifiers, Emitter
follower. JFET, MOSFET, Equivalent circuits and biasing of JFET's & MOSFET’s.
Low frequency CS and CD JFET amplifiers. FET as a voltage variable resistor.
Source follower.
Unit IV
FEEDBACK AMPLIFIERS : Classification, Feedback concept, Transfer gain with
feedback, General characteristics of negative feedback amplifiers. Analysis of
voltage-series, voltage-shunt, current- series and current-shunt feedback amplifier.
Stability criterion.
Unit V
OSCILLATORS : Classification. Criterion for oscillation. Tuned collector, Hartley,
Colpitts, RC Phase shift, Wien bridge and crystal oscillators, Astable, monostable
and bistable multivibrators. Schmitt trigger.
3CS3 DATA STRUCTURES & ALGORITHMS (Common to Comp. Engg. & Info. Tech)
Unit I
Definition & characteristics of algorithms, structures. Difficulties in estimating
exact execution time of algorithms. Concept of complexity of program.
Asymptotic notations: Big-Oh, theta, Omega- Definitions and examples,
Determination of time and space complexity of simple algorithms without
recursion. Representing a function in asymptotic notations viz 5n2-6n= (n2)
Arrays: Array as storage element, Row major & column major form of arrays,
computation of address of elements of n dimensional array.
Unit II
Arrays as storage elements for representing polynomial of one or more degrees
for addition & multiplication, sparse matrices for transposing & multiplication,
stack, queue, dequeue, circular queue for insertion and deletion with condition
for over and underflow, transposition of sparse matrices with algorithms of
varying complexity (Includes algorithms for operations as mentioned).
Evaluation of Expression: Concept of precedence and associativity in
expressions, difficulties in dealing with infix expressions, Resolving precedence
of operators and association of operands, postfix & prefix expressions,
conversion of expression from one form to other form using stack (with &
without parenthesis), Evaluation of expression in infix, postfix & prefix forms
using stack. Recursion.
Unit III
Linear linked lists: singly, doubly and circularly connected linear linked listsinsertion,
deletion at/ from beginning and any point in ordered or unordered lists.
Comparison of arrays and linked lists as data structures.
Linked implementation of stack, queue and dequeue. Algorithms for/of insertion,
deletion of stack, queue, dequeue implemented using linked structures.
Polynomial representation using linked lists for addition, Concepts of Head
Node in linked lists.
Searching: Sequential and binary search.
Unit IV
Non-Linear Structures: Trees definition, characteristics concept of child, sibling,
parent child relationship etc, binary tree: different types of binary trees based on
distribution of nodes, binary tree (threaded and unthreaded) as data structure,
insertion, deletion and traversal of binary trees, constructing binary tree from
traversal results. Threaded binary Tree. Time complexity of insertion, deletion
and traversal in threaded and ordinary binary trees. AVL tree: Concept of
balanced trees, balance factor in AVL trees, insertion into and deletion from
AVL tree, balancing AVL tree after insertion and deletion. Application of trees
for representation of sets.
Unit V
Graphs: Definition, Relation between tree & graph, directed and undirected
graph, representation of graphs using adjacency matrix and list. Depth first and
breadth first traversal of graphs, finding connected components and spanning
tree. Single source single destination shortest path algorithms.
Sorting: Insertion, quick, heap, topological and bubble sorting algorithms for
different characteristics of input data. Comparison of sorting algorithms in term
of time complexity.
NOTE:
1. Algorithm for any operation mentioned with a data structure or required to
implement the particular data structure is included in the curriculum
3CS4 OBJECT ORIENTED PROGRAMMING (Common to Comp. Engg. & Info. Tech)
Unit I
Introduction: Review of structures in C, accessing members of structures using
structure variables, pointer to structures, passing structures to functions, structures as
user defined data types.
Unit II
Introduction to programming paradigms- (Process oriented and Object oriented).
Concept of object, class, objects as variables of class data type, difference in
structures and class in terms of access to members, private and public members of a
class, data & function members.
Characteristics of OOP- Data hiding, Encapsulation, data security.
Basics of C++: Structure of C++ programs, introduction to defining member
functions within and outside a class, keyword using, declaring class, creating
objects, constructors & destructor functions, Initializing member values with and
without use of constructors, simple programs to access & manipulate data members,
cin and cout functions. Dangers of returning reference to a private data member,
constant objects and members function, composition of classes, friend functions and
classes, using this pointer, creating and destroying objects dynamically using new
and delete operators.
Static class members, container classes and iterators, proxy classes.
Unit III
Operator overloading: Fundamentals, Restrictions, operator functions as class
members v/s as friend functions. Overloading stream function, binary operators and
unary operators. Converting between types.
Unit IV
Inheritance: Base classes and derived classes, protected members, relationship
between base class and derived classes, constructors and destructors in derived
classes, public, private and protected inheritance, relationship among objects in an
inheritance hierarchy, abstract classes, virtual functions and dynamic binding, virtual
destructors.
Unit V
Multiple inheritance, virtual base classes, pointers to classes and class members,
multiple class members. Templates, exception handling
3CS5 DIGITAL ELECTRONICS (Common to Comp. Engg. & Info. Tech)
Unit I
NUMBER SYSTEMS, BASIC LOGIC GATES & BOOLEAN ALGEBRA: Binary
Arithmetic & Radix representation of different numbers. Sign & magnitude
representation, Fixed point representation, complement notation, various codes &
arithmetic in different codes & their inter conversion. Features of logic algebra,
postulates of Boolean algebra. Theorems of Boolean algebra. Boolean function.
Derived logic gates: Exclusive-OR, NAND, NOR gates, their block diagrams and
truth tables. Logic diagrams from Boolean expressions and vica-versa. Converting
logic diagrams to universal logic. Positive, negative and mixed logic. Logic gate
conversion.
Unit II
DIGITAL LOGIC GATE CHARACTERISTICS: TTL logic gate characteristics.
Theory & operation of TTL NAND gate circuitry. Open collector TTL. Three state
output logic. TTL subfamilies. MOS & CMOS logic families. Realization of logic
gates in RTL, DTL, ECL, C-MOS & MOSFET. Interfacing logic families to one
another.
Unit III
MINIMIZATION TECHNIQUES: Minterm, Maxterm, Karnaugh Map, K map upto
4 variables. Simplification of logic functions with K-map, conversion of truth
tables in POS and SOP form. Incomplete specified functions. Variable mapping.
Quinn-Mc Klusky minimization techniques.
Unit IV
COMBINATIONAL SYSTEMS: Combinational logic circuit design, half and full
adder, subtractor. Binary serial and parallel adders. BCD adder. Binary multiplier.
Decoder: Binary to Gray decoder, BCD to decimal, BCD to 7-segment decoder.
Multiplexer, demultiplexer, encoder. Octal to binary, BCD to excess-3 encoder.
Diode switching matrix. Design of logic circuits by multiplexers, encoders, decoders
and demultiplexers.
Unit V
SEQUENTIAL SYSTEMS: Latches, flip-flops, R-S, D, J-K, Master Slave flip
flops. Conversions of flip-flops. Counters : Asynchronous (ripple), synchronous
andsynchronous decade counter, Modulus counter, skipping state counter, counter
design. Ring counter. Counter applications. Registers: buffer register, shift register.
3CS6.1 OPTICAL COMMUNICATION (Common to Comp. Engg. & Info. Tech)
Unit I
OPTICAL FIBERS - Basic optical laws and definitions, Principles of light
propagation in fibers, Ray theory, Optical fiber modes and configurations, Step
index and graded index fibers, Monomode and multimode fibers, Fiber materials,
fiber fabrication, Fiber optic cables. Attenuation, signal distortion in optical fibers,
Dispersion-intra modal & inter modal, Dispersion shifted and flattened fiber.
Unit II
OPTICAL SOURCES - LED’s- Structure, Materials, Characteristics, Modulation,
Power & efficiency, Laser Diodes - Basic concept, Hetro Structure, properties and
modulation.
Unit III
OPTICAL DETECTORS - PIN and Avalanche photo diodes, photo detector noise,
detector response time, Avalanche multiplication noise. Photo diode materials.
Fundamental of Optical Receiver Operation.
Unit IV
OPTICAL FIBER COMMUNICATION SYSTEMS- Source to fiber coupling, fiber
to fiber joints, fiber splicing, fiber connectors. Principle components. Link design
calculation, Applications, Wavelength division multiplexing.
Unit V
OPTICAL FIBER MEASUREMENTS: Measurements of Fiber attenuation,
Dispersion, refractive index profile, Numerical aperture & diameter.
3CS6.2 FUNDAMENTALS OF LINUX & SHELL PROGRAMMING (Common to Comp.
Engg. & Info. Tech)
Unit I
Introduction: Introduction to Open Source technology, different flavors of Linux
(ex:- Red Hat , Fedora, Ubuntu), Files System hierarchy, Logging in, changing
password (passwd command only), longname, man, xman, date, cal, time, banner,
info commands to access on line help.
Simple commands like ls, cp, mv, wc, sort, tsort, cat, cut, grep, dd, head, tail, uniq,
diff, echo, touch, which, whereis, whatis, type, who, whoami, finger, w (option and
variations included), tty, ,uname, printf, ps, pwd , history, exec, kill, pkill, clear,
lpstate, cancel, compress, uncompress, exit.
Directory commands like: Brief introduction to file system, mkdir, dir, cd, df,
dfspace, du, ll, dirname, rmdir, dir access permission, changing access permission
for files and directories like: chmod, chgrp, chown, hard & soft links. Environments
and path setting. I/O redirection & piping commands
Unit II
vi editor: General startup of vi editor and it modes , Creating and editing files,
features of vi, screen movement , cursor movement, insertion, deletion, searching,
submitting operations, yank, put, delete commands, reading & writing files, exrc file
for setting parameters, advance editing techniques, vim (improved vi).
Unit III
Introduction to X-window system: x-window as client/ server system, concept of
window manager, remote computing & local displays, xinitrc file, customize X work
environment and application, customizing the fvwm window manager. Introduction
to package management using yum technology and rpm command, Browsing
internet using Mozilla Firefox and elinks tool.
Unit IV
Shell: meaning and purpose of shell, introduction to types of shell. The command
line, standard input and standard output , redirection , pipes , filters special
characters for searching files and pathnames.
Bourne Again SHell: shell script-writing and executing, command separation &
grouping, redirection, directory stack manipulation, processes, parameters &
variables, keyword variables. Introduction Korn Shell and C Shell
Unit V
Shell Programming: Control structures, the Here document, expanding NULL or
USET variables, Bulitins , functions, history , aliases, job control, file substitution,
source code management- RCS and CVS. awk utility
3CS6.3 MANAGEMENT INFORMATION SYSTEM (Common to Comp. Engg. & Info.
Tech)
Unit I
Introduction to MIS: concept, Definition, role, Impact and effectiveness of MIS. Ebusiness
enterprise: Introduction, E-business, E-commerce, E-communication, Ecollaboration.
Information Security Challenges: Security Threats controlling and
management.
Unit II
Basic of Management Information System: Decision Making, Information and
knowledge, OO- Technology and MIS, Business process Re-engineering.
Unit III
Application of Management Information system: Application in manufacturing
sector using for personal management, financial management, Production
Management, Material Management, Marketing Management Application in Service
Sector.
Unit IV
Enterprise Resource Planning (ERP): EMS, ERP, Benefits implementation, EMS &
MIS.
Case Studies: Application of SAP technologies in manufacturing sector
Unit V
Database and client server architecture, Data Warehouse: architecture to
implementation, E-business Technology: Electronic payment systems, Web enabled
business management, MIS in web environment.
3CS7 PROGRAMMING IN C++ (Common to Comp. Engg. & Info. Tech)
1 To write a simple program for understanding of C++ program structure without any
CLASS declaration. Program may be based on simple input output, understanding of
keyword using.
2 Write a C++ program to demonstrate concept of declaration of class with public &
private member, constructors, object creation using constructors, access restrictions,
defining member functions within and outside a class. Scope resolution operators,
accessing an object’s data members and functions through different type of object
handle name of object, reference to object, pointer to object, assigning class objects
to each other.
3 Program involving multiple classes (without inheritance) to accomplish a task.
Demonstrate composition of class.
4 Demonstration Friend function friend classes and this pointer.
5 Demonstration dynamic memory management using new & delete & static class
members.
6 Demonstration of restrictions an operator overloading, operator functions as member
function and/ or friend function, overloading stream insertion and stream extraction,
operators, overloading operators etc.
7 Demonstrator use of protected members, public & private protected classes, multilevel
inheritance etc.
8 Demonstrating multiple inheritance, virtual functions, virtual base classes, abstract
classes
3CS8 DATA STRUCTURES LAB (Common to Comp. Engg. & Info. Tech)
1 Write a simple C program on a 32 bit compiler to understand the concept of array
storage, size of a word. The program shall be written illustrating the concept of row
major and column major storage. Find the address of element and verify it with the
theoretical value. Program may be written for arrays upto 4-dimensions.
2 Simulate a stack, queue, circular queue and dequeue using a one dimensional array
as storage element. The program should implement the basic addition, deletion and
traversal operations.
3 Represent a 2-variable polynomial using array. Use this representation to implement
addition of polynomials.
4 Represent a sparse matrix using array. Implement addition and transposition
operations using the representation.
5 Implement singly, doubly and circularly connected linked lists illustrating operations
like addition at different locations, deletion from specified locations and traversal.
6 Repeat exercises 2, 3 & 4 with linked structures.
7 Implementation of binary tree with operations like addition, deletion, traversal.
8 Depth first and breadth first traversal of graphs represented using adjacency matrix
and list.
9 Implementation of binary search in arrays and on linked Binary Search Tree.
10 Implementation of insertion, quick, heap, topological and bubble sorting algorithms.
3CS9 ANALOG ELECTRONICS LAB (Common to Comp. Engg. & Info. Tech)
S. No. List of Experiments
1 Plot V-I characteristic of P-N junction diode & calculate cut-in voltage, reverse
Saturation current and static & dynamic resistances.
2 Plot V-I characteristic of zener diode and study of zener diode as voltage regulator.
Observe the effect of load changes and determine load limits of the voltage
regulator.
3 Plot frequency response curve for single stage amplifier and to determine gain
bandwidth product.
4 Plot drain current - drain voltage and drain current – gate bias characteristics of field
effect transistor and measure of Idss & Vp
5 Application of Diode as clipper & clamper
6 Plot gain- frequency characteristic of two stages RC coupled amplifier & calculate
its bandwidth and compare it with theoretical value.
7 Plot gain- frequency characteristic of emitter follower & find out its input and output
resistances.
8 Plot input and output characteristics of BJT in CB, CC and CE configurations. Find
their h-parameters.
9 Plot gain-frequency characteristics of BJT amplifier with and without negative
feedback in the emitter circuit and determine bandwidths, gain bandwidth products
and gains at 1kHz with and without negative feedback.
10 Plot and study the characteristics of small signal amplifier using FET.
11 Study Wein bridge oscillator and observe the effect of variation in R & C on
oscillator frequency
12 Study transistor phase shift oscillator and observe the effect of variation in R & C on
oscillator frequency and compare with theoretical value.
13 To plot the characteristics of UJT and UJT as relaxation.
14 To plot the characteristics of MOSFET and CMOS.
3CS10 DIGITAL ELECTRONICS LAB (Common to Comp. Engg. & Info. Tech)
1To verify the truth tables of basic logic gates: AND, OR, NOR, NAND, NOR. Also
to verify the truth table of Ex-OR, Ex-NOR (For 2, 3, & 4 inputs using gates with 2,
3, & 4 inputs).
2 To verify the truth table of OR, AND, NOR, Ex-OR, Ex-NOR realized using NAND
& NOR gates.
3 To realize an SOP and POS expression.
4 To realize Half adder/ Subtractor & Full Adder/ Subtractor using NAND & NOR
gates and to verify their truth tables.
5 To realize a 4-bit ripple adder/ Subtractor using basic Half adder/ Subtractor & basic
Full Adder/ Subtractor.
6 To verify the truth table of 4-to-1 multiplexer and 1-to-4 demultiplexer. Realize the
multiplexer using basic gates only. Also to construct and 8-to-1 multiplexer and 1-
to-8 demultiplexer using blocks of 4-to-1 multiplexer and 1-to-4 demultiplexer
7 Design & Realize a combinational circuit that will accept a 2421 BCD code and
drive a TIL -312 seven-segment display.
8 Using basic logic gates, realize the R-S, J-K and D-flip flops with and without clock
signal and verify their truth table
9 Construct a divide by 2,4 & 8 asynchronous counter. Construct a 4-bit binary
counter and ring counter for a particular output pattern using D flip flop.
10 Perform input/output operations on parallel in/Parallel out and Serial in/Serial out
registers using clock. Also exercise loading only one of multiple values into the
register using multiplexer.
Note: As far as possible, the experiments shall be performed on bread board.
However, experiment Nos. 1-4 are to be performed on bread board only.
Shri Akash Bhai
No comments:
Post a Comment