Bachelor of Technology (Computer Science and Engineering)

Credit Based Scheme of Studies/Examination(Modified)

Semester III (w.e.f Session 2019-2020)
                     
Examination Schedule (Marks) Duration
of Exam
(Hrs)
Major Minor Practical Total
S. Course No. Subject L:T:P Hours/W Credits
Test Test
No. eek
1 ES-227A Principles of Programming Languages 3:0:0 3 3 75 25 0 100 3

2 PC-CS- Data Structure and Algorithms 3:0:0 3 3 75 25 0 100 3

201A
3 ES-207A Digital Electronics 3:0:0 3 3 75 25 0 100 3
4 PC-CS- Object Oriented Programming 3:0:0 3 3 75 25 0 100 3
203A
5 BS-205 A Mathematics-III 3:0:0 3 3 75 25 0 100 3
6 HM-902A Business Intelligence and 3:0:0 3 3 75 25 0 100 3
Entrepreneurship
7 PC-CS- Data Structure and Algorithms Lab 0:0:4 4 2 0 40 60 100 3
205AL
8 ES-209AL Digital Electronics Lab 0:0:4 4 2 0 40 60 100 3
9 PC-CS- Object Oriented Programming Lab 0:0:4 4 2 0 40 60 100 3
207AL**
    Total   30 24 450 270 180 900  
10 SIM-201A* Seminar on Summer Internship 2:0:0 2   0 50 0 50
 ES-227A Principles of Programming Languages
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3 Hour
Purpose To introduce the principles and paradigms of programming languages for design and implement the software
intensive systems.
Course Outcomes (CO)
CO 1 To introduce the basic concepts of programming language, the general problems and methods related to syntax
and semantics.
CO 2 To introduce the structured data objects, subprograms and programmer defined data types.
CO 3 To outline the sequence control and data control.
CO 4 To introduce the concepts of storage management using programming languages.

Unit-I: Introduction, Syntax and Semantics

Introduction: A brief history, Characteristics of a good programming language, Programming language translators- compiler and
interpreters, Elementary data types – data objects, variable and constants, data types. Specification and implementation of
elementary data types, Declarations, type checking and type conversions, Assignment and initialization, Numeric data types,
enumerations, Booleans and characters.

Syntax and Semantics: Introduction, general problem of describing syntax, Formal method of describing Syntax, attribute
grammar dynamic semantic.

Unit-II: Structured data objects, Subprograms and Programmer Defined Data Types

Structured data objects: Structured data objects and data types, specification and implementation of structured data types,
Declaration and type checking of data structure, vector and arrays, records Character strings, variable size data structures, Union,
pointer and programmer defined data objects, sets, files.

Subprograms and Programmer Defined Data Types: Evolution of data type concept abstraction, encapsulation and information
hiding, Subprograms, type definitions, abstract data types, over loaded subprograms, generic subprograms.

Unit–III: Sequence Control and Data Control

Sequence Control: Implicit and explicit sequence control, sequence control within expressions, sequence control within statement,
Subprogram sequence control: simple call return, recursive subprograms, Exception and exception handlers, co routines,
sequence control. Concurrency – subprogram level concurrency, synchronization through semaphores, monitors and message
passing

Data Control: Names and referencing environment, static and dynamic scope, block structure, Local data and local referencing
environment, Shared data: dynamic and static scope, Parameter and parameter transmission schemes.

Unit-IV: Storage Management and Programming Languages

Storage Management: Major run time elements requiring storage

e, programmer and system controlled storage management and phases, Static storage management, Stack based storage
management, Heap storage management, variable and fixed size elements.
Programming Languages: Introduction to procedural, non-procedural, structured, logical, functional and object oriented
programming language, Comparison of C and C++ programming languages.

Suggested Books:
 Terrence W. Pratt, Marvin V. Zelkowitz, Programming Languages Design and Implementation, Pearson.
 Allen Tucker and Robert Noonan, Programming Languages–Principles and Paradigms, Tata McGraw-Hill, 2009.
 Ellis Horowitz, Fundamentals of Programming Languages, Galgotia Publications, 2010.
 C. Ghezzi, Programming Languages Concepts, Wiley Publications, 2010.
 PC-CS201A Data Structure and Algorithms
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3 Hour
Purpose To introduce the principles and paradigms of Data Structures for design and implement the software systems
logically and physically.
Course Outcomes (CO)
CO 1 To introduce the basic concepts of Data structure , basic data types ,searching and sorting based on array
data types.
CO 2 To introduce the structured data types like Stacks and Queue and its basic operations's implementation.
CO 3 To introduce dynamic implementation of linked list.
CO 4 To introduce the concepts of Tree and graph and implementation of traversal algorithms.

Unit-1
Introduction to Data Structures, Data Types, Built in and User Defined Data Structures, Applications of Data Structure, Algorithm
Analysis, Worst, Best and Average Case Analysis, Notations of Space and Time Complexity, Basics of Recursion.
Arrays, One Dimensional Arrays, Two Dimensional Arrays and Multi-Dimensional Arrays, Sparse Matrices,
Searching from array using Linear and Binary Searching Algorithm, Sorting of array using Selection, Insertion, Bubble, Radix
Algorithm
Unit-2
Stacks: Definition, Implementation of Stacks and Its Operations, Evaluation of Infix, prefix and Postfix Expression, Inter-conversion
of Infix, Prefix and Post-Fix Expression, Implementation of Merge Sort and Quick Sort Algorithm.
Queues: Definition, Sequential Implementation of Linear Queues and Its Operations, Circular Queue and Its Implementation,
Priority Queues and Its Implementation, Applications of queues.
Unit-3
Linked Lists: Need of Dynamic Data Structures, Single Link List and Its Dynamic Implementation, Traversing, Insertion, Deletion
Operations on Single Link Lists. Comparison between Static and Dynamic, Implementation of Linked List.
Circular Link Lists and Doubly Link List, Dynamic Implementation of Primitive Operations on Doubly Linked Lists and Circular Link
List. Dynamic Implementation of Stacks and Queues.
Unit-4
Trees: Definition, Basic Terminology, Binary Tree, External and Internal Nodes, Static and Dynamic Implementation of a Binary
Tree, Primitive Operations on Binary Trees, Binary Tree Traversals: Pre-Order, In-Order and Post-Order Traversals.
Representation of Infix, Post-Fix and Prefix Expressions using Trees.

Introduction to Binary Search Trees: B+ trees, AVL Trees, Threaded Binary trees, Balanced Multi-way search trees,
Implementation of Heap Sort Algorithm.

Graphs: Basic Terminology, Definition of Undirected and Directed Graphs, Memory Representation of Graphs, Minimum-Spanning
Trees, Warshal Algorithm, Graph Traversals Algorithms: Breadth First and Depth First.

Suggested Books:
 Theory and Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline, TMH.
 Data Structures and Algorithms by PAI, TMH.
 Fundamentals of Data structures by Ellis Horowitz and Sartaj Sahni, Pub, 1983, AW.
 Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman, Original edition, Addison-Wesley, 1999,
Low Priced Edition.
 Data Structures and Program Design in C by Robert Kruse, PHI,
 Shukla, Data Structures using C++, Wiley India
 Introduction to Computers Science -An Algorithms Approach, Jean Paul Tremblay, Richard B. Bunt, 2002, T.M.H.
 Data Structure and the Standard Template library – Willam J. Collins, 2003, T.M.H.
 ES-207A Digital Electronics
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3 Hour
Purpose To learn the basic methods for the design of digital circuits and provide the fundamental concepts used in the
design of digital systems.
Course Outcomes (CO)
CO1 To introduce basic postulates of Boolean algebra and shows the correlation between Boolean expressions
CO2 To introduce the methods for simplifying Boolean expressions
CO3 To outline the formal procedures for the analysis and design of combinational circuits and sequential circuits
CO4 To introduce the concept of memories and programmable logic devices.

UNIT I MINIMIZATION TECHNIQUES AND LOGIC GATES

Binary Digits, Logic Levels, and Digital Waveforms, Logic Systems-Positive and negative, Logic Operations, Logical
Operators, Logic Gates-AND, OR, NOT, NAND, NOR, Exclusive-OR and Exclusive-NOR, Active high and Active low
concepts, Universal Gates and realization of other gates using universal gates, Gate Performance Characteristics and
Parameters.Boolean Algebra: Rules and laws of Boolean algebra, Demorgan’s Theorems, Boolean Expressions and Truth
Tables, Standard SOP and POS forms; Minterm and Maxterms, Canaonical representation of Boolean expressions, Duality
Theorem, Simplification of Boolean Expressions, Minimization Techniques for Boolean Expressions using Karnaugh Map
and Quine McCluskey Tabular method.introduction of TTL and CMOS Logic and their characteristics, Tristate gates.
UNIT II COMBINATIONAL CIRCUITS
Introduction to combinational Circuits, Adders-Half-Adder and Full-Adder, Subtractors- Half and Full Subtractor; Parallel
adder and Subtractor; Look-Ahead Carry Adders. BCD adder, BCD subtractor, Parity Checker/Generator, Multiplexer,
Demultiplexer, Encoder, Priority Encoder; Decoder ,BCD to Seven segment Display Decoder/Driver, LCD Display, and
Comparators.
UNIT III SEQUENTIAL CIRCUITS
 Introduction to Sequential Circuits, Flip-Flops: Types of Flip Flops -RS, T, D, JK; Edge triggering, Level Triggering; Flip Flop
conversions; Master-Salve JK.

Introduction to shift registers, Basic Shift Register Operations, types of shift registers, Bidirectional Shift Registers, Shift
Register Counters.  Introduction to counters, Types of Counters-Asynchronous and synchronous counters, Up/Down
Synchronous Counters, Modulo-n Counter , State table, excitation table concepts, Design of asynchronous and
synchronous counters, Ring Counter, Applications of counters.

UNIT IV CONVERTER and MEMORY DEVICES

Digital to Analog Converter, Weighed Register: R-2R Ladder Network: Analog to Digital Conversion, Successive
Approximation Type, Dual Slope Type.

Classification of memories - ROM: ROM organization, PROM, EPROM, EEPROM, EAPROM, RAM: - RAM organization -
Write operation, Read operation, Memory cycle, Timing wave forms, memory expansion, Static RAM Cell, MOSFET RAM
cell structure, Dynamic RAM cell structure, Programmable Logic Devices - Programmable Logic Array (PLA), Programmable
Array Logic (PAL), Implementation of PLA, PAL using ROM.
 
Suggested Books:
 Donald P. Leach and Albert Paul Malvino, Digital Principles and Applications, 8th Edition, TMH, 2003.M.
 Morris Mano, Digital Design, 3rd Edition, Prentice Hall of India Pvt. Ltd., 2003 / Pearson Education (Singapore)
Pvt. Ltd., New Delhi, 2003.
 ALI, Digital Switching Systems, , TMH
 A.K. Maini, Digital Electronics, Wiley India
 John F. Wakerly, Digital Design, Fourth Edition, Pearson/PHI, 2006
 John. M Yarbrough, Digital Logic Applications and Design, Thomson Learning, 2002.
 S. Salivahanan and S. Arivazhagan, Digital Circuits and Design, 3rd Edition., Vikas Publishing House Pvt. Ltd,
New Delhi, 2006
 William H. Gothmann, Digital Electronics, 2nd Edition, PHI, 1982.
 Thomas L. Floyd, Digital Fundamentals, 8th Edition, Pearson Education Inc, New Delhi, 2003
 Donald D. Givone, Digital Principles and Design, TMH, 2003.
PC-CS203A Object Oriented Programming
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3 Hour
Purpose To introduce the principles and paradigms of Object Oriented Programming Language for design and
implement the Object Oriented System.
Course Outcomes (CO)
CO1 To introduce the basic concepts of object oriented programming language and the its representation.

CO2 To allocate dynamic memory, access private members of class and the behavior of inheritance and its
implementation.
CO3 To introduce polymorphism, interface design and overloading of operator.
CO4 To handle backup system using file, general purpose template and handling of raised exception during
programming.

Unit–1
Introduction to C++, C++ Standard Library, Illustrative Simple C++ Programs. Header Files, Namespaces, Application of
object oriented programming.

Object Oriented Concepts, Introduction to Objects and Object Oriented Programming, Encapsulation, Polymorphism,
Overloading, Inheritance, Abstract Classes, Accessifier (public/ protected/ private), Class Scope and Accessing Class
Members, Controlling Access Function, Constant, Class Member, Structure and Class

Unit-2
Friend Function and Friend Classes, This Pointer, Dynamic Memory Allocation and Deallocation (New and Delete), Static
Class Members, Constructors, parameter Constructors and Copy Constructors, Deconstructors,
Introduction of inheritance, Types of Inheritance, Overriding Base Class Members in a Derived Class, Public, Protected and
Private Inheritance, Effect of Constructors and Deconstructors of Base Class in Derived Classes.

Unit-3
Polymorphism, Pointer to Derived class, Virtual Functions, Pure Virtual Function, Abstract Base Classes, Static and
Dynamic Binding, Virtual Deconstructors.

Fundamentals of Operator Overloading, Rules for Operators Overloading, Implementation of Operator Overloading Like
<<,>> Unary Operators, Binary Operators.

Unit-4
Text Streams and binary stream, Sequential and Random Access File, Stream Input/ Output Classes, Stream Manipulators.

Basics of C++ Exception Handling, Try, Throw, Catch, multiple catch, Re-throwing an Exception, Exception specifications.
Templates: Function Templates, Overloading Template Functions, Class Template, Class Templates and Non- Type
Template arguments.

Suggested Books:
 The complete reference C ++ by Herbert shieldt Tata McGraw Hill.
 Object Oriented Programming in Turbo C++ by Robert Lafore, 1994, The WAITE Group Press.
 Shukla, Object Oriented Programming in c++, Wiley India.
 C++ How to Program by H M Deitel and P J Deitel, 1998, Prentice Hall.
 Programming with C++ By D Ravichandran, 2003, T.M.H.
 BS-205A Mathematics-III
Lecture Tutorial Practical Credit Theory Sessional Total Time
3 0 0 3.0 75 25 100 3 Hour
Purpose To familiarize the prospective engineers with techniques in sequence and series, multivariable
calculus, and ordinary differential equations.
Course Outcomes (CO)
CO1 To develop the tool of sequence, series and Fourier series for learning advanced Engineering
Mathematics.
CO2 To introduce effective mathematical tools for the solutions of differential equations that model physical
processes.
CO3 To acquaint the student with mathematical tools needed in evaluating multiple integrals and their
usage.
CO4 To familiarize the student with calculus of vector functions that is essential in most branches of
engineering.

UNIT-I
Sequence and Series: Convergence of sequence and series, tests for convergence (Comparison test, D’Alembert’s Ratio
test, Logarithmic test, Cauchy root test, Raabe’s test).
Fourier series: Introduction, Fourier-Euler Formula, Dirichlet’s conditions, Change of intervals, Fourier series for even and
odd functions, Half range sine and cosine series.

UNIT-II
First order ordinary differential equations: Exact, linear and Bernoulli’s equations, Euler’s equations, Equations not of first
degree: equations solvable for p, equations solvable for y, equations solvable for x and Clairaut’s type.
Differential equations of higher orders:
Second order linear differential equations with constant coefficients, method of variation of parameters, Cauchy and
Legendre’s linear differential equations.
UNIT-III
Multivariable Calculus (Integration): Multiple Integration: Double integrals (Cartesian), change of order of integration in
double integrals, Change of variables (Cartesian to polar) Applications: areas and volumes; Triple integrals (Cartesian),
orthogonal curvilinear coordinates, Simple applications involving cubes, sphere and rectangular parallelepipeds.
UNIT-IV
Vector Calculus: Introduction, Scalar and Vector point functions, Gradient, divergence and Curl and their properties,
Directional derivative. Line integrals, surface integrals, volume integrals, Theorems of Green, Gauss and Stokes (without
proof).

Suggested Books:
 G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson, Reprint, 2002.
 Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.
 Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th Reprint, 2010.
 N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2010.
 B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000.
 W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value Problems, 9th Edition,
Wiley India, 2009.
 S. L. Ross, Differential Equations, 3rd Ed., Wiley India, 1984.
 E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall India, 1995.
 E. L. Ince, Ordinary Differential Equations, Dover Publications, 1958.
 G.F. Simmons and S.G. Krantz, Differential Equations, Tata McGraw Hill, 2007.
 HM-902A Business Intelligence and Entrepreneurship
Lecture Tutorial Practical Credit Major Test Minor Test Total Time
3 0 0 3.0 75 25 100 3
Purpose To make the students conversant with the basics concepts in management thereby leading to nurturing their
managerial skills.
Course Outcomes (CO)
CO1 Students will be able understand who the entrepreneurs are and what competences needed to become an
Entrepreneur.
CO2 Students will be able understand insights into the management, opportunity search, identification of a Product;
market feasibility studies; project finalization etc. required for small business enterprises.
CO3 Students can be able to write a report and do oral presentation on the topics such as product identification,
business idea, export marketing etc.
CO4 Students will be able to know the different financial and other assistance available for the small industrial units.

Unit –I
Entrepreneurship : Concept and Definitions; Entrepreneurship and Economic Development; Classification and Types of
Entrepreneurs; Entrepreneurial Competencies; Factor Affecting Entrepreneurial Growth – Economic, Non-Economic
Factors; EDP Programmes; Entrepreneurial Training; Traits/Qualities of an Entrepreneurs; Manager Vs. Entrepreneur,
Entrepreneurial challenges.

Unit -II
Opportunity / Identification and Product Selection: Entrepreneurial Opportunity Search and Identification; Criteria to Select a
Product; Conducting Feasibility Studies; Sources of business ideas, Marketing Plan : Conducting of Marketing Research,
Industry Analysis, Competitor analysis, market segmentation and positioning, building a marketing plan, marketing mix,
launching a new product; export marketing, Methods of Project Appraisal, Project Report Preparation; Specimen of Project
Report; Project Planning and Scheduling using Networking Techniques of PERT / CPM.

Unit –III

Small Enterprises and Enterprise Launching Formalities : Definition of Small Scale; Rationale; Objective; Scope; SSI;
Registration; NOC from Pollution Board; Machinery and Equipment Selection , Role of SSI in Economic Development of
India; major problem faced by SSI,MSMEs – Definition and Significance in Indian Economy; MSME Schemes, Challenges
and Difficulties in availing MSME Schemes.

Unit –IV
Role of Support Institutions and Management of Small Business : DIC; SIDO; SIDBI; Small Industries Development
Corporation (SIDC); SISI; NSIC; NISBUD; State Financial Corporation SIC; Venture Capital : Concept, venture capital
financing schemes offered by various financial institutions in India.
Special Issues for Entrepreneurs: Legal issues – Forming business entity, requirements for formation of a Private/Public
Limited Company, Entrepreneurship and Intellectual Property Rights: IPR and their importance. (Patent, Copy Right,
Trademarks) , Case Studies-At least one in whole course.

Note:
• Case studies of Entrepreneurs – successful, failed, turnaround ventures should be discussed in the class.
• Exercises / activities should be conducted on ‘generating business ideas’ and identifying problems and opportunities.
• Interactive sessions with Entrepreneurs, authorities of financial institutions, Government officials should be organized

Suggested Readings:
 “Entrepreneurship development small business enterprises”, Pearson, Poornima M Charantimath,2013.
 Roy Rajiv, “Entrepreneurship”, Oxford University Press, 2011.
 “Innovation and Entrepreneurship”,Harper business- Drucker.F, Peter, 2006.
 “Entrepreneurship”, Tata Mc-graw Hill Publishing Co.ltd new Delhi- Robert D. Hisrich, Mathew J. Manimala,
Michael P Peters and Dean A. Shepherd, 8th Edition, 2012
 Enterpreneurship Development- S.Chand and Co.,Delhi- S.S.Khanka 1999
 Small-Scale Industries and Entrepreneurship. Himalaya Publishing House, Delhi –Vasant Desai 2003.
 Entrepreneurship Management -Cynthia, Kaulgud, Aruna, Vikas Publishing House, Delhi, 2003.