0% found this document useful (0 votes)
48 views29 pages

Enc 2023

The document outlines the course scheme and syllabus for the B.E. in Electronics and Computer for the year 2023, detailing the courses offered across four semesters, including credits, course codes, and names. It categorizes courses into Basic Science, Engineering Science, Humanities and Social Science, Professional Core, Professional Elective, Open Elective, and Project courses, totaling various credits. Additionally, it provides specific course objectives and syllabi for selected courses such as Applied Optimization Techniques, Computer and Communication Networks, and Engineering Materials.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views29 pages

Enc 2023

The document outlines the course scheme and syllabus for the B.E. in Electronics and Computer for the year 2023, detailing the courses offered across four semesters, including credits, course codes, and names. It categorizes courses into Basic Science, Engineering Science, Humanities and Social Science, Professional Core, Professional Elective, Open Elective, and Project courses, totaling various credits. Additionally, it provides specific course objectives and syllabi for selected courses such as Applied Optimization Techniques, Computer and Communication Networks, and Engineering Materials.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

COURSE SCHEME AND SYLLABUS

FOR

B.E. (Electronics and Computer)

2023
SEMESTER-I
S.
Course Code Course Name CODE** L T P Cr
No.
1. UPH013 PHYSICS BSC 3 1 2 4.5
2. UES101 ENGINEERING DRAWING ESC 2 4 0 4.0
3. UHU003 PROFESSIONAL HSS 2 0 2 3.0
COMMUNICATION
4. UES012 MANUFACTURING PROCESSES ESC 2 0 2 3.0
5. UMA010 MATHEMATICS–I BSC 3 1 0 3.5
TOTAL 18

SEMESTER-II
S.
Course Name CODE** L T P Cr
No. Course Code

1. UCB009 CHEMISTRY BSC 3 0 2 4.0


2. UES103 PROGRAMMING FOR PROBLEM ESC 3 0 2 4.0
SOLVING

3. UES013 ELECTRICAL & ELECTRONICS ESC 3 1 2 4.5


ENGINEERING

4. UEN008 ENERGY AND ENVIRONMENT BSC 2 0 0 2.0


5. UMA004 MATHEMATICS–II BSC 3 1 0 3.5
TOTAL 18

SEMESTER-III
S.
Course Code Course Name CODE** L T P Cr
No.
1. UNC301 APPLIED OPTIMIZATION BSC 3 0 2 4.0
TECHNIQUES
2. UNC303 COMPUTER AND PCC 3 0 0 3.0
COMMUNICATION NETWORKS
3. UES012 ENGINEERING MATERIALS BSC 3 1 2 4.5
4. UNC302 OBJECT ORIENTED PCC 2 0 2 3.0
PROGRAMMING PRACTICES
5. UEC310 INFORMATION AND
COMMUNICATION THEORY PCC
3 1 0 3.5
6. UEC304 ELECTRONIC DEVICES AND PCC 3 1 2 4.5
CIRCUITS
7. UTA016 ENGINEERING DESIGN PROJECT ESC 1 0 2 3.0
–I
TOTAL 25.5
SEMESTER-IV
S.
Course Name CODE** L T P Cr
No. Course Code

1. UNC401 DATA STRUCTURES AND PCC


ALGORITHMS
3 0 2 4.0
2. UMA033 NUMERICAL AND STATISTICAL BSC
METHODS
3 0 2 4.0
3. UEC612 DIGITAL SYSTEM DESIGN PCC 3 1 2 4.5
4. UEC404 SIGNALS AND SYSTEMS PCC 3 1 2 4.5
5. UEC513 EMBEDDED SYSTEMS PCC 3 0 2 4.0
6. UTA024 ENGINEERING DESIGN ESC 1 0 4 3.0
PROJECT-II

TOTAL 24
NATURE OF THE TOTAL
CODE SEMESTER AND COURSE NAME
COURSE CREDITS
BASIC SCIENCE BSC 30 SEMESTER-1: PHYSICS, MATHEMATICS–I
COURSES SEMESTER-2: CHEMISTRY, ENERGY AND
ENVIRONMENT, MATHEMATICS–II
SEMESTER-3: APPLIED OPTIMIZATION TECHNIQUES,
ENGINEERING MATERIALS
SEMESTER-4: NUMERICAL AND STATISTICAL
COMPUTATIONS
ENGINEERING ESC 25.5 SEMESTER-1: ENGINEERING DRAWING,
SCIENCE COURSES MANUFACTURING PROCESSES
SEMESTER-2: PROGRAMMING FOR PROBLEM SOLVING,
ELECTRICAL & ELECTRONICS ENGINEERING
SEMESTER-3: ENGINEERING DESIGN PROJECT – I
SEMESTER-4: ENGINEERING DESIGN PROJECT-II
SEMESTER-5: ARTIFICIAL INTELLIGENCE & MACHINE
LEARNING

HUMANITIES AND HSS 9 SEMESTER-1: PROFESSIONAL COMMUNICATION


SOCIAL SCIENCE SEMESTER-5: INNOVATION & ENTREPRENEURSHIP
COURSES SEMESTER-7: HUMANITIES FOR ENGINEERS

PROFESSIONAL CORE PCC 62.5 SEMESTER-3: COMPUTER AND COMMUNICATION


COURSES NETWORKS, OBJECT ORIENTED PROGRAMMING
PRACTICES, INFORMATION AND COMMUNICATION
THEORY, ELECTRONIC DEVICES AND CIRCUITS
SEMESTER-4: DATA STRUCTURES AND ALGORITHMS,
DIGITAL SYSTEM DESIGN, SIGNALS AND SYSTEMS,
EMBEDDED SYSTEMS
SEMESTER-5: OPERATING SYSTEMS, DATABASE
MANAGEMENT SYSTEMS, DIGITAL SIGNAL
PROCESSING, DIGITAL COMMUNICATION
SEMESTER-6: COMPUTER ARCHITECTURE, MOS
CIRCUIT DESIGN, DEEP LEARNING AND
APPLICATIONS
SEMESTER-7: IOT BASED SYSTEMS
PROFESSIONAL PEC 12 SEMESTER-5: ELECTIVE-I
ELECTIVE COURSES SEMESTER-6: ELECTIVE-II, ELECTIVE-III
SEMESTER-7: ELECTIVE-IV
OPEN ELECTIVE OEC 2 SEMESTER-7: GENERIC ELECTIVE
COURSES

PROJECT PRJ 23 SEMESTER-6: CAPSTONE PROJECT (START)


SEMESTER-7: CAPSTONE PROJECT (END)
SEMESTER-8: PROJECT SEMESTER
UNC301: APPLIED OPTIMIZATION TECHNIQUES
L T P Cr
3 0 2 4.0
Course Objective: The objective of this course is to develop the fundamental tools/
techniques in modern optimization as well as illustrating their applications in diverse fields
such as Wireless Communication, Signal Processing, Machine Learning, Big Data, VLSI
and Finance.
Syllabus
Introduction: Vectors and Matrices, Linear Independence, Rank of a matrix, Vector Space,
linear Independence, Basis and Dimension, Eigenvalues and Eigenvectors, Norms, Positive
Semi-Definite matrices, Inner Product and its properties, Null Space and Trace of matrices,
Eigenvalue decomposition of Hermitian matrices, Circulant matrices, Autocorrelation
matrix, Toeplitz Matrix, Relationship of Eigenvalues of an autocorrelation matrix with
Power spectrum.

Support Vector Machines (SVMs): Introduction, Optimal Hyperplancefot Linearly


Separable Patterns, Quadratic Optimization for finding Optimal Hyperplane, Statistical
Properties of Optimal Hyperplane, Optimal Hyperplanes for Non-separable Patterns, SVM
for Pattern Classification.

Convex Optimization: Convex sets, Hyperplanes/ Half-spaces, Convex/ Concave


Functions, Conditions for Convexity, Tests for convexity, Hessian matrix, Jensen inequality,
Conjugates and Sub differentials, quasiconvexity and pseudo convex functions and their
properties and interrelationships, minimax theorems for convex and quasiconvex functions.

Convex Optimization problems: Optimization for signal estimation, LMS, LS,


Regularization, Lagrange function, saddle point, Fritz John optimality conditions, constraint
qualifications, Karush-Kuhn-Tucker (KKT) necessary and sufficient optimality conditions.

Algorithms/Methods: Steepest Descent, Multiplicative-Descent, Accelerated Descent,


Block-Coordinate Descent, First order methods: Gradient descent and Stochastic Gradient
Descent, Newton Descent, Second order modelling using Taylor series.

Case Studies: Cellular Communication, Multi Antenna Wireless Communication, Image


Processing, Machine Learning, Artificial Intelligence, Big-Data, Recommender Systems.

Laboratory Work:

Course Learning Objectives (CLO)


The students will be able to:
1. Recognize classes of optimization problems.
2. Interface with software for computing optimal solutions to a given machine learning
problem using SVM.
3. Understand the mathematical underpinnings of optimization methods via examples
drawn from wireless communication, machine learning, computer vision, engineering,
and data analysis.
4. Understand foundational optimization ideas including gradient descent, stochastic
gradient methods, higher-order methods, and more advanced optimization algorithms.
5. Classify optimization problems by their tractability, difficulty, and compatibility with
existing software.
Text Books
1. Hanif D. Sherali , Y. Thomas Hou , Yi Shi ,“Applied Optimization Methods for
Wireless Networks, 2014
2. Boyd and Vandenberghe, “Convex Optimization”, Cambridge University Press, 2014.
Reference Books
1. SraSurvit, NovozinSabestian, Wright Stephen,” Optimization for Machine learning”,
2013
2. Mykel J. Kochenderfer, Tim A. Wheeler,”Algorithms for Optimization”, MIT Press,
2019
UEC533: COMPUTER AND COMMUNICATION NETWORKS
L T P Cr
3 0 0 3.0
Course Objective: To introduce basic concepts of Data communication with different
models. Enumerate the physical layer, Data Link Layer, Network Layer, Transport Layer
and Application Layer, explanation of the function(s) of each layer. Familiarization with
cryptography and network security.
Syllabus

Overview of Data Communication and Networking: Data communications, Networks,


The Internet, Protocols and standards, Layered tasks, OSI model, TCP /IP protocol
Architecture and its addressing, Data Rate Limits, Circuit switching, Packet Switching,
Message Switching.

Data link layer: Types of errors, Detection, Error correction, Flow and error control, Stop
and wait ARQ, go back n ARQ, Selective repeat ARQ, HDLC, Point to point protocol, PPP
stack, on, IEEE Standards: 802.3 to 802.6 and 802.11, FDDI, Bluetooth; Introduction to
Virtual circuit switching including frame relay, X.25, ATM and Softswitch Architecture;
Telephone networks, DSL technology, Cable modem, SONET/SDH.

Queueing Theory: An Introduction to Queues and Queueing Theory, Basic Queueing


Theory - I (Analysis of M/M/-/- Type Queues), Basic Queueing Theory - II (Departures,
Method of Stages, Batch Arrivals, Burke’s theorem and Network of queues, Little theorem,
M/G/1 Queues, Reservations Systems M/G/1 Queues with Priority

Network layer: Internetworks, Logical Addressing, Subnetting, Routing, ARP, IP, ICMP,
IGMP, IPV6, Unicast routing, Unicast routing protocol, Multicast routing, Multicast routing
protocols.

Transport layer: Process to process delivery, User datagram protocol (UDP), Transmission
control protocol (TCP), Data traffic, Congestion, Congestion control, Quality of service,
Techniques to improve QOS, Integrated services, Differentiated services.

Application layer: Client server model, Socket interface, Name space, Domain name space,
Distribution of name space, DNS in the internet, Resolution, DNS messages, DDNS,
Encapsulation, Electronic mail, File transfer, HTTP, World wide web (WWW), Network
Management System, Cryptography, Network Security, Simple Network management
Protocol (SNMP), Simple Mail Transfer protocol (SMTP)

Course Learning Objectives (CLO)


The students will be able to:
1. Understand the layered architecture of Internet’s reference models: OSI & TCP/IP
and basis of physical layer and media.
2. Acquire knowledge about design issues, framing, error detection and correction,
channel allocation techniques and link layer protocols.
3. Incorporate the data traffic with queueing models.
4. Identify various routing algorithms, elements of transport protocols, congestion
control, QOS, internetworking, IP and IP addressing mechanism.
5. Describe various communication applications like email, web browser,
familiarization with cryptography and network security.
Text Books
1. Ferouzan, Behrouz A., Data Communications and Networking, TATA McGraw Hill
5th Edition, (2017)
2. Tanenbaum, Andrew S., Computer Networks, PHI 5th Edition, (2013).
3. D. Gross and C. Harris, Fundamentals of Queueing Theory, 3rd Edition, Wiley,
1998. (WSE Edition, 2004).
Reference Books
1. Stallings William, Data and Computer Communication, Pearson Education 10th
Edition, (2017).
2. James F. Kurose, Computer networking: A top-down approach, Pearson Education
6th Edition, (2017).
3. Athanasios Papoulis, Probability Random Variables and Stochastic Processes,
McGraw-Hill, 4th Edition, (2002).
UES012: ENGINEERING MATERIALS
L T P Cr
3 1 2 4.5
Course Objective:To provide basic understanding of engineering materials, their structure
and the influence of structure on mechanical, chemical, electrical and magnetic properties.
Syllabus

Structure of solids: Classification of engineering materials, Structure-property relationship


in engineering materials, Crystalline and non-crystalline materials, Miller Indices, Crystal
planes and directions, Determination of crystal structure using X-rays, Inorganic solids,
Silicate structures and their applications. Defects; Point, line and surface defects.

Mechanical properties of materials: Elastic, Anelastic and Viscoelastic behaviour,


Engineering stress and engineering strain relationship, True stress - true strain relationship,
review of mechanical properties, Plastic deformation by twinning and slip, Movement of
dislocations, Critical shear stress, Strengthening mechanism, and Creep.

Equilibrium diagram: Solids solutions and alloys, Gibbs phase rule, Unary and binary
eutectic phase diagram, Examples and applications of phase diagrams like Iron - Iron carbide
phase diagram.

Electrical and magnetic materials: Conducting and resister materials, and their
engineering application; Semiconducting materials, their properties and applications;
Magnetic materials, Soft and hard magnetic materials and applications; Superconductors;
Dielectric materials, their properties and applications. Smart materials: Sensors and
actuators, piezoelectric, magnetostrictive and electrostrictive materials.

Corrosion process: Corrosion, Cause of corrosion, Types of corrosion, Protection against


corrosion.

Materials selection: Overview of properties of engineering materials, Selection of materials


for different engineering applications.
Laboratory Work and Micro-Project:
Note: The micro-project will be assigned to the group(s) of students at the beginning
of the semester. Based on the topic of the project the student will perform any of the
six experiments from the following list:

1. To determine Curie temperature of a ferrite sample and to study temperature


dependence of permeability in the vicinity of Curie temperature.
2. To study cooling curve of a binary alloy.
3. Determination of the elastic modulus and ultimate strength of a given fiber strand.
4. To determine the dielectric constant of a PCB laminate.
5. Detection of flaws using ultrasonic flaw detector (UFD).
6. To determine fiber and void fraction of a glass fiber reinforced composite specimen.
7. To investigate creep of a given wire at room temperature.
8. To estimate the Hall coefficient, carrier concentration and mobility in a
semiconductor crystal.
9. To estimate the band-gap energy of a semiconductor using four probe technique.
10. To measure grain size and study the effect of grain size on hardness of the given
metallic specimens.

Course Learning Objectives (CLO)


The students will be able to:
1. classify engineering materials based on its structure.
2. draw crystallographic planes and directions.
3. distinguish between elastic and plastic behavior of materials.
4. distinguish between isomorphous and eutectic phase diagrams.
5. classify materials based on their electrical and magnetic properties.
6. propose a solution to prevent corrosion.

Text Books
1. W.D. Callister , Materials Science and Engineering; John Wiley & Sons, Singapore,
2002.
2. W.F. Smith, Principles of Materials Science and Engineering: An Introduction; Tata
Mc-Graw Hill, 2008.
3. V. Raghavan, Introduction to Materials Science and Engineering; PHI, Delhi, 2005.

Reference Books
1. S. O. Kasap, Principles of Electronic Engineering Materials; Tata Mc-Graw Hill,
2007.
2. L. H. Van Vlack, Elements of Material Science and Engineering; Thomas Press,
India, 1998.
3. K. G. Budinski, Engineering Materials – Properties and selection, Prentince Hall
India, 1996
UNC302: OBJECT ORIENTED PROGRAMMING PRACTICES
L T P Cr
2 0 2 3.0
Course Objective: To gain understanding of object-oriented programming (OOP)
principles, explore their practical uses, and acquire knowledge of diverse algorithmic
methods and approaches.
Syllabus

Basics of Object Oriented Programming (OOP): Introduction to OOP, Difference


between OOP and procedure oriented Programming, Classes, objects and Methods, Function
overloading
Data Abstraction: Class definition, controlling access to other functions, Different types of
constructors, Destructor, Objects and classes. Polymorphism: Overloading functions and
operators, Runtime polymorphism, overloading new and delete operators.
Inheritance: Derived classes, syntax of derived classes, Access to the base class, multiple
inheritance, Virtual base class, Virtual functions and Polymorphism, Implications of
polymorphic use of classes, virtual destructors.
Input/Output and File handling: Stream I/O in C++, manipulators, Formatted I/O,
Overloading << and >> operators, Templates and Exception Handling: Use of templates,
function templates, class templates.
Laboratory Work:
To implement Programs for various kinds of programming constructs in C++ Language.
Course Learning Objectives (CLO)
The students will be able to:
1. Apply and understand the concepts of classes and objects.
2. Apply and understand the concepts of polymorphism.
3. Apply and understand the concepts of Inheritance.
4. Demonstrate use of templates and exception handling.

Text Books
1. Aho, A.V., Hopcraft, J.E. and Ullman, J.D., Data Structures and Algorithms,
Addison
Wesley (2004).
2. Langsam, Y., Augenstein, M. J. and Tenenbaum, A. M., Data Structures with C and
C++, Prentice Hall of India Private Limited (2000).
3. Tremblay, J.P. and Sorenson, P.G. Data Structures Organization and Architecture
Designing for Performance, Prentice Hall of India Private Limited (2004).
Reference Books
1. Pattric, N., The C++ Complete Reference, McGraw Hill (1982).
2. Larman, Craig, Applying UML and Patterns, Pearson Education (2005).
UEC310: INFORMATION AND COMMUNICATION THEORY
L T P Cr
3 1 0 3.5
Course Objective: To gain knowledge and understand the concepts of probability theory,
random variables, stochastic processes and Information theory. To familiarize the students
with the applications of probabilistic/stochastic techniques/methods in communication
engineering and information theory.
Syllabus

Probability Theory: Review of Probability, Bernoulli Trials, Bernoulli’s Theorem,


Concepts of Random Variables, Distribution and Probability Density Functions, Conditional
Distributions, Binomial Random variables Functions of One Random Variable, its
Distribution, Mean and Variance, Moments, Characteristic Functions; Two Functions of
Two Random Variables, Joint Moments, Joint Characteristic Functions, Conditional
Distributions, Conditional Expected Values, Normality, Center Limit Theorem, and Bayes’
Theorem

Stochastic Processes: Systems with Stochastic Inputs, Power Spectral Analysis of I/O
Signals, Poisson Points, Cyclostationary Processes, Poisson Sum Formula, Ergodicity, Mean
Square Estimation, Markov Chains, and Random-Walk Model

Estimation & Hypothesis Testing: Time and Ensemble Averages, Covariance Functions.
Simple Binary Hypothesis Tests, Decision Criteria, Neyman Pearson Tests, Bayes’ Criteria,
z-Score, and p-Value Test

Information Theory: Introduction, Information measure and entropy, Information source,


Markov source, Adjoint of an information source, Joint and Conditional Information
measure, Joint and conditional information measure of a Markov source, Instantaneous
codes, Kraft-Mcmillan inquality, Shannon first theorem, Coding strategies and Huffman
coding, Introduction to information channels, mutual information and channel capacity,
Shannon second theorem, channel capacity calculations for different channels, Differential
entropy, Rate distortion theory

Statistical Modeling of Noise: Probability Density of a Jointly-Gaussian Random Vector,


Wide-Sense-Stationary (WSS) Processes, Poisson Process Noise, Noise Statistics in Linear
Time-Invariant Systems, Noise Power Spectral Densities, Signal-to-Noise-Ratio in Presence
of AWGN and Interferences.
Course Learning Objectives (CLO)
The students will be able to:
1. apply the probabilistic concepts as well as properties of the random variables
2. perform the spectral analysis of stationary stochastic processes, for the modeling of
real-time desired signals and spurious-signals/noise
3. incorporate the estimation and hypothesis testing principles to find remedial solutions
4. employ information theory and coding concepts, to improve information symbol
transmission rate, and also use it for data compression.
Text Books
1. Athanasios Papoulis, Probability Random Variables and Stochastic Processes,
McGraw-Hill (1984)
2. John N. Daigle, Queueing Theory with Applications to Packet Telecommunication,
Springer (2005)
3. Bernard Sklar, Digital Communications: Fundamentals and Applications, Prentice
Hall (2001)
Reference Books
1. P.Z. Peebles, Probability, Random Variables, and Random Signal Principles,
McGraw-Hill (1980)
2. Dimitri P. Bertsekas, Robert G. Gallager, Data Networks, Prentice-Hall (1987)
3. A. Larson and B.O. Schubert, Stochastic Processes, vol. I and II, Holden-Day (1979)
4. W. Gardener, Stochastic Processes, McGraw Hill IEEE Transactions on Information
Theory (1986)
5. David J. C. Mackay, “Information Theory, Inference and Learning Algorithms”,
Cambridge University Press, 2003
UEC304: ELECTRONIC DEVICES AND CIRCUITS
L T P Cr
3 1 2 4.5
Course Objective: To gain knowledge and understand the concepts of various electronic e
devices used in the electronic circuits and their working.

Syllabus
Semiconductor Devices: Energy bands in solids (Metals, Semiconductor, Insulators),
Intrinsic, Extrinsic semiconductors, Drift current, Diffusion Currents, p- n junction diode:
Ideal diode, V-I characteristics of diode, diode switching characteristics, Operation and
characteristics of Zener diode, Schottky Barrier diode, Tunnel diode, Gunn diode, IMPATT
diode, PIN diode, Photo Diode, LED, BJT and MOSFET.
Transistor Biasing and Thermal Stabilization: Operation of BJT and its current
components, Transistor circuit configuration: CB, CE, CC (Relationship between α, β, γ),
Input-output characteristics, Concept of Q point and load line, biasing circuits and stability
criterion, DC analysis.
Transistor at Low and High Frequencies: Small signal equivalent parameters, Low
frequency models of BJT and MOSFET (π and T), Internal capacitances and high frequency
equivalent hybrid models for BJT and MOSFET, variation of hybrid parameters, h-parameter
model of CE, CB and CC configurations of BJT.
Transistor Amplifiers: Low and high frequency responses of single stage amplifier,
multistage amplifiers: types of couplings, two stage RC-coupled amplifier, Low-frequency
response of two stage RC-coupled amplifier, Effect of an emitter Bypass capacitor on low-
frequency response and Tuned amplifier, Power Amplifiers: Class A, B, AB, Push pull &
Class C amplifiers, Feedback Amplifiers: feedback concept, Voltage-series feedback,
Current-series feedback, Current-shunt feedback, Voltage-shunt feedback
Oscillators & Wave shaping circuits: Types of Oscillators, Oscillator Operation, RC
phase-shift oscillator, Hartley oscillator, Colpitts oscillator and Wien Bridge oscillator
Multi-vibratotrs (astable, mono-stable, Bi-Stable), High pass and low pass filters using R-C
Circuits & their responses.
Laboratory Work: Low and high frequency responses of single stage amplifiers based on
BJT and MOSFET, Frequency response analysis of RC coupled amplifier, Feedback
amplifier. Hartley and Colpitts Oscillator. RC Phase shift oscillator. Study of Multi-vibrators
(Astable, Mono-stable, Bi-stable Multi-vibrator).

Course Learning Objectives (CLO)


The students will be able to:
1. Demonstrate the use of semiconductor diodes in various applications.
2. Determine operating point and various stability factors of transistor.
3. Analyse low and high frequency transistor model.
4. Analyse the performance of multistage, feedback and power amplifiers.
5. Design Oscillator and multi-vibrator circuits and analyse its performance.
Text Books
1. Jacob Millman, Christos Halkias &, Chetan Parikh, “Millman's Integrated
Electronics - Analog and Digital Circuit and Systems” 2nd Edition.
2. Adel S. Sedra & K. C. Smith, “MicroElectronic Circuits Theory and Application”
Fifth Edition.
Reference Books
1. Robert L. Boylestad & L. Nashelsky, “Electronic Devices and Circuit Theory”
Eleventh Edition.
2. Jacob Millman, Herbert Taub “Pulse, Digital, and Switching Waveforms: Devices
and Circuits for Their Generation and Processing”5th Edition
3. Jacob Millman , Christos Halkias , Satyabrata Jit , “Electronic Devices & Circuits”
4th Edition.
4. Simon M. Sze, Kwok K. Ng “Physics of Semiconductor Devices”, 3rd Edition.
UTA016: ENGINEERING DESIGN PROJECT-I
L T P Cr
1 0 2 3.0
Course Objective:To develop design skills according to a Conceive-Design-Implement-
Operate (CDIO) compliant methodology. To apply engineering sciences through learning-
by- doing project work. To provide a framework to encourage creativity and innovation.
To develop teamwork and communication skills through group-based activity. To foster self-
directed learning and critical evaluation. To provide a basis for the technical aspects of the
project a small number of lectures are incorporated into the module. As the students would
have received little in the way of formal engineering instruction at this early stage in the
degree course, the level of the lectures is to be introductory with an emphasis on the physical
aspects of the subject matter as applied to the ‘Mangonel’ project. The lecture series include
subject areas such as Materials, Structures, Dynamics and Digital Electronics delivered by
experts in the field.
This module is delivered using a combination of introductory lectures and participation by
the students in 15 “activities”. The activities are executed to support the syllabus of the
course and might take place in specialised laboratories or on the open ground used for firing
the Mangonel. Students work in groups throughout the semester to encourage teamwork,
cooperation and to avail of the different skills of its members. In the end the students work
in sub-groups to do the Mangonel throwing arm redesign project. They assemble and
operate a Mangonel, based on the lectures and tutorials assignments of mechanical
engineering they experiment with the working, critically analyse the effect of design
changes and implement the final project in a competition. Presentation of the group
assembly, redesign and individual reflection of the project is assessed in the end.
Syllabus

Breakup of lecture details to be taken up by


MED:
Lec No. Topic Contents
Lec 1 Introduction The Mangonel Project. History. Spreadsheet.
Lec 2 PROJECTILE no DRAG, Design spread sheet simulator for it.
MOTION
Lec 3 PROJECTILE with DRAG, Design spread sheet simulator for
MOTION it.
Lec 4 STRUCTURES STATIC LOADS
FAILURE
Lec 5 STRUCTURES DYNAMIC LOADS
FAILURE
Lec 6 REDESIGNING THE Design constraints and limitations of
MANGONEL materials for redesigning the Mangonel for
competition as a group.
Lec 7 MANUFACTURING Manufacturing and assembling the Mangonel.
Lec 8 SIMULATION IN Simulation as an Analysis Tool in Engineering
ENGINEERING Design.
DESIGN
Lec 9 ROLE OF The Role of Modelling in Engineering Design.
MODELLING &
PROTOTYPING
Breakup of lecture details to be taken up by ECED:
Lec Topic Contents
No.
Lec 1- Digital Prototype, Architecture, Using the Integrated Development
5 Electronics Environment (IDE) to Prepare an Arduino Sketch, structuring
an Arduino Program, Using Simple Primitive Types
(Variables), Simple programming examples. Definition of a
sensor and actuator.
Laboratory Work
Associated Laboratory/Project Program: T- Mechanical Tutorial, L- Electronics
Laboratory, W- Mechanical Workshop of “Mangonel” assembly, redesign, operation
and reflection.

Title for the weekly work in 15 weeks Code


Using a spread sheet to develop a simulator T
1
Dynamics of projectile launched by a Mangonel - No Drag T
2
Dynamics of projectile launched by a Mangonel - With Drag T
3
Design against failure under static actions T
4
Design against failure under dynamic actions T
5
Electronics hardware and Arduino controller L
1
Electronics hardware and Arduino controller L
2
Programming the Arduino Controller L
3
Programming the Arduino Controller L
4
Final project of sensors, electronics hardware and programmed Arduino
controller based measurement of angular velocity of the “Mangonel” L
throwing arm. 5
Assembly of the Mangonel by group W
1
Assembly of the Mangonel by group W
2
Innovative redesign of the Mangonel and its testing by group W
3
Innovative redesign of the Mangonel and its testing by group W
4
Final inter group competition to assess best redesign and understanding
of the W
5
“Mangonel”.

Project: The Project will facilitate the design, construction and analysis of a
“Mangonel”. In addition to some introductory lectures, the content of the students’ work
during the semester will consist of:
1. the assembly of a Mangonel from a Bill Of Materials (BOM), detailed
engineering drawings of parts, assembly instructions, and few prefabricated parts ;
2. the development of a software tool to allow the trajectory of a “missile” to be studied
as a function of various operating parameters in conditions of no-drag and drag due
to air;
3. a structural analysis of certain key components of the Mangonel for static and dynamic
stresses using values of material properties which will be experimentally determined;
4. the development of a micro-electronic system to allow the angular velocity of
the throwing arm to be determined;
5. testing the Mangonel;
6. redesigning the throwing arm of the Mangonel to optimise for distance without
compromising its structural integrity;
7. an inter-group competition at the end of the semester with evaluation of the
group redesign strategies.
Course Learning Objectives (CLO)
1. simulate trajectories of a mass with and without aerodynamic drag using a
spreadsheet based software tool to allow trajectories be optimized;
2. perform a test to acquire an engineering material property of strength in bending and
3. analyze the throwing arm of the “Mangonel” under conditions of static and dynamic
loading;
4. develop and test software code to process sensor data;
5. design, construct and test an electronic hardware solution to process sensor data;
6. construct and operate a Roman catapult “Mangonel” using tools, materials
and assembly instructions, in a group, for a competition;
7. operate and evaluate the innovative redesign of elements of the “Mangonel”
for functional and structural performance
Text Books
1. Michael Mc Roberts, Beginning Arduino, Technology in action publications.
2. Alan G. Smith, Introduction to Arduino: A piece of cake, Create Space Independent
Publishing Platform (2011)
Reference Books
1. John Boxall, Arduino Workshop - A Hands-On Introduction with 65 Projects,
No Starch Press (2013)
UNC401: DATA STRUCTURES AND ALGORITHMS
L T P Cr
3 0 2 4.0
Course Objective: to become familiar with different types of data structures and their
applications and learn different types of algorithmic techniques and strategies.
Syllabus

Linear data structures: arrays, records, linked lists, strategies for choosing the appropriate
data structure, abstract data types and their implementation: stacks, queues, priority queues.

Basic Analysis: Differences among best, expected, and worst case behaviors of an algorithm,
Asymptotic analysis, Big O notation: formal definition and use, big omega and big theta
notation, Time and space trade-offs in algorithms, Recurrence relations, Analysis of iterative
and recursive algorithms.

Searching and Sorting: Linear Search, Binary Search, Bubble Sort, Selection Sort, Insertion
Sort, Shell Sort, Quick Sort, Heap Sort, Merge Sort.

Algorithmic Strategies with examples and problem solving: Brute-force algorithms with
examples, Greedy algorithms with examples, Divide-and-conquer algorithms with examples,
Recursive backtracking, Dynamic Programming with examples, Branch-and-bound with
examples, Heuristics, Reduction: transform-and-conquer with examples.

Non-Linear Data Structures and Sorting Algorithms: Hash tables, including strategies
for avoiding and resolving collisions, Binary search trees, Common operations on binary
search trees such as select min, max, insert, delete, iterate over tree, Graphs and graph
algorithms, Representations of graphs, Depth- and breadth-first traversals, Heaps, Shortest-
path algorithms (Dijkstra and Floyd), Minimum spanning tree (Prim and Kruskal).

Laboratory Work: Implementation of Arrays, Recursion, Stacks, Queues, Lists, Binary


trees, Sorting techniques, Searching techniques. Implementation of all the algorithmic
techniques.

Course Learning Objectives (CLO)


1. Implement the basic data structures and solve problems using fundamental
algorithms.
2. Implement various search and sorting techniques.
3. Analyze the complexity of algorithms, to provide justification for that selection, and
to implement the algorithm in a particular context.
4. Analyze, evaluate and choose appropriate data structure and algorithmic technique to
solve real-world problems.
Text Books
1. Corman, Leiserson & Rivest, Introduction to Algorithms, MIT Press, 3rd Ed., (2009)
2. Narasimha Karumanchi, Data Structures and Algorithms Made Easy”, 2nd Ed., (2014)

Reference Books
1. Sahni, Sartaj, Data Structures, Algorithms and Applications in C++, Universities
Press, 2nd ed., (2005)
UMA033: NUMERICAL AND STATISTICAL METHODS

L T P Cr
3 0 2 4
Course Objective:The main objective of this course is to understand and implement various
numerical and statistical methods to solve engineering, physical and real life problems.
Syllabus
Basic of Errors: Floating-point representation, rounding and chopping errors.
Non-Linear Equations: Bisection, fixed point iteration, Newton – Raphson’s method for
simple and multiple roots and order of convergence.
Linear Systems and Eigen-Values: Gauss elimination method using partial pivoting,
Gauss--Seidel method, Rayleigh’s power method for eigen-values and eigen-vectors.
Interpolation and Approximations: Newton’s forward and backward differences,
Lagrange (with error analysis), Newton’s divided difference interpolation formulas.
Numerical Integration: Newton-Cotes quadrature formulae (Trapezoidal and Simpson's
rules) and their error analysis, Gauss-Legendre quadrature formulae.
Differential Equations: Solution of initial value problems using Euler's, Modified Euler’s
and Runge-Kutta methods (fourth-order).
Curve Fitting: Curve fitting by the method of least squares- fitting of straight lines, second
degree parabolas and more general curves.
Probability Distribution: Mathematical expectations, Definition of probability distribution
(Probability Mass Function and Probability Density Function), Poisson, Geometric,
Binomial, Uniform and Normal distributions.
Correlation and Regression: Bivariate distribution, correlation coefficients, regression
lines, formula for regressioncoefficients.
Laboratory Work:Lab experiments will be set in consonance with materials covered in the
theory using MATLAB.
Course Learning Objectives (CLO)
The students will be able to:
1. Learn how to obtain numerical solution of nonlinear equations using bisection,
Newton and fixed-point iteration methods.
2. Solve system of linear equations numerically using direct and iterative methods.
3. Analyze the correlated data using the least square and regression curves.
4. Solve integration and initial value problems numerically.
5. Solve real life problems using various probability distributions.
6. Approximate the data and functions using interpolating polynomials.
Text Books
1. K. Atkinson and W. Han, Elementary Numerical Analysis, 3rd edition, John Wiley &
Sons, 2004.
2. Brian Bradie, A friendly Introduction to Numerical Analysis, prentice Hall, 2007.
3. Burden L. R., Faires D. J. and Burden A.M., Numerical Analysis, Brooks Cole, 8th
edition, 2004.
4. Richards A. Johnson, Probability and Statistics for Engineers, 8th Edition, PHI
Learning, 2011.
5. Meyer, P.L., Introductory Probability and Statistical applications, 2nd edition,
Oxford, 1970
Reference Books
1. Curtis, F. Gerald and Patrick O. Wheatley, Applied Numerical Analysis, 7th edition
Pearson Education, 2003.
2. Walpole, Ronald E., Myers, Raymond H. Myers, and Sharon L. Myers, Probability
and Statistics forEngineers and Scientists, 8th edition Pearson Education, 2007.
3. Steven C. Chapra, Applied Numerical Methods with MATLAB for Engineers and
Scientists, McGraw-Hill Publishing; 2nd edition, 2007.
UEC612: DIGITAL SYSTEM DESIGN
L T P Cr
3 1 2 4.5
Course Objective: To familiarize the student with the analysis, design and evaluation of
digital systems of medium complexity that are based on SSI, MSI and Programmable logic
devices. Also, to familiarize the students with the issues in the design of iterative networks,
timing analysis of synchronous and asynchronous systems.

Syllabus

Binary Codes: Review of special binary codes, Error detection and correction codes.
Combinational Circuits: Q. M. Method, Variable Map Method, Ripple carry adder, BCD
adder, High speed adder, Subtractor, Code conversion, Magnitude comparators,
Applications of Encoders, Decoders, MUX, DEMUX, Implementations using ROM, PLA,
PAL. Standard ICs and their applications. Using combinational modules to design digital
systems, Iterative networks.

Sequential Circuits: Various types of latches and flip-flops and their conversions, Universal
Shift Registers, Counters – Ring, Johnson, Design of Counters, Timing issues, Setup and
hold times, operating frequency limitations, Static Timing Analysis, Standard ICs for their
applications, Finite State Machines – Moore and Mealy, Design of Synchronous and
Asynchronous sequential circuits, Races and hazards, hazard free design.

Logic Circuits: DTL, TTL, MOS, CMOS logic families their comparison, Detailed study
of TTL & CMOS logic families and their characteristics i.e. Fan-in, Fan-out, Unit load,
Propagation delay, Power dissipation, Current & voltage parameters, Tristate Logic,
Interfacing of TTL & CMOS logic families, reading and analyzing Datasheets, Performance
estimation of digital systems.

Laboratory Work: To study standard ICs and their usage, To study latches and Flip-flops,
Design of registers and asynchronous/synchronous up/down counters, Variable modulus
counters, Design of Finite State Machines, Study of timing waveforms, Usage of IC tester.

Course Learning Objectives (CLO)


The students will be able to:
1. Perform Logic Minimization for single/multiple output function(s).
2. Generate multiple digital solutions to a verbally described problem.
3. Evaluate the performance of a given Digital circuit/system.
4. Draw the timing diagrams for the identified signals in a digital circuit.
5. Assess the performance of a given digital circuit with Mealy and Moore
configurations.
6. Perform static timing analysis of the digital circuits/systems.
7. Compare the performance of a given digital circuits/systems with respect to their
speed, power consumption, number of ICs, and cost.

Text Books
1. Fletcher, W.I., Engineering Approach to Digital Design, Prentice Hall of India 4 th
ed., 2007
2. Wakerly, J.F., Digital Design Principles and Practices, Prentice Hall of India, 5th ed.,
2013

Reference Books
1. Givone D. D., Digital Principles and Design, Tata McGraw Hill 2nded., (2007)
2. Tocci, R.J., Digital Systems: Principles and Applications, Prentice-Hall 10th ed.,
(2006)
3. Mano, M.M. and Clitti M. D., Digital Design, Prentice Hall 3rd ed., (2001)
UEC404: SIGNALS AND SYSTEMS
L T P Cr
3 1 2 4.5
Course Objective: The aim of this subject is to develop analytical capability of students, by
which they would be able to handle signal processing related problems and projects. The
knowledge of various transforms will help students to work in multi-disciplinary fields of
engineering in group activities.

Syllabus

Representation of Signals and Systems: Signals, Basic Continuous and discrete Time
signals and systems, Energy and power signals, System modelling concepts, Linear time
invariant systems, Representation of signals in terms of impulses, Discrete time LTI systems
continuous time LTI systems, Properties of LTI systems, Systems described by differential
and difference equations, Sampling theorem, Quantization.

Fourier Analysis: Continuous and discrete time Fourier series, Trigonometric and
exponential Fourier series, Properties of Fourier series, Continuous and discrete time Fourier
transforms and its properties, Analysis of discrete time signals and systems, Linear
Convolution, Circular Convolution, Correlation, Autocorrelation.

Z-Transform: Definition of Z-transform and Properties of Z-transform, Inverse Z-transform


- Power series, partial fraction expansion, residue method and their comparison, Relation
between Z.T. and F.T, Discrete time convolution, Time domain and frequency domain
analysis, Solution of difference equation, Applications of Z-transforms.

Introduction to Fast Fourier Transforms: Discrete Fourier transform, Properties of DFT,


Fast Fourier transforms, Divide and Conquer Approach, Decimation in time and decimation
in frequency, Radix-n FFT algorithms, Comparison of computational complexity.

Laboratory work:
Basics of MATLAB, Signal generation, Properties of signals and systems, Linear and
Circular convolution, Correlation, Z-transform, DFT / IDFT, FFT algorithms using
MATLAB.
Course Learning Objectives (CLO)
1. Analyze the properties of continuous and discrete time signals and systems.
2. Represent signals and systems in the frequency domain using Fourier tools.
3. Apply Z-transform to analyze discrete time signals and system.
4. Obtain the fast Fourier transform of a sequence and measure its computational
efficiency.
Text Books
1. Oppenheim, A.V. and Willsky, A.S., Signal & Systems, Prentice Hall of India
(1997).
2. Kani, A.N. Signals and Systems, McGraw Hill Higher Education,(2011)
3. Proakis, J.G. and Manolakis, D.G., Digital Signal Processing Principles Algorithm
& Applications, Prentice Hall, (2007).
Reference Books
1. Roberts, M.J., Signals and Systems: Analysis using Transform Methods and
MATLAB, Tata McGraw-Hill,(2012)
2. Lathi, B.P., Signal Processing and Linear Systems, Berkeley Cambridge Press, 1998
UEC513: EMBEDDED SYSTEMS
L T P Cr
3 0 2 4.0
Course Objective: The objective of this course is to equip students with the necessary
fundamental knowledge and skills that enable them to design basic embedded systems. It
covers architecture, programming of ARM processors and its interfacing with peripheral
devices.
Syllabus

Introduction to Embedded Systems: Definition, Embedded Systems Vs General


Computing Systems, Classification of Embedded Systems, Major application areas. General
purpose processor architecture and organization, Von-Neumann and Harvard architectures,
CISC and RISC architectures, Big and Little endian processors, Processor design trade-offs,
Processor cores: soft and hard.

Introduction to ARM Processor: The ARM design philosophy, ARM core data flow
model, Architecture, Register set, ARM7TDMI Interface signals, General Purpose Input
Output Registers, Memory Interface, Bus Cycle types, Pipeline, ARM processors family,
Operational Modes, Instruction Format, Data forwarding.

Programming based on ARM7TDMI: ARM Instruction set, condition codes, Addressing


modes, Interrupts, Exceptions and Vector Table. Assembly Language Programming, Thumb
state, Thumb Programmers model, Thumb Applications, ARM coprocessor interface and
Instructions.

ARM Tools and Interfacing of Peripherals: ARM Development Environment, Arm


Procedure Call Standard (APCS), Example C/C++ programs, Embedded software
development, Image structure, linker inputs and outputs, Protocols (I2C, SPI), Memory
Protection Unit (MPU). Physical Vs Virtual Memory, Paging, Segmentation. The Advanced
Microcontroller Bus Architecture (AMBA), DMA, Peripherals, Interfacing of peripherals
with ARM.
Laboratory Work: Introduction to Keil Software, Introduction to ARM processor kit,
Programming examples of ARM processors. Interfacing of LED, Seven Segment Display,
Stepper Motor, LCD with ARM7TDMI processor.
Course Learning Objectives (CLO)
The students will be able to:
1. Explain the embedded system, its processor architecture and distinguish it from
general computing systems.
2. Describe ARM processor internal architecture, assembly instructions, their format
and Develop ARM processor-based assembly language program for a given
statement.
3. Describe how thumb mode operations are designed and various coprocessors are
interfaced in an embedded system.
4. Interface various hardware peripherals in embedded systems.
5. Recognize issues to be handled in any processor software tool chain for embedded
system development especially using C/C++.

Text Books
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Naraig Manjikian, “Computer
organization and embedded systems, Sixth Edition, McGraw Hill (2012).
2. ARM System on Chip Architecture–Steve Furber–2nd Ed., 2000, Addison Wesley
Professional (2000).
Reference Books
1. Introduction to Embedded Systems, Shibu K V, McGraw-Hill
2. 2.Embedded Systems Architecture Programming and Design by Raj Kamal, 2nd
edition, Tata MCGraw-Hill.
3. Andrew N. Sloss, ARM System Developer’s Guide Designing and Optimizing
System Software, Morgan Kaufman Publication (2010)
UTA024 - ENGINEERING DESIGN PROJECT-II
(Including 2 self effort hours)
L T P Cr
1 0 4 3.0
Course Objective:The project will introduce students to the challenge of electronic systems
design & integration. The project is an example of ‘hardware and software co-design’ and
the scale of the task is such that it will require teamwork as a coordinated effort.
Syllabus
Hardware overview of Arduino:
● Introduction to Arduino Board: Technical specifications, accessories and
applications.
● Introduction to Eagle (PCB layout tool) software.

Sensors and selection criterion:


● Concepts of sensors, their technical specifications, selection criterion, working
principle and applications such as IR sensors, ultrasonic sensors.

Active and passive components:


● Familiarization with hardware components, input and output devices, their technical
specifications, selection criterion, working principle and applications such as-
○ Active and passive components: Transistor (MOSFET), diode (LED), LCD,
potentiometer, capacitors, DC motor, Breadboard, general PCB etc.
○ Instruments: CRO, multimeter, Logic probe, solder iron, desolder iron
○ Serial communication: Concept of RS232 communication , Xbee
● Introduction of ATtiny microcontroller based PWM circuit programming.

Programming of Arduino:
● Introduction to Arduino: Setting up the programming environment and basic
introduction to the Arduino micro-controller.
● Programming Concepts: Understanding and Using Variables, If-Else Statement,
Comparison Operators and Conditions, For Loop Iteration, Arrays, Switch Case
Statement and Using a Keyboard for Data Collection, While Statement, Using
Buttons, Reading Analog and Digital Pins, Serial Port Communication, Introduction
programming of different type of sensors and communication modules, DC Motors
controlling.

Basics of C#:
● Introduction: MS.NET Framework Introduction, Visual Studio Overview and
Installation
● Programming Basics: Console programming, Variables and Expressions, Arithmetic
Operators, Relational Operators, Logical Operators, Bitwise Operators, Assignment
Operators, Expressions, Control Structures, Characters, Strings, String Input, serial
port communication: Read and write data using serial port.
● Software code optimization, software version control.
Laboratory Work:
Schematic circuit drawing and PCB layout design on CAD tools, implementing hardware
module of IR sensor, Transmitter and Receiver circuit on PCB.
Bronze Challenge: Single buggy around track twice in clockwise direction, under full
supervisory control. Able to detect an obstacle. Parks safely. Able to communicate the
state of the track and buggy at each gantry stop to the console.
Silver Challenge: Two buggies, both one loop around, track in opposite directions under
full supervisory control. Able to detect an obstacle. Both park safely. Able to
communicate the state of the track and buggy at each gantry stop with the console.
Gold Challenge: Same as silver but users must be able to enter the number of loops
around the track beforehand to make the code generalized.
Course Learning Objectives (CLO)
The students will be able to:
1. Recognize issues to be addressed in a combined hardware and software system
design.
2. Draw the schematic diagram of an electronic circuit and design its PCB layout using
CAD Tools.
3. Apply hands-on experience in electronic circuit implementation and its testing.
4. Demonstrate programming skills by integrating coding, optimization and debugging
for different challenges.
5. Develop group working, including task sub-division and integration of individual
contributions from the team.
Text Books
1. Michael McRoberts, Beginning Arduino, Technology in action publications, 2nd
Edition.
2. Alan G. Smith, Introduction to Arduino: A piece of cake, CreateSpace Independent
Publishing Platform (2011).
Reference Books
1. John Boxall, Arduino Workshop - a Hands-On Introduction with 65 Projects, No
Starch Press; 1st edition (2013).

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy