Course Structure for

B. Tech. Programmes
For Academic Year 2023-24 onwards
The Course Structure for B. Tech. Programmes shall have the following categories of courses: -

Course Categories :

Sr. No. Category

1. Institute Core (IC)
2. Non-Conventional Institute Core (NC)
3. Program Core (PC)
4. Program Elective (PE)
5. Open Elective (OE)

Course category explanation:

Course category Explanation

IC Basic Sciences
Engineering Arts and Sciences
Humanities and Social Sciences
PC Courses specific to the relevant discipline
PE Elective Courses specific to the relevant discipline
OE Elective Courses from any domain
NC Courses only qualifying in nature

Department Abbreviations to be used in Course Codes

Department Department
Abbreviation
CE Civil Engineering
ME Mechanical Engineering
CS Computer Engineering
CH Chemistry
PH Physics
HS Humanities
MA Mathematics
EE Electrical Engineering
SW Student Welfare
EC Electronics & Communication Engineering
PI Production & Industrial Engineering
IT Information Technology

1
 SEMESTER-II (BATCH 2023 onwards)

Lecture (L) / Tutorial

Sr. Course Course (T) / Practical (P)
Course Title Credits
No. Category Code per week
L T@ P
Communication Skills in English (for EE,
CE, ECE, ME & PIE) HSIC 101 2 0 2
OR
Financial Education
HSIC 103 3 0 0
(for EE, CE, ECE, ME & PIE)
1. 3#
Economics for Engineers (for CoE, IT, AI
HSIC 102
& ML, IIOT and M&C)
OR 3 0 0
Business Studies
HSIC 104
(for CoE, IT, AI & ML, IIOT and M&C)
Integral Calculus and Difference
2. MAIC 102 3 0 0 3
Equations
Advanced Engineering Physics
PHIC 102 3 0 2
(for CE, ME & PIE)
IC Advanced Engineering Physics
PHIC 103 3 0 2
(for ECE)
Advanced Engineering Physics
3. PHIC 104 3 0 2 4
(for EE)
Advanced Engineering Physics
PHIC 105 3 0 2
(For IIoT)
Digital System Design (for CoE, IT, AI &
CSIC 100 4 0 0
ML and M&C)
Engineering Practice (for CE, EE, ME &
MEIC 102 1 0 3
PIE)
4. 2
Engineering Graphics (Web Design) ^
CSIC 102 1 0 3
(For CoE, ECE, IT, AI & ML, IIOT and M&C)
Chemistry (for CE, ME & PIE) CHIC 102 3 0 2
Chemistry (for EE, and ECE) CHIC 103 3 0 2
5. 4
Programming using Python (for CoE, IT,
CSIC 104 3 0 2
AI & ML, IIOT and M&C)
Any one subject from Group-I (for EE,
**NC ### 2 0 0
CE, ECE, ME & PIE)
6. 2#
NC Any one subject from Group-II (for CoE,
**NC ### 2 0 0
IT, AI & ML, IIOT and M&C)
7. NCC/ Sports /Yoga SWNC 101 0 0 2
1*
8. NSS /Clubs/Technical Societies SWNC 102 0 0 2
9. PC Programme specific course **PC ### 3/4 0 2/0 4
Total 22
* Continuous Evaluation Model as per guidelines and the credit to be awarded at the end of 6 th Semester
based on Cumulative performance up to 6th Semester.
^ Treated as a practical course (not integrated), evaluation will be as per practical course
# Minimum number of students required to register for the subject to be offered is 50 and maximum number
is 80 in one lecture group.
@ In lieu of tutorial, wherever necessary, assignments and interactions with the students may be conducted at
their own convenience by the faculty concerned.
** Two letters signifying the Department offering the course
### Three digits indicating course number
3
LIST OF NON-CONVENTIONAL INSTITUTE CORE COURSES:

Group Course Course Code

Human Values and Social Responsibility HSNC 101
Sanskrit Language Skills HSNC 102
Hindi Language Skills HSNC 103
I Telugu Language Skills HSNC 104
Constitution of India HSNC 105
Vedic Mathematics MANC 101
Indian Knowledge Systems HSNC 106
Teachings of Gita HSNC 107
French Language Skills HSNC 108
II German Language Skills HSNC 109
Japanese Language Skills HSNC 110
Thought Lab and Practices HSNC 111
NCC/ Sports /Yoga SWNC 101
III
NSS /Clubs/Technical Societies SWNC 102

NOTE:
1. The examination / evaluation of the theory / practical / integrated courses is proposed to be as per the
existing scheme. However, the attendance component of the awards (10 marks) is proposed to be merged
with the Mid Sem. tests/Viva-voce marks, while the Assessment on Indian Knowledge System through
report/Viva-voce will be part of Teacher assessment component of marks and this component will be
renamed as Teacher & IKS Assessment for theory courses.
2. The focus of concluding lectures should be to emphasize the value addition of the subject and also on
how it impacts the environment. Further, the faculty may suggest possible sustainable
solutions/emerging technologies/innovations towards sustainability in the subject domain.

4
 Evaluation Scheme for B.Tech. programmes

(Applicable for the students admitted in academic year 2023-24 onwards)

SUB-COMPONENT Weightage

(a) Theory Courses

1 Two Mid Semester Exams. 20+20=40
2 Teacher & IKS Assessment (through viva-voce, Home 10
Assignments, on the Spot tests, Short Quizzes etc.)
3 End Semester Examination 50
(b) Practical Courses
1 Mid Semester Evaluation (to be conducted in regular Practical 40
Classes)
2 Teacher Assessment (through viva-voce, lab. reports & class work 20
etc.)
3 End Semester Examination 40
(c) *Integrated Courses (L/T+P)
1 Internal evaluation of theory and practical component of course 50
2 End semester evaluation of theory and practical component of 50
course
(d) For Seminars, Projects, Training, Comprehensive viva, General Fitness evaluation,
the weightage will be decided by Departmental Review/Academic Committees.
(e) For Non-Conventional Institute Core Courses, the evaluation will be done in the
ongoing classes throughout the semester on a regular basis through
assignments/quizzes/viva-voce etc. by respective teachers. These courses being
qualifying in nature; the student will be awarded A+ grade on qualifying the course.
The student who fails to qualify, will be awarded F grade in the course and he/she
will have to qualify the course in the subsequent semesters as re-appear candidate.
Note:
The students must get minimum 40% marks separately in internal and external component of the course to
qualify. In Non-Conventional Institute Core Courses also the student must get minimum 40% marks to qualify
the course.

* Evaluation process and guidelines will be followed as per Annexure-A appended herewith.

5
Evaluation and Grading System

The student will be awarded Letter Grade which indicates the level of performance in a course and has a Grade
Point for the purpose of computing the Cumulative Grade Point Average (CGPA) as per the tables given below:

All Courses (except Non-Conventional Institute Core Courses)

Marks obtained & Grade Performance Grade Point
85 ≤ A+ ≤ 100 Excellent 10
75 ≤ A < 85 Very Good 09
65 ≤ B < 75 Good 08
50 ≤ C < 65 Average 06
40 ≤ D < 50 Pass 04
0 ≤ F < 40 Re-appear 00

Non-Conventional Institute Core Courses

Marks obtained & Grade Performance Grade Point

40 ≤ A+ ≤ 100 Satisfactory 10
0 ≤ F < 40 Re-appear 00

A student who earns an F Grade in a course shall have to re-appear in that course in the subsequent examination
(s).
The CGPA is the weighted average of all the grades and computed as follows:
CGPA = ∑CiGi / ∑Ci
The Ci denotes credits assigned to ith course and Gi indicates the Grade Point equivalent to the Letter Grade
obtained by the student in the ith course.
Note:

The Percentage of marks obtained by a student be calculated as = CGPA multiplied by 9.00.

6
 Annexure-A

Sr.No. Important points Definitions/Process to be followed

related to
evaluation
1. Integrated Courses Where Theory (T) and/or Tutorial (T) and Practical (P) are integral
part. The course no. is unique for theory and practical portion. The L
T P structure would be 2 1 2, 2 0 2 or similar having credits as 3:1, 2:1
or similar.
2. Detention Cases Where total attendance of Theory, Tutorial and Practical parts is less
than minimum required attendance (<75%)
2.1 The students having less than minimum required attendance (i.e. less
than 75%) are declared Detained.
2.2 The detained students having attendance less than 50% have to
compulsorily repeat such course with junior batch
2.3 The detained students having attendance ≥ 50% but < 75% have two
options, as
(i) Repeat Theory and Practical part of the course
(ii) Opt ‘D’ Grade in the course. For this, students are required to fill
up the relevant form available at Institute website. Students will
be allowed to appear in the end semester exam. (theory as well as
practical), but after clearing, he/she will be awarded only ‘D’
grades.

3. Evaluation Process (i) Internal Evaluation (50 marks)

(ii) End Sem. Evaluation (50 marks)

Sample example for Internal Evaluation of 50 marks is further having weightage of Theory
evaluation process is and Practical parts according to Credit assigned to them. Thus 50
enclosed as 3.1 marks of internal component of Theory part and 60 marks of Internal
Annexure-I. component of Practical part are mapped into 50 marks each and then
their weightage is computed as per the ratio of credits shared by them.
External Evaluation of 50 marks is similarly having weightage of
Theory and Practical parts according to Credit assigned to them. Thus
50 marks of External component of Theory and 40 marks of External
3.2 component of Practical are mapped into 50 marks each and then their
weightage is computed as per the ratio of credits shared by them.
4. Passing the Course To pass Internal components, the student must secure 40% marks out
4.1 of 50 marks i.e. 20 marks.
4.2 To pass External components, the student must secure 40% marks out
of 50 marks i.e. 20 marks and the student should not remain absent in
End semester exam of Theory and Practical part.
4.3 If a student remains absent in End semester exam. of Theory and/or
Practical part, then he/she will be declared re-appear in End Sem.
Evaluation irrespective of total marks obtained. In such case, he/she
has to re-appear in End Sem. Exam. of Theory as well as Practical part.
Award of Grades The Grades in the courses shall be awarded on the basis of total marks
obtained in Internal Evaluation and End Sem. Evaluation if not opted
for D grade as per 2.3 (ii).
5. Re-appear (I) Reappear in Internal Evaluation (Theory and Practical)
(E) Reappear in End Sem. Evaluation (Theory and Practical)

7
5.1 The student who is not detained and scores less than 40% marks in
Internal evaluation shall be declared re-appear in Internal component,
in such case, the student must re-appear as sessional improvement in
Theory as well as Practical part of the course.
5.2 The student who is not detained, scores less than 40% marks in End
Semester evaluation and not appeared in End Semester Evaluation of
Theory or Practical or both shall be declared re-appear in End Semester
Component. In such case, the student must re-appear in End Sem.
Exam. of Theory as well as Practical part of the course.

8
 Table of Multiplying Factor for theory and practical
Annexure-I components according to Credit D
Sr. Total Theory Practical Theory Practical
Example of Evaluation Procedure for Integrated Courses No. Credits Credit Credit Multiply Multiply
Integrated Course of the Factor Factor
Course
Structure: L:T:P C 1 4 3 1 3/4 =0.75 1/4 = 0.25
2:1:2 4 Credits: Th.(L+T) + 2 4 2 2 2/4 = 0.50 2/4 = 0.50
Pr(P) 3 4 1 3 1/4 = 0.25 3/4 =0.75
4 3 2 1 2/3 = 0.66 1/3 = 0.33
Total Credits: 3+1=4
5 3 1 2 1/3 = 0.33 2/3 = 0.66
T 6 2 1 1 1/2 = 0.50 1/2 = 0.50
x p q p/x q/x
End Semester
Internal Evaluation
Evaluation out of
out of 50 marks
50 marks

A & B are in proportion to the C & D are in proportion to the

credit shared by L+T & P i.e. 3:1 credit shared by L+T & P i.e. 3:1

B C D
A

Theory Weightage (50*0.75) Practical Weightage (50*0.25) = Theory Weightage (50*0.75) Practical Weightage (50*0.25) =
=37.5 Marks 12.5 Marks =37.5 Marks 12.5 Marks

If a student gets J marks out of If a student gets K marks out of If a student gets P marks out of If a student gets Q marks out of
50, his/her evaluation for his 60, his/her evaluation for this 50, his/her evaluation for his 40, his/her evaluation for his
part is = (J/50)*37.5 part is = (K/60)*12.5 marks part is = (P/50)*37.5 marks part is = (Q/40)*12.5) marks

A+B out of 50, External= C+D out of 50, Total= (A+B+C+D) out of 100

9
Attendance requirement for being eligible to appear in the end semester examinations

Minimum requirement of attendance for being eligible to appear in the end semester
examinations shall be 75%.
However, this may be relaxed upto a maximum of 10% i.e. upto 65% by the Director. An extra
relaxation of upto 5%, over and above the already existing relaxation of a maximum of 10%,
may be granted by the Director under special circumstances, on the specific recommendations
of concerned HoD/School Coordinator, to meet the minimum attendance requirement of 75%.
Those having attendance below 65% are not allowed to appear for the end-semester examination
of that/those course (s) and shall be notified as ‘Detained’. All such students, depending upon
their attendance shall be further categorized into two categories A & B, as follows:
Category A: (Attendance between 50 % to 64 %) A student has two
options
Option 1: To repeat the course through classroom/lab studies and obtain whatever grade
he/she can obtain
Option 2: He/She is permitted to attend classes of the next semester and can appear for the
mid-semester examinations of that/those course(s) when the opportunity is
available. However, such student is restricted to a grade of ‘D’ only.
Category B: (Attendance below 50%) Such students have to mandatorily repeat that/those
course (s).

A Tabular presentation is given below:

Attendance Course of Action

75%or more Eligible to appear for the End- semester examination

65% - 74% Eligible to appear for the End- semester examination with the permission
of the Director

50% - 64% Detained

Two options
a) Repeat the course (s) through classroom / lab teaching
b) To appear for mid-semester examination in that/those course(s) and settle
for a max of ‘D’ grade

Below 50% Detained

To repeat classes

10
 DEPARTMENT OF HUMANITIES & SOCIAL SCIENCES
Programme: B. Tech
Course Title: Business Studies
Course Category: IC Internal: 50 Marks
Course Code: HSIC 104 Theory: 50 Marks
Credits: 3 (L-2, T-1) Total: 100 Marks
Semester: 1st/2nd Time: 3 hrs
Course Objectives
 The course is designed to introduce the concepts of business to the students.
 The course aims to acquaint the students about business processes from beginning to
the end.
Unit I: Fundamentals of Business
Business: Meaning and Characteristics of Business, Objectives of Business. Classification of
Business Activities: Industry and Commerce, Industry types: Primary, Secondary and Tertiary.
Types of Businesses: Sole Proprietorship, Partnership, Limited Liability Company, Private and
Public company. Formation of Company: stages and required documents.
Unit II: Sources of Business Finance
Business Finance: Concept and Importance. Types of Sources of Finance: Long-term Sources
(Equity Shares, Preference shares, Debentures, Term Loans, Retained earnings, Loan from
financial institutions, etc.), Short Term Sources (Trade Credit, Accrued Expenses, Commercial
Papers, Public Deposits etc.)
Unit III: Small Business and Entrepreneurship Development
Entrepreneurship Development (ED): Concept, Characteristics and Need. Process of
Entrepreneurship Development: Start-up India Scheme, Intellectual Property Rights and
Entrepreneurship. Small Scale Enterprise: Classification and Roles; Issues and Challenges
faced by Small Scale Enterprises, Government schemes for small scale industries.
Unit IV: Business Services and Social Responsibility of Businesses
Business services: Meaning and Types, Emerging Modes of Business, E-business: Concept,
Scope and Benefits, E-commerce, EDI, Web-based Marketing, Role of Internet and Risk
Management; Social Responsibility of Business. Role of Business in Sustainable Development.
Course Outcomes
 The course would help the students in understanding different forms and numerous
processes of a business.
 The course would sensitize the students to practice the ethical behaviour of the
businesses.
Suggested Readings
Business Studies: Learners Book, Oxford Successful
Business Studies: 2018/19 Undergraduate Guide, University of Huddersfield
Business Studies: Fourth Edition, Ian Chambers and David Gray, CP.

16
 Course Code L-T-P-C
Integral Calculus and Di↵erence Equations
MAIC 102 3-1-0-4

Pre-Requisites:
The basic knowledge of Di↵erentiation, Integration, Summation, Scalars,
Vectors and Trigonometrical functions.
Course Objective:
1. To provide the students with sufficient knowledge of Integral
Calculus and its applications.
2. To have the knowledge of vector calculus and its physical inter-
pretation with applications.
3. To have the idea of di↵erence equation and Z-transforms with
engineering applications.
4. To have the knowledge of fundamental concept of Fourier series
and its applications.

Unit 1: 8L
Power Series Solutions and Special Functions: The Strum-
Liouville Problem, Orthogonality of eigen functions, Ordinary and
singular points of an equation, Series solution about an ordinary
point using Power series solutions, Series solution about a regular
singular point using Frobenius method, Solution of Legendre’s and
Bessel’s di↵erential equations, Legendre’s and Bessel’s functions.

Unit 2: 8L
Multiple Integrals:Evaluation of double integrals (Cartesian and
polar coordinates), Change of order of integration, Change of vari-
ables between cartesian and polar coordinates, Applications of Dou-
ble Integrals, Triple integrals, Change of variables between Cartesian,
cylindrical and spherical polar co-ordinates, Applications of triple in-
tegrals, Beta and Gamma functions, Dirichlet integrals.

Scheme and Syllabi 13 w.e.f. 2023 - 24

67
Unit 3: 8L
Vector Calculus :Scalar and vector valued functions, Gradient of a
scalar point function and its geometrical interpretation, Directional
derivative, Divergence and curl of a vector point function and their
physical interpretations, Statement of vector identities, Scalar and
velocity potentials, Line, surface and volume integrals, Statement
of Green’s, Stoke’s and Gauss divergence theorems, Verification and
evaluation of vector integrals using these theorems.

Unit 4: 8L
Di↵erence Equations and Z - Transforms:Di↵erence Equation-
Definition of Di↵erence equation, First and second order di↵erence
equations with constant coefficients, Fibonacci sequence, Solution of
di↵erence equations (complementary functions and particular inte-
grals).
Z-transform- Definition of Z-transform, Relation between Z- trans-
form and Laplace transforms, Z-transforms of standard functions, In-
verse Z-transforms, Inverse Z-transforms by partial fraction method,
Inverse Z-transforms by convolution method, Solution of simple dif-
ference equations using Z-transforms.

Unit 5: 8L
Fourier Series: Fourier series, Euler’s formula, Dirichlet’s condi-
tions, Fourier series expansion of functions having point of discon-
tinuity, Change of interval, Expansion of even and odd functions,
Half range series, Typical wave-forms, Parseval’s formula, Practical
Harmonic Analysis.

Text Books:
1. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edi-
tion, Wiley India Pvt. Ltd., 2011.

Scheme and Syllabi 14 w.e.f. 2023 - 24

68
 Course Code : CSIC 100
Course Title : Digital System Design
Number of Credits : 4
Prerequisites :
Course Type : IC

Course Learning Objectives:

1. Awareness of intricate design details of components in any digital system.
2. Knowledge of number system and conceptual understanding of different codes.
3. Design fundamentals of computing machinery.
4. Introduction of computational automation process.
Course Content:
1. Number Systems and Coding Schemes:
Number Systems and Codes Introduction to the positional number system, signed magnitude numbers,
floating point numbers, binary arithmetic: addition, subtraction, multiplication and division, Base
conversion, conversion formulas with examples, one’s and two’s compliment arithmetic, Computer codes
– BCD codes, gray codes, excess-3 codes, parity checks, Hamming and alphanumeric codes.
2. Combinational Logic:
Design Introduction, standard representations for logical functions, Karnaugh map representation,
simplification of logical functions using K-map, minimization of logical functions specified in
minterms/maxterms or Truth Table, minimization of logical functions not specified in
minterms/maxterms, Don’t care conditions, design examples, Ex-or and Ex-nor simplification of Kmaps,
five and six-variable K-maps, QM method, MEV method, Introduction of multiplexers and their use in
combinational logic design, demultiplexers/decoders and their use in combinational logic design, adders
and their use as subtractors, digital comparators, parity generators/checkers, code converters, priority
encoders.
3. Synchronous Sequential Circuits:
Introduction, FSM model, memory elements and their excitation functions. Synthesis of synchronous
sequential circuits, capabilities and limitation of FSM, state equivalence and minimization, simplification
of incompletely specified machines, registers and counters, RAM design, ROM design and programmable
logic array.
4. Asynchronous Sequential Circuits:
Fundamental mode and Pulse mode Circuits Analysis and Design.
Books:
1. M. Morris Mano and Michael D. Ciletti: Digital Logic Design, Sixth Edition, Pearson Education.
2. R.P. Jain: Modern Digital Electronics, Fifth Edition, TMH.
3. Z Kohavi and Niraj. K. Jha: Switching And Finite Automata Theory, Third Edition, Cambridge University
Press.
4. Kumar A. Anand: Fundamentals of Digital Circuits, Fourth Edition, PHI.
5. James Bignell and Robert Donovan: Digital Electronics, Fifth Edition, Cengage Learning.

Course Outcomes:
1. Clarity of application of different number system and coding schemes.
2. Proficiency in design and analysis of combinational and sequential circuits.
3. Circuit level understanding of computer addressing and memory layouts.
4. Application of digital circuits for design of finite automaton.

79
 Course Code : CSIC 102
Course Title : Engineering Graphics (Web Design)
Number of Credits : 2.5
Prerequisites :
Course Type : IC

Course Learning Objectives:

1. Introduction and brief history of World Wide Web (WWW).
2. Web essentials: HTML, XHTML, CSS.
3. Addressing web standards, client requirements and principles of web page design.
4. Introduction of Web architecture.

Course Content:
1. Introduction: Introduction to world wide web, Web Browsers, Web Servers, Hypertext Transfer Protocol,
URLs, Domain Names, Internet Service Provider, Basic steps for Developing Website, Choosing the
Contents, Planning and Designing Web Site, Creating a Website, Web Publishing, Hosting Site, Types of
hosting packages, Five Golden rules of web designing.

2. Web essentials and standards: Clients, servers, introduction to Markup languages, scripting languages,
Introduction to elements of HTML, XHTML and CSS, Introduction to Document object model (DOM),
working with text, list, tables, frames, hyperlinks, Images, forms and controls. CSS properties, Id and
Class, Box Model.

3. Javascript: Javascript as programming language, Data types, Values, Variables, Expressions and
Operators. JavaScript Statements, loops, arrays, strings, methods, Defining and Invoking functions and
their closure, random functions and maths library, representing dates, Pattern Matching and Regular
Expressions, difference between server side and client side javascript, embedding javascript in HTML,
hiding HTML elements, showing hidden HTML elements. DOM and event handling, error handling,
mouse, text, and keyboard events and cookies.

4. XML: XML: Introduction – benefits of XML, well formed XML documents, XML syntax, XML
declaration ,XML schema , XML with CSS, Document Type Definition (DTD),creating DTD –
Types(internal DTD, external DTD),XSL.
Reference Books:
1. Thomas A Powell, HTML: The Complete Reference, Tata McGraw Hill Publications.
2. Scott Guelich, Shishir Gundavaram, Gunther Birzniek; CGI Programming with Perl 2/e,O’Reilly
3. Doug Tidwell, James Snell, Pavel Kulchenko; Programming Web Services with SOAP, O’Reilly
4. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition, Pearson Education,2007.
5. Yong, XML Step by Step, PHI.
6. Chris Bales, “Web programming- Building Internet Application”.
7. Deitel, Deitel, Goldberg, "Internet & World Wide Web How To Program", Third Edition,Pearson
Education, 2006.
8. Marty Hall and Larry Brown, “Core Web Programming” Second Edition, Volume I and II,Pearson
Education, 2001.
9. Bayross Ivan, “Web Enabled Commercial Applications Development using HTML, Javascript,
DHTML & PHP”, BPB Publication, 2005.

Course outcomes
1. Knowledge of basic principles of web site design.
2. Design proficiency of websites adhering to current web standards (HTML, XML, CSS).
3. Knowledge of various scripting languages.

80
 Course Code : CSIC 104
Course Title : Programming using Python
Number of Credits : 4
Prerequisites :
Course Type : IC

Course Learning Objectives:

1. Building robust applications using Python programming.
2. Building multithreaded, platform-independent and GUI based python applications for business problems.

Course Content:
1. The concept of data types:
Variables, Assignments; Immutable Variables; Numerical Types; Arithmetic Operators And Expressions;
comments in the program; understanding error messages; Conditions, boolean logic, logical operators;
ranges; Control statements: if-else, loops (for, while); short-circuit (lazy) evaluation; Strings and text files;
manipulating files and directories, os and sys modules; text files: reading/writing text and numbers from/to
a file; creating and reading a formatted file (csv or tab-separated); String manipulations: subscript
operator, indexing, slicing a string.

2. Lists, tuples, and dictionaries:

Basic list operators, replacing, inserting, removing an element; searching and sorting lists; dictionary
literals, adding and removing keys, accessing and replacing values; traversing dictionaries; Design with
functions: hiding redundancy, complexity; arguments and return values; formal vs actual arguments,
named arguments.

3. Simple Graphics and Image Processing:

“turtle” module; simple 2d drawing - colors, shapes; digital images, image file formats, image processing:
Simple image manipulations with 'image' module (convert to bw, greyscale, blur, etc). Classes and OOP:
classes, objects, attributes and methods; defining classes; design with classes, data modeling; persistent
storage of objects; inheritance, polymorphism, operator overloading (_eq_, _str_, etc); abstract classes;
exception handling, try block

4. Graphical user interfaces:

Event-driven programming paradigm; tkinter module, creating simple GUI; buttons, labels, entry fields,
dialogs; widget attributes - sizes, fonts, colors layouts, nested frames.

Reference Books:
1. T.R. Padmanabhan, Programming with Python, Springer, 1st Ed., 2016.
2. Kenneth Lambert, Fundamentals of Python: First Programs, Cengage Learning,, 1st Ed., 2012.

Course outcomes:
1. Programming ability for solving simple business problems.
2. Design of robust and multithreaded python applications.
3. Familiarity of simple GUI interfaces.

88
 Program Specific Course
Course Code : CSPC 100/ITPC 100
Course Title : Data Structures
Number of Credits : 4
Prerequisites : Problems Solving and Programming Skills
Course Type : PC

Course Learning Objectives

1. This course introduces the concept of Data Structures used in various computer science applications
2. The students are introduced to understand and efficiently apply various data structures such as stacks,
queues, linked lists, trees and graphs for solving various computing problems using C programming
language.

Course Content
1. Pointers & File Handling:
Revision of Pointers and Dynamic Memory, Files and related operations.
Searching techniques: Linear and Binary, Sorting techniques: Selection, Bubble, Insertion, Merge sort,
Quicksort.

2. Simple Data Structures

Arrays based Linear Data Structures: Array storage, sparse arrays; Transpose, addition, and multiplication
of sparse matrices, Stacks and Queues and their applications, multiple stacks and queues in an array.

3. Linked Data Structures

Singly, Doubly & Circular Linked Lists; representation, operations and applications, linked stacks and
queues. linked lists based polynomial addition.

4. Advanced Data Structures

Trees, Basic concepts and definitions of a tree and binary tree and associated terminology, Binary tree
traversal techniques, some more operations on binary trees, Heaps and heapsort.

Reference Books:
1. E Horowitz and S. Sahni: Fundamentals of Data Structures in C, Second Edition, Universities Press,
Hyderabad.
2. R.L. Kruse: Data Structures & Program Design in C, PHI.
3. D.F. Knuth: The art of Computer Programming Vol-1, Narosa Publications, 1985.
4. Byron S. Gottfried & J K Chhabra: Theory and Problems of Programming with C Language, Schaum’s
Outlines Series, TMH, 2005.

Course Outcomes
1. Develop skill to identify and determine the usage of various data structures, operations, associated
algorithms and implement their applications.
2. Apply knowledge of pointers, memory allocation and string handling for solving programming problems.
3. Understand the concept of trees and graphs, their implementation and applications.
4. Able to implement standard algorithms for searching and sorting.
5. Analyze efficiency of different algorithms using time and space complexity.

91