SCHEME AND SYLLABUS FOR FIRST & SECOND YEARS

OF
FOUR YEAR UNDER GRADUATE DEGREE COURSE
B. TECH (COMPUTER SCIENCE & ENGINEERING)
[W.E.F. 2022 - 2023 ADMITTED BATCH]

DEPARTMENT OF COMPUTER SCIENCE & SYSTEMS

ENGINEERING
ANDHRA UNIVERSITY COLLEGE OF ENGINEERING
ANDHRA UNIVERSITY
VISAKHAPATNAM-530 003
 ANDHRA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SYSTEM ENGINEERING
SCHEME AND SYLLABI
(With effect from 2022-23 admitted batch)
Common for CSE & IT

B.Tech & B.Tech + M.Tech

(Computer Science & Engineering)
I Year – I Semester

Hours per
Course Internal External Total Credits
Category Course Title week
code Marks Marks Marks
L P
CS1101 BS Engineering 4 0 30 70 100 3
Mathematics –I
CS1102 BS Green Chemistry 4 0 30 70 100 3
CS1103 HSS English 4 0 30 70 100 3
CS1104 ES Computer Programming 4 0 30 70 100 3
Using C
CS1105 ES IT Essentials 4 0 30 70 100 3
Communication skills
CS1106 HSS 0 3 50 50 100 1.5
Lab
CS1107 ES Computer Engineering 0 3 50 50 100 1.5
Workshop Lab
CS1108 ES Computer Programming 0 3 50 50 100 1.5
using C lab
Total Credits 19.5

B.Tech & B.Tech + M.Tech

I Year-II Semester

Hours
Course Internal External Total Credits
Category Course Title per week
code Marks Marks Marks
L P
CS1201 BS Engineering
Mathematics–II 4 0 30 70 100 3
CS1202 BS Engineering Physics 4 0 30 70 100 3
Elements of
CS1203 ES
Electronics 4 0 30 70 100 3
Engineering
CS1204 ES Data Structures
Using C
4 0 30 70 100 3
Digital Logic
CS1205 ES 4 0 30 70 100 3
Design
CS1206 ES Linux
Administration Lab
0 3 50 50 100 1.5
CS1207 BS Engineering Physics
Lab
0 3 50 50 100 1.5
Data Structures
CS1208 ES 0 3 50 50 100 1.5
Lab
Total Credits 19.5
 B.Tech & B.Tech + M.Tech
(Computer Science & Engineering)
II Year - I Semester

Hours
Course Internal External Total Credits
Category Course Title per week
code Marks Marks Marks
L P
Discrete Mathematical
CS2101 ES 4 0 30 70 100 3
Structures
Computer Organization and
CS2102 PC 4 0 30 70 100 3
Architecture
Probability, Statistics and
CS2103 BS 4 0 30 70 100 3
Queuing theory
CS2104 PC Operating Systems 4 0 30 70 100 3
Object Oriented
CS2105 PC 4 0 30 70 100 3
Programming Through Java
Computer Organization &
CS2106 PC 0 3 30 70 100 1.5
Architecture Lab
Object Oriented
CS2107 PC Programming Through Java 0 3 50 50 100 1.5
Lab
CS2108 PC Operating Systems Lab 0 3 50 50 100 1.5
Intellectual Property Rights
CS2109 SC 1 2 100 0 100 2
(Internal)
CS2110 MC Environmental Science 0 0 - 100 100 0
Total credits 21.5
B.Tech & B.Tech + M.Tech
II Year - II Semester

Hours
Course Internal External Total
Category Course Title per week Credits
code Marks Marks Marks
L P
CS2201 ES Microprocessors 4 0 30 70 100 3
Design and Analysis of
CS2202 PC 4 0 30 70 100 3
Algorithms
Database Management
CS2203 PC 4 0 30 70 100 3
Systems
Formal Languages &
CS2204 PC 4 0 30 70 100 3
Automata Theory
CS2205 HSS Managerial Economics 4 0 30 70 100 3
Algorithms Lab through
CS2206 PC 0 3 50 50 100 1.5
C++.
Database Management
CS2207 PC 0 3 50 50 100 1.5
Systems Lab
CS2208 SC Web Technologies 1 2 50 50 100 2
Professional Ethics &
CS2209 MC 0 0 0 100 100 0
Universal Human Values
CS2210 MC NCC/NSS 0 2 - - - 0
Total credits 20
Internship-I
 B.Tech & B.Tech + M.Tech
(Computer Science & Engineering)
I Year – I Semester

Hours per
Course Internal External Total Credits
Category Course Title week
code Marks Marks Marks
L P
CS1101 BS Engineering 4 0 30 70 100 3
Mathematics –I
CS1102 BS Green Chemistry 4 0 30 70 100 3
CS1103 HSS English 4 0 30 70 100 3
CS1104 ES Computer Programming 4 0 30 70 100 3
Using C
CS1105 ES IT Essentials 4 0 30 70 100 3
Communication skills
CS1106 HSS Lab 0 3 50 50 100 1.5
CS1107 ES Computer Engineering 0 3 50 50 100 1.5
Workshop Lab
CS1108 ES Computer Programming 0 3 50 50 100 1.5
using C lab
Total Credits 19.5
CS1101 ENGINEERING MATHEMATICS-I

Course Objectives
• To transmit the knowledge of Partial differentiation.
• To know of getting maxima and minima of function of two variables and finding errors
and approximations.
• To evaluate double and triple integrals, volumes of solids and area of curved surfaces.
• To expand a periodical function as Fourier series and half-range Fourier series
Course Outcomes
• Find the partial derivatives of functions of two or more variables.
• Evaluate maxima and minima, errors and approximations.
• Evaluate double and triple integrals, volumes of solids and area of curved surfaces.
• To expand a periodical function as Fourier series and half-range Fourier series.
• Have a fundamental understanding of Fourier series and be able to give Fourier
expansions of a given function.

SYLLABUS

Partial Differentiation: Introduction - Functions of two or more variables - Partial derivatives

- Homogeneous functions – Euler’s theorem - Total derivative - Change of variables – Jacobins.
Mean value Theorems (without proofs)

Applications of Partial Differentiation: Geometrical interpretation -Tangent plane and

Normal to a surface -Taylor’s theorem for functions of two variables - Errors and
approximations -Total differential. Maxima and Minima of functions of two variables -
Lagrange’s method of undetermined multipliers - Differentiation under the integral Sign -
Leibnitz’s rule.

Multiple Integrals: Introduction - Double Integrals - Change of Order of Integration - Double

Integrals in Polar Coordinates - Triple Integrals - Change of Variables.

Multiple Integrals-Applications: Area enclosed by plane curves - Volumes of solids - Area

of a curved surface - Calculation of Mass - Centre of gravity - Moment of inertia - product of
inertia – principal axes- Beta Function - Gamma Function - Relation between Beta and Gamma
Functions. Error Function or Probability Integral.

Fourier Series: Introduction - Euler’s Formulae - Conditions for a Fourier Expansion -

Functions having points of discontinuity - Change of Interval - Odd and Even Functions -
Expansions of Odd or Even Periodic Functions, Half-Range Series - Parseval’s Formula.
Practical Harmonic analysis

Text Book
1. Scope and Treatment as in “Higher Engineering Mathematics”, by Dr. B.S. Grewal,
43rd Edition, Khanna publishers.
Reference Books
1. Graduate Engineering Mathematics by V B Kumar Vatti., I.K.International publishing
house Pvt. Ltd.
2. Advanced Engineering Mathematics by Erwin Kreyszig.
3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish Goyal, Lakshmi
Publications.
4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Company
5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill Company. 6.
6. Higher Engineering Mathematics by Dr. M.K.Venkataraman.

*****
CS1102 GREEN CHEMISTRY

Course Objectives:

 To apply the basic knowledge of Chemistry to the Engineering Discipline.

 To develop knowledge about water and its treatment for industrial and potable
purposes.
 To develop understanding in the areas of Batteries, Fuels Mechanism of Corrosion of
Metals and Corrosion Control Methods, Green Chemistry and Technology and
Processes involving Green Chemistry and apply the knowledge for solving existing
challenges faced in various engineering and societal areas.

Learning outcome:

 The students are able to apply the basic concepts and principles studied in Chemistry
to the field of Engineering.
 The students are able to apply chemistry to different branches of engineering
 The students are able to acquire the knowledge in the areas of Water Chemistry,
Mechanism of Corrosion of Metals and Corrosion Control Methods, Batteries, Fuel
Cells, Green Chemistry and Technology and Processes involving Green Chemistry and
suggest innovative solutions for existing challenges in these areas.

SYLLABUS

Water Technology
Sources of Water – Impurities and their influence of living systems – WHO Limits – Hardness
and its Determination – Boiler Troubles and their removal – Water Softening Methods – Lime-
Soda, Zeolite and Ion Exchange - Municipal Water Treatment-Break Point Chlorination –
Desalination of Sea Water – Reverse Osmosis Method, Electro-dialysis.

Batteries
Primary batteries: The chemistry - Types: Zinc-carbon (Leclanche type), zinc alkaline
(Duracell), zinc/air batteries; Lithium primary cells – liquid cathode, solid cathode and lithium-
ferrous sulphide cells. Secondary batteries: Lead acid and VRLA (valve regulated (sealed) lead
acid), nickel-cadmium, nickel-zinc, nickel-metal hydride batteries, lithium ion batteries,
ultrathin lithium polymer cells. Advanced Batteries for electric vehicles, requirements of the
battery – sodium-beta and redox batteries.

Fuel Cells
Fuel Cells: Description, working principle, anodic, cathodic and cell reactions, fabrication of
electrodes and other components, applications, advantages, disadvantages and environmental
aspects of the following types of fuel cells: Proton Exchange Membrane Fuel Cells, alkaline
fuel cells, phosphoric acid, solid oxide, molten carbonate, direct methanol fuel cells-
Membranes and Fuels

Corrosion
Corrosion: Origin and Theory – Types of Corrosion: Chemical and Electrochemical; Pitting,
Inter granular, Waterline, Stress – Galvanic Series – Factors Effecting Corrosion. Corrosion
Controlling Methods, Protective Coatings, Metallic Coatings, Electroplating and Electroless
Plating.

Green Chemistry and Technology

Introduction and significance of green chemistry, Goals of green chemistry, 12 principles of
green chemistry, toxicity of chemicals, material safety data sheet (MSDS), concept of zero
pollution technologies, atom economy, functional toxicity vs non-functional toxicity,
functional group approaches to green chemistry, Elimination of toxic functional group,
optimization of frameworks for the design of greener synthetic pathways, Applications of green
chemistry - Green solvents, green fuels and propellants, biocatalysis.

Text Books

1. Engineering Chemistry – PC Jain and M. Jain – Dhanpath Rai and Sons, New Delhi.
2. A Text book of Engineering Chemistry – S. S. Dara – S. Chand & Co. New Delhi.
3. Hand Book of Green Chemistry and Technology; by James Clarke and Duncan
Macquarrie; Blakwell Publishing.
*****
CS1103 ENGLISH

Course Objectives
• To make students understand the explicit and implicit meanings of a text/topic;
• To give exposure to new words and phrases, and aid to use them in different contexts;
• To apply relevant writing formats to draft essays, letters, emails and presentations; and
• To adapt oneself to a given situation and develop a functional approach to finding
solutions: adaptability and problem solving.
Course Outcomes
• Students will be able to analyse a given text and discover the various aspects related to
language and literature;
• Learn the various language structures, parts of speech and figures of speech;
• Develop one’s reading and writing abilities for enhanced communication; and
• Learn to apply the topics in real-life situations for creative and critical use.

SYLLABUS

On the conduct of life: William Hazlitt

Life skills: Values and Ethics
If: Rudyard Kipling
The Brook: Alfred Tennyson
Life skills: Self-Improvement
How I Became a Public Speaker: George Bernard Shaw
The Death Trap: Saki
Life skills: Time Management
On saving Time: Seneca
Chindu Yellama
Life skills: Innovation
Muhammad Yunus
Politics and the English Language: George Orwell
Life skills: Motivation
Dancer with a White Parasol: Ranjana Dave
Grammar: Prepositions – Articles – Noun-Pronoun Agreement, Subject-Verb Agreement –
Misplaced Modifiers–Clichés, Redundancies.

Vocabulary: Introduction to Word Formation – Root Words from other Languages –Prefixes
and Suffixes–Synonyms, Antonyms– Common Abbreviations
Writing: Clauses and Sentences – Punctuation – Principals of Good Writing – Essay Writing
– Writing a Summary
Writing: Essay Writing
Life skills: Innovation
Muhammad Yunus
Textbook
1. Language and Life: A Skills Approach Board of Editors, Orient Blackswan Publishers,
India.2018.
References
1. Practical English Usage, Michael Swan. OUP. 1995.
2. Remedial English Grammar, F.T. Wood. Macmillan.2007
3. On Writing Well, William Zinsser. Harper Resource Book. 2001
4. Study Writing, Liz Hamp-Lyons and Ben Heasly. Cambridge University Press. 2006.
5. Communication Skills, Sanjay Kumar and Pushp Lata. Oxford University Press. 2011.
6. Exercises in Spoken English, Parts. I-III. CIEFL, Hyderabad. Oxford University Press.

******
CS1104 COMPUTER PROGRAMMING USING C

Course Objectives
• The course is designed to provide complete knowledge of C language.
• To provide students with understanding of code organization and functional
hierarchical decomposition with using complex data types.
• To provide knowledge to the students to develop logics which will help them to create
programs, applications in C.
• This course aims to identify tasks in which the numerical techniques learned are
applicable and apply them to write programs, and hence use computers effectively to
solve the task.
• This course provides the fundamental knowledge which is useful in understanding the
other programming languages.

Course Outcomes
• Identify basic elements of C programming structures like data types, expressions,
control statements, various simple functions and apply them in problem solving.
• Apply various operations on derived data types like arrays and strings in problem
solving.
• Design and implement of modular Programming and memory management using
Functions, pointers.
• Apply Structure, Unions and File handling techniques to Design and Solve different
engineering programs with minimal complexity.
• Apply Numerical methods to Solve the complex Engineering problems.

SYLLABUS

Introduction to C: Basic structure of C program, Constants, Variables and data types,

Operators and Expressions, Arithmetic Precedence and associativity, Type Conversions.
Managing Input and Output Operations Formatted Input, Formatted Output.

Decision Making, Branching, Looping: Decision making with if statement, Simple if

statement, The if…else statement, Nesting of if…else statement, the else.. if ladder, switch
statement, the (?:) operator, the GOTO statement., The while statement, the do statement, The
for statement, Jumps in Loops.
Arrays & Strings: One, Two-dimensional Arrays, Character Arrays. Declaration and
initialization of Strings, reading and writing of strings, String handling functions, Table of
strings.

Functions: Definition of Functions, Return Values and their Types, Function Calls, Function
Declaration, Category of Functions: No Arguments and no Return Values, Arguments but no
Return Values, Arguments with Return Values, No Argument but Returns a Value, Functions
that Return Multiple Values. Nesting of functions, recursion, passing arrays to functions,
passing strings to functions, the scope, visibility and lifetime of variables.

Pointers: Accessing the address of a variable, declaring pointer variables, initializing of

pointer variables, accessing variables using pointers, chain of pointers, pointer expressions,
pointers and arrays, pointers and character strings, array of pointes, pointers as function
arguments, functions returning pointers, pointers to functions, pointers to structures-Program
Applications.

Structure and Unions: Defining a structure, declaring structure variables, accessing structure
members, structure initialization, copying and comparing structure variables, arrays of
structures, arrays within structures, structures within structures, structures and functions and
unions, size of structures and bit-fields- Program applications.

File handling: Defining and opening a file, closing a file, Input/ Output operations on files,
Error handling during I/O operations, random access to files and Command Line Arguments-
Program Applications.

Text Books
1. Programming in ANSI C, E Balagurusamy, 6th Edition. McGraw Hill Education (India)
Private Limited.
Reference Books
1. Let Us C ,Yashwant Kanetkar, BPB Publications, 5th Edition.
2. Computer Science, A structured programming approach using C”, B.A.Forouzan and
R.F.Gilberg, “ 3rd Edition, Thomson, 2007.
3. The C –Programming Language’ B.W. Kernighan, Dennis M. Ritchie, PHI.
4. Scientific Programming: C-Language, Algorithms and Models in Science, Luciano M.
Barone (Author), EnzoMarinari (Author), Giovanni Organtini, World Scientific.
CS1105 IT ESSENTIALS

Course Objectives
• Select the appropriate computer components to build, repair, or upgrade personal
computers.
• Explain how to correctly use tools and safely work in a lab.
• Install components to build, repair, or upgrade personal computers.
• Configure computers to communicate on a network
• Configure devices to connect to the Internet and Cloud services
• Explain how to use, configure, and manage laptops and mobile devices

Course Outcomes
• Understands the roles and responsibilities of the IT professional
• Able to Troubleshoot advanced hardware and software problems
• Provides an experience-oriented course that employs industry-relevant instructional
approaches to prepare students for entry-level jobs in the industry.

Syllabus

Introduction to the Personal Computer Describe a Computer System, Identify the Names,
Purposes, and Characteristics of Cases and Power Supplies, Identify the Names, Purposes, and
Characteristics of Internal Components, Identify the Names, Purposes, and Characteristics of
Ports and Cables, Identify the Names, Purposes, and Characteristics of Input Devices, Identify
the Names, Purposes, and Characteristics of Output Devices, Explain System Resources and
Their Purposes.

Safe Lab Procedures and Tool Use Explain the Purpose of Safe Working Conditions and
Procedures, Identify Tools and Software Used with Personal Computer Components and Their
Purposes, Implement Proper Tool Use.

Computer Assembly Attach the Components to the Motherboard and Install the Motherboard,
Install Internal Drives, Install Drives in External Bays, Install Adapter Cards, Connect the
Power Cables Reattach the Side Panels to the Case, Boot the Computer for the First Time.
Basics of Preventive Maintenance and Troubleshooting Explain the Purpose of Preventive
Maintenance, Identify the Steps of the Troubleshooting Process.

Fundamental Laptops and Portable Devices Identify Common Preventive Maintenance

Techniques for Laptops and Portable Devices, Describe How to Troubleshoot Laptops and
Portable Devices.
Fundamental Operating Systems Explain the Purpose of an Operating System, Describe and
Compare Operating Systems to Include Purpose, Limitations, and Compatibilities, Determine
Operating System Based on Customer Needs, Install an Operating System, Identify and Apply
Common Preventive Maintenance Techniques for Operating Systems, Troubleshoot Operating
Systems.

Fundamental Networks Explain the Principles of Networking, Describe Types of Networks,

Describe Basic Networking Concepts and Technologies, Describe the Physical Components of
a Network, Describe LAN Topologies and Architectures.

Fundamental Security: Explain Why Security Is Important, Describe Security Threats,

Identify Security Procedures, Identify Common Preventive Maintenance Techniques for
Security, Troubleshoot Security.

Text books:
1. IT Essentials: PC Hardware and Software Companion Guide Fourth Edition, Cisco
Networking Academy.
References:
1. Network security essentials application and standrads, by William stallings, 4 th edition,
prentice hall.
2. Mike Meyers' CompTIA A+ Guide to Managing and Troubleshooting PCs, Sixth
Edition 6th Edition
CS1106 COMMUNICATION SKILLS LAB

Course Objectives
• To make students recognize the sounds of English through Audio-Visual aids;
• To help students build their confidence and help them to overcome their inhibitions and
self- consciousness while speaking in English;
• To familiarize the students with stress and intonation and enable them to speak English
effectively; and
• To give learners exposure to and practice in speaking in both formal and informal
contexts.

Course Outcomes
• Students will be sensitized towards recognition of English sound patterns and the
fluency in their speech will be enhanced;
• A study of the communicative items in the laboratory will help students become
successful in the competitive world;
• Students will be able to participate in group activities like roleplays, group discussions
and debates; and
• Students will be able to express themselves fluently and accurately in social as well
professional context.

SYLLABUS

Introduction to Phonetics: The Sounds of English (Speech sound – vowels and consonants)
- Stress and Intonation - Accent and Rhythm.

Listening Skills: Listening for gist and specific information - listening for Note taking,
summarizing and for opinions - Listening to the speeches of eminent personalities.

Speaking Skills: Self-introduction - Conversation Skills (Introducing and taking leave) -

Giving and asking for information - Role Play - Just A Minute (JAM) session - Telephone
etiquette.
Reading and Writing skills: Reading Comprehension – Précis Writing - E-Mail writing -
Punctuation.

Presentation skills: Verbal and non-verbal communication - Body Language - Making a

Presentation

Reference Books
1. Ashraf Rizvi. Effective Technical Communication. Tata McGraw Hill Education
Private Limited, New Delhi.
2. Speak Well. Orient Blackswan Publishers, Hyderabad.
3. Allan Pease. Body Language. Manjul Publishing House, New Delhi.

*****
CS1107 COMPUTER ENGINEERING WORKSHOP LAB

Course Objectives
• Explain the internal parts of a computer, peripherals, I/O ports, connecting cables
• Demonstrate basic command line interface commands on LINUX
• Teach the usage of Internet for productivity and self-paced lifelong learning
• Describe about Compression, Multimedia and Antivirus tools
• Demonstrate Office Tools such as Word processors, Spreadsheets and Presentation
tools

Course Outcomes
• Assemble and disassemble components of a PC
• Construct a fully functional virtual machine, Summarize various LINUX operating
system commands.
• Able to Troubleshoot hardware and software problems.

Syllabus

Module I – Hardware Concepts

1. Every student should identify the peripherals of a computer, components in a CPU and
its functions. Draw the block diagram of the CPU along with the configuration of each
peripheral and submit to your instructor. Every student should disassemble and
assemble the PC back to working condition.

Module II – Software Installations

1. Every student should individually install operating system like LINUX or MS windows
on the personal computer. The system should be configured as dual boot with both
windows and LINUX.
2. Hardware Troubleshooting: Students have to be given a PC which does not boot due to
improper assembly or defective peripherals. They should identify the problem and fix
it to get the computer back to working condition.
3. Software Troubleshooting: Students have to be given a malfunctioning CPU due to
system software problems. They should identify the problem and fix it to get the
computer back to working condition.
4. Cyber Hygiene: Students should learn about viruses on the internet and install antivirus
software. Student should learn to customize the browsers to block pop ups, block active
x downloads to avoid viruses and/or worms.
5. Web Browsers, Surfing the Web: Students customize their web browsers with the LAN
proxy settings, bookmarks, search toolbars and popup blockers.
Module III – MS-Office
1. MS Word - Features to be covered: Formatting Fonts in word, Drop Cap in word,
Applying Text effects, Using Character Spacing, Borders and Colours, Inserting
Header and Footer, Using Date.
2. Creating project abstract Features to be covered: Formatting Styles, inserting table,
Bullets and Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink,
Symbols, Spell Check, Track Changes.
3. Creating a Newsletter: Features to be covered: Table of Content, Newspaper columns,
Images from files and clipart, Drawing toolbar and Word Art, Formatting Images,
Textboxes, Paragraphs in word.
4. Spreadsheet Orientation: Accessing, overview of toolbars, saving spreadsheet files,
Using help and resources. Creating a Scheduler: Gridlines, Format Cells, Summation,
auto fill, Formatting Text.
5. Calculating GPA - Features to be covered: Cell Referencing, Formulae in spreadsheet
– average, std. deviation, Charts, Renaming and Inserting worksheets, Hyper linking,
Count function, Sorting, Conditional formatting.
6. Creating Power Point: Student should work on basic power point utilities and tools in
Latex and Ms Office/equivalent (FOSS) which help them create basic power point
presentation. PPT Orientation, Slide Layouts, Inserting Text, Formatting Text, Bullets
and Numbering, Auto Shapes, Lines and Arrows, Hyperlinks, Inserting Images, Tables
and charts.
CS1108 Computer Programming Using C Lab

Course Objectives
• To impart writing skill of C programming to the students and solving problems.
• To write and execute programs in C to solve problems such as Modularize the problems
into small modules and then convert them into programs.,
• To write and execute programs in C to solve problems such as arrays, files, strings,
structures and different numerical methods.
• This reference has been prepared for the beginners to help them understand the basic to
advanced concepts related to Objective-C Programming languages.

Course Outcomes
• Understand various computer components, Installation of software. C programming
development environment, compiling, debugging, and linking and executing a program
using the development environment.
• Analysing the complexity of problems, Modularize the problems into small modules
and then convert them into programs.
• Construct programs that demonstrate effective use of C features including arrays,
strings, structures, pointers and files.
• Apply and practice logical ability to solve the real-world problems.
• Apply Numerical methods to Solve the complex Engineering problems.

Syllabus

Practice the following concepts with algorithm, flow chart and implementation.
1. C – Tokens, Data Types - Format Specifiers, I/O Statements.
2. Operators in C, their Precedence and Associativity, Arithmetic
Expressions/Instructions, Type casting, Math.h functions.
3. Control Statements (Conditional): If and its Variants, Switch (Break).
4. Goto Statement, Control Statements (Looping): While, Do-While, For Loop, Continue
& Break (Unconditional), Nested Loops
5. Arrays, One Dimensional Array: Declaration and Initialization, Accessing Array
Elements.
6. Two Dimensional Array: Declaration and Initialization, Accessing Array Elements.
7. Strings: Read & Write, “String.h” Predefined Functions, without predefined functions.
 8. Pointers: Declarations, Types, Pointers to Arrays, Pointers to Character Strings,
Pointers to Pointers, Array of Pointers
9. Structures: Nested Structures, Pointers to Structures, Unions.
10. Functions: Function Declaration, Classification (Arguments and Return Type), Storage
Classes.
11. Parameter Passing Techniques, Passing Parameters Types, Recursion
12. Files: Opening, Closing of Files, Reading and Writing of Files.
13. Binary Files, Random Accessing of Files, Enum, Typedef, Pre-processor Commands.
14. Numerical methods: Bisection method, Newton Raphson method, Lagrange’s
interpolation, Simpson’s rule for numerical integration.

References:
1. Programming in ANSI C, E Balagurusamy, 6th Edition. McGraw Hill Education (India)
Private Limited.
2. Introduction to Numerical Methods, SS Sastry, Prentice Hall
 B.Tech & B.Tech + M.Tech
(Computer Science & Engineering)
I Year-II Semester

Hours
Course Internal External Total Credits
Category Course Title per week
code Marks Marks Marks
L P
CS1201 BS Engineering
Mathematics–II 4 0 30 70 100 3
CS1202 BS Engineering Physics 4 0 30 70 100 3
Elements of
CS1203 ES
Electronics 4 0 30 70 100 3
Engineering
CS1204 ES Data Structures
Using C
4 0 30 70 100 3
Digital Logic
CS1205 ES 4 0 30 70 100 3
Design
CS1206 ES LINUX
Administration Lab 0 3 50 50 100 1.5
CS1207 BS Engineering Physics
Lab
0 3 50 50 100 1.5
Data Structures
CS1208 ES 0 3 50 50 100 1.5
Lab
Total Credits 19.5
CS1201 ENGINEERING MATHEMATICS – II

Course Objectives
• The way of obtaining rank, eigen values and eigen vectors of a matrix.
• To know the importance of Cayley-Hamilton theorem and getting canonical form from
a given quadratic form.
• To solve the system of equations by using direct and indirect methods.
• To solve first order and higher order differential equations by various methods.
• To obtain the Laplace transforms and inverse Laplace transforms for a given functions
and their applications.

Course Outcomes
• Find rank, eigen values and eigen vectors of a matrix and understand the importance of
Cayley- Hamilton theorem.
• Reduce quadratic form to canonical forms and solving linear systems by direct and
indirect methods.
• Demonstrate solutions to first order differential equations by various methods and solve
basic applications problems related to electrical circuits, orthogonal trajectories and
Newton’s law of cooling
• Discriminate among the structure and procedure of solving higher order differential
equations with constant and variable coefficients.
• Understand Laplace transforms and its properties and finding the solution of ordinary
differential equations.

SYLLABUS

Linear Algebra: Rank of a matrix- Echelon form, Normal Form - Solution of Linear System
of Equations - Consistency of Linear System of Equations - Direct & Indirect Methods: Gauss
elimination method, LU Factorization method, Gauss Seidal Method. Complex Matrices:
Hermitian, Skew-Hermitian and Unitary Matrices and their Properties.

Eigen Values and Eigen Vectors: Eigen Values and Eigen Vectors of a Matrix - Cayley-
Hamilton theorem - Inverse and Powers of a Matrix using Cayley-Hamilton's theorem and its
applications. Diagonalization of a Matrix - Quadratic Forms - Reduction of Quadratic Form to
Canonical Form - Nature of a Quadratic Form.
Ordinary Differential Equations of First Order and its Applications: Formation of
ordinary differential equations (ODEs) - Solution of an ordinary differential equation -
Equations of the first order and first degree - Linear differential equation - Bernoulli’s equation
- Exact differential equations - Equations reducible to exact equations - Orthogonal Trajectories
- Simple Electric (LR & CR) Circuits - Newton’s Law of Cooling - Law of Natural growth and
decay.

Differential Equations of Higher Order: Solutions of Linear Ordinary Differential Equations

with Constant Coefficients - Rules for finding the complimentary function - Rules for finding
the particular integral - Method of variation of parameters - Cauchy’s linear equation -
Legendre’s linear equation - Simultaneous linear differential equations.

Laplace Transforms: Introduction - Existence Conditions - Transforms of Elementary

Functions - Properties of Laplace Transforms - Transforms of Derivatives - Transforms of
Integrals - Multiplication by tn - Division by t – Evaluation of integrals by Laplace Transforms
- Inverse Laplace Transform - Applications of Laplace Transforms to Ordinary Differential
Equations - Simultaneous Linear Differential Equations with Constant Coefficients - Second
Shifting Theorem - Laplace Transforms of Unit Step Function, Unit Impulse Function and
Laplace Transforms of Periodic Functions.

Text Book
1. Scope and Treatment as in “Higher Engineering Mathematics”, by Dr. B.S. Grewal,
43rd edition, Khanna publishers.
Reference Books
1. Graduate Engineering Mathematics by V B Kumar Vatti., I.K. International publishing
house Pvt. Ltd.
2. Advanced Engineering Mathematics by Erwin Kreyszig.
3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish Goyal. Lakshmi
Publications.
4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Company.
5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill Company.
*****
CS1202 ENGINERING PHYSICS

Course Objectives
• To impart knowledge in basic concept of physics of Thermodynamics relevant to
engineering applications.
• To grasp the concepts of physics for electromagnetism and its application to
engineering. Learn production of Ultrasonics and their applications in engineering.
• To Develop understanding of interference, diffraction and polarization: connect it to a
few engineering applications.
• To Learn basics of lasers and optical fibres and their use in some applications.
• To Understand concepts and principles in quantum mechanics and Nanophase
Materials. Relate them to some applications.

Course Outcomes
• Understand the fundamentals of Thermodynamics and Laws of thermodynamics.
Understand the working of Carnot cycle and concept of entropy.
• Gain Knowledge on the basic concepts of electric and magnetic fields. Understand the
concept of the nature of magnetic materials. Gain knowledge on electromagnetic
induction and its applications.
• Understand the Theory of Superposition of waves. Understand the formation of
Newton’s rings and the working of Michelson’s interferometer. Remember the basics
of diffraction, Evaluate the path difference. Analysis of Fraunhofer Diffraction due to
a single slit
• Understand the interaction of matter with radiation, Characteristics of Lasers, Principle,
working schemes of Laser and Principle of Optical Fibre. Realize their role in optical
fibre communication.
• Understand the intuitive ideas of the Quantum physics and understand dual nature of
matter. Compute Eigen values, Eigen functions, momentum of Atomic and subatomic
particles using Time independent one-Dimensional Schrodinger’s wave equation.
Understand the fundamentals and synthesis processes of Nanophase materials.

SYLLABUS

Thermodynamics: Introduction, Heat and Work, First law of thermodynamics and

applications, Reversible and Irreversible process, Carnot cycle and Efficiency, Second law of
thermodynamics, Carnot’s Theorem, Entropy, Second law in terms of entropy, Entropy and
disorder, Third law of thermodynamics (statement only).

Electromagnetism: Concept of electric flux, Gauss’s law - some applications, Magnetic field
- Magnetic force on current, torque on current loop, The Biot-Savart’s Law, B near a long wire,
B for a circular Current loop, Ampere’s law, B for a solenoid, Hall effect, Faraday’s law of
induction, Lenz’s law, Induced magnetic fields, Displacement current, Maxwell’s equations
(no derivation), Magnetic materials: Classification of magnetic materials and properties.

Ultrasonics: Introduction, Production of Ultrasonics – Piezoelectric and Magnetostriction

methods, acoustic grating, applications of ultrasonics.

Optics-
Interference: Principles of superposition – Young’s Experiment – Coherence - Interference in
thin films (reflected light), Newton’s Rings, Michelson Interferometer and its applications.
Diffraction: Introduction, Differences between interference and diffraction, Fresnel and
Fraunhofer diffraction, Fraunhofer diffraction at a single slit (Qualitative and quantitative
treatment).

Polarisation: Polarisation by reflection, refraction and double refraction in uniaxial crystals,

Nicol prism, Quarter and Half wave plate, circular and elliptical polarization.

Lasers And Fibre Optics: Introduction, characteristics of a laser beam, spontaneous and
stimulated emission of radiation, population inversion, Ruby laser, He-Ne laser,
Semiconductor laser, applications of lasers Introduction to optical fibres, principle of
propagation of light in optical fibres, Acceptance Angle and cone of a fibre, Numerical
aperture, Modes of propagations, classification of fibres, Fibre optics in communications,
Application of optical fibres.

Modern Physics-
Introduction, De Broglie concept of matter waves, Heisenberg uncertainty principle,
Schrodinger time independent wave equation, application to a particle in a box. Free electron
theory of metals, Kronig - Penney model (qualitative treatment), Origin of energy band
formation in solids, Classification of materials into conductors, semi-conductors and insulators.
Nanophase Materials: Introduction, properties, Top-down and bottom-up approaches,
Synthesis - Ball milling, Chemical vapour deposition method, sol-gel methods, Applications
of nano materials.

Text Books
1. Physics by David Halliday and Robert Resnick – Part I and Part II - Wiley.
2. A textbook of Engineering Physics, Dr. M. N. Avadhanulu, Dr. P.G. Kshirsagar - S.
Chand
3. Engineering Physics by R.K. Gaurand S.L. Gupta–Dhanpat Rai

Reference Books
1. Modern Engineering Physics by A.S. Vadudeva
2. University Physics by Young and Freedman

*****
CS1203 ELEMENTS OF ELECTRONICS ENGINEERING

Course Objectives
• Introduce students to basics of semiconductors, their classification and properties
• To provide theory of PN junction diode, its characteristics and applications
• To introduce basics of rectifying circuits and bipolar junction transistor
• To provide basics of transistor biasing, transistor amplifiers and field effect transistors

Course Outcomes
By the end of the course, the student should be able to:
• Explain the basics of semiconductors and their classification
• Understand the theory of PN junction diode, rectifying circuits and bipolar junction
transistor
• Explain the concepts of transistor biasing, transistor amplifiers and field effect
transistors

SYLLABUS

Introduction to Electronics and Semiconductors: Energy band theory, Conduction in

Insulators, Semiconductors and metals, Electron emission from metals, Classification of
semiconductors, Carrier concentration in an intrinsic semiconductor, Properties of intrinsic
semiconductor, Drift and diffusion currents.

Semi-Conductor Diode: Theory of PN junction diode, Open circuited PN junction, V-I

characteristics of a PN diode, Diode current equation, Transition and diffusion capacitances,
Break down in PN diode, Applications of PN diodes. Zener diode, Zener regulator, Tunnel
diode, Schottky diode.

Rectifying circuits: Half wave and full wave rectifiers, Bridge rectifiers, Efficiency, Ripple
and regulation of each rectifier, Capacitor filters.

Bipolar Junction Transistor: Introduction, construction, Operation of PNP and NPN

Transistors – Transistor Circuit configurations- Characteristics of a CE configurations – h
parameters, low frequency small signal equivalent circuit of a Transistor.
Transistor Biasing and thermal stabilization: Transistor Biasing, Stabilization, Different
methods of transistor biasing – Fixed bias, Collector feedback bias – self bias – Bias
compensation.

Transistor Amplifiers: CE, CB, CC amplifier configurations –Multistage amplifier – A Two

Stage RC coupled amplifier – frequency response curve and bandwidth.

Field Effect Transistors: Junction Field Effect Transistors (JFET) – JFET characteristics,
JFET Parameters, Small signal equivalent circuit – MOSFETS – Depletion and Enhancement
MOSFETS.

Text Books:
1. Electronic Device and Circuits by Sanjeev Guptha.

Reference Books:
1. Electronic Device and Circuits Theory by Robert L. Boylested Electronic Device and
Circuits by David. A. Bell
CS1204 DATA STRUCTURES USING C

Course objectives
• Assess how the choice of data structures and algorithm design methods impacts the
performance of programs.
• Choose the appropriate data structure and algorithm design method for a specified
application.
• Solve problems using data structures such as linear lists, stacks, queues, binary trees,
heaps binary search trees, and graphs and writing programs for these solutions.

Course outcomes
• Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are
represented in memory and used by algorithm.
• Demonstrate different methods for traversing trees.
• Compare alternative implementations of data structures with respect to performance.
• Discuss the computational efficiency of the principal algorithms for sorting and
searching

SYLLABUS

Introduction to Data Structures: Review of C Programming, Recursive Definition and

Processes, Recursion in C, Simulation of Recursion, Efficiency of Recursion, Abstract Data
Types, Meaning and Definition of Data Structures, Arrays.

Stacks: Stack as an Abstract Data Type, Primitive Operations, Implementing Stack Operations
using Arrays, Infix, Postfix and Prefix: Definitions, Evaluation and Conversions.

Queues: Queue as an Abstract Data Type, Sequential Representation, Types of Queues,

Operations, Implementation using Arrays.

Linked List: Operations, Implementation of Stacks, Queues and priority Queues using Linked
Lists+, Circular Lists: Insertion, Deletion and Concatenation Operations, Stacks and Queues
as Circular Lists, Doubly Linked Lists.
Trees: Binary Trees - Definitions and Operations, Binary Tree Representation: Node
Representation, Implicit array Representation, Binary Tree Traversal, Threaded Binary Trees
and their Traversal, Trees and their Applications; Tree Searching: Insertion and Deletion of a
node from a Binary Search Tree, Efficiency of Binary Search Tree operations.

Searching: Basic Searching Techniques: Dictionary as an Abstract Data Type, Algorithmic

Notation, Sequential Searching and its Efficiency, Binary Search, Interpolation Search.

Sorting: General Background: Efficiency, Asymptotic Notations, Efficiency of Sorting,

Bubble Sort and Quick Sort and their Efficiency, Selection Sorting, Binary Tree Sort, Heap
Sort, Insertion Sorts, Shell Sort, Address calculation Sort, Merge and Radix Sorts.

Graphs and Their Application: Definition of Graphs, Representation of Graphs, Transitive

closure, Linked Representation of Graphs, Topological Ordering of nodes, Graph Traversal
and Spanning Forests, Undirected Graphs and their Traversals, Applications of Graphs,
Minimal Spanning Trees.

Textbooks
1. Data Structures Using C and C++ Yddish Langsam, Moshe J. Augenstein and
Aaron M.Tanenbaum, Prentice Hall Of India (2nd Edition)
2. Data Structures, Algorithms and Applications with C++, Sahani Mc-Graw Hill.
CS1205 DIGITAL LOGIC DESIGN

Course objectives
• To introduce the basic principles for design of combinational circuit and sequential
circuits.
• To learn simple digital circuits in preparation for computer engineering.

Course Outcomes
A student who successfully fulfils the course requirements will have demonstrated:
• An ability to define different number systems, binary addition and subtraction, 2’s
complement representation and operations with this representation.
• An ability to understand the different Boolean algebra theorems and apply them for
logic functions.
• An ability to define the Karnaugh map for a few variables and perform an algorithmic
reduction of logic functions.
• An ability to define the following combinational circuits: multiplexer, de-multiplexers
encoders/decoders, comparators, arithmetic-logic units; and to be able to build simple
circuits.
• An ability to understand asynchronous and synchronous sequential circuits, like
counters and shift registers.
• An ability to understand memories like RAM and ROM, Programmable Logic Array
and Programmable Array Logic.

SYLLABUS

Binary Systems: Digital Systems. Binary Numbers. Number Base Conversions. Octal and
Hexadecimal Numbers. Complements. Signed Binary Numbers. Binary Codes. Binary Storage
and Registers. Binary Logic

Boolean Algebra and Logic Gates: Basic Definitions. Axiomatic Definition of Boolean
Algebra. Basic Theorems and Properties of Boolean Algebra. Boolean Functions. Canonical
and Standard Forms. Other Logic Operations. Digital Logic Gates. Integrated Circuits.

Combinational Logic Design, Gate-Level Minimization: The Map Method. Four Variable
Map. Five-Variable Map. Product of Sums Simplification. Don't-Care Conditions. NAND and
NOR Implementation. Other Two- Level Implementations. Exclusive-OR Function. Hardware
Description Language (HDL).

Combinational Logic: Combinational Circuits. Analysis Procedure. Design Procedure.

Binary Adder Subtractor. Decimal Adder. Binary Multiplier. Magnitude Comparator.
Decoders. Encoders. Multiplexers. HDL For Combinational Circuits.

Sequential Logic Design, Synchronous Sequential Logic: Sequential Circuits. Latches

Flipflops. Analysis of Clocked Sequential Circuits. HDL For Sequential Circuits. State
Reduction and Assignment. Design Procedure.

Registers ad Counters: Registers. Shift Registers. Ripple Counters. Synchronous Counters.

Other Counters. HDL for Registers and Counters.

Memory and Programmable Logic: Introduction. Random-Access Memory. Memory

Decoding, Error Detection and Correction. Read-Only Memory. Programmable Logic Array.
Programmable Array Logic. Sequential Programmable Devices.

Text Book
1. DigitalDesign,3rdEdition, M. Morris Mano, Pearson Education.

Reference Books
1. Digital Logic Design Principles, Norman Balabanian & Bradley Carlson, John Wiley
&Sons (Asia) Pvt.Ltd.,2002
2. Fundamentals of Digital Logic with VHDL Design, Stephen Brown and
ZvonkoVranesic, TataMcGraw-HillEdition,2002.
CS1206 LINUX ADMINISTRATION LAB

Course Objectives
 To understand LINUX operating system and its internals.
 To understand LINUX file system structure and its operations.
 To understand LINUX shell environment and its programming.
 To understand communication in LINUX and the corresponding primitives.

Course Outcomes
• The student learns about LINUX features for multiuser, multitasking capabilities.
• The student learns about file system organization, file and directory manipulation,
setting file permissions, and disk free space administration.
• The student learns about writing shell scripts for different applications.
• The student learns about how users communicate with each other in LINUX
environment.

SYLLABUS

1) Study and practice on file system / handling files with commands, syntax, usage,
application.
2) Practice on vi editor.
3) Study and practice on redirection operators with relevant commands, syntax, usage,
application.
4) Study and practice on filters with relevant commands, syntax, usage, application.
5) Study and practice on Backup with relevant commands, syntax, usage, application.
6) Study and practice on internet related commands, syntax, usage, application.
7) Study and practice on shells/shell programming with relevant programming constructs,
syntax, usage, application.
8) Study and practice on awk with relevant commands, syntax, usage, application.
9) Study and practice on regular expressions and the grep family with relevant commands,
syntax, usage, application.
10) Study and practice on compilation process of C programs under UNIX.

References:
1. Unix concepts and applications by Sumitabha Das, TMH Publications.
2. Shell programming by Yashwanth Kanetkar.
CS1207 ENGINNERING PHYSICS LAB

Course Objectives
• To enable the students to acquire skill, technique and utilization of the Instruments
• Draw the relevance between the theoretical knowledge and to imply it in a practical
manner with respect to analyse various electronic circuits and its components.
• To impart the practical knowledge in basic concepts of Wave optics, Lasers and fibre
optics.
• To familiarize the handling of basic physical apparatus like Vernier callipers, screw
gauge, spectrometers, travelling microscope, laser device, optical fibre, etc.

Course Outcomes
• Ability to design and conduct experiments as well as to analyse and interpret
• Ability to apply experimental skills to determine the physical quantities related to Heat,
Electromagnetism and Optics
• The student will learn to draw the relevance between theoretical knowledge and the
means to imply it in a practical manner by performing various relative experiments.

SYLLABUS

1. Determination of Radius of Curvature of a given Convex Lens By forming Newton’s

Rings.
2. Determination of Wavelength of Spectral Lines in the Mercury Spectrum by Normal
Incidence method.
3. Study the Intensity Variation of the Magnetic Field along axis of Current Carrying
Circular Coil.
4. Determination of Cauchy’s Constants of a Given Material of the Prism using
Spectrometer.
5. Determination of Refractive Index of Ordinary ray o and Extraordinary e ray.
6. Determination of Thickness Given Paper Strip by Wedge Method.
7. Calibration of Low Range Voltmeter.
8. Calibration of Low Range Ammeter.
9. Determination of Magnetic Moment and Horizontal Component of Earth’s Magnetic
Field.
10. Lees Method - Coefficient of thermal Conductivity of a Bad Conductor.
11. Carey Foster’s Bridge – Verification of laws of Resistance and Determination of
Specific Resistance.
12. Melde’s Apparatus – Frequency of electrically maintained Tuning Fork.
13. Photoelectric cell-Characteristics.
14. Planks Constants.
15. Laser- Diffraction.
*****
CS1208 DATA STRUCTURES LAB

Course Objectives
• To implement stacks and queues using arrays and linked lists.
• To develop programs for searching and sorting algorithms.
• To write programs using concepts of various trees.
• To implement programs using graphs.

Course Outcomes
• Student will be able to write programs to implement stacks and queues.
• Ability to implement various searching and sorting techniques.
• Ability to implement programs using trees and graphs.

SYLLABUS
List of Programs:
1. Write a C program for sorting a list using Bubble sort and then apply binary search.
2. Write a C program for implementing the operations of a queue.
3. Write a C program to implement the operations on priority queues.
4. Write a C to implement the operations on circular queues.
5. Write a C program to implement the operations on stacks.
6. Write a C program for evaluating a given postfix expression using stack.
7. Write a C program for converting a given infix expression to postfix form using
stack.
8. Write a C program to implement the operations on single linked list.
9. Write a C program for demonstrate operations on double linked list.
10. Write a C program for the representation of polynomials using circular linked list
and for the addition of two such polynomials
11. Write a C program to create a binary search tree and for implementing the in order,
Pre order, post order traversal using recursion
12. a) Write a C program for finding the transitive closure of a digraph
b) Write a C program for finding the shortest path from a given source to any vertex
in a digraph using Dijkstra’s algorithm.
13. a) Write a C program for finding the Depth First Search of a graph.
b) Write a C program for finding the Breadth First Search of a graph
References:
1. Data Structures Using C and C++ Yddish Langsam, Moshe J. Augenstein and
Aaron M.Tanenbaum, Prentice Hall Of India (2nd Edition)
2. Data Structures, Algorithms and Applications with C++, Sahani Mc-Graw Hill.