GE8151 PROBLEM SOLVING AND PYTHON

https://www.poriyaan.in/ PROGRAMMING
UNIT – I https://eee.poriyaan.in/

ALGORITHMIC PROBLEM SOLVING

/
in
ALGORITHM Problem Solving and Python Programming
 Algorithm is defined as step-by-step description of how to arrive at the

n.
solution of the given problem.


aa
It also defined as finite sequence of explicit instructions that when provided
with a set of input values, produces an output and then terminates.
 An algorithm provides a blueprint to writing a program to solve a particular

iy
problem.
 It is an effective procedure for solving a problem in a finite number of steps.

Characteristics of Algorithm:
or
.p
 Be precise

w
Be unambiguous
 It has finite number of inputs
w

 It should be written in sequence

 It should conclude after a finite number of steps.
w

Qualities of Algorithm:
//
s:

 Different algorithm may perform the same task with different set of
instructions. Some algorithm is considered better than the other in solving the
tp

problem. The algorithm is written in such a way that it optimizes all necessary
conditions.
ht

 The factors that determine the quality of algorithm are:

 Accuracy: Algorithm should provide accurate result.
 Memory: It should take less memory.
 Time : It takes less time to execute
 Order : It must be in a sequential order.

Advantages:
* It is a step-wise description of a solution to a given problem, which makes it easy to
Understand.
* It uses a definite procedure to solve a problem.
* It is independent on any programming language.

Disadvantages:
* It is not a computer program.
 * It is time consuming. (An algorithm needs to be developed first, which is then converted
into
Flowchart and then into a computer program.)
* It is difficult to show branching and looping statements.

Example1: Algorithm to find sum of two numbers.

/
in
Stpe1: Start

n.
Step2: Read the values of a, b
Step3: Calculate c = a + b

aa
Step4: Print the value of c.

iy
Step5: Stop

Example 2: Algorithm to find area of rectangle

or
Step1: Start .p
Step2: Read length and breadth l, b
w
Step3: Calculate area of rectangle, area = l x b
Step4: Print the value of area.Step5: Stop
w

BUILDING BLOCKS OF ALGORITHMS

w

Any algorithm can be constructed from four basic building blocks. These four building blocks
are
//
s:

* Statements
* State Sequence
tp

* Control flow Selection

ht

* Function Iteration

Instructions / Statements:
* Instructions: Commands given to the computer that tell what it has to do.
* Statements: → A section (Segment) of code that represents a command.
→ Each and every line in an algorithm is called statement.

* Types of statement:

> Simple statement:

→ Assignment statement, return, goto etc

> Compound statement:

 → For, while, if, if-else etc.

State:
* Each and every action in an algorithm is called state.
* An algorithm is a finite number of steps for accomplishing a goal which, given an initial
state, will terminate in a defined end state.

/
in
Control flow:

n.
* It is also called flow of control. It is the order in which instructions or statements are
executed. There are three types of control flow, they are

aa
 Sequential control structure → Action
 Selection control structure → Decision (or) Branching
 Iteration control structure → 𝑅𝑒𝑝𝑒𝑡𝑖𝑡𝑖𝑜𝑛 (𝑜𝑟)𝐿𝑜𝑜𝑝𝑖𝑛𝑔

iy
or
* Sequential control structure (or) sequence structure:

→ It is the most common form of control structure.

.p
→ Each statement in the program is executed one after another in the given order.
w
Statement -. 1
w

ALGORITHMS
w

Statement -. 2
ALGORITHMS
//

Statement -. 3
s:

ALGORITHMS
tp

→ Example:
ht

Add two numbers

Step1: Start
Step2: Read values of a and b
Step3: Add the values of a and b
c=a+b
Step4: Print the value of c
Step5: Stop.

 Selection control structure:

→ It is the representation of a condition and choice between two actions.

→ The choice made depends on whether the condition is true or false. It is also called a

Decision.

→ This structure is sometimes referred as if-then-else structure because it directs the

/
in
program

n.
to perform in this way: If condition A is true then perform Action X else perform Action Y.

aa
iy
or
.p
→ Example: Algorithm to check the given number is odd or even.
w
Step1: Start
w

Step2: Read the value of num

// w

Step3: Check if num % 2 = = 0 then

s:

Step3.1: Display (Print) the given number is even

tp

Step3.2: Else print the given number is even

ht

Step4: Stop

* Iteration control structure:

→ This process is also called as repetition or looping.

→ It is the process of repeating a set of instructions.

→ There are two types of iteration:

 Count controlled Iteration : It will repeat a set of instructions for a specific number
Of times.
 Condition controlled iteration : It will repeat the instructions until a specific
Condition is met.
 /
in
→ Example: Algorithm to find factorial of a number

n.
Step1: Start

aa
Step2: Initialize the variable,

iy
fact = 1 and i =1

or
Step3: Read the value of num .p
i=i+1
w
Step5: Print the value of fact
w

Step4: Repeat the following steps until i = num

w

fact = fact * i
//

Step6: Stop.
s:

Function:
tp

* A function is a set of instructions that are used to perform a specified task which repeatedly
ht

occurs in the main program.

* There are two types of function

> Built – in function

> User defined function

* The built – in functions are predefined set of functions.

* The user defined functions are defined by the user, according to the user requirements.

NOTATION;

PSEUDOCODE:
* Pseudo code is another programming analysis tool, which is used for planning program
code.

* Pseudo means imitation or false and code refers to the instructions written in programming

Language.

/
in
* It is also called program Design Language (PDL).

n.
* Pseudo code is somewhat halfway in between English and a programming language.

aa
* Here pseudo code is detailed yet readable and it ensures that actual programming is likely

to match the design specification.

iy
* Pseudo code keywords:

> Input: READ, OBTAIN, GET and PROMPT

or
.p
> Output: PRINT, DISPLAY and SHOW
w
> Compute: COMPUTE, CALCULATE and DETERMINE
w

> Initialize: SET and INITIALIZE

// w

> dd one: INCREMENT

s:

> Sub one: DECREMENT

tp

* Pseudo code Guidelines:

ht

→ Statements should be written in simple English.

→ It should be programming language independent.

→ Steps must be understandable.

→ Pseudocode must be concise

→ Keywords must be capitalized.

→ Each instruction should be written in a separate line.

→ Each statement should express just one action for the compiler.

→ Each set of instructions are written from top to bottom with only one entry and one exit.
Advantages:

* It is easy to develop a program from a pseudo code than with a flowchart.

* It is easily modified

* It is compact

/
in
* It is language independent

n.
Disadvantages:

aa
* It doesn’t provide visual representation of the program lagic.

iy
* There is no accepted standards for writing pseudo code.

or
* There is no real formatting or syntax rules.
.p
* It is not used to understand the flow of the program control.
w
Example: (i) Pseudo code for finding sum of two numbers
w

BEGIN
w

READ the values of a, b

//

CALCULATE the sum, c = a + b

s:

PRINT the value of c

tp

END
ht

(ii) Pseudo code for finding area of circle with radius ‘r’

BEGIN

READ the value of r

CALCULATE the area of circle

area = 3.14 * r * r

PRINT the value of area

END

Flowchart:
* Flowchart is the diagrammatic representation of an algorithm, in which the steps are

Represented in the form of different shapes of boxes and logical flow is indicated by

Interconnecting arrows.

* The boxes represent operations and the arrows represent the data flows (the sequence in

/
.in
Which the operations are implemented.

n
* The purpose of the flowchart is to help the programmer in understanding the logic of the

aa
Program.

iy
* Flowchart symbols:

Symbol
or
Symbol Name Description
.p
w
w

Used to connect symbols.

Flow lines
//w

It indicates the sequence of

steps and the direction of
flow of control.
s:
tp

Used to represent the start

ht

Terminal or stop (end) of the

program.

Used to represent the input

Input/output or output statement, in the
program.

Processing
 Used to represent the
processing function of a
program.

Used to denote a decision

/
in
Decision to be made.

n.
aa
Used to join different flow

iy
Connector lines.

or
.p
Used to indicate that the
w
Off-page connecto flowchart continues on the
w

next page.
//w
s:

Used to provide additional

Annotation information about another
tp

flowchart symbol.
ht

Used to represent data input

Magnetic Disk or output and to a magnetic
disk.

* Guidelines for drawing flowchart:

> The flowchart should be clear, neat and easy to follow.

> The flowchart must have a logical start and stop.

> Only one flow line should come out from a process symbol.
> Only one flow line should enter a decision symbol, but two or three flow lines should leave

/
the

.in
decision symbol.

a an
iy
or
> Only one flow line is used with a terminal symbol.
.p
w
w

> Within standard symbols write briefly. If necessary use annotation to describe data or
//w

Process more clearly.

s:
tp
ht

> Intersection of flow lines should be avoided.

> Connector symbol is used to reduce the number of flow lines.

> It is useful to list the validity of the flowchart with normal test data.

/
* Benefits of flowcharts:

in
> Communication

n.
> Effective Analysis

aa
> Makes logic clear

iy
> Useful in coding

or
> Proper testing and debugging .p
> Appropriate documentation
w
* Limitations of flowcharts:
w

* Complex
w

* Difficult to modify
//
s:

> No update
tp

* Example: Flowchart to find sum of two numbers.

ht

PROGRAMMING LANGUAGE;
* A computer is the ideal machine to execute computational algorithms.

* A computer can perform arithmetic operations.

* It can also perform operations with conditional/ branching instruction.

* Types of Languages used in computer programming:

/
in
> Low level (or) Machine Language

n.
> Assembly Level Language

aa
> High level (or) programming Language.

iy
* Machine Language:

or
> It consists of binary numbers that encode instructions for the computer.
.p
> Every computer has its own machine language.
w
> Example: 101011101
w

100110110
Assembly Language
// w

> An assembly language consists of mnemonics

s:

> There is one mnemonic for each machine instruction.

tp

> Each assembler instruction is a mnemonic

ht

> Example:

Start

add x, y → one instruction

Sub x, y → one instruction

---

---

End

 High level programming Language:

  It consists of English like languages.
 It can be easily translated into machine instruction.
 The sentences written in high level languages are called “statements”.
 Example: python program
x = 10

/
in
y = 20
z=x+y

n.
Print “The sum is”, z

aa
Output:
The sum is 30

iy
 Types of High Level programming Languages

or
Computer programming languages are used to communicate instructions to a
computer. They are based on certain syntactic and semantic rules, which define the
.p
meaning of each of the programming language constructs. They are divided into the
w
following categories:
 Interpreted programming Languages
w

Ø Functional programming Languages

//w

Ø Compiled programming Languages

 Procedural programming Languages
s:

 Scripting programming Languages

 Mark-up programming Languages
tp

 Logic-Based programming Languages

ht

 Concurrent programming Languages

 Object-Oriented programming Languages
 Interpreted programming Languages:
→ It is a programming language for which most of its implementations execute
Instructions directly, without previously compiling a program into machine -
language
Instructions.
→ Example: BASIC, Pascal, Python
 Functional programming Languages:
→ It define every computation as a mathematical evaluation (calculation). They focus
On the application of functions.
→ Example: F, Haskell, Q
 Compiled programming Languages:
→ It is a programming language whose implementations are typically compilers, and
not interpreters.
→ Example: C, C++, Java
 Procedural Programming Languages:

/
in
→ Also called imperative programming languages.
→ A procedure is a group of statements that can be referenced through a procedure

n.
Call.

aa
→ It help in the reuse of code.
→ Example: Hyper Talk, MATLAB.

iy
 Scripting Programming Languages:

or
→ It is a programming language that control an application
→ Scripts can execute independentof any other application.
.p
→ Example: PHP, Apple script, VBScript.
w
 Mark-up programming Languages:
w

→ It is an artificial language that uses annotations to text that define how the text is to
Be displayed.
w

→ Example: HTML
//
s:

XML, XHTML
tp

 Logic – Based programming Languages:

ht

→ It is a type of programming paradigm which is largely based on formal logic.

→ It is a set of sentences in logical form, expressing facts and rules about some
Problem domain.
→ Example: ALF, Leda, Prolog.
 Concurrent Programming Languages:
→ It is a computer programming technique that provides for the execution of
Operations concurrently, either within a single computer, or across a number
Of systems.
→ Example: ABCL, E, Limbo
 Object – Oriented programming Languages:
→ It is a programming paradigm based on the concept of “objects”, which may
contain data, in the form of fields, often known as attributes: and code, in the form
of
Procedures, often. Known as methods.

/
in
n.
aa
iy
or
.p
w
w
// w
s:
tp
ht
 → Example: Agora, Beta, Lava

ALGORITHMIC PROBLEM SOLVING:

 Algorithms are procedural solutions to problems.

 These solutions are not answers but specific instructions for getting answer.

/
in
n.
aa
o riy
.p
w
w
//w
s:
tp
ht

 Understanding the problem:

 Before designing an algorithm we need to understand completely the given problem.
 Read the problem’s description carefully and ask questions about the problem.
 An input to an algorithm specifies an instances of the problem that the algorithm
solves.
 Ascertaining the capabilities of the computational Device:
 Once we completely understand the problem, we need to ascertain the capabilities of
the computational device.
 Sequential Algorithms:
→ The instructions are executed one after another
 i.e., one operation at a time.
 Parallel Algorithms:
→ The instructions are executed simultaneously
i.e., multiple operations at a time
 Choosing between Exact and Approximate problem solving:

/
.in
 The next step is to choose how to solve the problem.
 Solving the problem exactly is called an exact algorithm.

n
 Solving a problem approximately is called an approximation algorithm.

aa
 We select an approximation algorithm for three reasons:
 (i) There are problems that cannot be solved exactly.

iy
Example: extracting square roots, solving non-line equations.

or
(ii) Available algorithms are slow because of its complexity.
.p
(iii) An approximation algorithm can be part of sophisticated algorithm that
w
Solves a problem exactly.
w

 Deciding on appropriate Data structure:

w

 Data structure is a scheme of organizing related data items.

//

 Algorithms + Data structure = programs

s:

 Algorithm Design Techniques:

 It is a general approach to solve problem algorithmically
tp

 It provides guidance for designing new algorithms.

ht

 It is used to classify algorithms according to design area.

 Methods of specifying an algorithm:
 Step by step form
 Pseudo code
 Proving an Algorithm’s Correctness:
 Once an algorithm is specified it has to be proved for its correctness.
 A technique for proving correctness is to use mathematical induction.
 Because an algorithm’s iterations provide a natural sequence of steps needed for
such proofs.
 But in order to show that an algorithm is incorrect, we need just one instance of its
input for which the algorithm fails.
 Analysing an algorithm;
  Characteristics used for analysing an algorithm are

(i) Efficiency:

 Time efficiency: Denotes how fast the algorithm runs.

 Space efficiency: Indicates how much extra memory it occupies.

/
in
(ii) Simplicity:

n.
 Simpler algorithms are easier to understand and to program.

aa
(iii) Generality:

iy
 There are two issues:

or
(i) Generality of the problem the algorithm solves.
.p
(ii) Set of inputs it accepts.
w
 Coding an Algorithm:
 Algorithms are implemented as programs.
w

 Unless the correctness of a algorithm is proven, the program can’t be considered

w

correct.
//

 The validity of programs is checked by testing.

s:

SIMPLE STRATEGIES FOR DEVELOPING ALGORITHMS:

tp

 Algorithms are used to manipulate the data for a given problem.

ht

 For a complex problem, its algorithm is often divided into smaller units called
modules.
 This process of dividing algorithm into modules is called modularization.
 The advantage of modularization is :
→ It makes the complex algorithm simpler to design and implement.
 Each module can be designed independently.
 There are two main approaches to design an algorithm
 Top – down approach
 Bottom – up approach
 Top – down Approach:
 It starts by dividing the complex algorithm into one or more modules.
  These modules can be further divided into one or more sub – modules.
 This process is iterated until the design level of module complexity is achieved.
 Bottom – up Approach:
 It is the reverse of top-down approach.
 It starts designing the most basic or concrete modules and then proceed towards

/
in
designing higher level modules.
 In this approach sub –modules are grouped together to form higher level module.

n.
 This process is repeated until the design of the complete algorithm is obtained.

aa
 Iteration:
 Iteration means, executing one or more steps for a number of times.

iy
 It can be implemented using while and for loop.

or
 These loops execute one or more steps until some condition is true.
 Example: Algorithm to print ‘N’ numbers
.p
Step1: Start
w
Step2: Read the value of N
w

Step3: Set the value of i = 1

Step4: Repeat step 5 and 6 until i< =N
//w

Step5: Print the value of i

Step6: Increment, i = i + 1
s:

Step7: Stop

tp

Recursion:
 Recursion is the process of calling the same function itself again until some condition
ht

is satisfied.
 Example: Algorithm to find factorial of a number.
Step1: Start
Step2: Read the value of N
Step3: Call function, factorial (N)
Step4: Stop

User Defined function: factorial (N)

Step1: Initialize f = 1

Step2: Check if N = = 1 then return 1

Step3: Else, f = n * factorial (n-1)

 Step4: Print the value of f

ILLUSTRATIVE PROBLEMS

1. Find Minimum in a list

 Problem Description:

/
in
 Minimum in a list of elements can be achieved in different ways.


n.
One way is to sort the list of elements in ascending order and get the first element as
minimum.

aa
 Another method, is to compare each element with other.
 Assume the first element as the minimum element and start comparing with the next

iy
(second) element.

or
 If the next element is smaller than assume that element as the minimum, and keep
repeating the process till the last element.
.p
 Finally obtain the minimum element.
w
w

ALGORITHM PSEUDOCODE
w

Step1 : Start BE GI N
://

Step2 : Read the limit of list as n READ the limit of list as ‘r’
Step3: Read the ‘n’ elements of list a (). READ the ‘n’ elements
s

Step4 : Assign, min = a[0] of list a()

tp

Step5 : For i = 1 to n repeat ASSIGN min = a[0]

ht

Step 5.1 and 5.2 FOR i = 1 to n REPEAT

Step5.1 : Check if a[𝑖] < min CHECK IF a[𝑖] < min
Step5.2 : Then assign, THEN min = a[𝑖]
min = a[𝑖] PRINT the value of
Step6 : Print the value of min Min
Step7 : Stop END

Flowchart:
 /
in
n.
aa
iy
or
2. Insert a card in a list of sorted cards
.p
w
Problem Description:
w

Playing cards is one of the techniques of sorting. To insert a card in a list of sorted
//w

cards the steps are as follows:

 Insert a new card in the appropriate position by comparing each element’s value with
s:

the new card.

 When the position is found, move the remaining element (elements from that
tp

position) by one position) by one position up.

ht

 The new card is inserted at the current position.

Algorithm Pseudo code

Step1 : Start BEGIN
Step2 : Read the elements of a list in sorted READ the elements of a
Order, list() List, list() in sorted order
Step3 : Read a new element (card) to be READ a new element,
Inserted. (new card) to be inserted
Step4 : Traverse the list Traverse the list FOR
For i = n-1 to 0 i = n-1 to 0 REPEAT
Step4.1 : Check if new card > list [𝑖] then CHECK IF new card> list [𝑖] THEN
Step4.2: Set position ‘f’ as the current SET position ‘f’ as the
index. Current index
Step4.3 : Move the cards of fth Move the cards of f th
Index to n-1 index to its next Index to n-1 index
index. To its next index

/
in
Step5: Set new card to the current index. SET new card to the
Step6 : Display all the card elements of a Current index.

n.
new list. DISPLAY all the card

aa
Step7: Stop. Elements of a new list
END.

iy
or
.p
w
w
// w
s:
tp
ht
 /
in
n.
aa
iy
or
.p
w
w
//w
s:
tp
ht

3. Guess an Integer Number in a Range

Problem Description

To guess a number in a range of elements, the input guessing number should be

restricted to the specified range. The random number is automatically generated by the
system and it can be stored in a variable. If both the guess number and random number are
same, it should print “Good Jb” else it must print whether it is greater are lesser than the
random number.
 ALGORITHM PSEUDOCODE
Step1 : Start BEGIN
Step2: Read a number r ‘n’ range. READ a number ‘n’, range
Step3 : Read an guess number READ an guess number
Step4 : If (guess>n) then IF (guess > n ) THEN

/
Step4.1: Print “your guess too high”. PRINT “your guess too high”.

in
Step5: Elif (guess <n) then ELIF (guess < n ) THEN

n.
Step5.1: Print “your guess too low”. PRINT “your guess too low”.

aa
Step6 : Elif (guess = = n) then ELIF (guess = = n) THEN
Step6.1: Print “your guess is correct”. PRINT “your guess is correct”.

iy
Step7 : Else print “your guess is wrong” ELSE PRINT “your guess is wrong”.
Step8 : Stop END

or
.p
w
w
//w
s:
tp
ht
4. Towers of Hanoi

Problem Description:
 Tower of Hanoi is a mathematical puzzle with three rods and ‘n’ number of different
sized disks, each disk has a hole in centers, allowing it to be stacked around any of
the poles.

/
 Initially the disks are stacked on the left most pole in the order of decreasing size,

in
i.e., the largest disk at the bottom and the smallest on the top.

n.
 The aim (objective) of this game is to move the disks from the left mast pole (rod) to
the right most poles, without ever placing a larger disk on the top of the smaller disk.

aa
 Rules for Towers of Hanoi:
 Only one disk may be moved at a time.

iy
 Only the top most disk can be moved

or
 Only the smaller disk can be placed above the larger disk.
.p
Solution: Let us consider n =3 and three rods (pegs) named A, B and C.
w
w
//w
s:
tp
ht
 /
in
n.
aa
iy
or
.p
w
w
//w
s:
tp
ht

ALGORITHM PSEUDOCODE
Step1 : Start PROCEDURE
Step2 : Define the function tower() TOWER (N, A, C, B)
Step3: Read the number of disk N. BEGIN
Step4 : Initialize the pegs IF N = = 1 THEN
A = Source, B = aux, Move disk from A to C
C = dest. ELSE
Step5 : Call the function TOWER (N-1, A, B,C)
tower (N, A, C, B) move disk from A to C
Step6 : Stop TOWER (N-1, B,C,A)
User Defined Function: ENDIF
Step1 : Define the function END
tower ( N, A, C, B) END PROCEDURE
Step2 : if N = = 1 then move disk from A to
Step3 : Else
Step3.1 : tower (N-1, A, B, C)

/
in
Step3.2 : move disk from A to C // N → no. of disks.
Step3.3 : tower (N-1, B, C, A) 3 pegs → A, B, C

n.
aa
iy
Source aun Dest

or
.p
w
w
// w
s:
tp
ht
Problem Solving and Python Programming (GE3151) – Reg 2021
Unit I: Computational Thinking and Problem Solving
Computational Thinking and Problem Solving | Fundamentals of Computing | Identification of Computational Problems |
Algorithms | Building Blocks | Notation | Algorithmic Problem Solving | Simple Strategies for Developing Algorithms |
Illustrative Problems | Anna University Two Marks Questions & Answers | Multiple Choice Questions and Answers

Unit II: Data Types, Expressions, Statements

Data Types, Expressions, Statements | Introduction to Python | How to Write and Execute Python Program | Concept
of Interpreter and Compiler | Python Interpreter | Interactive and Script Modes | Debugging | Values and Types |
Variables, Expressions and Statements | Tuple Assignment | Indentation, String Operations | Functions | Illustrative
Programs | Anna University Two Marks Questions & Answers | Multiple Choice Questions

Unit III: Control Flow, Functions, Strings

Control Flow, Functions, Strings | Boolean Values | Operators | Input and Output | Conditional Statements | Iteration
| Fruitful Functions | Recursion | Strings | Lists as arrays | Illustrative Programs | Anna University Two Marks
Questions & Answers | Multiple Choice Questions

Unit IV: Lists, Tuples, Dictionaries

Lists, Tuples, Dictionaries | Lists | Tuples | Dictionaries | Advanced List Processing - List Comprehension | Illustrative
Programs | Anna University Two Marks Questions & Answers | Multiple Choice Questions

Unit V: Files, Modules, Packages

Files, Modules, Packages | Files | Command Line Arguments | Errors and Exceptions | Modules | Packages | Two Marks
Questions with Answers | Multiple Choice Questions

Common to all 1st Semester

HOME | EEE | ECE | MECH | CIVIL | CSE

1st Semester Anna University EEE- Reg 2021
Professional English – I
2nd Semester 3rd Semester
Matrices and Calculus
Probability and Complex
Professional English - II Functions
Engineering Physics
Statistics and Numerical Electromagnetic Fields
Engineering Chemistry Methods
Problem Solving and Physics for Electrical Digital Logic Circuits
Python Programming Engineering
Electron Devices and
Physics and Chemistry Basic Civil and Mechanical Circuits
Laboratory Engineering
Electrical Machines - I
Engineering Graphics
C Programming and Data
4th Semester Electric Circuit Analysis Structures
Environmental Sciences
and Sustainability 6th Semester
Transmission and 5th Semester
Distribution Protection and
Linear Integrated Power System Analysis Switchgear
Circuits
Power Electronics Power System
Measurements and Operation and Control
Instrumentation Control Systems
Open Elective – I
Microprocessor and
Microcontroller Professional Elective I
Professional Elective IV
Electrical Machines - II Professional Elective II
Professional Elective V
Professional Elective III
7th Semester Professional Elective VI
High Voltage Mandatory Course-I& Mandatory Course-
Engineering II& MC
Human Values and 8th Semester
Ethics
Elective –
Management Project Work /
Internship
Open Elective – II
Open Elective – III
Open Elective – IV
Professional Elective
VII Click on Clouds to navigate other department

https://www.poriyaan.in/