Click on Subject/Paper under Semester to enter.

Professional English Discrete Mathematics Environmental Sciences

Professional English - - II - HS3252 - MA3354 and Sustainability -
I - HS3152 GE3451
Digital Principles and
Statistics and Probability and
Computer Organization
Matrices and Calculus Numerical Methods - Statistics - MA3391
- CS3351
- MA3151 MA3251
3rd Semester
1st Semester

4th Semester
2nd Semester

Database Design and Operating Systems -

Engineering Physics - Engineering Graphics
Management - AD3391 AL3452
PH3151 - GE3251

Physics for Design and Analysis of Machine Learning -

Engineering Chemistry Information Science Algorithms - AD3351 AL3451
- CY3151 - PH3256
Data Exploration and Fundamentals of Data
Basic Electrical and
Visualization - AD3301 Science and Analytics
Problem Solving and Electronics Engineering -
BE3251 - AD3491
Python Programming -
GE3151 Artificial Intelligence
Data Structures Computer Networks
- AL3391
Design - AD3251 - CS3591

Deep Learning -
AD3501

Embedded Systems
Data and Information Human Values and
and IoT - CS3691
5th Semester

Security - CW3551 Ethics - GE3791

6th Semester

7th Semester

8th Semester

Open Elective-1
Distributed Computing Open Elective 2
- CS3551 Project Work /
Elective-3
Open Elective 3 Intership
Big Data Analytics - Elective-4
CCS334 Open Elective 4
Elective-5
Elective 1 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
 lOMoARcPSD|45374298

www.BrainKart.com

UNIT IV MODEL EVALUATION

Performance metrics -- Baseline Models -- Hyperparameters: Manual Hyperparameter --

Automatic Hyperparameter -- Grid search -- Random search -- Debugging strategies.

PERFORMANCE METRICS
To evaluate the performance or quality of the model, different metrics are used, and these metrics are
known as performance metrics or evaluation metrics. These performance metrics help us understand how
well our model has performed for the given data. In this way, we can improve the model's performance by
tuning the hyper-parameters. Each ML model aims to generalize well on unseen/new data, and
performance metrics help determine how well the model generalizes on the new dataset.

In machine learning, each task or problem is divided into classification and Regression. Not all metrics
can be used for all types of problems;

Performance Metrics for Classification

In a classification problem, the category or classes of data is identified based on training data. The model
learns from the given dataset and then classifies the new data into classes or groups based on the training.
It predicts class labels as the output, such as Yes or No, 0 or 1, Spam or Not Spam, etc. To evaluate the
performance of a classification model, different metrics are used, and some of them are as follows:

o Accuracy
o Confusion Matrix
o Precision
o Recall
o F-Score
o AUC(Area Under the Curve)-ROC

I. Accuracy

The accuracy metric is one of the simplest Classification metrics to implement, and it can be determined
as the number of correct predictions to the total number of predictions

When to Use Accuracy?

It is good to use the Accuracy metric when the target variable classes in data are approximately balanced.
For example, if 60% of classes in a fruit image dataset are of Apple, 40% are Mango. In this case, if the
model is asked to predict whether the image is of Apple or Mango, it will give a prediction with 97% of
accuracy.

When not to use Accuracy?

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

It is recommended not to use the Accuracy measure when the target variable majorly belongs to one class.
For example, Suppose there is a model for a disease prediction in which, out of 100 people, only five
people have a disease, and 95 people don't have one. In this case, if our model predicts every person with
no disease (which means a bad prediction), the Accuracy measure will be 95%, which is not correct.

II. Confusion Matrix

A confusion matrix is a tabular representation of prediction outcomes of any binary classifier, which is
used to describe the performance of the classification model on a set of test data when true values are
known.

o In the matrix, columns are for the prediction values, and rows specify the Actual values. Here
Actual and prediction give two possible classes, Yes or No. So, if we are predicting the presence
of a disease in a patient, the Prediction column with Yes means, Patient has the disease, and for
NO, the Patient doesn't have the disease.
o In this example, the total number of predictions are 165, out of which 110 time predicted yes,
whereas 55 times predicted No.However, in reality, 60 cases in which patients don't have the
disease, whereas 105 cases in which patients have the disease.
o True Positive(TP): In this case, the prediction outcome is true, and it is true in reality, also.
o True Negative(TN): in this case, the prediction outcome is false, and it is false in reality, also.
o False Positive(FP): In this case, prediction outcomes are true, but they are false in actuality.
o False Negative(FN): In this case, predictions are false, and they are true in actuality.

III. Precision

The precision metric is used to overcome the limitation of Accuracy. The precision determines the
proportion of positive prediction that was actually correct. It can be calculated as the True Positive or
predictions that are actually true to the total positive predictions (True Positive and False Positive).

IV. Recall or Sensitivity

It is also similar to the Precision metric; however, it aims to calculate the proportion of actual positive that
was identified incorrectly. It can be calculated as True Positive or predictions that are actually true to the
total number of positives, either correctly predicted as positive or incorrectly predicted as negative (true
Positive and false negative).

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

When to use Precision and Recall?

From the above definitions of Precision and Recall, we can say that recall determines the performance of
a classifier with respect to a false negative, whereas precision gives information about the performance of
a classifier with respect to a false positive.

So, if we want to minimize the false negative, then, Recall should be as near to 100%, and if we want to
minimize the false positive, then precision should be close to 100% as possible.

V. F-Scores

F-score or F1 Score is a metric to evaluate a binary classification model on the basis of predictions that
are made for the positive class. It is calculated with the help of Precision and Recall. It is a type of single
score that represents both Precision and Recall. So, the F1 Score can be calculated as the harmonic
mean of both precision and Recall, assigning equal weight to each of them.

VI. AUC-ROC

Sometimes we need to visualize the performance of the classification model on charts; then, we can use
the AUC-ROC curve. It is one of the popular and important metrics for evaluating the performance of the
classification model.

Firstly, let's understand ROC (Receiver Operating Characteristic curve) curve. ROC represents a graph
to show the performance of a classification model at different threshold levels. The curve is plotted
between two parameters, which are:

o True Positive Rate

o False Positive Rate

AUC calculates the performance across all the thresholds and provides an aggregate measure. The value
of AUC ranges from 0 to 1. It means a model with 100% wrong prediction will have an AUC of 0.0,
whereas models with 100% correct predictions will have an AUC of 1.0.

Performance Metrics for Regression

Regression is a supervised learning technique that aims to find the relationships between the dependent
and independent variables. A predictive regression model predicts a numeric or discrete value. The
metrics used for regression are different from the classification metrics.

o Mean Absolute Error

o Mean Squared Error
o R2 Score

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

o Adjusted R2

I. Mean Absolute Error (MAE)

Mean Absolute Error or MAE is one of the simplest metrics, which measures the absolute difference
between actual and predicted values, where absolute means taking a number as Positive.

The below formula is used to calculate MAE:

Here,

Y is the Actual outcome, Y' is the predicted outcome, and N is the total number of data points.

II. Mean Squared Error

Mean Squared error or MSE is one of the most suitable metrics for Regression evaluation. It measures the
average of the Squared difference between predicted values and the actual value given by the model.

Moreover, due to squared differences, it penalizes small errors also, and hence it leads to over-estimation
of how bad the model is.

III. R Squared Score

R squared error is also known as Coefficient of Determination, The R-squared metric enables us to
compare our model with a constant baseline to determine the performance of the model. To select the
constant baseline, we need to take the mean of the data and draw the line at the mean.

The R squared score will always be less than or equal to 1 without concerning if the values are too large
or small.

IV. Adjusted R Squared

Adjusted R squared, as the name suggests, is the improved version of R squared error. R square has a
limitation of improvement of a score on increasing the terms, even though the model is not improving,
and it may mislead the data scientists.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

To overcome the issue of R square, adjusted R squared is used, which will always show a lower value
than R². It is because it adjusts the values of increasing predictors and only shows improvement if there is
a real improvement.

We can calculate the adjusted R squared as follows:

Here,

n is the number of observations

k denotes the number of independent variables

and Ra2 denotes the adjusted R2

BASELINE MODELS

``What is a Baseline Model?

Baseline models serve as a benchmark in an ML application. Their main goal is to put the results of
trained models into context.

Assume you begin working on a problem statement and complete all of the steps, including EDA, data
cleansing, and feature engineering. You now begin working on your model. During model training, you
discover that your model's accuracy is 54%. So, without making much effort, you now have a 54% accuracy
level, which is now your base value.You can now tag this as a baseline model, indicating that you will
enhance this number after this. If your model's accuracy level goes below 54% in the future, it means the
model requires improvements.

Types of baseline models

Baseline models are divided into three main categories:

 Random Baseline Models: Data in the actual world isn't always reliable. A dummy classifier or
regressor is the optimal baseline model for these issues. This baseline model will inform you if your
machine learning model is learning or not.
 ML Baseline Modes: Now, if the data is predictable, you can create a baseline model which helps
us analyze which features are critical for prediction and which are not. The baseline models are
commonly used with feature engineering.
 Automated ML Baseline Models: It is the ultimate baseline model. It's an excellent model for
comparing your ML model. If your ML model outperforms the automated baseline model, it's a
strong indication that the model has the potential to become a product.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

Benefits of baseline models

Understand your data

The key advantage of employing the baseline model is that it aids in data comprehension:

 Analyze observations that are challenging to categorize: With the help of a baseline model,
you'll be able to figure out which observations are difficult to categorize.
 Analyze the different classes: Likewise, if you're focusing on a multi-class regression issue, a
baseline model might show you which classes are simple to classify and which are tough to classify.
 Detect data with low signal strength: A weak signal or low fitting might be indicated by a
baseline model with no or little prediction.

Faster iteration

Baseline models also help improve the efficiency with which you can build the models.

 Increase speed and performance: With a baseline model in place, you will have detailed
information on what to improve and develop. This makes it easy to see if the changes you're making
to your model are improving metrics or not. This enables you to quickly discover initiatives that can
enhance your KPIs.
 Efficiency: If you build a baseline model, the amount of work you have to do on current projects
may reduce, allowing you to focus on other projects. The baseline model facilitates efficiency and
productivity.

Performance benchmark

Baseline models provide a suitable standard against which you can evaluate your real models.

 Some performance measures, such as logarithmic loss, are helpful to evaluate amongst models than
to assess individually. This is due to the fact that many performance measurements lack a specified
scale and instead take on varying values based on the result variable's range. This can assist you in
determining when a sophisticated model is required vs when simple business logic is adequate.
 Calculate the impact on key business parameters. Creating a simple baseline model can also help
you see what type of influence you might have on company indicators. This is particularly true if
your baseline model is stochastic as well.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

HYPERPARAMETERS

In neural networks, parameters are used to train the model and make predictions. There are two types of
parameters:

Model parameters are internal to the neural network – for example, neuron weights. They are estimated
or learned automatically from training samples. These parameters are also used to make predictions in a
production model.
Hyperparameters are external parameters set by the operator of the neural network – for example,
selecting which activation function to use or the batch size used in training. Hyperparameters have a huge
impact on the accuracy of a neural network, there may be different optimal values for different values,
and it is non-trivial to discover those values.
The simplest way to select hyperparameters for a neural network model is “manual search” – in other
words, trial and error. New methods are evolving which use algorithms and optimization methods to
discover the best hyperparameters.

What is Hyperparameter Tuning?

A hyperparameter is a parameter of the model whose value influences the learning process and whose
value cannot be estimated from the training data. Hyperparameters are configured externally before
starting the model learning/training process. Hyperparameter tuning is the process of finding the optimal
hyperparameters for any given machine learning algorithm.

List of Common Hyperparameters

Hyperparameters related to neural network structure

1. Number of hidden layers – adding more hidden layers of neurons generally improves accuracy, to a
certain limit which can differ depending on the problem.
2. Dropout – what percentage of neurons should be randomly “killed” during each epoch to prevent
overfitting.
3. Activation function – which function should be used to process the inputs flowing into each neuron.
The activation function can impact the network’s ability to converge and learn for different ranges of
input values, and also its training speed.
4. Weights initialization – it is necessary to set initial weights for the first forward pass. Two basic
options are to set weights to zero or to randomize them. However, this can result in a vanishing or
exploding gradient, which will make it difficult to train the model. To mitigate this problem, you can use
a heuristic (a formula tied to the number of neuron layers) to determine the weights. A common heuristic
used for the Tanh activation is called Xavier initialization.

Hyperparameters related to training algorithm

1. Learning rate – how fast the backpropagation algorithm performs gradient descent. A lower learning
rate makes the network train faster but might result in missing the minimum of the loss function.
2. Epoch, iterations and batch size – these parameters determine the rate at which samples are fed to the
model for training. An epoch is a group of samples which are passed through the model together (forward
pass) and then run through backpropagation (backward pass) to determine their optimal weights. If the

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

epoch cannot be run all together due the size of the sample or complexity of the network, it is split into
batches, and the epoch is run in two or more iterations. The number of epochs and batches per epoch can
significantly affect model fit, as shown below.
3. Optimizer algorithm – when a neural network trains, it uses an algorithm to determine the optimal
weights for the model, called an optimizer. The basic option is Stochastic Gradient Descent, but there are
other options.
4. Momentum— Another common algorithm is Momentum, which works by waiting after a weight is
updated, and updating it a second time using a delta amount. This speeds up training gradually, with a
reduced risk of oscillation. Other algorithms are Nesterov Accelerated Gradient, AdaDelta and Adam.

Manual Hyperparameter Tuning

Traditionally, hyperparameters were tuned manually by trial and error. This is still commonly done, and
experienced operators can “guess” parameter values that will achieve very high accuracy for deep
learning models. However, there is a constant search for better, faster and more automatic methods to
optimize hyperparameters. Pros: Very simple and effective with skilled operators Cons: Not scientific,
unknown if you have fully optimized hyperparameters

 Automated hyperparameter tuning: In automated hyperparameter tuning, the optimal set of

hyperparameters is found by using an algorithm. An automatic hyperparameter tuning technique involves
methods in which the user defines a set of hyperparameter combinations or a range for each
hyperparameter, and the tuning algorithm runs the trials to find the optimal set of hyperparameters for the
model.

1. Grid Search
Grid search is slightly more sophisticated than manual tuning. It involves systematically
testing multiple values of each hyperparameter, by automatically retraining the model for each value of
the parameter. For example, you can perform a grid search for the optimal batch size by automatically
training the model for batch sizes between 10-100 samples, in steps of 20. The model will run 5 times and
the batch size selected will be the one which yields highest accuracy. Pros: Maps out the problem space
and provides more opportunity for optimization Cons: Can be slow to run for large numbers of
hyperparameter values
Grid-search is used to find the optimal hyperparameters of a model which results in the most
‘accurate’ predictions.Grid search is the simplest algorithm for hyperparameter tuning. Basically, we
divide the domain of the hyperparameters into a discrete grid. Then, we try every combination of values
of this grid, calculating some performance metrics using cross-validation. The point of the grid that
maximizes the average value in cross-validation, is the optimal combination of values for the
hyperparameters.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

Example of a grid search

Grid search is an exhaustive algorithm that spans all the combinations, so it can actually find the best
point in the domain. The great drawback is that it’s very slow. Checking every combination of the space
requires a lot of time that, sometimes, is not available. Don’t forget that every point in the grid needs k-
fold cross-validation, which requires k training steps. So, tuning the hyperparameters of a model in this
way can be quite complex and expensive. However, if we look for the best combination of values of the
hyperparameters, grid search is a very good idea.

2. Random Search
According to a 2012 research study by James Bergstra and Yoshua Bengio, testing randomized
values of hyperparameters is actually more effective than manual search or grid search. In other words,
instead of testing systematically to cover “promising areas” of the problem space, it is preferable to test
random values drawn from the entire problem space. Pros: According to the study, provides higher
accuracy with less training cycles, for problems with high dimensionality Cons: Results are unintuitive,
difficult to understand “why” hyperparameter values were chosen
Random search is similar to grid search, but instead of using all the points in the grid, it tests only
a randomly selected subset of these points. The smaller this subset, the faster but less accurate the
optimization. The larger this dataset, the more accurate the optimization but the closer to a grid search.

Example of random search

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

Random search is a very useful option when you have several hyperparameters with a fine-grained grid of
values. Using a subset made by 5-100 randomly selected points, we are able to get a reasonably good set
of values of the hyperparameters. It will not likely be the best point, but it can still be a good set of values
that gives us a good model.

3. Bayesian Optimization
Bayesian optimization is a technique which tries to approximate the trained model with
different possible hyperparameter values. To simplify, bayesian optimization trains the model with
different hyperparameter values, and observes the function generated for the model by each set of
parameter values. It does this over and over again, each time selecting hyperparameter values that are
slightly different and can help plot the next relevant segment of the problem space. Similar to sampling
methods in statistics, the algorithm ends up with a list of possible hyperparameter value sets and model
functions, from which it predicts the optimal function across the entire problem set. Pros: The original
study and practical experience from the industry shows that bayesian optimization results in significantly
higher accuracy compared to random search. Cons: Like random search, results are not intuitive and
difficult to improve on, even by trained operators
The Bayesian optimization method takes a different approach. This method treats the search
for the optimal hyperparameters as an optimization problem. When choosing the next hyperparameter
combination, this method considers the previous evaluation results. It then applies a probabilistic function
to select the combination that will probably yield the best results. This method discovers a fairly good
hyperparameter combination in relatively few iterations. Data scientists choose a probabilistic model
when the objective function is unknown. That is, there is no analytical expression to maximize or
minimize. The data scientists apply the learning algorithm to a data set, use the algorithm’s results to
define the objective function, and take the various hyperparameter combinations as the input domain.The
probabilistic model is based on past evaluation results. It estimates the probability of a hyperparameter
combination’s objective function result:

P( result | hyperparameters )

This probabilistic model is a “surrogate” of the objective function. The objective function can be, for
instance, the root-mean-square error (RMSE). We calculate the objective function using the training data
with the hyperparameter combination. We try to optimize it (maximize or minimize, depending on the
objective function selected). Applying the probabilistic model to the hyperparameters is computationally
inexpensive compared to the objective function, so this method typically updates and improves the surrogate
probability model every time the objective function runs. Better hyperparameter predictions decrease the
number of objective function evaluations we need to achieve a good result.Gaussian processes, random forest
regression, and tree-structured Parzen estimators (TPE) are surrogate model examples.

Debugging strategies
Debugging is the process of identifying and resolving errors, or bugs, in a software system. It
is an important aspect of software engineering because bugs can cause a software system to
malfunction, and can lead to poor performance or incorrect results. Debugging can be a time-
consuming and complex task, but it is essential for ensuring that a software system is functioning
correctly.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

1. Pay Attention to Error Messages

Error messages aren’t just there as an annoyance — they can actually tell we exactly what the problem
is with our software. So, when an error message pops up, make sure we read it, because it can give we
a lot of insight into what’s going on with the product.
If we’re not sure what the error message means, try searching for it online. Chances are someone else
has encountered the same problem in the past and could know precisely how to fix it.
1. Leverage a Debugger

A debugger, also known as a debugging tool or debugging mode, can be used to easily identify and
correct bugs. To effectively leverage the tool, we’ll need to run our program within the debugger,
which allows we to monitor it in real-time and see the error when it occurs. We can pause the program
while it’s running to pinpoint and investigate any issues that are occurring and review our code line by
line.

2. Log Everything
Make sure we’re logging every issue we encounter, as well as steps we take to address them and
ensure our program is running correctly. Once we’ve documented the error, we can start mapping out
potential scenarios and solutions. We should keep track of all possible steps to take and the information
we need to make a decision regarding our errors. This will also allow we to navigate different potential
solutions.
3.Localize the Problem
The method of problem localization entails removing pieces of code line by line until we find the
issue that is interfering with our program. While this is a somewhat painstaking and involved way of
identifying the error that’s taking place, it can be highly effective in determining what, exactly, is going
wrong with our product. Of course, we’ll need to keep repeating the process until we’ve tracked down
the bugs.
4.Try to Replicate the Problem
By replicating the problem, we’ll find out what the nature of the problem is precisely. In fact,
this can lead to us creating better, cleaner code in general since we’re exercising the critical thinking
skills required to find the cause of an issue.
This, of course, demands a thorough investigation of the ins and outs of the product. But once we’ve
successfully reproduced the error that’s interfering with our product’s performance, usability, or
functionality, fixing the problem should require far less time. In fact, most of the time, replicating the
issue is the hard work, while resolving it takes only minutes.
5.Turn to the Community
It’s highly likely that any error we encounter is one others have encountered before we. It can be
very helpful to turn to a community associated with the language, framework, or another development
tool we’re using to find a solution for addressing the bug we’ve encountered. Many development tools,
such as languages like Python and frameworks like Ruby on Rails, have huge, thriving communities,
offering an abundance of support to developers within them.
6.Test, Test, and Test Again
The best way to spot bugs and successfully resolve them before they derail our app — is by
repeatedly testing the product. While the QA team will more thoroughly vet the product, developers
themselves can script simple tests during the development phase, such as unit testing, which
involves individually testing different pieces of the code — units.

There are several common methods and techniques used in debugging, including:
1. Code Inspection: This involves manually reviewing the source code of a software system to
identify potential bugs or errors.
2. Debugging Tools: There are various tools available for debugging such as debuggers, trace tools,
and profilers that can be used to identify and resolve bugs.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

3. Unit Testing: This involves testing individual units or components of a software system to identify
bugs or errors.
4. Integration Testing: This involves testing the interactions between different components of a
software system to identify bugs or errors.
5. System Testing: This involves testing the entire software system to identify bugs or errors.
6. Monitoring: This involves monitoring a software system for unusual behaviour or performance
issues that can indicate the presence of bugs or errors.
7. Logging: This involves recording events and messages related to the software system, which can be
used to identify bugs or errors.
Debugging Process: Steps involved in debugging are:

 Problem identification and report preparation.

 Assigning the report to the software engineer defect to verify that it is genuine.
 Defect Analysis using modelling, documentation, finding and testing candidate flaws, etc.
 Defect Resolution by making required changes to the system.
 Validation of corrections.
The debugging process will always have one of two outcomes:
1. The cause will be found and corrected.
2. The cause will not be found.
Debugging Approaches/Strategies:
1. Brute Force: Study the system for a larger duration in order to understand the system. It helps the
debugger to construct different representations of systems to be debugged depending on the need. A
study of the system is also done actively to find recent changes made to the software.
2. Backtracking: Backward analysis of the problem which involves tracing the program backward
from the location of the failure message in order to identify the region of faulty code. A detailed
study of the region is conducted to find the cause of defects.
3. Forward analysis of the program involves tracing the program forwards using breakpoints or print
statements at different points in the program and studying the results. The region where the wrong
outputs are obtained is the region that needs to be focused on to find the defect.
4. Using past experience with the software debug the software with similar problems in nature. The
success of this approach depends on the expertise of the debugger.
5. Cause elimination: it introduces the concept of binary partitioning. Data related to the error
occurrence are organized to isolate potential causes.
6. Static analysis: Analysing the code without executing it to identify potential bugs or errors. This
approach involves analysing code syntax, data flow, and control flow.
7. Dynamic analysis: Executing the code and analysing its behaviour at runtime to identify errors or
bugs. This approach involves techniques like runtime debugging and profiling.
8. Collaborative debugging: Involves multiple developers working together to debug a system. This
approach is helpful in situations where multiple modules or components are involved, and the root
cause of the error is not clear.
9. Logging and Tracing: Using logging and tracing tools to identify the sequence of events leading
up to the error. This approach involves collecting and analysing logs and traces generated by the
system during its execution.
10. Automated Debugging: The use of automated tools and techniques to assist in the debugging
process. These tools can include static and dynamic analysis tools, as well as tools that use machine
learning and artificial intelligence to identify errors and suggest fixes.

Debugging Tools:
Debugging tool is a computer program that is used to test and debug other programs. A lot of
public domain software like gdb and dbx are available for debugging. They offer console-based
command-line interfaces. Examples of automated debugging tools include code-based tracers, profilers,
interpreters, etc. Some of the widely used debuggers are:

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

 Radare2
 WinDbg
 Valgrind

Difference between Debugging and Testing:

Debugging is different from testing. Testing focuses on finding bugs, errors, etc whereas debugging
starts after a bug has been identified in the software. Testing is used to ensure that the program is
correct and it was supposed to do with a certain minimum success rate. Testing can be manual or
automated. There are several different types of testing unit testing, integration testing, alpha, and beta
testing, etc. Debugging requires a lot of knowledge, skills, and expertise. It can be supported by some
automated tools available but is more of a manual process as every bug is different and requires a
different technique, unlike a pre-defined testing mechanism.

Advantages of Debugging:

Several advantages of debugging in software engineering:

1. Improved system quality: By identifying and resolving bugs, a software system can be made more
reliable and efficient, resulting in improved overall quality.
2. Reduced system downtime: By identifying and resolving bugs, a software system can be made
more stable and less likely to experience downtime, which can result in improved availability for
users.
3. Increased user satisfaction: By identifying and resolving bugs, a software system can be made
more user-friendly and better able to meet the needs of users, which can result in increased
satisfaction.
4. Reduced development costs: By identifying and resolving bugs early in the development process,
it can save time and resources that would otherwise be spent on fixing bugs later in the
development process or after the system has been deployed.
5. Increased security: By identifying and resolving bugs that could be exploited by attackers, a
software system can be made more secure, reducing the risk of security breaches.
6. Facilitates change: With debugging, it becomes easy to make changes to the software as it
becomes easy to identify and fix bugs that would have been caused by the changes.
7. Better understanding of the system: Debugging can help developers gain a better understanding
of how a software system works, and how different components of the system interact with one
another.
8. Facilitates testing: By identifying and resolving bugs, it makes it easier to test the software and
ensure that it meets the requirements and specifications.

Disadvantages of Debugging

While debugging is an important aspect of software engineering, there are also some disadvantages to
consider:

1. Time-consuming: Debugging can be a time-consuming process, especially if the bug is difficult to

find or reproduce. This can cause delays in the development process and add to the overall cost of
the project.
2. Requires specialized skills: Debugging can be a complex task that requires specialized skills and
knowledge. This can be a challenge for developers who are not familiar with the tools and
techniques used in debugging.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 lOMoARcPSD|45374298

www.BrainKart.com

3. Can be difficult to reproduce: Some bugs may be difficult to reproduce, which can make it
challenging to identify and resolve them.
4. Can be difficult to diagnose: Some bugs may be caused by interactions between different
components of a software system, which can make it challenging to identify the root cause of the
problem.
5. Can be difficult to fix: Some bugs may be caused by fundamental design flaws or architecture
issues, which can be difficult or impossible to fix without significant changes to the software
system.
6. Limited insight: In some cases, debugging tools can only provide limited insight into the problem
and may not provide enough information to identify the root cause of the problem.
7. Can be expensive: Debugging can be an expensive process, especially if it requires additional
resources such as specialized debugging tools or additional development time.

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes
 Click on Subject/Paper under Semester to enter.
Professional English Discrete Mathematics Environmental Sciences
Professional English - - II - HS3252 - MA3354 and Sustainability -
I - HS3152 GE3451
Digital Principles and
Statistics and Probability and
Computer Organization
Matrices and Calculus Numerical Methods - Statistics - MA3391
- CS3351
- MA3151 MA3251
3rd Semester
1st Semester

4th Semester
2nd Semester

Database Design and Operating Systems -

Engineering Physics - Engineering Graphics
Management - AD3391 AL3452
PH3151 - GE3251

Physics for Design and Analysis of Machine Learning -

Engineering Chemistry Information Science Algorithms - AD3351 AL3451
- CY3151 - PH3256
Data Exploration and Fundamentals of Data
Basic Electrical and
Visualization - AD3301 Science and Analytics
Problem Solving and Electronics Engineering -
BE3251 - AD3491
Python Programming -
GE3151 Artificial Intelligence
Data Structures Computer Networks
- AL3391
Design - AD3251 - CS3591

Deep Learning -
AD3501

Embedded Systems
Data and Information Human Values and
and IoT - CS3691
5th Semester

Security - CW3551 Ethics - GE3791

6th Semester

7th Semester

8th Semester

Open Elective-1
Distributed Computing Open Elective 2
- CS3551 Project Work /
Elective-3
Open Elective 3 Intership
Big Data Analytics - Elective-4
CCS334 Open Elective 4
Elective-5
Elective 1 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