Click on Subject/Paper under Semester to enter.

Random Process and Electromagnetic

Professional English Linear Algebra -
Professional English - - II - HS3252 Fields - EC3452
MA3355
I - HS3152
C Programming and Networks and
Statistics and
Data Structures - Security - EC3401
Matrices and Calculus Numerical Methods -
CS3353
- MA3151 MA3251
1st Semester

3rd Semester

Linear Integrated

4th Semester
2nd Semester

Signals and Systems - Circuits - EC3451

Engineering Physics - Engineering Graphics
- GE3251 EC3354
PH3151 Digital Signal
Processing - EC3492
Physics for Electronic Devices and
Engineering Chemistry Electronics Engg - Circuits - EC3353
- CY3151 PH3254 Communication
Systems - EC3491
Control Systems -
Basic Electrical & EC3351
Problem Solving and Instru Engg - BE3254 Environmental
Python Programming - Sciences and
GE3151 Digital Systems Design Sustainability -
Circuit Analysis - - EC3352 GE3451
EC3251

Wireless
Communication -
EC3501 Embedded Systems
and IOT Design -
ET3491
VLSI and Chip Design
5th Semester

- EC3552 Human Values and

7th Semester

8th Semester
6th Semester

Artificial Intelligence Ethics - GE3791

and Machine Learning
Transmission Lines and - CS3491
RF Systems - EC3551 Open Elective 2 Project Work /
Intership
Open Elective-1 Open Elective 3
Elective 1
Elective-4
Open Elective 4
Elective 2
Elective-5
Elective 3
Elective-6
 All ECE Engg Subjects - [ B.E., M.E., ] (Click on Subjects to enter)
Circuit Analysis Digital Electronics Communication Theory
Basic Electrical and Electrical Engineering and Principles of Digital
Instrumentation Engineering Instrumentation Signal Processing
Electronic Devices Linear Integrated Circuits Signals and Systems
Electronic Circuits I Electronic Circuits II Digital Communication
Transmission Lines and Wave Control System Engineering Microprocessors and
Guides Microcontrollers
Computer Architecture Computer Networks Operating Systems
RF and Microwave Engineering Medical Electronics VLSI Design
Optical Communication and Embedded and Real Time Cryptography and
Networks Systems Network Security
Probability and Random Transforms and Partial Physics for Electronics
Processes Differential Equations Engineering
Engineering Physics Engineering Chemistry Engineering Graphics
Problem Solving and Python Object Oriented Programming Environmental Science
Programming and Data Structures and Engineering
Principles of Management Technical English Total Quality
Management
Professional Ethics in Engineering Mathematics I Engineering Mathematics
Engineering II
 www.BrainKart.com

UNIT I PROBLEM SOLVING

Introduction to AI - AI Applications - Problem solving agents – search algorithms –
uninformed search strategies – Heuristic search strategies – Local search and optimization
problems – adversarial search – constraint satisfaction problems (CSP)
Part A
1. What is Artificial Intelligence?(K1)
2. What is an agent?(K1)
3. What are the different types of agents? (K1)
4. Define rational agent. (K1)
5. List down the characteristics of intelligent agent.(K1)
6. What are various applications of AI? or What can AI do today? (K3)
7. Are reflex actions (such as flinching from a hot stove) rational? Are they
intelligent?
8. Is AI a science, or is it engineering? Or neither or both? Explain.
9. What are the various agent programs in intelligent systems? (K1)
10. Define the problem solving agent. (K1)
11. Define the terms goal formulation and problem formulation. (K1)
12. List the steps involved in simple problem solving agent. (K1)
13. What are the components of well-defined problems? (or)
What are the four components to define a problem? Define them?
14. Differentiate toy problems and real world problems? (K2)
15. Give example for real world end toy problems.
(K3)
15. How will you measure the problem-solving performance? (K1)
16. What is the application of BFS? (K1)
17. State on which basis search algorithms are chosen? (K4)
18. Evaluate performance of problem-solving method based on depth-first search
algorithm? (K4)
19. List some of the uninformed search techniques. (K1)
20. What is the power of heuristic search? (or) Why does one go for heuristics
search? (K1)
21. What are the advantages of heuristic function? (K4)

22. State the reason when hill climbing often gets stuck? (K2)

23. When a heuristic function h is said to be admissible? Give an admissible

heuristic function for TSP? (K4)
24. What do you mean by local maxima with respect to search technique? (K3)
25. How can we avoid ridge and plateau in hill climbing? (K3)
26. Differentiate Blind Search and Heuristic Search. (K2)
27. What is CSP? (K1)
28. How can minimax also be extended for game of chance? (K1)
Part B
3

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com

1. Enumerate Classical “Water jug Problem”. Describe the state space for this
problem and also give the solution. (K4)
2. How to define a problem as state space search? Discuss it with the help of an
example(K1)
3. Solve the given problem. Describe the operators involved in it. (K2)
Consider a Water Jug Problem : You are given two jugs, a 4-gallon one and
a 3-gallon one. Neither has any measuring markers on it. There is a pump
that can be used to fill the jugs with water. How can you get exactly 2 gallons
of water into the 4-gallon jug ? Explicit Assumptions: A jug can be filled
from the pump, water can be poured out of a jug onto the ground, water can
be poured from one jug to another and that there are no other measuring
devices available.
4. Define the following problems. What types of control strategy is used in the
following problem. (K3)
i. The Tower of Hanoi
ii.Crypto-arithmetic
iii.The Missionaries and cannibals problems
iv.8-puzzle problem
5. Discuss uninformed search methods with examples. (K6)
6. Give an example of a problem for which breadth first search would work
better than depth first search. (K1)
7. Explain the algorithm for steepest hill climbing(K5)
8. Explain the A* search and give the proof of optimality of A*(K5)
9. Explain AO* algorithm with a suitable example. State the limitations in the
algorithm? (K5)
10. Explain the nature of heuristics with example. What is the effect of heuristics
accuracy? (K5)
11. Explain the various types of hill climbing search techniques. (K2)
12. Discuss about constraint satisfaction problem with a algorithm for solving a
crypt arithmetic Problem. (K3)
13. Solve the following Crypt arithmetic problem using constraints satisfaction
search procedure. (K2)
CROSS
+ROADS
------------
DANGER
----------------

14. Explain alpha-beta pruning algorithm and the Minmax game playing
algorithm with example? (K5)
15. Solve the given problem. Describe the operators involved in it. (K3)
Consider a water jug problem: You are given two jugs, a 4-gallon one and a
4

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com

3-gallon one. Neither have any measuring Markers on it. There is a pump
that can be used to fill the jug with water. How can you get exactly 2 gallons
of water into the 4 gallon jug? Explicit Assumptions: A jug can be filled from
the pump, water can be poured out of a jug onto the ground, water can be
poured from one jug to another and that there are no other measuring
devices available.

UNIT II PROBABILISTIC REASONING

Acting under uncertainty – Bayesian inference – naïve bayes models. Probabilistic
reasoning – Bayesian networks – exact inference in BN – approximate inference in BN –
causal networks.

Part A
1. Why does uncertainty arise? (K1)
.
2. Differentiate uncertainty with ignorance. (K3)
3. What is the need for probability theory in uncertainty? (K1)
4. What is the need for utility theory in uncertainty? (K1)
5. Define principle of maximum expected utility (MEU)? (K2)
6. Mention the needs of probabilistic reasoning in AI. (K2)
7. What does the full joint probability distribution specify? (K4)
8. State Bayes' Theorem in Artificial Intelligence.
9. Given that P(A)=0.3,P(A|B)=0.4 and P(B)=0.5, Compute P(B|A).
10. What is Bayesian Belief Network? (K3)
Part B

1. How to get the exact inference form Bayesian network? (K1)

2. Explain variable elimination algorithm for answering queries on Bayesian
networks? (K4)
3. Define uncertain knowledge, prior probability and conditional probability.
State the Bayes’ theorem. How it is useful for decision making under
uncertainty? Explain belief networks briefly? (K1)
4. Explain the method of handling approximate inference in Bayesian networks.
(K1)
5. What is Bayes’ rule? Explain how Bayes’ rule can be applied to tackle
uncertain Knowledge. (K1)
6. Discuss about Bayesian Theory and Bayesian network. (K6)
7. Explain how does Bayesian statistics provide reasoning under various kinds
of uncertainty? (K4)
8. How to get the approximate inference from Bayesian network. (K1)
9. Construct a Bayesian Network and define the necessary CPTs for the given
scenario. We have a bag of three biased coins a,b and c with probabilities of
coming up heads of 20%, 60% and 80% respectively. One coin is drawn
randomly from the bag (with equal likelihood of drawing each of the three
coins) and then the coin is flipped three times to generate the outcomes X1,
X2 and X3. (K6)
5

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com

a. Draw a Bayesian network corresponding to this setup and define the

relevant CPTs.
b. Calculate which coin is most likely to have been drawn if the flips come
up HHT
10. Consider the following set of propositionsPatient has spots (K1)
Patient has measles
Patient has high fever
Patient has Rocky mountain spotted fever.
Patient has previously been inoculated against measles.
Patient was recently bitten by a tick
Patient has an allergy.
a) Create a network that defines the casual connections among these nodes.
b) Make it a Bayesian network by constructing the necessary conditional
probability matrix.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com

UNIT III SUPERVISED LEARNING

Introduction to machine learning – Linear Regression Models: Least squares, single
& multiple variables, Bayesian linear regression, gradient descent, Linear Classification
Models: Discriminant function – Probabilistic discriminative model - Logistic regression,
Probabilistic generative model – Naive Bayes, Maximum margin classifier – Support vector
machine, Decision Tree, Random forests.
PART - A
1. What is Machine Learning? (K1)
2. Mention the difference between Data Mining and Machine learning? (K4)
3. What is ‘Overfitting’ in Machine learning? (K1)
4. Why overfitting happens? (K1)
5. How can you avoid overfitting? (K2)
6. What are the five popular algorithms of Machine Learning? (K1)

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com

7. What are the different Algorithm techniques in Machine Learning? (K4)

8. What are the three stages to build the hypotheses or model in machinelearning?
(K2)
9. What is the standard approach to supervised learning? (K1)
10. What is ‘Training set’ and ‘Test set’? (K4)
11. What is the difference between artificial learning and machine learning? (K4)
12. What are the advantages of Naive Bayes? (K3)
13. What is the main key difference between supervised and unsupervisedmachine
learning? (K4)
14. What is a Linear Regression? (K1)
15. What are the disadvantages of the linear regression model? (K2)
16. What is the difference between classification and regression? (K4)
17. What is the difference between stochastic gradient descent (SGD) and gradient
descent (GD)? (K4)
18. What are the different types of least squares? (K6)
19. What is the difference between least squares regression and multiple regression?
(K4)
20. What is the principle of least squares? (K3)
21. What are some advantages to using Bayesian linear regression? (K5)
22. What Is Bayesian Linear Regression? (K1)
23. What are the advantages of Bayesian Regression? (K1)
24. What are the disadvantages of Bayesian Regression? (K4)
25. What are types of classification models? (K3)
26. Why is random forest better than SVM? (K1)
27. Which is better linear regression or random forest? (K3)
28. Which is better linear or tree based models? (K4)
29. Is linear discriminant analysis classification or regression? (K5)
30. What is probabilistic discriminative model? (K1)
31. What is SVM? (K1)
32. What is Decision tree? (K1)
33. What is Random forest? (K1)
34. What is Decision Tree Classification? (K5)
35. What Is Pruning in Decision Trees, and How Is It Done? (K3)
36. Do you think 50 small decision trees are better than a large one? Why? (K5)
37. You’ve built a random forest model with 10000 trees. You got delighted after
getting training error as 0.00. But, the validation error is 34.23. What is goingon?
Haven’t you trained your model perfectly? (K4)
38. When would you use random forests vs SVM and why? (K1)
Part – B
1. Assume a disease so rare that it is seen in only one person out of every million.
Assume also that we have a test that is effective in that if a person hasthe disease,
there is a 99 percent chance that the test result will be positive; however, the test
is not perfect, and there is a one in a thousand chance that the test result will be
positive on a healthy person. Assume that a new patient arrives and the test
result is positive. What is the probability that the patient has the disease? (K4)
2. Explain Naïve Bayes Classifier with an Example. (K1)
3. Explain SVM Algorithm in Detail. (K1)
8

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com

4. Explain Decision Tree Classification. (K4)

5. Explain the principle of the gradient descent algorithm. Accompany your
explanation with a diagram. Explain the use of all the terms and constants that
you introduce and comment on the range of values that they can take. (K2)
6. Explain the following(K4)
a) Linear regression
b) Logistic Regression
UNIT IV ENSEMBLE TECHNIQUES AND UNSUPERVISED LEARNING
Combining multiple learners: Model combination schemes, Voting, Ensemble Learning -
bagging, boosting, stacking, Unsupervised learning: K-means, Instance Based Learning: KNN,
Gaussian mixture models and Expectation maximization

PART - A
1. What is bagging and boosting in ensemble learning? (K1)
2. What is stacking in ensemble learning? (K1)
3. Which are the three types of ensemble learning? (K2)
4. Why ensemble methods are used? (K1)
5. What is a voting classifier? (K1)
6. What type of classifiers are used in weighted voting method? (K2)
7. What is difference between K means and Gaussian mixture? (K4)
8. What are Gaussian mixture models How is expectation maximization used in it? (K1)
9. What is k-means unsupervised learning? (K2)
10. What is the difference between K-means and KNN? (K6)
11. What is expectation maximization algorithm used for? (K4)
12. What is the advantage of Gaussian process? (K1)
13. What are examples of unsupervised learning? (K2)
14. How do you implement expectation maximization algorithm? (K2)
15. What is the principle of maximum likelihood? (K2)
Part – B
1. Explain briefly about unsupervised learning structure? (K2)
2. Explain various learning techniques involved in unsupervised learning? (K2)
3. What is Gaussian process? And explain in detail of Gaussian parameterestimates
with suitable examples. (K1)
4. Explain the concepts of clustering approaches. How it differ from classification. (K2)
5. List the applications of clustering and identify advantages and disadvantages of
clustering algorithm. (K4)
6. Explain about EM algorithm. (K2)
7. List non-parametric techniques and Explain K-nearest neighbour estimation. (K4)

UNIT V NEURAL NETWORKS

Perceptron - Multilayer perceptron, activation functions, network training – gradient
descent optimization – stochastic gradient descent, error backpropagation, from shallow
networks to deep networks –Unit saturation (aka the vanishing gradient problem) – ReLU,
hyperparameter tuning, batch normalization, regularization, dropout.

1. What is perceptron and its types? (K1)

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com

2. Which activation function is used in multilayer perceptron? (K1)

3. What are the activation functions of MLP? (K1)
4. Does MLP have activation function? (K5)
5. What is the difference between a perceptron and a MLP? (K4)
6. What are the types of activation function? (K2)
7. What is MLP and how does it work?Why do you require Multilayer Perceptron? (K1)
8. What are the advantages of Multilayer Perceptron?(K1)
9. What do you mean by activation function? (K1)
10. What are the limitations of perceptron? (K1)
11. How many layers are there in perceptron? (K3)
12. is stochastic gradient descent same as gradient descent? (K5)
13. How is stochastic gradient descent used as an optimization technique? (K3)
14. Does stochastic gradient descent lead to faster training? (K5)
15. What is stochastic gradient descent and why is it used in the training of neural
networks? (K2)
16. What are the three main types gradient descent algorithm? (K1)
17. What are the disadvantages of stochastic gradient descent? (K1)
18. How do you solve the vanishing gradient problem within a deep neural network? (K3)
19. What is the problem with ReLU? (K1)
20. Why is ReLU used in deep learning? (K1)
21. Why is ReLU better than Softmax? (K1)
Part – B

1. Draw the architecture of a single layer perceptron (SLP) and explain itsoperation.
Mention its advantages and disadvantages. (K1)
2. Draw the architecture of a Multilayer perceptron (MLP) and explain its
operation. Mention its advantages and disadvantages. (K6)
3. Explain the stochastic optimization methods for weight determination. (K4)
4. Describe back propagation and features of back propagation. (K2)
5. Write the flowchart of error back-propagation training algorithm. (K6)
6. Develop a Back propagation algorithm for Multilayer Feed forward neural network
consisting of one input layer, one hidden layer and output layer from first principles.
(K5)
7. List the factors that affect the performance of multilayer feed-forward neural
network. (K4)
8. Difference between a Shallow Net & Deep Learning Net. (K4)
9. How do you tune hyper parameters for better neural network performance?Explain
in detail. (K1)

10

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 Click on Subject/Paper under Semester to enter.
Environmental Sciences
Professional English and Sustainability -
Professional English - - II - HS3252 Discrete Mathematics GE3451
I - HS3152 - MA3354
Statistics and Theory of Computation
Matrices and Calculus Numerical Methods - Digital Principles and - CS3452
3rd Semester

4th Semester
- MA3151 MA3251 Computer Organization
1st Semester

2nd Semester

- CS3351 Artificial Intelligence

Engineering Graphics and Machine Learning
Engineering Physics - - CS3491
- GE3251 Foundation of Data
PH3151
Science - CS3352
Database Management
Physics for
Engineering Chemistry System - CS3492
Information Science Data Structure -
- CY3151 - PH3256 CS3301

Basic Electrical and

Algorithms - CS3401
Problem Solving and Electronics Engineering Object Oriented
Python Programming - - BE3251 Programming - CS3391 Introduction to
GE3151 Operating Systems -
Programming in C -
CS3451
CS3251

Computer Networks - Object Oriented

CS3591 Software Engineering
- CCS356
Compiler Design - Human Values and
5th Semester

CS3501 Embedded Systems Ethics - GE3791

7th Semester

8th Semester
6th Semester

and IoT - CS3691

Cryptography and Open Elective 2
Cyber Security - Open Elective-1 Project Work /
CB3491
Open Elective 3 Intership
Distributed Computing Elective-3
- CS3551 Open Elective 4
Elective-4
Elective 1
Management Elective
Elective-5
Elective 2
Elective-6
 All Computer Engg Subjects - [ B.E., M.E., ] (Click on Subjects to
enter)
Programming in C Computer Networks Operating Systems
Programming and Data Programming and Data Problem Solving and Python
Structures I Structure II Programming
Database Management Systems Computer Architecture Analog and Digital
Communication
Design and Analysis of Microprocessors and Object Oriented Analysis
Algorithms Microcontrollers and Design
Software Engineering Discrete Mathematics Internet Programming
Theory of Computation Computer Graphics Distributed Systems
Mobile Computing Compiler Design Digital Signal Processing
Artificial Intelligence Software Testing Grid and Cloud Computing
Data Ware Housing and Data Cryptography and Resource Management
Mining Network Security Techniques
Service Oriented Architecture Embedded and Real Time Multi - Core Architectures
Systems and Programming
Probability and Queueing Theory Physics for Information Transforms and Partial
Science Differential Equations
Technical English Engineering Physics Engineering Chemistry
Engineering Graphics Total Quality Professional Ethics in
Management Engineering
Basic Electrical and Electronics Problem Solving and Environmental Science and
and Measurement Engineering Python Programming Engineering
 Click on Subject/Paper under Semester to enter.
Random Process and Electromagnetic
Professional English Linear Algebra -
Professional English - - II - HS3252 Fields - EC3452
MA3355
I - HS3152
C Programming and Networks and
Statistics and
Data Structures - Security - EC3401
Matrices and Calculus Numerical Methods -
CS3353
- MA3151 MA3251
1st Semester

3rd Semester

Linear Integrated

4th Semester
2nd Semester

Signals and Systems - Circuits - EC3451

Engineering Physics - Engineering Graphics
- GE3251 EC3354
PH3151 Digital Signal
Processing - EC3492
Physics for Electronic Devices and
Engineering Chemistry Electronics Engg - Circuits - EC3353
- CY3151 PH3254 Communication
Systems - EC3491
Control Systems -
Basic Electrical & EC3351
Problem Solving and Instru Engg - BE3254 Environmental
Python Programming - Sciences and
GE3151 Digital Systems Design Sustainability -
Circuit Analysis - - EC3352 GE3451
EC3251

Wireless
Communication -
EC3501 Embedded Systems
and IOT Design -
ET3491
VLSI and Chip Design
5th Semester

- EC3552 Human Values and

7th Semester

8th Semester
6th Semester

Artificial Intelligence Ethics - GE3791

and Machine Learning
Transmission Lines and - CS3491
RF Systems - EC3551 Open Elective 2 Project Work /
Intership
Open Elective-1 Open Elective 3
Elective 1
Elective-4
Open Elective 4
Elective 2
Elective-5
Elective 3
Elective-6
 All ECE Engg Subjects - [ B.E., M.E., ] (Click on Subjects to enter)
Circuit Analysis Digital Electronics Communication Theory
Basic Electrical and Electrical Engineering and Principles of Digital
Instrumentation Engineering Instrumentation Signal Processing
Electronic Devices Linear Integrated Circuits Signals and Systems
Electronic Circuits I Electronic Circuits II Digital Communication
Transmission Lines and Wave Control System Engineering Microprocessors and
Guides Microcontrollers
Computer Architecture Computer Networks Operating Systems
RF and Microwave Engineering Medical Electronics VLSI Design
Optical Communication and Embedded and Real Time Cryptography and
Networks Systems Network Security
Probability and Random Transforms and Partial Physics for Electronics
Processes Differential Equations Engineering
Engineering Physics Engineering Chemistry Engineering Graphics
Problem Solving and Python Object Oriented Programming Environmental Science
Programming and Data Structures and Engineering
Principles of Management Technical English Total Quality
Management
Professional Ethics in Engineering Mathematics I Engineering Mathematics
Engineering II
 Click on Subject/Paper under Semester to enter.
Environmental Sciences
Professional English and Sustainability -
Professional English - - II - HS3252 Discrete Mathematics - GE3451
I - HS3152 MA3354
Statistics and Theory of Computation
Matrices and Calculus Numerical Methods - Digital Principles and - CS3452
3rd Semester

4th Semester
- MA3151 MA3251 Computer Organization
1st Semester

2nd Semester

- CS3351 Artificial Intelligence

Engineering Graphics and Machine Learning
Engineering Physics - - CS3491
- GE3251 Foundation of Data
PH3151
Science - CS3352
Database Management
Physics for
Engineering Chemistry System - CS3492
Information Science Data Structures and
- CY3151 - PH3256 Algorithms - CD3291
Web Essentials -
Basic Electrical and IT3401
Problem Solving and Electronics Engineering - Object Oriented
Python Programming - BE3251 Programming - CS3391 Introduction to
GE3151 Operating Systems -
Programming in C -
CS3451
CS3251

Computer Networks -
CS3591
Object Oriented
Full Stack Web Software Engineering - Human Values and
5th Semester

Development - IT3501 CCS356 Ethics - GE3791

7th Semester

8th Semester
6th Semester

Distributed Computing Open Elective-1 Open Elective 2

- CS3551 Project Work /
Elective-3 Open Elective 3 Intership
Embedded Systems and
IoT - CS3691 Elective-4
Open Elective 4

Elective 1 Elective-5
Management Elective

Elective-6
Elective 2
 All Computer Engg Subjects - [ B.E., M.E., ] (Click on Subjects to enter)
Programming in C Computer Networks Operating Systems
Programming and Data Programming and Data Problem Solving and Python
Structures I Structure II Programming
Database Management Systems Computer Architecture Analog and Digital
Communication
Design and Analysis of Microprocessors and Object Oriented Analysis
Algorithms Microcontrollers and Design
Software Engineering Discrete Mathematics Internet Programming
Theory of Computation Computer Graphics Distributed Systems
Mobile Computing Compiler Design Digital Signal Processing
Artificial Intelligence Software Testing Grid and Cloud Computing
Data Ware Housing and Data Cryptography and Resource Management
Mining Network Security Techniques
Service Oriented Architecture Embedded and Real Time Multi - Core Architectures
Systems and Programming
Probability and Queueing Theory Physics for Information Transforms and Partial
Science Differential Equations
Technical English Engineering Physics Engineering Chemistry
Engineering Graphics Total Quality Professional Ethics in
Management Engineering
Basic Electrical and Electronics Problem Solving and Environmental Science and
and Measurement Engineering Python Programming Engineering