Structure of Undergraduate Engineering program

AICTE Proposed
Breakup of Breakup of
Sl. Category
Credits Credits (Total
No.
(Total160) 160)
Humanities and Social Sciences including
1 12* 10
Management courses
2 Basic Science courses 25* 23
Engineering Science courses including
3 workshop, drawing, Basics of 24* 20
electrical/mechanical / computer etc

4 Professional Core Courses 48* 43

Professional Elective courses relevant to
5 chosen specialization/branch/ 18* 14
Ability Enhancement Courses
Open subjects–Electives from other technical,
6 emerging, arts commerce and NCC/NSS 18* 14
subjects/Ability Enhancement Courses
Mini and Major Project work/seminar/Summer
7 15* 32
Internship and Research/Industrial Internship

Mandatory Non- Credit Courses [Environmental

Sciences ,Induction training, Indian Constitution,
No 04
8 Universal Human Values, Kannada]
credits

Total 160* 160

*Minor variation is allowed as per need of the respective discipline

1
OFFICE OF THE DEAN (ACADEMICS)
 Credit breakdown/distribution for
all Semesters B.E. Programme

Semester Credits

I & II 20 + 20 = 40

III 18

IV 22

V 18

VI 22

VII 24

VIII 16

Total 160

2
 DEPARTMENT OF COMPUTER SCIENCE & BUSINESS SYSTEMS

DR. AMBEDKAR INSTITUTE OF TECHNOLOGY

BANGALORE-56

VISION:
“To be a center of Excellence in CS&BS through knowledge sharing, globally competitive with managerial skill
to become masters and researchers, envisioned to meet industry expectation”.

MISSION:
M1: To imbibe technical knowledge through innovative teaching and learning to compete globally.
M2: To explore business discipline through Computer Science with research, innovation and inculcate in critical
thinking through effective communication and programming skills.
M3: To produce competent professional to meet out the needs globally by imparting industry relevant education
along with managerial skills, social responsibility and human values.
M4: To strengthen the industry-institute collaboration and team works to gain in-depth knowledge through
internships.
M5: To promote new age of learning concepts towards continuous learning.

PROGRAM EDUCATIONAL OBJECTIVES:

PEO 1: To ensure graduates will be proficient in utilizing the fundamental knowledge of
basic sciences, mathematics, Computer Science and Business systems for the
applications relevant to various streams of Engineering and Technology.

PEO 2: Graduates will perform Research by designing and developing solutions using
modern tools for complex problems in the field of IT by adapting to the rapid
technological advancements.
PEO 3: To enable graduates to gain employment in organizations and establish themselves
as professionals by applying their technical skills and leadership qualities to solve
real world problems and meet the diversified needs of industry,
academia and research.
PEO 4: The students will be industry ready with required business skills in service
orientation &Demonstrate professionalism, ethics, inter-personal skills and
continuous learning to develop leadership qualities.
PROGRAM SPECIFIC OBJECTIVES (PSOS)

PSO 1: Ability to design and implement industry demand professionals with business
principles aligned with equivalent knowledge in humanities and business systems.

PSO 2: To manage complex IT projects with consideration of the human, financial,

ethical and environmental factors and an understanding of risk management
processes, and operational and policy implications for the benefits of society as a
Whole.
PSO 3: Ability to Design, Develop and Test software systems for the organizational need
to provide solutions for real-world problems.

Dr. Siddaraju
HOD - CSBS

4
 Dr. Ambedkar Institute of Technology, Bengaluru-560056 Outcome Based Education (OBE) and Choice Based Credit System
B.E. Name of the Programme: COMPUTER SCIENCE & BUSINESS SYSTEMS Tentative Scheme of Teaching and
Examination effective from the Academic Year 2023-24

III SEMESTER

Teaching Hours /Week Examination

Theory Tutori Pract Self Durati CIE SEE Total
Teaching Lecture al ical / study on in Marks Marks Marks Credits
Sl. Course Course Code Course Title Department (TD) Draw hours
No and Question ing
Paper Setting L T P S
1 22MAT301CB Mathematics Course 3 2 0 0 05 50 50 100 4
BSC Maths
2 IPCC 22CBU302 Digital Design & CB/CS/IS 3 0 2 0 03 50 50 100 4
Computer Organization
3 IPCC 22 CBU303 Database Management Systems CB/CS/IS 3 0 2 0 03 50 50 100 4
PCC 22CBT304 Data Structures and CB/CS/IS 0 04 50 50 100 3
3 1 0
4 Applications
PCCL 22CBL305 Data Structures and CB/CS/IS 0 03 50 50 100 1
5 0 0 2
Applications Lab
6 ESC 22CBT306x ESC/ETC/PLC CB/CS/IS 3 1 0 0 04 50 50 100 3
7 UHV 22HST307 Social Connect and Any 0 0 2 0 01 100 --- 100 1
Responsibility Department
If the course is a Theory 01
AEC/ 22CBT308x Ability Enhancement Course / CB/CS/IS 1 0 0 0 50 50 100 1
8
SEC or 22CBL308x Skill Enhancement Course – If a course is a laboratory 02
III
0 0 2 0
9 HS 22CDN309 Aptitude and Verbal Ability Skill-I Placement Cell -- 50 -- 50
2 0 0 0
PP/NP
22NSN310 National Service Scheme (NSS) NSS coordinator
22PEN310 Physical Education (PE) Physical Education - 100 - 100 PP/NP
10 MC 0 0 2 0 - -
(Sports and Athletics) Director
22YON310 Yoga Yoga Teacher -
Total 550 350 900 21
 PCC: Professional Core Course, PCCL: Professional Core Course laboratory, UHV: Universal Human Value Course, MC: Mandatory Course (Non-credit),
AEC: Ability Enhancement Course, SEC: Skill Enhancement Course, L: Lecture, T: Tutorial, P: Practical, S= Self-Study, CIE: Continuous Internal
Evaluation, SEE:Semester End Evaluation. K: This letter in the course code indicates common to all the streams of Engineering. ESC: Engineering Science
Course, ETC: Emerging Technology Course, PLC: Programming Language Course
.
Engineering Science Course (ESC/ETC/PLC) 22CBT306x
22CBT306A Formal Language and Automata Theory 22CBT306C Java Programming
22CBT306B OOPS with C++ 22CBT306D
Ability Enhancement Course – III 22CBT308x
OR 2CBL308x
22CBT308A Business Communication & Value Science 1
22CBT308B Principles of Economics
Professional Core Course (IPCC): Refers to Professional Core Course Theory Integrated with practical of the same course. Credit for IPCC can be 04 and
its Teaching– Learning hours (L : T : P) can be considered as (3 : 0 : 2) or (2 : 2 : 2). The theory part of the IPCC shall be evaluated both by CIE and SEE.
The practical part shall be evaluated by only CIE (no SEE). However, questions from the practical part of IPCC shall be included in the SEE question paper.

National Service Scheme /Physical Education/Yoga: All students have to register for any one of the courses namely National Service Scheme (NSS),
Physical Education (PE)(Sports and Athletics), and Yoga(YOG) with the concerned coordinator of the course during the first Week of III semesters. Activities
shall be carried out between III semester to the VI semester (for 4 semesters). Successful completion of the registered course and requisite CIE score is
mandatory for the award of the Degree. The events shall be appropriately scheduled by the colleges and the same shall be reflected in the calendar prepared
for the NSS, PE, and Yoga activities. These courses shall not be considered for vertical progression as well as for the calculation of SGPA and CGPA, but
completion of the course is mandatory for the award of Degree.
 Dr. Ambedkar Institute of Technology, Bengaluru-560056
Outcome Based Education(OBE) and Choice Based Credit System
B.E. Name of the programme: --COMPUTER SCIENCE & BUSINESS SYSTEMS
Tentative Scheme of Teaching and Examination effective from the Academic Year 2023-24
IV SEMESTER
Teaching Teaching Hours /Week Examination
Department Theory Tutor Practic Self - Duratio CIE SEE Total Credi
Sl. Course and Course Course Title (TD) and ial al / Study n in Marks Marks Marks ts
No Code Question Paper Drawin hours
Setting Board g
(PSB) L T P S
1 PCC 22CBT401 Fundamentals of Management CB/MBA 3 0 0 0 03 50 50 100 3
2 IPCC 22CBU402 Operating Systems (Unix Environment) CB/CS/IS 3 0 2 0 03 50 50 100 4
3 IPCC 22CBU403 Analysis And Design Of Algorithms CB/CS/IS 3 0 2 0 03 50 50 100 4
PCCL 22CBL404 Software Engineering Lab CB/CS/IS 0 0 2 0 03 50 50 100 1
4
5 ESC 22CBT405x ESC/ETC/PLC CB/MBA 3 0 0 0 03 50 50 100 3
If the course is Theory 01
AEC/ 22CBT406x Ability Enhancement TD and 1 0 00 50 50 100 1
6 SEC or Course/Skill Enhancement Course- PSB:
If the course is a lab 02
22CBL406x IV Concerned
department 0 0 2 0
BSC 22BIT407 Biology For Engineers TD / PSB: BT, 2 0 0 0 03 50 50 100 2
7
CHE,
8 UHV 22HST408 Universal human values course Any Department 1 0 0 0 01 50 50 100 1
HS 22CDN409 Aptitude and Verbal Ability Skill-II Placement Cell 2 0 0 0 -- 50 -- 50 PP/
9
NP
22NSN410 National Service Scheme (NSS) NSS coordinator
22PEN410 Physical Education (PE) (Sports and Physical
MC Athletics) PP/
10 Education 0 0 2 0 02 100 --- 100
NP
Director
22YON410 Yoga Yoga Teacher
Total 500 400 900 19
PCC: Professional Core Course, PCCL: Professional Core Course laboratory, UHV: Universal Human Value Course, MC: Mandatory Course (Non-credit),
AEC: Ability Enhancement Course, SEC: Skill Enhancement Course, L: Lecture, T: Tutorial, P: Practical, S= Self-Study, CIE: Continuous Internal
Evaluation, SEE: Semester End Evaluation. K : This letter in the course code indicates common to all the stream of engineering.

Engineering Science Course (ESC/ETC/PLC) 22CBT405x OR 22CBL405x

22CBT405A Strategic Management 22CBT405C Design Thinking
22CBT405B Marketing Research & Marketing Management 22CBT405D
Ability Enhancement Course / Skill Enhancement Course – IV 22CBT405x OR 22CBL406x
22CBT406A Business Communication & Value Science II 22CBT406C Operations Research
22CBT406B Introduction to Block chain
Professional Core Course (IPCC): Refers to Professional Core Course Theory Integrated with practical of the same course. Credit for IPCC can be 04 and
its Teaching– Learning hours (L : T : P) can be considered as (3 : 0 : 2) or (2 : 2 : 2). The theory part of the IPCC shall be evaluated both by CIE and SEE.
The practical part shall be evaluated by only CIE (no SEE). However, questions from the practical part of IPCC shall be included in the SEE question paper.
National Service Scheme /Physical Education/Yoga: All students have to register for any one of the courses namely National Service Scheme (NSS),
Physical Education (PE)(Sports and Athletics), and Yoga(YOG) with the concerned coordinator of the course during the first Week of III semesters.
Activities shall be carried out between III semester to the VI semester (for 4 semesters). Successful completion of the registered course and requisite CIE
score is mandatory for the award of the Degree. The events shall be appropriately scheduled by the colleges and the same shall be reflected in the calendar
prepared for the NSS, PE, and Yoga activities. These courses shall not be considered for vertical progression as well as for the calculation of SGPA and
CGPA, but completion of the courses is mandatory for the award of Degree.
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024

Course Title DIGITAL DESIGN AND COMPUTER ORGANIZATON

Course Code 22CBU302
Category Integrated Professional Core Course (IPCC)
Scheme and No. of Hours/Week Total teaching Credits
Credits L T P SS Total hours
03 00 02 00 05 60 04
CIE Marks: 50 SEE Marks: Total Max. Marks: Duration of SEE:03 Hours
50 100

COURSE OBJECTIVES:

• Understand the basic digital principles and working of various logic gates, and
different techniques for simplification of Boolean function.
• Design combinational logic circuits and describe their applications.
• Analyze working of Flip Flops and sequential circuits.
• Study the basic organization and architecture of digital computers such as CPU, memory,
I/O, and software
• Discussions of digital logic and microprogramming to understand the design and
application of computer systems and can be used as foundation for more advanced
computer-related studies

UNIT I 12 Hours
Combinational Logic Circuits: Binary Logic, Integrated Circuits, Boolean Functions, Canonical
And Standard Forms, The Map Method Two, Three, Four -Variable Maps, Map Manipulation,
Essential Prime Implicants, Product-Of-Sums Optimization, Don’t-Care Conditions ,minimal sum
and minimal product. The Tabulation Method, Determination Of Prime Implicants.
Laboratory Component (Hardware)
• Verification of basic and universal gates ICs
• Given a Boolean expression implementation using basic/universal gates.
• Simplification of given 4-variable logic expression using K-Map and realize using basic
gates and universal gates.
UNIT II 12 Hours
Data processing circuits: Combinational Logic Design Procedure, Adders, Subtractors, Code
Converter, Magnitude Comparator, Multiplexers, De multiplexers, Decoder.
Laboratory Component (Hardware)
• Design and implementation of combinational circuits such as Adder, Subtractor,
Comparator circuits using basic/universal gates
• Simplification of 4-variable logic expression and realize it using multiplexer IC.
• Design and implementation of adder, subtractor and Boolean expression using Decoder
IC.
UNIT III 12 Hours
Sequential Logic: Introduction, Flip-Flops, Triggering Of Flip Flops, Excitation Tables, Design
Procedure. Registers, Shift Registers, Ripple Counter, Synchronous Counter.
Laboratory Component (Hardware)
• Design and implementation of various flip flops (SR, JK, D, T) using universal gates
• Design and implementation of shift registers. (ring ,switched tail )
• Design and implementation of synchronous counter using JK flip flop IC
UNIT IV 12 Hours
Processor Logic Design: Introduction, Processor Organization, Arithmetic Logic Unit, Design
Of Logic Circuit, Design Of Arithmetic Circuit,
Control logic design: Introduction, Control Organization, Hard Wired Control, Hard Wired
control –example.

Laboratory Component (Using Logisim Simulator)

• Design and implementation of Arithmetic circuit
• Design and Implementation of Logic circuit
• Design and implementation of ALU
UNIT V 12 Hours
Computer Design: Introduction, System of Configuration, Computer Instructions, Timing and
Control, Execution of Instructions, Microcomputer System Design: Introduction,
Microcomputer Organization, Microprocessor Organization, Instructions and Addressing Modes

Laboratory Component (Using Logisim Simulator)

• Design of simple processor which includes Register, ALU and Control unit.

Course Statements Blooms

Outcomes Level

CO1 Demonstrate the various techniques like K-map, Quine- L3

McCluskey method for minimization of combinational functions.

CO2 Develop and Analyze different combinational and sequential L3

circuits using Logic gates, Multiplexers, Decoders, and Flip flops.

CO3 Describe the structure of CPU, memory and I/O unit. L2

CO4 Design the processor with Register, ALU and control unit L3

TEXT BOOKS
1. M Morris Mano: Digital Logic and Computer Design, 14th Impression, Pearson,
2012.ISBN 978-81-7758-409-7.

REFERENCE BOOKS
1. Donald P Leach, Albert Paul Malvino & Goutam Saha, Digital Principles and Applications,
8th Edition, Tata McGraw Hill, 2015.
2. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.
 3. Donald P Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and Applications,
7th Edition, Tata McGraw Hill, 2010.
4. Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss: Digital Systems Principles and
Applications, 10th Edition, Pearson Education, 2007.
.
ONLINE RESOURCES
1. Digital Electronic Circuits: https://nptel.ac.in/courses/108/105/108105132/
2. Digital Electronics Lab: http://vlabs.iitkgp.ac.in/dec

Faculty Incharge

Dr. Srinivasa A H
Mrs. Vinutha M S
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science and Business Systems
Scheme and Syllabus - NEP – 2023 -2024
Course Title DATABASE MANAGEMENT SYSTEMS
Course Code 22CBU303
Category Integrated Professional Core Course (IPCC)
Scheme and No. of Hours/Week Total teaching Credits
Credits L T P SS Total hours
03 00 02 00 05 60 04
CIE Marks: 50 SEE Marks: 50 Total Max. marks=100 Duration of SEE: 03 Hours

COURSE OBJECTIVES:
1. To understand the different issues involved in the design and implementation of a database system.
2. To study the physical and logical database designs, database modeling, relational algebra concepts.
3. To understand and use data manipulation language to query, update and manage a database
4. To develop an understanding of essential DBMS concepts such as normalization and transaction
concepts.

UNIT I 9 Hours
Introduction: Introduction, an example, Characteristics of Database approach; Advantages of using
DBMS approach; Data models, schemas and instances; three schema architecture and data
independence; Database languages and interfaces; Classification of Database management systems.
Entity-Relationship model; using High- Level conceptual Data Models for database Design; An
example Database Application; Entity types, Entity Sets, Attributes and Keys; Relationship types,
Relationship Sets, Roles and structural Constraints; Weak Entity types; Refining the ER Design, ER
to relational schema diagram mapping.
UNIT II 8 Hours
Relational Model and Relational Algebra: Relational Model Concepts; relational Model constraints
and Relational Database Schemas; update operations, Transactions and dealing with constraint
violations; Unary Relational Operations; SELECT and PROJECT; Relational Algebra Operations from
Set Theory; Binary Relational Operations: JOIN and DIVISION; Additional Relational Operations;
Examples of Queries in Relational Algebra.
UNIT III 8 Hours
SQL: Specifying basic constraints in SQL; schema change statements in SQL; Basic queries in SQL;
More complex SQL queries-Insert, Delete and Update statements in SQL; Specifying constraints as
Assertion and Trigger; Views (Virtual Tables) in SQL.
UNIT IV 9 Hours
Database Design: Informal Design Guidelines for Relation Schemas; Functional Dependencies;
Normal Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms;
Boyce-Cod Normal form, Properties of Relational Decompositions; Algorithms for relational Database
Schema Design; Multi-valued Dependencies and Fourth Normal Form; Join Dependencies and Fifth
Normal Form
 UNIT V 8 Hours
Transaction Management: Transaction and System Concepts, Desirable Properties of Transactions,
characterizing schedules based on Recoverability, characterizing schedules based on Serializability.
Two-Phase Locking Techniques for Concurrency Control, Concurrency Control based on Timestamp
ordering.

Laboratory Component:
1. Execution of any three exercises involving complete database creation and implementing simple &
complex queries as discussed in the theory classes.
2. Implementation of mini project.
A mini project should be implemented by the students in teams. The maximum size of a team can be
2-3 from the same batch. The students must finalize a project topic by discussing with the faculty. The
mini project must be carried out in the college only.
The tasks when implementing mini project would be:
1. Understand the complete domain knowledge of the application and derive the complete data
requirement specification for the mini project.
2. Design the ER diagram for the application.
3. Design Relational Schema diagram for the application.
4. Normalization of the relational design.
5. Implement minimum 5 queries for the application.
6. Documentation & submission of report.
General guidelines:
• Database for the project - Oracle / MySQL/ DB2 / SQL Server / MongoDB etc.
• Design a Database application for a particular case study using Visual Basic/Java Script in visual
studio /Eclipse Tool.

Sample Mini Projects.

Inventory Control System. Placement management system
Material Requirement Processing. Library management system
Hospital Management System. Web Based User Identification System.
Railway Reservation System. Timetable Management System
Hotel Management System Personal Information System
Note: In the CIE, the marks will be evaluated based on mini project demonstration, project report and
viva-voce.
TEACHING LEARNING PROCESS: Chalk and Talk, Power Point presentation, videos, quiz,
brainstorming.
OUTCOMES: On completion of the course, student should be able to:
CO1: Understand the basic concepts and architecture associated with DBMS so as to employ the
conceptual and relational models to design large database systems.
CO2: Create, maintain and manipulate a relational database using SQL.
CO3: Analyze the database design & normalize it so that the data conforms to design principles.
CO4: Apply the characteristics of database transactions and assess how they affect database integrity and
consistency.
TEXT BOOKS
1. Fundamental of Database Systems by Elmasri and Navathe, 7th Edition, Addison-Wesley, 2015, ISBN-
10: 0133970779, ISBN-13: 978-0133970777
REFERENCE BOOKS
1. Database Management Systems by Raghu Ramakrishnan and Johannes Gehrke – 3rd Edition, McGraw-
Hill, 2006.
2. An Introduction to Database Systems by C.J. Date, A. Kannan, S. Swamynathan, 8th Edition, Pearson
Education,2013.
3. Data Base system Concepts by Silberschatz, Korth and Sudharshan, 5th edition McGraw Hill, 2011.

ONLINE RESOURCES
1. Database Management System: https://onlinecourses.nptel.ac.in/noc19_cs46/course
2. Introduction to Database Management Systems:
https://www.youtube.com/watch?v=OMwgGL3lHlI&list=PLBlnK6fEyqRiyryTrbKHX1Sh9luYI0dhX
3. SQL Tutorial - Full Database Course for Beginners:
https://www.youtube.com/watch?v=HXV3zeQKqGY

SCHEME FOR EXAMINATIONS

Theory Question Paper Pattern:
1) Answer ANY ONE from Question No. 1 and 2
2) Answer ANY ONE from Question No. 3 and 4
3) Answer ANY ONE from Question No. 5 and 6
4) Answer ANY ONE from Question No. 7 and 8
5) Answer ANY ONE from Question No. 9 and 10

MAPPING of CO’s with PO’s

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 - - - - - - -
CO2 3 3 3 3 2 - - - - - - -
CO3 3 3 2 2 - - - - - - -
CO4 2 2 2 - - - - - - -
Strength of correlation: Low-1, Medium- 2, High-3

Faculty In-charge
1. Dr. Asha
2. Mrs. Veena Potdar
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title DATA STRUCTURES AND APPLICATIONS
Course Code 22CBT304
Category Professional Core Course (PCC)
Scheme No. of Hours/Week Total Credits
and L T P SS Total teaching
Credits hours
2 1 0 0 4 52 3
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100
COURSE OBJECTIVES:
1. Understanding various searching & sorting techniques.
2. Explain fundamentals of data structures and their applications essential for implementing
solutions to problems.
3. Illustrate representation of data structures: Stack, Queues, Linked Lists and Trees.
4. Design and Develop Solutions to problems using Arrays, Structures, Stack, Queues,
Linked Lists, and Trees.
5. Find suitable data structure for application development.
UNIT-1 (8 Hours)

Algorithm Specification: Algorithms for sorting and searching.

Introduction: Data Structures, Classifications (Primitive & Non-Primitive), Data structure
operations. (Traversing, inserting, deleting, searching, and sorting).
Arrays and Structures: Arrays, Dynamically Allocated Arrays, Structures and Unions,
Demonstration of representation of Polynomials and Sparse Matrices. Dynamic Memory
Allocation along with its Functions.

UNIT-2 (8 Hours)

Recursion: Recursive Definition and Processes, Recursion in C, The Towers of Hanoi

Problem.
Stacks: Definition, System stack, Stack Operations, Array Representation of Stacks, Stacks
using Dynamic Arrays. Different representation of expression. Stack Applications with Infix
to postfix conversion and evaluation of postfix expression.

UNIT-3 (9 Hours)

Queues: Definition, Kinds of Queues, Array Representation of Queues, Queue Operations,

Circular Queues, Queues and Circular queues using Dynamic arrays.
Linked Lists: Definition, classification of linked lists. Representation of different types of
linked lists in Memory, Traversing, Insertion, Deletion, Searching, Sorting, and
Concatenation Operations on Singly linked list, Linked Stacks and Queues.

UNIT-4 (8 Hours)

Header linked lists and Circular linked lists with basic operations.
Applications of Linked lists – Polynomials, Programming Examples.
Doubly Linked lists and Circular Doubly linked lists, Programming Examples Miscellaneous
problems on Linked List.
UNIT-5 (9 Hours)

Trees 1: Terminologies, Representation of Trees, Binary Trees, Properties of Binary trees, Array
and linked Representation of Binary Trees, Binary Tree Traversals - Inorder, Postorder, Preorder;
Level-order
Binary Search Trees – Definition, Insertion, Deletion, Traversal, and Searching operation on
Binary search tree.
Trees 2: Application of Trees-Evaluation of Expression, Threaded binary trees,
Heaps: Definition, Insertion into max heap
Course Outcomes Statements Blooms Level
CO1 Identify different data structures and their applications. L2
CO2 Apply stack and queues in solving problems. L3
CO3 Demonstrate applications of linked list. L4

CO4 Explore the applications of trees to model and solve the L2

real-world problem.

TEXT BOOKS
1. Horowitz, Sahni, Anderson-Freed, Fundamentals of Data Structures in C, 2nd Ed,
Universities Press
2. Y Langsam, M J Augenstein, A M Tenenbaum, Data Structures using C and C++, 2nd Ed,
PHI
REFERENCE BOOKS
1. Gilberg and Forouzan, Data Structures: A Pseudo-code approach with C, 2nd Ed, Cengage
Learning,2014.
2. Reema Thareja, Data Structures using C, 3rd Ed, Oxford press, 2012.
3. Jean-Paul Tremblay & Paul G. Sorenson, An Introduction to Data Structures with
Applications,2nd Ed, McGraw Hill, 2013

ONLINE RESOURCES
1. http://elearning.vtu.ac.in/econtent/courses/video/CSE/06CS35.html
2. https://nptel.ac.in/courses/106/105/106105171/
3. http://www.nptelvideos.in/2012/11/data-structures-and-algorithms.html

FACULTY INCHARGE: Dr. Harish G & Asha Rani K P

 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title DATA STRUCTURES LAB
Course Code 22CBL305
Category Professional Core Course Lab (PCCL)
Schem No. of Hours/Week Total Credits
e and L T P S Tota teaching
Credit S l hours
s 0 0 2 0 02 12 1
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100

COURSE OBJECTIVES:

The objectives of this course are:

1. Understanding various searching & sorting techniques.
2. To strengthen the ability to identify and apply the suitable data structure for the given
real-world problem by developing algorithms for manipulating stacks & queues, linked
lists, trees.
3. To understand recursion concept.

1. (SORTING & SEARCHING)

Write a C program to perform the below operations on an unordered list of integers
a. Selection sort
b. Linear search
2. (SEARCH IN SPARSE MATRIX)
Design, develop, and execute a program in C to read a sparse matrix of integer values and
to search the sparse matrix for an element specified by the user. Print the result of the
search appropriately. Use the triple <row, column, value> to represent an element in the
sparse matrix
3. (RECURSION)
Write recursive C Programs for
a. Searching an element on a given list of integers using the Binary Search method.
b. Solving the Towers of Hanoi problem.
4. (STACKS)
Write a C Program to construct a stack of integers and to perform the following operations
on it:
a. Push b. Pop c. Display
The program should print appropriate messages for stack overflow, stack underflow, and
stack empty.
5. (INFIX TO POSTFIX)
Design, develop, and execute a program in C to convert a given valid parenthesized infix
arithmetic expression to postfix expression and then to print both the expressions. The
expression consists of single character operands and the binary operators + (plus), -
(minus), * (multiply) and / (divide).
6. (EVALUATE A POSTFIX EXPRESSION)
Design, develop, and execute a program in C to evaluate a valid postfix expression using
stack. Assume that the postfix expression is read as a single line consisting of non-
negative single digit operands and binary arithmetic operators. The arithmetic operators
are + (add), - (subtract), * (multiply) and / (divide).
7. (QUEUE)
Design, develop, and execute a program in C to simulate the working of a queue of
integers using an array. Provide the following operations:
a. Insert b. Delete c. Display
8. (CIRCULAR QUEUE)
Write a C Program to simulate the working of a circular queue of integers using an array.
Provide the following operations:
a. Insert b. Delete c. Display
9. (STACKS USING SINGLY LINKED LIST)
Write a C Program using dynamic variables and pointers to construct a stack of integers
using singly linked list and to perform the following operations:
a. Push b. Pop c. Display
The program should print appropriate messages for stack overflow and stack empty.
10. (QUEUES USING SINGLY LINKED LIST)
Write a C program using dynamic variables and pointers to construct a queue of integers
using singly linked list and to perform the following operations:
a. Insert b. Delete c. Display
The program should print appropriate messages for queue full and queue empty.
11. (POLYNOMIAL ADDITION USING LINLKED LIST)
Using circular representation for a polynomial, design, develop, and execute a program
in C to accept two polynomials, add them, and then print the resulting polynomial.
12. (DOUBLY LINKED LIST)
Design, develop, and execute a program in C to implement a doubly linked list where
each node consists of integers. The program should support the following operations:
i. Create a doubly linked list by adding each node at the front.
ii. Insert a new node to the left of the node whose key value is read as an input.
iii. Delete the node of a given data if it is found, otherwise display appropriate
message.
iv. Display the contents of the list.
(Note: Only either (a,b and d) or (a, c and d) may be asked in the examination)
13. (TREES)
Write a C Program
a. To construct a binary search tree of integers.
b. To traverse the tree using all the methods
• Inorder, Preorder, Postorder.

c. To display the elements in the tree.

14. (MAX HEAP CREATION)
Design, develop, and execute a program in C to create a max heap of integers by accepting
one element at a time and by inserting it immediately in to the heap. Use the array
representation for the heap. Display the array at the end of insertion phase.
 Course Statements Bloom’s
Outcomes Level
CO1 Analyse searching and sorting techniques L3
CO2 Analyse problem and propose solution by selecting L3
appropriate data structures.
CO3 Solve a problem using Recursion. L3

FACULTY INCHARGE:
1. Dr. Harish G
2. Asha Rani K P
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title FORMAL LANGUAGE & AUTOMATA THEORY
Course Code 22CBT306A
Category Engineering Science Course (ESC/ETC/PLC)
Schem No. of Hours/Week Total Credit
e and L T P S Tota teachin s
Credits S l g hours
3 0 0 0 3 42 3
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100
COURSE OBJECTIVES:
1. Present fundamental concepts and techniques for designing Automata.
2. Provide necessary background for formulating real-world problems to Finite state machines,
construct regular expressions and conversion between themselves.
3. Use the pumping lemma to demonstrate the non-regularity of languages.
4. Design Pushdown Automata for various context-free Grammars, also design Turing Machines.
5. Present fundamental concepts and techniques for the design of a compiler

UNIT-1 (09 Hours)

Introduction to Finite Automata: Introduction to Finite Automata; The central concepts of

Automata theory; Deterministic finite automata; The Language of a DFA, Extending the
Transition Function to Strings, Nondeterministic finite automata and its conversion, The
Extended Transition Function, Equivalence of Deterministic and Nondeterministic Finite
Automata, Finite automata with Epsilon-transitions, Extended Transitions and Languages for
NFAs, Eliminating Epsilon-Transitions
UNIT-2 (08 Hours)

Regular Expressions: The Operators of Regular Expressions, Building Regular Expressions,

From DFAs to Regular Expressions, Converting DFAs to Regular Expressions by Eliminating
States, Converting Regular Expressions to Automata Regular Languages: Regular languages;
Proving languages not to be regular languages; Equivalence and minimization of automata
UNIT-3 (08 Hours)

Context-Free Grammars and Languages : Context–free grammars, Definition,

Examples, Derivation, Parse trees; Ambiguity in grammars and Languages.

UNIT-4 (09 Hours)

Pushdown Automata: Description and definition, Instantaneous Description, Language of

PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA.
 Introduction To Turing Machine: Problems that Computers cannot solve; Definition and
representation, Basic model of Turing Machine, Instantaneous Description, Language
acceptance by Turning Machines, Programming techniques for Turning Machines
UNIT-5 (08 Hours)

Introduction to Compiler Design: The Structure of a Compiler, Language Processors, Phases

of Compilers, Applications of Compiler Technology, Programming Language Basics.
Lexical Analysis Phase of compiler Design: Role of Lexical Analyzer, Input Buffering,
Specification of Token, Recognition of Token.

Course
Blooms
Outcome Statements
Level
s
Design different finite state machines for regular languages, make
CO1 conversion between them, construct the regular expression and study its 6
applications.
Obtain a minimized DFA, convert the given automata to regular
CO2 expressions and vice-versa and prove languages not to be regular using 4
pumping lemma.
Know basic definitions in Grammar, Write CFGs, Construct parse trees,
CO3 3
find and remove ambiguity in grammars.
Study Pushdown Automata, Design NPDA and DPDA after the CFG
CO4 conversion and convert PDAs to grammar. Design Turing machines to 2
solve
Illustrate the structure of compiler including its phases and components and
CO5 Design and Implement Lexical Analyzer for different programming 3
constructs by having a good knowledge of Context Free Grammars.

TEXTBOOKS
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Automata Theory,
Languages and Computation, Publisher: Pearson Education; Third edition (2011)
(Chapters: 1.1, 1.5, 2.2 to 2.5, 3.1 to 3.3, 4, 5, 6, 7, 8.1 to 8.4, 8.6)
ISBN-10: 8131762688 & ISBN-13: 978-8131762684
2. Alfred W Aho, Monica S Lam, Ravi Sethi, and Jeffrey D Ullman, “Compilers-Principles,
Techniques and Tools” Publisher: Pearson Education; Second edition (1 January 2011)
ISBN-10: 8131759024 ISBN-13: 978-8131759028

Reference Books:
1. K.L.P. Mishra: Theory of Computer Science, Automata, Languages and Computation, 3rd
Edition, PHI, 2007. ISBN-978-81-203-2968-3
2. Raymond Greenlaw, H. James Hoover: Fundamentals of the Theory of Computation, Principles
and Practice, Morgan Kaufmann, 1998. ISBN 9781558605473, 9780080948355
3. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata McGraw-
Hill, 2007. ISBN 10: 0070660484 / ISBN 13: 9780070660489
4. Kavi Mahesh: Theory of Computation, A Problem-solving approach, Wiley-India.
ISBN: 9788126533114

Web Links for Self Study:

1) http://nptel.vtu.ac.in/econtent/courses/CSE/CS44/index.php
2) https://www.classcentral.com/course/swayam-introduction-to-automata-languages-and-
computation-12943
3) https://freevideolectures.com/course/3379/formal-languages-and-automata-theory
4) https://nptel.ac.in/courses/106106049/ (Video course)
5) https://nptel.ac.in/courses/106/103/106103070/ (Web course)

FACULTY NAME: Dr. Harish G & Mrs. Veena Potdar

 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024

Course Title OOPS with C++

Course Code 22CBT306B
Category Engineering Science Course (ESC/ETC/PLC)
Scheme No.of Hours/Week Total teaching Credits
and L T P SS Total hours
Credits 03 00 00 00 03 42 03
CIE Marks: 50 SEE Marks: Total Max. Duration of SEE:03 Hours
50 marks=100

Course Objectives:
CLO 1. Understanding about object-oriented programming and Gain knowledge about the capability
to store information together in an object.
CLO 2. Understand the capability of a class to rely upon another class and functions.
CLO 3. Understand about constructors which are special type of functions.
CLO 4. Create and process data in files using file I/O functions
CLO 5. Use the generic programming features of C++ including Exception handling.
UNIT I -08 hrs
Introduction to Object Oriented Programming: Computer programming background- C++
overview- First C++ Program -Basic C++ syntax, Object Oriented Programming: What is an object,
Classes, methods and messages, abstraction and encapsulation, inheritance, abstract classes,
polymorphism.
Programming Assignments:
1. Write a C++ program to sort the elements in ascending and descending order.
2. Write a C++ program to find the sum of all the natural numbers from 1 to n.
UNIT II – 09 hrs
Functions in C++: Tokens – Keywords – Identifiers and constants – Operators in C++ – Scope
resolution operator – Expressions and their types – Special assignment expressions – Function
prototyping – Call by reference – Return by reference – Inline functions -Default arguments –
Function overloading.
Programming Assignments:
1. Write a C++ program to swap 2 values by writing a function that uses call by reference
technique.
2. Write a C++ program to demonstrate function overloading for the following prototypes.
add(int a, int b)
add(double a, double b)
UNIT III – 09 hrs
Inheritance & Polymorphism: Derived class Constructors, Destructors-Types of Inheritance-
Defining Derived classes, Single Inheritance, Multiple, Hierarchical Inheritance, Hybrid
Inheritance.
 Programming Assignments:
1. Create a class named Shape with a function that prints "This is a shape". Create another class
named Polygon inheriting the Shape class with the same function that prints "Polygon is a
shape". Create two other classes named Rectangle and Triangle having the same function
which prints "Rectangle is a polygon" and "Triangle is a polygon" respectively. Again, make
another class named Square having the same function which prints "Square is a rectangle".
Now, try calling the function by the object of each of these classes.
2. Suppose we have three classes Vehicle, Four-Wheeler, and Car. The class Vehicle is the base class,
the class Four-Wheeler is derived from it and the class Car is derived from the class Four-wheeler.
Class Vehicle has a method 'vehicle' that prints 'I am a vehicle', class Four-wheeler has a method
'four-Wheeler' that prints 'I have four wheels', and class Car has a method 'car' that prints 'I am a
car'. So, as this is a multi-level inheritance; we can have access to all the other classes methods
from the object of the class Car. We invoke all the methods from a Car object and print the
corresponding outputs of the methods. So, if we invoke the methods in this order, car(),
fourWheeler(), and vehicle(), then the output will be
• I am a car
• I have four wheels
• I am a vehicle
Write a C++ program to demonstrate multilevel inheritance using this.
UNIT IV – 08 hrs
I/O Streams: C++ Class Hierarchy- File Stream-Text File Handling- Binary File Handling during
file operations.
Programming Assignments:
1. 1. Write a C++ program to create a text file, check file created or not, if created it will write some
text into the file and then read the text from the file.
2. Write a C++ program to write and read time in/from binary file using fstream
UNIT V – 08 hrs
Exception Handling: Introduction to Exception - Benefits of Exception handling- Try and catch
block- Throw statement- Pre-defined exceptions in C++.
Programming Assignments:
1. Write a function which throws a division by zero exception and catch it in catch block. Write a
C++ program to demonstrate usage of try, catch and throw to handle exception.
2. Write a C++ program function which handles array of bounds exception using C++.

Course
Course Outcome Statements
Outcomes
Construct classes incorporating the object-oriented techniques to solve engineering
CO1
problems.
Demonstrate the ability to design and develop C++ programs, analyze and interpret
CO2
object-oriented data and document results.
Apply the concept of function overloading, operator overloading, virtual functions and
CO3
polymorphism.
CO4 Develop user friendly applications using File I/O, STL and exception
handling mechanism.
 Textbooks
1. Bhushan Trivedi, “Programming with ANSI C++”, Oxford Press, Second Edition, 2012.
2. Balagurusamy E, Object Oriented Programming with C++, Tata McGraw Hill Education
Pvt. Ltd , Fourth Edition 2010.

Reference Books
1. Bhave , “ Object Oriented Programming With C++”, Pearson Education , 2004.
2. Ray Lischner, “Exploring C++ : The programmer’s introduction to C++” , press, 2010
Bhave , “ Object Oriented Programming With C++”, Pearson Education , 2004
Weblinks and Video Lectures (e-Resources):
1. Basics of C++ -https://www.youtube.com/watch?v=BClS40yzssA
2. Functions of C++ -https://www.youtube.com/watch?v=p8ehAjZWjPw

Tutorial Link:
1.https://www.w3schools.com/cpp/cpp_intro.asp
2. https://www.edx.org/course/introduction-to-c-3
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
Demonstration of simple projects
Faculty In-charge
1. Dr. Suresha D
2. Dr. Praveena M V
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024

Course Title Java Programming

Course Code 22CBT306C
Category Engineering Science Course (ESC/ETC/PLC)
Scheme No. of Hours/Week Total Credits
and L T P SS Total teaching
Credits hours
03 01 00 00 04 52 03
CIE Marks: SEE Marks: Total Max. Duration of SEE:03 Hours
50 50 marks=100
COURSE OBJECTIVES:

● Learn fundamental features of object oriented language and JAVA

● Set up Java JDK environment to create, debug and run simple Java programs.
● Study the concepts of creation of Threads ,Inheritance concepts and to learn GUI Based
programs Using Applets.
● Study the concepts of importing of packages and exception handling mechanism.

UNIT I 08 hours
An Overview of Java: Object-Oriented Programming, A First Simple Program, A Second
Short Program, Two Control Statements, Using Blocks of Code, Lexical Issues, The Java Class
Libraries, Data Types
Variables, and Arrays: Java Is a Strongly Typed Language, The Primitive Types, Integers,
Floating-Point Types, Characters, Booleans, A Closer Look at Literals, Variables, Type
Conversion and Casting, Automatic Type Promotion in Expressions, Arrays, A Few Words
About Strings.
UNIT II 08 hours
Operators: Arithmetic Operators, The Bitwise Operators, Relational Operators, Boolean
Logical Operators, The Assignment Operator, The? Operator, Operator Precedence, Using
Parentheses, Control Statements: Java’s Selection Statements, Iteration Statements, Jump
Statements.
Applet: Introduction to Applet, Applet Life Cycle, Graphics in Applet, Displaying Image in
Applet, Painting in Applet.
UNIT III 08 hours
Introducing Classes and Methods: Class Fundamentals, Declaring Objects, Assigning Object
Reference Variables, Introducing Methods, Constructors, The this Keyword, Garbage
Collection, The finalize( ) Method, A Stack Class. A Closer Look at Methods and Classes:
Overloading Methods, Using Objects as Parameters, A Closer Look at Argument Passing,
Returning Objects, Recursion, Introducing Access Control, understanding static, Introducing
final.
UNIT IV 10 hours
 Multi-Threaded Programming: Multi Threaded Programming: What are threads? How to make
the classes threadable , Extending threads, Implementing runnable, Synchronization, Changing
state of the thread, producer consumer problems.
Exception Handling: Exception-Handling Fundamentals, Exception Types, Uncaught
Exceptions, Using try and catch, Multiple catch Clauses, Nested try Statements, throw, throws,
finally, Java‟s Built-in Exceptions, Creating Your Own Exception Subclasses, Chained
Exceptions, Using Exceptions
UNIT V 08 hours
Packages and Interfaces: Packages, Access Protection, Importing Packages, Interfaces.
Inheritance: Inheritance, Using super, Creating a Multilevel Hierarchy, When Constructors Are
Called, Method Overriding, Dynamic Method Dispatch, Using Abstract Classes, Using final
with Inheritance, The Object Class.

COURSE OUTCOMES:
CO1: Design Classes and establish relationship among Classes for various applications from
problem definition.
CO2: Analyze and implement reliable object-oriented applications using Java features.
CO3: Demonstrate Java concepts to implement window based program and GUI Programms.
CO4: Write Java programs to implement Multithreads and handle Exceptions in Program.

TEXT BOOKS:
1. The Complete Reference - Java, Herbert Schildt 9th Edition, 2016, TMH Publications,
ISBN :978-93-392-1209-4.

REFERENCE BOOKS:

1. Cay S.Horstmann :Core Java volume I-Fundamental ,11th Edition, Pearson Education,
2019.
WEBLINKS:
1. https://www.youtube.com/watch?v=mQj34vUhpts&list=PLfn3cNtmZdPOe3R_wO_h540QNf
MkCQ0ho&index=44&t=0s - Swing I
2. https://www.youtube.com/watch?v=FY3g4gGPhio&list=PLfn3cNtmZdPOe3R_wO_h540QNf
MkCQ0ho&index=44 – Swing II
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title BUSINESS COMMUNICATION &VALUE SCIENCE – I
Course Code 22CBT308A
Category Ability Enhancement Course (AEC)
Scheme and No. of Hours/Week Total Credits
Credits L T P SS Total Teaching
hours
01 00 00 00 01 15 01
CIE Marks: 50 SEE Marks: Total Max. Duration of SEE: 02 Hours
50 marks=100
COURSE OBJECTIVES:
1. To develop effective writing, reading, presentation and group discussion skills
2. To help students to identify personality traits and evolve as a better team player
3. To understand what life skills are and their importance in leading a happy and well-adjusted
life
4. To motivate students to look within and create a morality, behavior & beliefs
5. To introduce the key concepts of values, diversity and inclusion

UNIT I -05 hrs

Listening process – short texts – formal and informal conversations - basics in speaking –
speaking on given topics & situations – recording speeches and strategies to improve.
UNIT II -03 hrs
Overview of LOL (include activity on introducing self)- class activity – presentation on favorite
cricket captain in IPL and the skills and values they demonstrate - self-work with immersion –
mock interview
UNIT III -02 hrs
Listening – law of nature - importance of listening skills -difference between listening and
hearing, types of listening - formal and informal Emails - common errors – voices - speaking –
role plays – overview of communication skills – barriers of communication – effective
communication - types of communication – verbal and non-verbal –
UNIT IV -02 hrs
Listening - debates and discussions – practicing multiple tasks – verbal communication –
pronunciation / clarity of speech –newspaper-based activities – group discussion – writing –
summary writing – story writing – resume writing – interpersonal skills – stress management –
time management.
UNIT V -03 hrs
Listening to selected speeches and presentations – understanding life skills introduction to
life skills – multiple intelligence embracing diversity – speaking – Life skills: community
service work with an NGO and make a presentation – leadership – team work – managing stress
– motivating people.
 Course Blooms
Statements
Outcomes Level
CO1 Comprehend conversations and talks presented in English. L2
CO2 Recognize the need for life skills and values. L2
CO3 Recognize own strengths and opportunities. L2
CO4 Apply the life skills to different situations. L3
CO5 Understand the basic tenets of communication. L1

TEXT BOOKS:
1. Board of editors. Fluency in English A Course book for Engineering and Technology. Orient
Blackswan, Hyderabad: 2016.
2. Richards, C. Jack. Interchange Students’ Book – 2 New Delhi: CUP, 2015.

REFERENCE BOOKS:
1. Dr. A.P.J Abdul Kalam, “Guiding Souls : Dialogues on the purpose of life”; Publishing Year
2005; Co-author--Arun Tiwari .
2. Dr. A.P.J Abdul Kalam, “The Family and the Nation”, Publishing year: 2015; Coauthor:
Acharya Mahapragya.
2. Dr. A.P.J Abdul Kalam, “The Scientific India: A twenty First Century Guide to the World
around us”, Publishing year: 2011; Co-author- Y.S.Rajan.
3. Dr. A.P.J Abdul Kalam, “Forge Your Future: Candid, Forthright, Inspiring”, Publishing year:
2014.
4. Peter H. Diamandis and Steven Kotler, “Abundance: The Future is Better Than You Think”,
Published: 21 Feb, 2012; Publisher: Free Press.
5. Simon Sinek, “Start With Why: How Great Leaders Inspire Everyone to Take Action”,
Published: 6 October 2011; Publisher: Penguin.
6. Sandra Moriarty, Nancy D. Mitchell, William D. Wells, “Advertising & IMC: Principles and
Practice”, Published: 15 June 2016; Publisher: Pearson
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title PRINCIPLES OF ECONOMICS
Course Code 22CBT308B
Category Ability Enhancement Course (AEC)
Scheme No. of Hours/Week Total Credits
and L T P SS Total Teaching
Credits hours
01 00 00 00 01 15 01
CIE Marks: 50 SEE Marks: 50 Total Max. Duration of SEE: 02 Hours
marks=100

Unit I (08 Hrs)

Microeconomics: Principles of Demand and Supply - Supply Curves of Firms - Elasticity of
Supply; Demand Curves of Households - Elasticity of Demand; Equilibrium and Comparative
Statics (Shift of a Curve and Movement along the Curve); Welfare Analysis - Consumers’ and
Producers’ Surplus - Price Ceilings and Price Floors; Consumer Behaviour - Axioms of Choice
- Budget Constraints and Indifference Curves; Consumer’s Equilibrium - Effects of a Price
Change, Income and Substitution Effects -Derivation of a Demand Curve; Applications - Tax
and Subsidies - Intertemporal Consumption - Suppliers’ Income Effect; Theory of Production -
Production Function and Iso-quants - Cost Minimization; Cost Curves - Total, Average and
Marginal Costs - Long Run and Short Run Costs; Equilibrium of a Firm Under Perfect
Competition; Monopoly and Monopolistic Competition
Unit II (07 Hrs)

Macroeconomics: National Income and its Components - GNP, NNP, GDP, NDP; Consumption
Function; Investment; Simple Keynesian Model of Income Determination and the Keynesian
Multiplier; Government Sector - Taxes and Subsidies; External Sector - Exports and Imports;
Money - Definitions; Demand for Money -Transactionary and Speculative Demand; Supply of
Money - Bank’s Credit Creation Multiplier; Integrating Money and Commodity Markets - IS,
LM Model; Business Cycles and Stabilization - Monetary and Fiscal Policy - Central Bank and
the Government; The Classical Paradigm - Price and Wage Rigidities - Voluntary and
Involuntary Unemployment.

TEXT BOOKS:
1. Microeconomics, Pindyck, Robert S., and Daniel L. Rubinfeld.
2. Macroeconomics, Dornbusch, Fischer and Startz.
3. Economics, Paul Anthony Samuelson, William D. Nordhaus
REFERENCE BOOKS:
1. Intermediate Microeconomics: A Modern Approach, Hal R, Varian.
2. Principles of Macroeconomics, N. Gregory Mankiw.

Dr. Ambedkar Institute of Technology, Bengaluru-56

 Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title FUNDAMENTALS OF MANAGEMENT

Course Code 22CBT401

Category PCC
Scheme and No. of Hours/Week Total Credits
Credits L T P SS Total Teaching
hours
03 00 00 00 03 42 03
CIE Marks: 50 SEE Marks: Total Max. Duration of SEE: 02 Hours
50 marks=100

COURSE OBJECTIVES:
1. To make students understand fundamental concepts, historical development and principles of
management, basic roles, skills and application of managerial functions.
2. To understand the basic concepts and theories underlying individual behavior besides
developing better insights into one’s own self.
3. To make students aware of Individual behavior in groups and develop motivational and
leadership skills to become a better facilitator for building effective teams as leaders themselves.

UNIT – I
Management Theories: Concept and Foundations of Management, Evolution of Management
Thoughts [Pre-Scientific Management Era (before 1880), Classical management Era (1880-1930),
Neo-classical Management Era (1930-1950), Modern Management era (1950-on word).
Contribution of Management Thinkers: Taylor, Fayol, Elton Mayo etc.

UNIT – II
Planning: Meaning and Nature, Types of Plans and Steps in Planning process.
Organizing: Nature and purpose of organization, Types of organization structure, Centralization
Vs Decentralization, authority and responsibility, span of control, MBO and MBE ( meaning)
Staffing: Nature& Importance, Process of Selection and Recruitment. Directing: Meaning &
Nature of directing, Leadership Styles: Autocratic, Democratic, Charismatic, Laissez faire &
Participative Controlling: Meaning, the basic control process. Types of control Case Study
Discussion

UNIT – III

Organization Behavior: Introduction, Personality, Perception, Learning and Reinforcement,

Motivation, Group Dynamics, Power & Influence, Work Stress and Stress Management, Decision
Making, Problems in Decision Making, Decision Making, Organizational Culture, Managing
Cultural Diversity

UNIT – IV
Organizational Design: Classical, Neoclassical and Contingency approaches to organizational
design; Organizational theory and design, Organizational structure (Simple Structure, Functional
Structure, Divisional Structure, Matrix Structure)

UNIT – V

Managerial Ethics: Ethics and Business, Ethics of Marketing & advertising, Ethics of Finance &
Accounting, Decision – making frameworks, Business and Social Responsibility, International
Standards, Corporate Governance, Corporate Citizenship, Corporate Social Responsibility

Leadership: Concept, Nature, Importance, Attributes of a leader, developing leaders across the
organization, Leadership Grid

Home Assignment:
The topic for class discussion will be mentioned beforehand and students should be ready to
discuss these topics (in groups) in class. Students are required to meet in groups before coming to
class and prepare on the topic. Few topics are mentioned below as examples. Instructor can add
or change any topic as per requirement.
1. Topic: Corporate social responsibility (CSR) and HRM implications: What does it mean
to be socially responsible within an increasingly financially driven market economy?
2. Topic: Leaders are Born, Not Made! The debate
COURSE OUTCOMES:
1. Appreciate the overview of theory of management and demonstrate their exposure on recent
trends in management.
2. Comprehend & correlate all the concepts of management and its functions and link them to
organizational context.
3. Realize the organisational behaviour and foundations of individual behaviour. and demonstrate
the same in taking critical decisions.
4. Demonstrate their acumen in motivating, leading team, effectively use their skills for self-
grooming, working in groups and to achieve organizational goals in real world/situation.
5. Apprehend and demonstrate their exposure on recent trends in management.

Text Books:

1. Richard L. Daft, Understanding the Theory and Design of Organizations

Reference Books:
1. Stephen P. Robbins, Timothy A. Judge, Neharika Vohra, Organizational Behavior

Dr. Ambedkar Institute of Technology, Bengaluru-56

Department of Computer Science & Business systems
 NEP – 2023 -2024
Course Title OPERATING SYSTEM
CourseCode 22CBU402
Category IPCC
Scheme No. of Hours/Week Total teaching Credits
and L T P SS Total hours
Credits 03 00 02 00 05 42 04
CIE Marks: 50 SEE Marks: Total Max. Duration of SEE:03 Hours
50 marks=100
COURSE OBJECTIVES:
1. To introduce the basics of computer system organization and different structures of operating
system Design
2. To explain process management and CPU scheduling, along with the concept of multithreading.
3. To illustrate process Synchronization and concept of Deadlock by solving problems.
4. To explain Main Memory and Virtual memory management, File system and Mass storage
structures with problem solving

UNIT I (8 hours)
Introduction: What Operating Systems Do, Computer-System Organization, Computer-System
Architecture, Operating-System Structure, Resource Management, Virtualization, Distributed
Systems
Operating-System Structures: Operating-System Services, System Calls, Operating-System
Design and Implementation, Operating-System Structure.
Laboratory Component
• Basics of UNIX commands
UNIT II (8 hours)
Process Management: Process Concept, Process Scheduling, Operations on Processes, Inter-
process Communication, IPC in Shared-Memory Systems, IPC in Message-Passing Systems.
CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms.
Laboratory Component
• Write C program to implement Process system calls.
• Write a C program to implement producer/consumer problem.
• Consider the following set of processes with the length of the CPU burst given in
milliseconds.
Process Burst Time Priority
P1 2 2
P2 1 1
P3 8 4
P4 4 2
P5 5 4
All processes are assumed to have arrived at time 0 and in the order P1, P2, P3, P4, P5.
Write C program to implement the following:
i.FCFS scheduling, Priority scheduling
 UNIT III (9 hours)
Process Synchronization: Background, The Critical-Section Problem, Peterson’s Solution,
Hardware Support for Synchronization, Mutex Locks, Semaphores, Monitors - Monitor usage.
Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks,
Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock.
Laboratory Component
• Consider the following snapshot of a system:
Process Allocation Max Available
A B C D A B C D A B C D
P0 3 0 1 4 5 1 1 7 0 3 0 1
P1 2 2 1 0 3 2 1 1
P2 3 1 2 1 3 3 2 1
P3 0 5 1 0 4 6 1 2
P4 4 2 1 2 6 3 2 5
Write a C program that implements Banker’s Algorithm, to determine if the given snapshot of the
system is in a safe state. Illustrate the order in which the process may complete, or illustrate why
the state is unsafe.
UNIT IV(8 hours)
Main Memory: Background, Contiguous Memory Allocation, Paging, Structure of the Page
Table, Segmentation.
Virtual Memory: Background, Demand Paging, Page Replacement, Allocation of Frames,
Introduction to Thrashing,
Laboratory Component
• Write a C program to implement the first-fit and best-fit algorithm for memory management.
• Consider the following page reference string:
7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1
Assuming demand paging with three frames, write C programs that implement calculation of the
number of page faults that would occur for the following replacement algorithms:
i.LRU
ii.FIFO
UNIT V (9 hours)
File system: File concept; Access methods; Directory structure; File system mounting; File
sharing, Memory Compression.
Storage Management: Mass storage structures - Disk structure, Disk attachment, Disk
scheduling, Disk management, Swap space management.
Laboratory Component
• Write a C program to perform file manipulation.
• Consider a disk queue with requests for I/O to blocks on cylinders 98, 183,
37, 122, 14, 124, 65, 67 in that order. Assume that the disk head is initially at cylinder 53.
Calculate the total head movement for the number of cylinders using the following
algorithms: FIFO, C_SCAN, LOOK
COURSE OUTCOMES:

CO1: Illustrate the role of an operating system with respect to resource management,
interfaces and system calls
CO2: Apply process scheduling algorithms to select the processes for execution and compare
their performances.
CO3: Interpret the requirements for process synchronization and understand the state of
deadlock in a computing environment and the methods to detect and overcome it
CO4: Describe and analyze the memory management and its allocation methods.
CO5 Identify the storage management methods with respect to different storage management
techniques.
Textbooks
1. Operating System Concepts - Tenth Edition, Avi Silberschatz, Peter Baer Galvin, Greg
Gagne, John Wiley & Sons, Inc. ISBN 978-1-118-06333-0

Reference Books
1.D.M Dhamdhere: Operating systems - A concept based Approach, 3rd Edition,
Tata McGraw- Hill, 2012. ISBN13: 9781259005589P.
2. C.P. Bhatt: Introduction to Operating Systems Concepts and Practice, 3rd
Edition, PHI, 2010. ISBN-10: 9788120348363
3. Harvey M Deital: Operating systems, 3rd Edition, Pearson Education, 2011. ISBN:
9788131712894
Weblinks and Video Lectures (e-Resources):
1. https://www.os-book.com/OS10/slide-dir/index.html
2. https://www.booksfree.org/pages/book-downloading-page/?dlm-dp-dl=24807
3. https://archive.nptel.ac.in/courses/106/105/106105214/
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
• Demonstration of simple projects

Faculty In-charge: Dr. Leena Giri G & Dr. Suresha D

 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
Scheme and Syllabus - NEP – 2023 -2024

Course Title ANALYSIS AND DESIGN OF ALGORITHMS

Course Code 22CBU403
Category Integrated Professional Core Course (IPCC)
Scheme No. of Hours/Week Total teaching Credits
and L T P SS Total hours
Credits 03 00 00 00 03 42 03
CIE Marks: 50 SEE Marks: Total Max. Duration of SEE: 03 Hours
50 marks=100

COURSE OBJECTIVES:
1. Explain the methods of analyzing the algorithms and to analyze performance of algorithms.
2. State algorithm’s efficiencies using asymptotic notations.
3. Solve problems using algorithm design methods such as the brute force method, greedy
method, divide and conquer, decrease and conquer, dynamic programming, backtracking
and branch and bound.
4. Choose the appropriate data structure and algorithm design method for a specified
application.

Unit 1
Introduction: What is an Algorithm? It’s Properties. Fundamentals of Algorithmic Problem solving,
Analysis Framework-Time efficiency and space efficiency, Worst-case, Best-case and Average case
efficiency.
Performance Analysis: Estimating Space complexity and Time complexity of algorithms.
Asymptotic Notations: Big-Oh notation (O), Omega notation (Ω), Theta notation () with examples,
Basic efficiency classes, Mathematical analysis of Non-Recursive and Recursive Algorithms with
Examples.
Brute Force Technique: Introduction, Linear Search, Bubble Sort, Selection Sort
Unit 2
Divide and Conquer: General method, Recurrence equation for divide and conquer, Divide and
Conquer algorithms and complexity Analysis of Binary search, Merge sort, Quick sort. MaxMin
problem
Unit 3
Greedy Method: General method, Knapsack Problem, solving Job sequencing with deadlines
Problems. Minimum cost spanning trees: Prim’s Algorithm, Kruskal’s Algorithm with performance
analysis. Single source shortest paths: Dijkstra's Algorithm.
Decrease and Conquer Approach: Introduction, Topological Sorting using source removal method,
Breadth First Search, Depth First Search.
Unit 4
 Dynamic Programming: General method with Examples, Transitive Closure: Warshall’s Algorithm.
All Pairs Shortest Paths: Floyd's Algorithm, Knapsack problem.
Space-Time Tradeoffs: Introduction, Sorting by Counting, Input Enhancement in String Matching
Harspool’s algorithm.
Unit 5
Backtracking: General method, solution using back tracking to N-Queens problem, Sum of subsets
problem,
Branch and Bound: Assignment Problem, Travelling Sales Person problem.

Laboratory
Implementation of Different Algorithms based on various algorithmic strategies using C/C++
TEACHING LEARNING PROCESS: Chalk and Talk, power point presentation, animations, videos

COURSE OUTCOMES: At the end of the course the student will be able to:
CO1. Analyze the running times of algorithms and Apply brute force approach in solving the
problem. State the performance of algorithm using asymptotic notations and mathematically
analyze the complexity of the algorithm.
CO2. Apply divide and conquer approaches in solving the problems. Derive and solve
recurrences describing the performance of divide-and-conquer algorithms.
CO3. Able to choose the appropriate algorithmic design technique like greedy method, decrease
and conquer and compare the efficiency of algorithms to solve the given problem.
CO4. Apply and analyze dynamic programming approaches and improve an algorithm time
efficiency over space.
CO5. Apply and analyze backtracking and branch and bound technique in solving the problem.
TEXT BOOKS
1. Anany Levitin: Introduction to Design &amp; Analysis of Algorithms, 3rd Edition, Pearson
Education,
2012.ISBN 10: 0-13-231681-1, ISBN 13: 978-0-13-231681-1
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Fundamentals of Computer
Algorithms,
2nd Edition, University press, 2008.ISBN 10: 8173716129 , ISBN 13: 9788173716126
REFERENCE BOOKS
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,
Clifford Stein, 3rd Edition, PHI.
2. Design and Analysis of Algorithms, 2014, S. Sridhar, Oxford (Higher Education),ISBN:
0198093691.
ONLINE RESOURCES
1. http://elearning.vtu.ac.in/econtent/courses/video/CSE/06CS43.html
2. https://nptel.ac.in/courses/106/101/106101060/
3. http://elearning.vtu.ac.in/econtent/courses/video/FEP/ADA.html
Faculty In charge
1. Dr. Asha
2. Dr. Harish G
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title SOFTWARE ENGINEERING
Course Code 22CBL404
Category Professional Core Course Lab (PCCL)
Schem No. of Hours/Week Total Credits
e and L T P S Tota teaching
Credit S l hours
s 0 0 2 0 02 12 1
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100

COURSE OBJECTIVES:
1. To provide the idea of decomposing the given problem into Analysis, Design, Implementation,
Testing and Maintenance phases.
2. To provide an idea of using various process models in the software industry according to given
circumstances.
3. To gain the knowledge of how Analysis, Design, Implementation, Testing and Maintenance
processes are conducted in a software project.

UNIT I
Introduction: Programming in the small vs. programming in the large; software project failures
and importance of software quality and timely availability; engineering approach to software
development; role of software engineering towards successful execution of large software
projects; emergence of software engineering as a discipline.
UNIT II
Software Project Management: Basic concepts of life cycle models – different models and
milestones; software project planning – identification of activities and resources; concepts of
feasibility study; techniques for estimation of schedule and effort; software cost estimation
models and concepts of software engineering economics; techniques of software project control
and reporting; introduction to measurement of software size; introduction to the concepts of risk
and its mitigation; configuration management.
UNIT II
Software Quality and Reliability: Internal and external qualities; process and product quality;
principles to achieve software quality; introduction to different software quality models like
McCall, Boehm, FURPS / FURPS+, Dromey, ISO – 9126; introduction to Capability Maturity
Models (CMM and CMMI); introduction to software reliability, reliability models and
estimation.
UNIT III
Software Requirements Analysis, Design and Construction: Introduction to Software
Requirements Specifications (SRS) and requirement elicitation techniques; techniques for
requirement modeling – decision tables, event tables, state transition tables, Petri nets;
 requirements documentation through use cases; introduction to UML, introduction to software
metrics and metrics based control methods; measures of code and design quality.
UNIT IV
Object Oriented Analysis, Design and Construction: Concepts -- the principles of
abstraction, modularity, specification, encapsulation and information hiding; concepts of
abstract data type; Class Responsibility Collaborator (CRC) model; quality of design; design
measurements; concepts of design patterns; Refactoring; object oriented construction principles;
object oriented metrics.
UNIT V
Software Testing: Introduction to faults and failures; basic testing concepts; concepts of
verification and validation; black box and white box tests; white box test coverage – code
coverage, condition coverage, branch coverage; basic concepts of black-box tests – equivalence
classes, boundary value tests, usage of state tables; testing use cases; transaction based testing;
testing for non-functional requirements – volume, performance and efficiency; concepts of
inspection.
Laboratory
Development of requirements specification, function oriented design using SA/SD, object-
oriented design using UML, test case design, implementation using C++ and testing. Use of
appropriate CASE tools and other tools such as configuration management tools, program
analysis tools in the software life cycle.

Text Books:
1. Software Engineering, Ian Sommerville
Reference Books:
1. Fundamentals of Software Engineering, Carlo Ghezzi, Jazayeri Mehdi, Mandrioli Dino
2. Software Requirements and Specification: A Lexicon of Practice, Principles and Prejudices,
Michael Jackson
3. The Unified Development Process, Ivar Jacobson, Grady Booch, James Rumbaugh
4. Design Patterns: Elements of Object-Oriented Reusable Software, Erich Gamma, Richard
Helm, Ralph Johnson, John Vlissides
5. Software Metrics: A Rigorous and Practical Approach, Norman E Fenton, Shari Lawrence
Pfleeger
6. Software Engineering: Theory and Practice, Shari Lawrence Pfleeger and Joanne M. Atlee
7. Object-Oriented Software Construction, Bertrand Meyer
8. Object Oriented Software Engineering: A Use Case Driven Approach --Ivar Jacobson
9. Touch of Class: Learning to Program Well with Objects and Contracts --Bertrand Meyer UML
Distilled: A Brief Guide to the Standard Object Modeling Language --Martin Fowler
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title STRATEGIC MANAGEMENT
Course Code 22CBT405A
Category Engineering Science Course (ESC/ETC/PLC)
Schem No. of Hours/Week Total Credits
e and L T P S Tota teaching
Credit S l hours
s 3 0 0 0 03 42 3
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100

COURSE OBJECTIVES:
1. To make students understand fundamental concepts and importance of strategic management,
including process of Strategic management, Strategic intent, Micro, Macro environment,
organizational structures
2. To introduce about strategic intent, formulation of strategy, strategic implementation,
evaluation and control.
3. To gain insights into various strategic management models.
4. To provide awareness on company‘s external environment and competitive position of the
business in the Industry.

UNIT I
Understanding Corporate Strategy : Strategic Management – Meaning, Need & Importance,
Characteristics, Nature and Scope, Objectives, Level of Strategy, The Strategic Management
Process - Strategic Intent, Strategic Formulation, Strategic Implementation, Strategic Evaluation,
Strategic Control. Relationship between a Business Strategy and Business Model.
Case Study Discussion
UNIT II
Strategy Formulation: Definition of Strategy Formulation, Strategic Intent, Hierarchy of
Strategic Intent, Organization values. Vision - Characteristics, Benefits. Mission & Purpose -
Components, Characteristics, Benefits. Business Definition - Characteristics, Dimensions, Goals
& Objectives - Features, Areas of Setting of goals and objectives, Significance, Short-term
Objectives, Long-term Objectives. Balanced Score card - Definition, Uses, Benefits &
Limitations, Components and Framework.
Case Study Discussion
UNIT III
Analyzing a Company’s External Environment – Business Environment - Company‘s External
Environment, Industry Environment, General Environment. Industry Analysis – Objectives,
Factors are driving industry change and its impact, Industry Competitive Analysis - Porter‘s
Dominant Economic Trait, Porter‘s Five Forces model – Key Success Factors - Competitive
Environment Analysis - Environment Search, Environmental Diagnosis.
Case Study Discussion
 UNIT IV
Analyzing a Company’s Resources and Competitive position – SWOT Analysis – Value Chain
Analysis. Generic Competitive Strategic – Low cost provider Strategy, Differentiation Strategy,
Best cost provider Strategy, Focused Strategy. Collaborative Partnership - Strategic Alliance,
Mergers and Acquisition. .
Business planning in different environment - Innovation, Integration, Diversification,
Turnaround Strategic – GE Nine Cell Planning Gird and BCG Matrix.
Case Study Discussion 6 hours
UNIT V
Strategy Implementation: Organizational design, strategic leadership, Organizational
Structures and Organizational Controls – Strategic Controls & its types, Financial Controls.
Types of control systems. Relationship between Strategy and Structure, Organizational
Structures – Types – Simple, Functional, Multi divisional Structure – Product team, Market
Structure, Matrix Structure.
Case Study Discussion

COURSE OUTCOMES: On completion of the course, student should be able to:

1. The student will be able to comprehend basics of strategic intent, formulation,
implementation, evaluation and control.
2. The student will be able to demonstrate their acumen to create vision, mission, business
definition, objectives, balanced score card, and Analyze SWOT, Value chain of the business
3. The student will be able to appraise company‘s resources, internal and external analysis,
competitive position and design models to support strategic decisions and business planning.
4. The student will be able to apply knowledge to implement strategies and evaluate and control
the results and take controlling measures for effective decision-making.

TEXT BOOKS
1. Crafting and Executing Strategy, Arthur A. Thompson Jr.AJ Strickland III, John E
Gamble,18/e,TataMcGrawHill,2012.
2. Strategic Management, Alex Miller, Irwin McGraw Hill
3. Strategic Management - Analysis, Implementation, Control, Nag A,1/e,Vikas,2011.
4. Strategic Management –An Integrated Approach, Charles W. L .Hill, Gareth R. Jones,
Cengage Learning.

REFERENCE BOOKS
Strategic Management: Concepts and Cases, David R, 14/e, PHI.
2. Strategic Management: Building and Sustaining Competitive Advantage, Robert A. Pitts &
David Lei, 4/e, Cengage Learning.
3. Competitive Advantage, Michael E Porter, Free Press NY
4. Essentials of Strategic Management, Hunger. David, 5/e, Pearson.

EBOOKS/ONLINE RESOURCES
1. http://www.nptel.ac.in
2. https://en.wikipedia.org
3. https:/strategy-business/.com
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title MARKETING RESEARCH & MARKETING MANAGEMENT
Course Code 22CBT405B
Category Engineering Science Course (ESC/ETC/PLC)
Schem No. of Hours/Week Total Credits
e and L T P S Tota teaching
Credit S l hours
s 3 0 0 0 03 42 3
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100

COURSE OBJECTIVES:
1. To enhance the knowledge about marketing theories, principles, strategies and concepts
and how they are applied.
2. To provide with opportunities to analyze marketing activities within the firm.
3. To apply marketing concepts and theories to realistic marketing situations.

UNIT I
Marketing Concepts and Applications: Introduction to Marketing & Core Concepts, Marketing
of Services, Importance of marketing in service sector.
Marketing Planning & Environment: Elements of Marketing Mix, Analyzing needs & trends
in Environment - Macro, Economic, Political, Technical & Social
Understanding the consumer: Determinants of consumer behavior, Factors influencing
consumer behavior
Market Segmentation: Meaning & Concept, Basis of segmentation, selection of segments,
Market Segmentation strategies, Target Marketing, Product Positioning
UNIT II

Product Management: Product Life cycle concept, New Product development & strategy, Stages
in New Product development, Product decision and strategies, Branding & packaging
UNIT III

Pricing, Promotion and Distribution Strategy: Policies & Practices – Pricing Methods & Price
determination Policies. Marketing Communication – The promotion mix, Advertising & Publicity,
5 M’s of Advertising Management. Marketing Channels, Retailing, Marketing Communication,
Advertising
 UNIT IV
Marketing Research: Introduction, Type of Market Research, Scope, Objectives & Limitations
Marketing Research Techniques, Survey Questionnaire design & drafting, Pricing Research,
Media Research, Qualitative Research
Data Analysis: Use of various statistical tools – Descriptive & Inference Statistics, Statistical
Hypothesis Testing, Multivariate Analysis - Discriminant Analysis, Cluster Analysis, Segmenting
and Positioning, Factor Analysis
UNIT V
Internet Marketing: Introduction to Internet Marketing. Mapping fundamental concepts of
Marketing (7Ps, STP); Strategy and Planning for Internet Marketing
Business to Business Marketing: Fundamental of business markets. Organizational buying
process. Business buyer needs. Market and sales potential. Product in business markets. Price in
business markets. Place in business markets. Promotion in business markets. Relationship,
networks and customer relationship management. Business to Business marketing strategy
Home Assignments:
1. Written Analyses of Cases – Students are expected to report on their analysis and
recommendations of what to do in specific business situations by applying concepts and
principles learned in class (Case Studies to be shared by Faculty) e.g. “Marketing Myopia”
2. Field visit & live project covering steps involved in formulating Market Research Project
3. Measuring Internet Marketing Effectiveness: Metrics and Website Analytics

Course
Blooms
Outcome Statements
Level
s
CO1 Understand basic marketing concepts L1
Comprehend the dynamics of marketing and analyze how its various
CO2 L2
components interact with each other in the real world
CO3 Leverage marketing concepts for effective decision making L3
Understand basic concepts and application of statistical tools in
CO4 L2
Marketing research
TEXT BOOKS:
• Marketing Management (Analysis, Planning, Implementation & Control) – Philip Kotler
• Fundamentals of Marketing – William J. Stanton & Others
• Marketing Management – V.S. Ramaswamy and S. Namakumari
• Marketing Research – Rajendra Nargundkar
• Market Research – G.C. Beri
• Market Research, Concepts, & Cases – Cooper Schindler
REFERENCE BOOKS:
1. Marketing Management – Rajan Saxena
2. Marketing Management – S.A. Sherlekar
3. Service Marketing – S.M. Zha
4. Journals – The IUP Journal of Marketing Management, Harvard Business Review
5. Research for Marketing Decisions by Paul Green, Donald, Tull
6. Business Statistics, A First Course, David M Levine at al, Pearson Publication
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title DESIGN THINKING
Course Code 22CBT405C
Category Engineering Science Course (ESC/ETC/PLC)
Scheme and No. of Hours/Week Total Credits
Credits L T P S Tota teaching
S l hours
3 0 0 0 03 42 3
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100

COURSE OBJECTIVES:

1. Recognize the importance of DT, explain, list & apply the steps in each of the phases in the
DT process.
2. Use doodling and storytelling in presenting ideas and prototypes
3. Create value proposition statements as part of their presentations
4. Recognize how DT can help in functional work
5. Recognize how Agile and DT complement each other to deliver customer satisfaction

UNIT I (10 Hrs)

Why is Design Thinking important for business? Why is Design Thinking important for you?
What is DT? What is empathy? How to empathize? Intro to Immersion Activity. Immersion
activity
UNIT II (08 Hrs)
Creating personas. Problem statements, Defining problem statements
UNIT III (08 Hrs)
How to Ideate? Ideation games. Ideate to find solutions. Let’s doodle!
What is Storytelling in DT?
UNIT IV (08 Hrs)
Why is a Prototype important in Design Thinking? Prototype your idea. Value Proposition
Statement Testing in Design Thinking. Test the Prototype
Role of DT in your work. Share your Satori
UNIT V (12)

Project
Option 1: Each group needs to present a Prototype of how they can apply DT in their functional
work or coding. Examples will be provided to explain what exactly they need to do.
Option 2: Each group will apply DT to create a prototype to improve any existing product or
service.
For both options, groups need to complete all phases of the Stanford DT model and include the
outputs of each phase in their presentation.

Course Bloom
Outcome Statements s
s Level
Recognize the importance of Design Thinking, Identify & recognize the
CO1 L3
steps in the DT process
CO2 Conduct an immersion activity and fill up the DT question template L2
CO3 Test a prototype created through a DT process L3
CO4 Recognize how DT can help in functional work L4
Recognize how Agile and DT complement each other to deliver customer
CO5 L4
satisfaction

TEXT BOOKS:
There are no prescribed texts for Semester 5 – there will be handouts and reference links shared.
REFERENCE BOOKS:
1. Hooked by Nir Eyal
2. The Art of Creative Thinking by Rod Judkins
3. Start Up nation by Dan Senor and Saul singer
4. Start with Why by Simon Sinek
Online Resources:
1. Understanding Design
2. Design Thinking and Innovation at Apple Wei Li
3. Stanford Webinar- Design Thinking = Method, Not Magic
4. Stanford Design Thinking Virtual Crash Course
5. So Many Uses- activity to spark creativity and design
 Dr. Ambedkar Institute of Technology, Bengaluru-56
Department of Computer Science & Business Systems
NEP – 2023 -2024
Course Title BUSINESS COMMUNICATION &VALUE SCIENCE – II
Course Code 22CBT406A
Category Ability Enhancement Course(AEC)
Schem No. of Hours/Week Total Credits
e and L T P SS Total teaching
Credit hours
s 3 0 0 0 03 42 3
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100

COURSE OBJECTIVES:
• To develop effective writing, reading, presentation and group discussion skills
• To help students to identify personality traits and evolve as a better team player
• To understand what life skills are and their importance in leading a happy and well-adjusted
life
• To motivate students to look within and create a morality, behavior & beliefs
• To introduce the key concepts of values, diversity and inclusion

UNIT 1(5 Hrs)

Listening: Social Issues - Class Discussion: Good And Bad Writing - Common Errors,
Punctuation Rules - Use of Words – Definition – Compound Words – Jumbled Sentences -
Speaking – Group Discussion on Social Cause – Writing Techniques - Creating an E
Magazine : To Share Concepts and Ideas - Activity: Choose a Social Issue and Capture the
Ideas in a Slam Book.
UNIT II(3 Hrs)
Create - Vision - Mission - Value Statement - Tagline and Design a Logo for an NGO –
Speaking: Introduction to Basic Presentation Skills & Orai App – Reading - Introduction to
Skimming and Scanning – Reading Passages and Short Stories – Writing: One Word
Substitution – Sentences Expressing Purpose.
UNIT III(2 Hrs)
Brain Storming - Class Discussion on Social Issue – Activity: Create – Design a Skit on Social
Issue/NGO – Readout The Skit – Role Play – Individual FeedbackTeam Work: Intro to Dr.
Meredith Belbin and his Research on Team Work – Belbin’s Personality Traits – Writing:
Framing Questions – Report Writing.
UNIT IV(2Hrs)
Listening: Short Film on Diversity – Discussion on The Concept Empathy – Group Activity:
Create a Story of a Person’s Life Affected by Social Issues - Narrate The Story in First Person
– Group Feedback – Write a Review in a Blog – Covering the Topics Discussed in Class –
Verbal Analogies – Cause & Effect Expressions.
 Course Blooms
Statements
Outcomes Level
CO1 Understand and use the tools of structured written communication. L4
Develop materials to create an identity for an organization dedicated
CO2 L4
to a social cause.
CO3 Apply the basic concept of speed reading, skimming and scanning. L4
Recognize the concepts of behavior and identify individual role in a
CO4 L3
team
CO5 Understand the basic concepts of Morality and Diversity and to create
L2
communication material.

TEXT BOOKS:
1. Board of editors. Fluency in English A Course book for Engineering and Technology. Orient
Blackswan, Hyderabad: 2016.
2. Richards, C. Jack. Interchange Students’ Book – 2 New Delhi: CUP, 2015.

REFERENCE BOOKS:
1. Dr. A.P.J Abdul Kalam, “Guiding Souls : Dialogues on the purpose of life”; Publishing Year
2005; Co-author--Arun Tiwari .
2. Dr. A.P.J Abdul Kalam, “The Family and the Nation”, Publishing year: 2015; Coauthor: Acharya
Mahapragya.
3. Dr. A.P.J Abdul Kalam, “The Scientific India: A twenty First Century Guide to the World around
us”, Publishing year: 2011; Co-author- Y.S.Rajan.
4. Dr. A.P.J Abdul Kalam, “Forge Your Future: Candid, Forthright, Inspiring”, Publishing year:
2014.
5. Peter H. Diamandis and Steven Kotler, “Abundance: The Future is Better Than You Think”,
Published: 21 Feb, 2012; Publisher: Free Press.
6. Simon Sinek, “Start With Why: How Great Leaders Inspire Everyone to Take Action”,
Published: 6 October 2011; Publisher: Penguin.
7. Sandra Moriarty, Nancy D. Mitchell, William D. Wells, “Advertising & IMC: Principles and
Practice”, Published: 15 June 2016; Publisher: Pearson
 Dr. Ambedkar Institute of Technology,
Bengaluru – 56
Department of Computer Science and Business Systems
Scheme and Syllabus – CBCS – 2023 – 2024
Course Title Introduction to Blockchain
Course Code 22CBT406B
Category Ability Enhancement Course (AEC)
Scheme and No. of Hours/Week Total Credits
Credits L T P SS Total Teaching
hours
1 00 00 00 1.5 15 01
CIE Marks: 50 SEE Total Max. Duration of SEE: 02 Hours
Marks: 50 marks=100

COURSE OBJECTIVES:
1. To understand a broad overview of the essential concepts of blockchain technology.
2. To familiarize students with the necessary foundation of Bitcoin protocol followed by the
Ethereum protocol.
3. To learn about different types of blockchain and consensus algorithms.

UNIT I
Basics: The Double-Spend Problem, Byzantine Generals’ Computing Problems, Public-Key
Cryptography, Hashing, Distributed Systems, Distributed Consensus.

UNIT II
Technology Stack: Blockchain, Protocol, Currency. Bitcoin
Blockchain: Structure, Operations, Features, Consensus Model, Incentive Model.

UNIT III
Ethereum Blockchain: Smart Contracts, Ethereum Structure, Operations, Consensus Model,
Incentive Model.
UNIT IV
Tiers of Blockchain Technology: Blockchain 1.0, Blockchain 2.0, Blockchain 3.0,
Types of Blockchain: Public Blockchain, Private Blockchain, Semi-Private Blockchain.

UNIT V
Types of Consensus Algorithms: Proof of Stake, Proof of Work, Proof of Elapsed Time, Deposite-
Based Consensus, Proof of Importance, Federated Byzantine Consensus.
TEACHING LEARNING PROCESS: Chalk and Talk, power point presentation, animations,
videos
COURSE OUTCOMES:
CO1: To explain the basic notion of distributed systems.
CO2: To illustrate the essential components of a blockchain platform.
CO3: To use the working of an immutable distributed ledger and trust model that defines
blockchain.
CO4: To categorize the various types of Block chain and its consensus

TEXT BOOKS
1. Kirankalyan Kulkarni, Essentials of Bitcoin and Blockchain, Packt Publishing.
2. Anshul Kaushik, Block Chain & Crypto Currencies, Khanna Publishing House.
3. Tiana Laurence, Blockchain for Dummies, 2nd Edition 2019, John Wiley & Sons.

REFERENCE BOOKS
1. Mastering Blockchain: Deeper insights into decentralization, cryptography, Bitcoin, and
popular Blockchain frameworks by Imran Bashir, Packt Publishing (2017).
2. Blockchain: Blueprint for a New Economy by Melanie Swan, Shroff Publisher O’Reilly
Publisher Media; 1st edition (2015)

ONLINE RESOURCES
1. https://www.coursera.org/specializations/blockchain.
2. https://nptel.ac.in/courses/106105184/
3. Introduction to Blockchain Technology and Applications,
https://swayam.gov.in/nd1_noc20_cs01/preview
 Dr. Ambedkar Institute of Technology, Bengaluru – 56
Department of Computer Science and Business Systems
2023 – 2024

Course Title OPERATIONS RESEARCH

Course Code 22CBT406C
Category Ability Enhancement Course (AEC)
Schem No. of Hours/Week Total Credits
e and L T P SS Total teaching
Credit hours
s 3 0 0 0 03 42 3
CIE Marks: SEE Marks: Total Max. Duration of SEE: 03 Hours
50 50 marks=100

COURSE OBJECTIVES:
1. Understand the characteristics of different types of decision-making environments to formulate
and solve a real-world problem as a mathematical programming model.
2. Define and formulate & solve linear programming problems using appropriate techniques and
optimization solvers, interpret the results obtained.
3. Understand, formulate & solve problems using the simplex method.
4. Understand the theoretical workings of appropriate decision-making approaches and tools to
identify the optimal strategy to solve transportation & assignment problems.
5. To introduce methods used in Game theory as tools in application and in improving analytical
and decision-making skills, comprehend the nature of metaheuristics.

UNIT I
Introduction: The origin, nature, and impact of OR; Defining the problem and gathering data;
Formulating a mathematical model; Deriving solutions from the model; Testing the model;
Preparing to apply the model; Implementation. Introduction to Linear Programming: The
linear programming (LP) model. Assumptions of LP; Additional examples.
UNIT IIV
Simplex Method: The essence of the simplex method; Setting up the simplex method; Algebra
of the simplex method; the simplex method in tabular form; Tie breaking in the simplex method,
Adapting to other model forms; Post optimality analysis.
UNIT III
Transportation and Assignment Problems: The transportation problem; A streamlined
simplex method for the transportation problem; The assignment problem; A special algorithm
for the assignment problem.
UNIT I
Game Theory: The formulation of two persons, zero sum games; Solving simple games - a
prototype example; Games with mixed strategies; Graphical solution procedure; Solving by
linear programming, Extensions.
Decision Analysis: A prototype example; Decision making without experimentation; Decision
making with experimentation; Decision trees.
 UNIT V
Metaheuristics: The nature of Metaheuristics, Tabu Search, Simulated Annealing, Genetic
Algorithms.

Course Blooms
Statements
Outcomes Level
Understand the objectives, phases, models, used in operation
CO1 L2
research, Solve linear programming problems
CO2 To be able to solve problems using the simplex method L3
Solve linear programming problems using duality theory and
CO3 L3
post optimality analysis
Solve problems on transportation, assignment problems and
CO4 L3
game theory.
Understand the nature of metaheuristics, simulated annealing
CO5 L2
and genetic algorithms, tabu search method

TEXT BOOKS:
1. Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research, 8th
Edition, Tata McGraw Hill, 2005.
REFERENCE BOOKS:
1. Wayne L. Winston: Operations Research Applications and Algorithms, 4th Edition, Thomson
Course Technology, 2003.
2. Hamdy A Taha: Operations Research: An Introduction, 8 Edition, Prentice Hall India, 2007.
SELF STUDY REFERENCES / WEBLINKS:
1. Operations Research:
https://www.youtube.com/watch?v=knZrhVkZ71Q&list=PLU6SqdYcYsfLyEPjMPHT_1ZhT
RrnXA55R
2. MOOC NPTEL - Introduction to Operation Research:
https://www.youtube.com/watch?v=BDBhpxRzImI&list=PLWoXNEI-KK1mCv_EL4OdF_-
6FXryaZ11N

COURSE COORDINATORS: Mrs. Veena Potdar