BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT

(Autonomous Institute affiliated to VTU, Belagavi, Approved by AICTE New Delhi)

Yelahanka, Bengaluru 560064

Bachelor of Engineering

Department of Computer Science and

Business Systems

III and IV Semester Scheme and Syllabus

2023 Scheme
Effective from the AY 2023-24
Approved in the BoS meeting held on 26/07/2023
 Scheme of III Semester
BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT
(Autonomous Institute affiliated to VTU)
Scheme of Teaching and Examination: Effective from AY 2023 – 24
Outcome Based Education (OBE) and Choice Based Credit System (CBCS)

UG PROGRAM: B.E. in Computer Science and Business Systems Semester: III

Teaching
Teaching Hours /Week Examination
Department
Course and Course Title (TD) and Self - Credits
Sl. Practical
Course Code Theory Study Duration in CIE SEE Total
No Question Tutorial /
Lecture Drawing hours Marks Marks Marks
Paper Setting
Board (PSB) L T P S
TD-: Maths 3 2 0
1
PCC/BSC BCS301 Mathematics for Computer 05 50 50 100 4
PSB: Maths
Science
2 IPCC BCS302 Digital Design and Computer TD : CB
Organization PSB : CS 3 0 2 05 50 50 100 4
IPCC BCS303 TD :CB
3 0 2
3 Operating Systems PSB : CS 03 50 50 100 4
4 PCC BCS304 TD : CB
Data Structures and PSB : CS 3 0 0 05 50 50 100 3
Applications
PCCL BCSL305 TD : CB
5 Data Structures Lab PSB : CS
0 0 2 02 50 50 100 1
ESC BCS306x TD : CB
2 0 2
6 ESC/ETC/PLC PSB : CS 04 50 50 100 3
UHV Social Connect and Any Department 02 100 --- 100 1
7 BSCK307 0 0 2
Responsibility
If the course is Theory 01
AEC Ability Enhancement Course/ TD and PSB:
8 BCB358X
Skill Enhancement Course – III Concerned 1 0 0 50 50 100 1
/ SEC department If the course is a lab 02
0 0 2
BNSK359 National Service Scheme (NSS) NSS coordinator
BPEK359 Physical Education (PE) (Sports Physical 0 0 2 02
9 MC
Education 100 --- 100 0
and Athletics)
Director
BYOK359 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= SDA: Skill Development Activity,
CIE: Continuous Internal Evaluation, SEE: Semester End Evaluation. K :This letter in the course code indicates common to all the stream of engineering.
ESC: Engineering Science Course, ETC: Emerging Technology Course, PLC: Programming Language Course
Engineering Science Course (ESC/ETC/PLC) )
(Note- Student should opt for the course which should not be similar to the course opted in 1st Year)
BCS306A Object Oriented Programming with Java
BCS306B Object Oriented Programming with C++
Ability Enhancement Course – III
BCB358A Data analytics with Excel BCB358C Data Visualization using Tableau and Power BI
BCB358B Data Analytics with R BCB358D Business Communication-1
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. For more details,
the regulation governing the Degree of Bachelor of Engineering /Technology (B.E./B.Tech.) 2022-23
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.
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS) applicable for 2022 Scheme
SEMESTER – III
Mathematics III for Computer Science (3:2:0:0) 4
(Common to CSE/ISE/AI&ML/CSBS)
(Effective from the academic year 2023-24)
Course Code BCS301 CIE Marks 50
Teaching Hours/Week (L:T:P) 3:2:0:0 SEE Marks 50
Total Number of Contact Hours 40 hours Theory + Exam Hours 3
20 Hours Tutorial
Course Objectives:
This course aims to prepare the students to:
1. To introduce the concept of random variables, probability distributions, specific discrete and
continuous distributions with practical application in Computer Science Engineering and social life
situations.
2. To provide the principles of statistical inferences and the basics of hypothesis testing with emphasis
on some commonly encountered hypotheses.
3. To find the association between attributes and the correlation between two variables

Teaching-Learning Process
Pedagogy (General Instructions):
Teachers can use the following strategies to accelerate the attainment of the various course outcomes.
1. In addition to the traditional lecture method, different types of innovative teaching methods may be adopted
so that the delivered lessons shall develop students’ theoretical and applied Mathematical skills.
2. State the need for Mathematics with Engineering Studies and Provide real-life examples.
3. Support and guide the students for self–study.
4. You will assign homework, grading assignments and quizzes, and documenting students' progress.
5. Encourage the students to group learning to improve their creative and analytical skills.
6. Show short related video lectures in the following ways:
• As an introduction to new topics (pre-lecture activity).
• As a revision of topics (post-lecture activity).
• As additional examples (post-lecture activity).
• As an additional material of challenging topics (pre-and post-lecture activity).
• As a model solution of some exercises (post-lecture activity).
Module – 1
Probability Distributions:Review of basic probability theory. Random variables (discrete and
continuous),probability mass and density functions. Mathematical expectation, mean and variance.
Binomial, Poisson and normal distributions- problems (derivations for mean and standard deviation for
Binomial and Poisson distributions only)-Illustrative examples. Exponential distribution.

(RBT Levels: L1, L2 and L3) (12 Hours)

Module – 2
Joint probability distribution & Markov Chain: Joint Probability distribution for two discrete random
variables, expectation, covariance and correlation. Markov Chain: Introduction to Stochastic Process,
Probability Vectors, Stochastic matrices, Regular stochastic matrices, Markov chains, Higher transition
probabilities, Stationary distribution of Regular Markov chains and absorbing states.

(RBT Levels: L1, L2 and L3) (12 Hours)

Module – 3
Statistical Inference 1: Introduction, sampling distribution, standard error, testing of hypothesis, evels of
significance, test of significances, confidence limits, simple sampling of attributes, test of
significance for large samples, comparison of large samples.

(RBT Levels: L1, L2 and L3) (12 Hours)

Module – 4
Statistical Inference 2: Sampling variables, Test of Significance for means of two small samples, students
‘t’ distribution, Chi-square distribution as a test of goodness of fit. F-Distribution.
(RBT Levels: L1, L2 and L3) (12 Hours)
Module – 5
Curve fitting, Correlation, and Regressions Principles of least squares, Curve fitting by the method of least squares
in the form 𝑦 = 𝑎 + 𝑏𝑥, 𝑦 = 𝑎 + 𝑏𝑐 + 𝑐𝑥2, and 𝑦 = 𝑎𝑥𝑏. Correlation, Coefficient of correlation, Lines
of regression, Angle between regression lines, standard error of estimate, rank correlation.

(RBT Levels: L1, L2 and L3) (12 Hours)

Course Outcomes:
The students will be able to:
CO1: Analize various probability distributions occurring in in the modeling of various physical and
engineering phenomena.
CO2: Use statistical methodology and tools in the engineering problem-solving process.
CO3: Apply the notion of a discrete-time Markov chain and n-step transition probabilities to solve the
given problem.
CO4: Make use of the concepts of method of least squares, correlation and regression analysis to fit a
suitable mathematical model for the statistical data.
Text books:
1. Ronald E. Walpole, Raymond H Myers, Sharon L Myers & Keying Ye “Probability & Statistics for Engineers &
Scientists”, Pearson Education, 9th edition, 2017.
2. Peter Bruce, Andrew Bruce & Peter Gedeck “Practical Statistics for Data Scientists” O’Reilly Media, Inc., 2nd
edition 2020.

Reference Books:
1. Erwin Kreyszig, “Advanced Engineering Mathematics”, John Wiley & Sons, 9 th Edition, 2006.
2. B. S. Grewal “Higher Engineering Mathematics”, Khanna publishers, 44 th Ed., 2021.
3. G Haribaskaran “Probability, Queuing Theory & Reliability Engineering”, Laxmi Publication, Latest Edition,
2006.
4. Irwin Miller & Marylees Miller, John E. Freund’s “Mathematical Statistics with Applications” Pearson. Dorling
Kindersley Pvt. Ltd. India, 8 th edition, 2014.
5. S C Gupta and V K Kapoor, “Fundamentals of Mathematical Statistics”, S Chand and Company, Latest edition.
6. Robert V. Hogg, Joseph W. McKean & Allen T. Craig. “Introduction to Mathematical Statistics”, Pearson
Education 7 th edition, 2013.
7. Jim Pitman. Probability,Springer-Verlag, 1993.
8. Sheldon M. Ross,“Introduction to Probability Models” 11 th edition. Elsevier, 2014.
9. A.M. Yaglom and I. M. Yaglom, “Probability and Information”. D. Reidel Publishing Company. Distributed by
Hindustan Publishing Corporation (India) Delhi, 1983.
10. P. G. Hoel, S. C. Port and C. J. Stone, “Introduction to Probability Theory”, Universal Book Stall, (Reprint),
2003.
11. S. Ross, “A First Course in Probability”, Pearson Education India, 6 th Ed., 2002.
12. W. Feller, “An Introduction to Probability Theory and its Applications”, Vol. 1, Wiley, 3rd Ed., 1968.
13. N.P. Bali and Manish Goyal, A Textbook of Engineering Mathematics, Laxmi Publications, Reprint, 2010.
14. Veerarajan T, Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi, 2010.
Alternate Assessment Tools (AATs) suggested:
⚫ Programming Assignment
⚫ Seminars
Web links and Video Lectures (e-Resources):
http://nptel.ac.in/courses.php?disciplineID=111
http://www.class-central.com/subject/math(MOOCs)
http://academicearth.org/
http://www.bookstreet.in.

VTU EDUSAT PROGRAMME – 20

VTU e-Shikshana Program
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50) and for the
SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures a minimum of 40% (40 marks out of 100) in the sum total of the CIE
(Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.

Continuous Internal Evaluation:

• For the Assignment component of the CIE, there are 25 marks and for the Internal Assessment Test
component, there are 25 marks.
• The first test will be administered after 40-50% of the syllabus has been covered, and the second test
will be administered after 85-90% of the syllabus has been covered. Any two assignment methods
mentioned in the 22OB2.4, if an assignment is projectbased then only one assignment for the course shall
be planned. The teacher should not conduct two assignments at the end of the semester if two
assignments are planned.
• For the course, CIE marks will be based on a scaled-down sum of two tests and other methods of
assessment.
Internal Assessment Test question paper is designed to attain the different levels of Bloom’s
taxonomy as per the outcome defined for the course.
Semester-End Examination:
Theory SEE will be conducted by the University as per the scheduled timetable, with common question
papers for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module
(with a maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
Marks scored shall be proportionally reduced to 50 marks.

Activity-Based Learning (Suggested Activities in Class)/Practical-Based Learning

● Programming Assignment
● Seminars
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS)
SEMESTER – III
Digital Design and Computer Organization (3:0:2:0) 4
(Effective from the academic year 2023 -24)
Course Code BCS302 CIE Marks 50
Teaching Hours/Week 3:0:2:0
SEE Marks 50
(L: T:P:S)
Total Number of Contact Hours 40 hours Theory +
Exam Hours 3 Hours
20 hours practical
Examination nature (SEE) Theory
Course Objectives:
This course will enable students to:
1. Read and Write Optimize Boolean equations for logic circuits.
2. Design combinational and sequential circuits using MSI components.
3. Simulate and experimentally validate sequential logic circuits.
4. Understand the structure, function, organization and architecture of modern day computing
systems.
5. Examine the internal architecture and organization of the processor with an extended
discussion of computer arithmetic and the instruction set architecture.
Preamble: Computer System Design course is to familiarize with concepts, design, and practical use
of digital circuits and components of computer system. Digital circuits are used in designing
Microcontrollers, Microprocessor, Embedded system projects and exposed to hardware design
which reflects the current
industry requirements.
Module – 1
Introduction to Digital Design: Binary Logic, Boolean Functions, Digital Logic Gates, Introduction, The
Map Method, Four-Variable Map, Don’t-Care Conditions, NAND and NOR Implementation, QM
method(tabular), Other Hardware Description Language – Verilog Model of a simple circuit.

Text book 1: 1.9, 2.4, 2.5, 2.8, 3.1, 3.2, 3.3, 3.5, 3.6, 3.9 (8 Hours)
Module – 2
Combinational Logic: Introduction, Combinational Circuits, Design Procedure, Binary Adder-
Subtractor, Decoders, Encoders, Multiplexers (MEV). HDL Models of Combinational Circuits –
Adder, Multiplexer, Encoder. Sequential Logic: Introduction, Sequential Circuits, Storage
Elements: Latches, Flip-Flops.

Text book 1: 4.1, 4.2, 4.4, 4.5, 4.9, 4.10, 4.11, 4.12, 5.1, 5.2, 5.3, 5.4. (8 Hours)
Module – 3
Basic Structure of Computers: Functional Units, Basic Operational Concepts, Bus structure,
Performance – Processor Clock, Basic Performance Equation, Clock Rate, Performance
Measurement.Machine Instructions and Programs: Memory Location and Addresses, Memory
Operations, Instruction and Instruction sequencing, Addressing Modes.

Text book 2: 1.2, 1.3, 1.4, 1.6, 2.2, 2.3, 2.4, 2.5. (8 Hours)
 Module – 4
Input/output Organization: Accessing I/O Devices, Interrupts – Interrupt Hardware, Enabling
and Disabling Interrupts, Handling Multiple Devices, Direct Memory Access: Bus Arbitration, Speed,
size and Cost of memory systems. Cache Memories – Mapping Functions.

Text book 2: 4.1, 4.2.1, 4.2.2, 4.2.3, 4.4, 5.4, 5.5.1 (8 Hours)

Module – 5
Basic Processing Unit: Some Fundamental Concepts: Register Transfers, Performing ALU
operations, fetching a word from Memory, Storing a word in memory. Execution of a Complete
Instruction. Pipelining: Basic concepts, Role of Cache memory, Pipeline Performance.

Text book 2: 7.1, 7.2, 8.1 (8 Hours)

PRACTICAL COMPONENT OF IPCC

SL. Experiments
No. Experiments Simulation packages preferred: Xilinx, Modelsim, PSpice or any other
relevant
1 Given a 4-variable logic expression, simplify it using appropriate technique and
simulate the same using basic gates.
2 Design a 4- bit full adder and subtractor and simulate the same using basic gates.
3 Design VHDL/Verilog HDL to implement simple circuits using structural, Data flow and
Behavioral model.
4 Design Binary Adder-Subtractor – Half adder and Half Subtractor and simulate using
VHDL/Verilog HDL.
5 Design Decimal adder and simulate using VHDL/Verilog HDL.
6 Design Different types of multiplexer like 2:1, 4:1 and 8:1 and simulate using
VHDL/Verilog program.
7 Design and implement various types of De-Multiplexer and simulate VHDL/Verilog
8 Design and simulate VHDL/Verilog program for implementing various types of Flip-
Flops such as SR, JK and D.
Course outcomes (Course Skill Set):
At the end of the course, the student will be able to:
CO1: Discuss the basic concepts of digital system components.
CO2: Apply various minimization methods to realize the digital circuits.
CO3: Interpret digital operations in digital circuits.
CO4: Analyze the functioning of various units in digital systems.
Suggested Learning Resources:
TextBooks
1. M. Morris Mano & Michael D. Ciletti, Digital Design With an Introduction to Verilog Design, 5e,
Pearson Education.
2. Carl Hamacher, ZvonkoVranesic, SafwatZaky, Computer Organization, 5th Edition, Tata
McGraw Hill.William Stallings Operating Systems: Internals and Design Principles, 6th
Edition, Pearson.
Refernces:
1. Donald P Leach, Albert Paul Malvino & GoutamSaha, Digital Principles and Applications,
Tata McGraw Hill, 6th Edition, 2006.
 Web links and Video Lectures (e-Resources):
1. https://cse11-iiith.vlabs.ac.in/
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
Assign the group task to Design the various types of counters and display the output accordingly
Assessment Methods
● Lab Assessment (25marks)
● GATE Based Aptitude Test
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS)
SEMESTER – III
Operating Systems (3:0:2:0) 4
(Effective from the academic year 2023 -24)
Course Code BCS303 CIE Marks 50
Teaching Hours/Week SEE Marks
3:0:2:0 50
(L: T:P:S)
Total Number of Contact 40 hours Theory + Exam Hours
3 Hours
Hours 20 hours practical
Examination Nature Theory
Course Objectives:
This course will enable students to:
1. Introduce concepts and terminology used in OS
2. Explain threading and multithreaded systems
3. Illustrate process synchronization and concept of Deadlock
4. Introduce Memory and Virtual memory management, File system and storage techniques
Preamble
Operating systems are the fundamental part of every computing device to run any type of
software. The increasing use of computing devices in all areas of life (leisure, work), lead to a
variety of operating systems. Yet all operating systems share common principles. These principles are
important for computer science students in their understanding of programming languages and
software built on top of the operating systems.This course will be discussing about the Address
spaces, System call interface, Process/Threads, Inter Process Communication, Deadlock, Scheduling,
Main memory, Virtual memory and File systems.
Module – 1
Introduction to operating systems, System structures: What operating systems do; Computer System
organization; Computer System architecture; Operating System structure; Operating System
operations; Process management; Memory management; Storage management; Protection and Security;
Distributed system; Special-purpose systems; Computing environments.
Operating System Services: User - Operating System interface; System calls; Types of system calls; System
programs; Operating system design and implementation; Operating System structure; Virtual
machines; Operating System debugging, Operating System generation; System boot.

Textbook 1: Chapter – 1 (1.1-1.12), 2 (2.2-2.11) (8 Hours)

Module – 2
Process Management: Process concept; Process scheduling; Operations on processes; Inter
process communication
Multi-threaded Programming: Overview; Multithreading models; Thread Libraries; Threading
issues. Process Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms; Thread
scheduling; Multiple-processor scheduling.

Textbook 1: Chapter – 3 (3.1-3.4), 4 (4.1-4.4), 5 (5.1 -5.5) (8 Hours)

Module – 3
Process Synchronization: Synchronization: The critical section problem; Peterson’s solution;
Synchronization hardware; Semaphores; Classical problems of synchronization.
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlocks
prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Textbook 1: Chapter – 6 (6.1-6.6), 7 (7.1 -7.7) (8 Hours)

 Module – 4

Memory Management: Memory management strategies: Background; Swapping; Contiguous

memory allocation; Paging; Structure of page table; Segmentation.
Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement;
Allocation of frames; Thrashing.

Textbook 1: Chapter -8 (8.1-8.6), 9 (9.1-9.6) (8 Hours)

Module – 5
File System, Implementation of File System: File system: File concept; Access methods; Directory
and Disk structure; File system mounting; File sharing; Implementing File system: File system
structure; File system implementation; Directory implementation; Allocation methods; Free space
management.
Secondary Storage Structure, Protection: Mass storage structures; Disk structure; Disk
attachment; Disk scheduling; Disk management; Protection: Goals of protection, Principles of
protection, Domain of protection, Access matrix.

Textbook 1: Chapter – 10 (10.1-10.5) ,11 (11.1-11.5),12 (12.1-12.5), 14 (14.1-14.4) (8 Hours)

PRACTICAL COMPONENT OF IPCC
Si. No. Program
Basic Unix commands: who, ls, ln, cp,rm,mv, chmod, chown, mkdir, rmdir, ls,pwd,cd and so
on.
1 Create the following types of a files using shell command and system call
a. soft link (symlink system call)
b. hard link (link system call)
c. FIFO
2 Write a program to print the various file attributes of a given file.[ex:inode,number of hard
links, uid, gid and so on]
3 Write a program
a. to store the details of bank account details such as customer name, account number,balance
and contact details .
b. perform record locking(read/write lock ) to avoid race condition
4 .a. Write a program to print the system resource limits. Use getrlimit system call.
b. Write a program to set (any one) system resource limit. Use setrlimit system call.
5 a. Write a C program to demonstrate multitasking using fork( ) to carry out 4 tasks
concurrently.
b. Write a C program that illustrates how an orphan,zombie processes are created
6 a. Write a program to make parent to wait for a specific child process and print the type of
termination , if abnormal termination print the signal number.
b. Write a program to send and receive data between related processes.
7 Write C programs that illustrate communication between two unrelated processes using
named pipe(FIFO file).
8 Write a program
a. to create a message queue and
b. to send message to a message queue by mentioning message id, message and message
number.
c. Receive message from message queue by mentioning message id and message number
9 Write a program to simulate ticket reservation system for a flight with the following
operations:
a. Create shared memory segment to store total number of seats available.
b. To print availability of seats
c. Book a seat
10 Write a program to create a semaphore and initialize value to the semaphore.
a. create a binary semaphore
 b. create a counting semaphore
Course Outcomes:
The students will be able to:
CO1: Identify the structure of an operating system and its scheduling mechanism.
CO2: Demonstrate the allocation of resources for a process using scheduling algorithm.
CO3: Identify root causes of deadlock and provide the solution for deadlock elimination
CO4: Explore about the storage structures and learn about the Linux Operating system.
CO5: Analyze Storage Structures and Implement Customized Case study
Textbooks:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles 8th edition,
Wiley- India, 2015
Reference Books:
1. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th Edition
2. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw- Hill, 2013.
P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition,PHI(EEE),
2014.
3. William Stallings Operating Systems: Internals and Design Principles, 6th Edition, Pearson.

Web links and Video Lectures (e-Resources):

1. https://youtu.be/mXw9ruZaxzQ
2. https://youtu.be/vBURTt97EkA
3. https://www.youtube.com/watch?v=783KAB-
tuE4&list= PLIemF3uozcAKTgsCIj82voMK3TMR0YE_f
4. https://www.youtube.com/watch?v=3-
ITLMMeeXY&list=PL3pGy4HtqwD0n7bQfHjPnsWzkeRn6mkO

Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

● Assessment Methods
o Case Study on Unix Based Systems (10Marks)
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS)
SEMESTER – III
Data Structure and Applications (3:0:0:0) 3
(Effective from the academic year 2023-2024)
Course Code BCS304 CIE Marks 50
Teaching Hours/Week (L:T:P) 3:0:0:0 SEE Marks 50
Total Number of Contact Hours 40 hours Exam Hours 3

Course Objectives:
This course will enable students to:
1. Explain fundamentals of data structures and their applications essential for
programming/problem Solving.
2. Utilize an appropriate data structure like Stack, Queues, Lists, Trees and Graphs to solve a given
problem.
3. Demonstrate the use of appropriate data structures in implementing the algorithms while solving the
real world problems
Preamble: Data Structures are a specialized means of organizing and storing data in computers in such
a way that we can perform operations on the stored data more efficiently. Data structures have a
wide and diverse scope of usage across the fields of Computer Science and many other fields of
Engineering. Data Structures are the main part of many computer science algorithms as they enable
the programmers to handle the data in an efficient way. It plays a vital role in enhancing the
performance of a software.
Module – 1
Introduction: Significance and scope of Data Structures, Data Structures and Algorithms in Economic
growth of Nation, Impact of Data Structures and Algorithms on societal problems, sustainable
solutions, Career perspective of Data Structures and Algorithms, current innovations in Data
Structures.
Data Structures: Definition, Classification and Operations, Dynamic memory allocation, Dynamic
Arrays, Self-referential structures.
Stacks: Definition, Stack Operations, Array Representation of Stacks, Stacks using Dynamic Arrays. Stack
Applications: Polish notation, Infix to postfix conversion, evaluation of postfix expression, Multiple
Stacks and Queues. Programming Examples.

Text Book: Chapter-1:1.2 Chapter-2: 2.1 to 2.7 Chapter-3: 3.1,3.2,3.6

Reference Book 1: 1.1 to 1.4 (8 Hours)
Module – 2
Queues: Definition, Array Representation, Queue Operations, Circular Queues, Circular queues using
Dynamic arrays, De-queues, Priority Queues.
Recursion: Factorial, GCD, Fibonacci Sequence, Tower of Hanoi, Ackerman's function.

Text Book: Chapter-3: 3.3, 3.4, 3.7 Chapter-4: 4.1 to 4.4 (8 Hours)
Module – 3
Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation; Garbage
Collection.
Linked list operations: Traversing, Searching, Insertion, and Deletion. Doubly Linked lists, Circular
linked lists, and header linked lists. Linked Stacks and Queues. Applications of Linked lists –
Polynomials, Sparse matrix representation. Programming Examples.
Text Book: Chapter-4: 4.5,4.7,4.8 Chapter-5: 5.1 to 5.3, 5.5 (8 Hours)
 Module – 4
Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of
Tree.
Binary Trees: Binary Tree Insert Operation, Binary Tree Traversals - Inorder, postorder, preorder,
Level Order; Additional Binary tree operations.
Binary Search Trees: BST Insert and Delete operations, Application of Trees-Evaluation of
Expression, Programming Examples.

Text Book: Chapter-5: 5.7 to 5.11 Chapter-6: 6.1, 6.2 (8 Hours)

Module – 5
Graphs: Definitions, Terminologies, Matrix and Adjacency List Representation Of Graphs, Warshal’s
Algorithm, Floyds Algorithm, Breadth First Search, Depth First Search.
Hashing: Definition, Hashing Functions, Hash Table, Separate chaining, Collision resolution
techniques: Linear Probing, Quadratic Probing, Double Hashing, Rehashing, and Applications of
Hashing.

Text Book: Chapter 8: 8.1 to 8.3 Chapter 9: 9.1, 9.2 Chapter 10: 10.1 (8 Hours)
Course Outcomes:
The students will be able to:
CO1: Illustrate different types of linear data structures, its operations and algorithms to solve a given
problem.
CO2: Illustrate different types of non-linear data structures, its operations and algorithms to solve a
given problem.
CO3: Examine any given problem, recommend and implement solutions using suitable data structures.
CO4: Design and implement applications using suitable data structures.
Textbooks
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, Universities Press, 2nd
edition, 2019
2. Seymour Lipschutz, Data Structures, Schaum's Outline Series, 1st Edition, 2014.
Reference Books:
1. Gilberg & Forouzan, Data Structures: A Pseudo-code approach with C, Cengage Learning,
2nd edition, 2014.
2. Jean-Paul Tremblay & Paul G. Sorenson, An Introduction to Data Structures with
Applications, McGraw Hill, 2nd Edition, 2013.
3. Reema Thareja, Data Structures using C, 3 rd Ed, Oxford press, 2012.

Web links and Video Lectures (e-Resources)

• http://elearning.vtu.ac.in/econtent/courses/video/CSE/06CS35.html
• https://nptel.ac.in/courses/106/105/106105171/
• http://www.nptelvideos.in/2012/11/data-structures-and-algorithms.html
• https://www.youtube.com/watch?v=3Xo6P_V-qns&t=201s
• https://ds2-iiith.vlabs.ac.in/exp/selection-sort/index.html
• https://nptel.ac.in/courses/106/102/106102064/
• https://ds1-iiith.vlabs.ac.in/exp/stacks-queues/index.html
• https://ds1-iiith.vlabs.ac.in/exp/linked-list/basics/overview.html
• https://ds1-iiith.vlabs.ac.in/List%20of%20experiments.html
• https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/index.html
• https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/depth-first-traversal/dft-
practice.html
• https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_013501595
4 2807756812559/overview
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
⚫ Coding in Online Platforms/ Certification Course/Coding Quiz
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS)
SEMESTER - III
DATA STRUCTURES LABORATORY (0:0:2) 1
(Effective from the academic year 2023-24)

Course Code BCSL305 CIE Marks 50

Teaching Hours/Week (L:T:P) 0:0:2 SEE Marks 50
Total Number of Contact Hours 28Hours Exam Hours 03
Examination Type Practical
Course Objectives:
This course enables students to:
1. Develop linear data structures and their applications such as stacks, queues and lists.
2. Develop non-linear data structures and their applications such as trees and graphs sorting and searching
algorithms.
Descriptions:
Design, develop, and implement the specified Data Structure as given in the list given below using C
Language under LINUX /Windows environment..
Sl. Programs List
No
Design, Develop and Implement a menu driven Program in C for the following operations on STACK of
Integers (Array Implementation of Stack with maximum size MAX)
a. Push an Element on to Stack
b. Pop an Element from Stack
1
c. Demonstrate Overflow and Underflow situations on Stack
d. Display the status of Stack
e. Exit
Support the program with appropriate functions for each of the above operations.
Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix
2 Expression. Program should support for both parenthesized and free parenthesized expressions with
the operators: +, -, *, /, %( Remainder), ^ (Power) and alphanumeric operands.
Design, Develop and Implement a Program in C for evaluation of Suffix expression with single digit
3
operands and operators: +, -, *, /, %, ^
Design, Develop and Implement a menu driven Program in C for the following operations on Circular
QUEUE of integers (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to Circular QUEUE
b. Delete an Element from Circular QUEUE
4
c. Demonstrate Overflow and Underflow situations on Circular QUEUE
d. Display the status of Circular QUEUE
e. Exit
Support the program with appropriate functions for each of the above operations.
Design, Develop and Implement a menu driven Program in C for the following operations on Double
Ended QUEUE of integers (Array Implementation of Queue with maximum size MAX)
a. Perform Insertion / Deletion at front of QUEUE
5 b. Perform Insertion / Deletion at rear of QUEUE
c. Display the status of Circular QUEUE
d. Exit
Support the program with appropriate functions for each of the above operations.
Design, Develop and Implement a menu driven Program in C for the following operations on Singly
6
Linked List (SLL) of Student Data with the fields: USN, Name, Branch, Sem, PhNo
 a. Create a SLL of N Students Data by using front insertion.
b. Display the status of SLL and count the number of nodes in it
c. Perform Insertion / Deletion at End of SLL
d. Perform Insertion / Deletion at Front of SLL(Demonstration of stack)
e. Exit
Design, Develop and Implement a menu driven Program in C for the following operations on Doubly
Linked List (DLL) of Employee Data with the fields: SSN, Name, Dept, Designation, Sal, PhNo
a. Create a DLL of N Employees Data by using end insertion.
b. Display the status of DLL and count the number of nodes in it
7
c. Perform Insertion and Deletion at End of DLL
d. Perform Insertion and Deletion at Front of DLL
e. Demonstrate how this DLL can be used as Double Ended Queue
f. Exit.
Develop a menu driven Program in C for the following operations on Binary Search Tree (BST) of
Integers.
a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
8
b. Traverse the BST in Inorder, Preorder and Post Order
c. Search the BST for a given element (KEY) and report the appropriate message
d. Exit
Design, Develop and Implement a Program in C for the following operations on Graph(G) of Cities
a. Create a Graph of N cities using Adjacency Matrix.
9
b. Print all the nodes reachable from a given starting node in a digraph using any traversal method
(DFS/BFS).
Given a set of N employee records with a set K of Keys (4-digit) which uniquely determine the records.
Assume that the records are available in the memory by a Hash Table (HT) of m memory locations
with L as the set of memory addresses (2-digit) of locations in HT. Let the keys in K and addresses in
10
L are Integers. Develop a Program in C that uses Hash function H: K →L as H (K) = K mod m (remainder
method), and implement hashing technique to map a given key K to the address space L. Resolve the
collision (if any) using linear probing.
Course Outcomes:
The student should be able to:
CO 1:Analyze various linear and non-linear data structures
CO2: Demonstrate the working nature of different types of data structures and their applications
CO3: Use appropriate searching and sorting algorithms for the give scenario.
CO4: Apply the appropriate data structure for solving real world problems
Textbooks
1.Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, Universities Press,2nd edition, 2019

2.P Reema Thareja, Data Structures using C, 3 rd Ed, Oxford press, 2012.
 ESC/ETC/PLC (BCS306x)

B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS

Choice Based Credit System (CBCS)
SEMESTER – III
Object Oriented Programming with JAVA (2:0:2)3
(Effective from the academic year 2023-24)
Course Code BCS306A CIE Marks 50
Teaching Hours/Week (L: T:P: S) 2:0:2 SEE Marks 50
28 Hours of Theory + Total Marks
Total Hours of Pedagogy 100
20 Hours of Practical
Examination Nature Theory
Note - Students who have undergone “ Basics of Java Programming- BPLCK105C/205C” in first
year are not eligible to opt this course
Course objectives:
1. To learn primitive constructs JAVA programming language.
2. To understand Object Oriented Programming Features of JAVA.
3. To gain knowledge on: packages, multithreaded programing and exceptions.
Preamble
The purpose of this course is to enable learners to solve problems by breaking it down to object level while
designing software and to implement it using Java. This course covers Object Oriented Principles, Object
Oriented Programming in Java, Inheritance, Exception handling, Event handling, multithreaded
programming and working with window-based graphics. This course helps the learners to develop Desktop
GUI Applications, Mobile applications, Enterprise Applications, Scientific Applications and Web based
Applications.
Teaching-Learning Process (General Instructions)
These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes and make Teaching –Learning more effective
1. Use Online Java Compiler IDE: https://www.jdoodle.com/online-java-compiler/ or any other.
2. Demonstration of programing examples.
3. Chalk and board, power point presentations
4. Online material (Tutorials) and video lectures.
Module – 1
An Overview of Java: Object-Oriented Programming (Two Paradigms, Abstraction, The Three OOP
Principles), Using Blocks of Code, Lexical Issues (Whitespace, Identifiers, Literals, Comments, Separators,
The Java Keywords).
Data Types, Variables, and Arrays: The Primitive Types (Integers, Floating-Point Types, Characters,
Booleans), Variables, Type Conversion and Casting, Automatic Type Promotion in Expressions, Arrays,
Introducing Type Inference with Local Variables.
Operators: Arithmetic Operators, Relational Operators, Boolean Logical Operators, The Assignment
Operator, The ? Operator, Operator Precedence, Using Parentheses.
Control Statements: Java’s Selection Statements (if, The Traditional switch), Iteration Statements (while,
do-while, for, The For-Each Version of the for Loop, Local Variable Type Inference in a for Loop, Nested
Loops), Jump Statements (Using break, Using continue, return).

TextBook 1: Chapter 2, 3, 4, 5 (8 Hours)

 Module – 2
Introducing Classes: Class Fundamentals, Declaring Objects, Assigning Object Reference Variables,
Introducing Methods, Constructors, The this Keyword, Garbage Collection.
Methods and Classes: Overloading Methods, Objects as Parameters, Argument Passing, Returning
Objects, Recursion, Access Control, Understanding static, Introducing final

Text Book 1:Chapter 6, 7 (8 Hours)

Module – 3
Inheritance: Inheritance Basics, Using super, Creating a Multilevel Hierarchy, When Constructors Are
Executed, Method Overriding, Dynamic Method Dispatch, Using Abstract Classes, Using final with
Inheritance, Local Variable Type Inference and Inheritance, The Object Class.
Interfaces: Interfaces, Default Interface Methods.

Text Book 1: Chapter 8, 9 (8 Hours)

Module – 4
Packages: Packages, Packages and Member Access, Importing Packages.
Exceptions: 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.

Text Book 1:Chapter 9, 10 (8 Hours)

Module – 5
Multithreaded Programming: The Java Thread Model, The Main Thread, Creating a Thread, Creating
Multiple Threads, Using isAlive() and join(), Thread Priorities, Synchronization, Interthread
Communication, Suspending, Resuming, and Stopping Threads, Obtaining a Thread’s State.

Text Book 1:Chapter 11 (8 Hours)

PRACTICAL COMPONENT OF IPCC
SL.
Experiments
No.
1 Develop a JAVA program to add TWO matrices of suitable order N (The value of N should
be read from command line arguments).
2 Develop a stack class to hold a maximum of 10 integers with suitable methods. Develop a
JAVA main method to illustrate Stack operations.
3 Develop a JAVA program to create a class named shape. Create three sub classes namely:
circle, triangle and square, each class has two member functions named draw () and
erase( ). Demonstrate polymorphism concepts by developing suitable methods, defining
member data and main program.
4 Develop a JAVA program to create an abstract class Shape with abstract methods
calculateArea() and calculatePerimeter(). Create subclasses Circle and Triangle that
extend the Shape class and implement the respective methods to calculate the area and
perimeter of each shape.
5 Develop a JAVA program to create an interface Resizable with methods resize Width(int
width) and resizeHeight(int height) that allow an object to be resized. Create a class
Rectangle that implements the Resizable interface and implements the resize methods.
6 Develop a JAVA program to raise a custom exception (user defined exception) for
DivisionByZero using try, catch, throw and finally.
7 Write a program to illustrate creation of threads using runnable class. (start method start
each of the newly created thread. Inside the run method there is sleep() for suspend the
thread for 500 milliseconds).
 8 Develop a program to create a class MyThread in this class a constructor, call the base class
constructor, using super and start the thread. The run method of the class starts after this.
It can be observed that both main thread and created child thread are executed
concurrently.

Course outcome (Course Skill Set)

At the end of the course, the student will be able to:
CO1: Demonstrate the fundamentals of Java programming constructs.
CO2: Interpret the object oriented features of Java programming language.
CO3: Apply the object oriented programming constructs to solve complex problems .
CO4: Develop the solutions using the OOP concepts for simple to complex problems.

Textbooks:
1. Herbert Schildt, “Java: The Complete Reference”, Twelfth Edition, November 2021, McGraw-Hill, ISBN:
9781260463422
Reference Books
1. Programming with Java, 6th Edition, by E Balagurusamy, Mar-2019, McGraw Hill Education, ISBN:
9789353162337.
2. Bruce Eckel, “Thinking in Java”, Fourth Edition,Prentice Hall,2006
(https://sd.blackball.lv/library/thinking_in_java_4th_edition.pdf)
Web links and Video Lectures (e-Resources):
1. Java Tutorial: https://www.geeksforgeeks.org/java/
2. Introduction To Programming In Java (by Evan Jones, Adam Marcus and Eugene Wu):
https://ocw.mit.edu/courses/6-092-introduction-to-programming-in-java-january-iap-2010/
3. Java Tutorial: https://www.w3schools.com/java/
4. Java Tutorial: https://www.javatpoint.com/java-tutorial
Alternate Assessment Tools (AATs) suggested:
I. Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
1. Installation of Java (Refer: https://www.java.com/en/download/help/index_installing.html)
2. Demonstration of online IDEs like geeksforgeeks, jdoodle or any other Tools
3. Demonstration of class diagrams for the class abstraction, type visibility, composition and
inheritance
II. Certification course - Infosys Spring Board
III. Coding Practice in Online Coding Platforms
Lab/Practical Assessment (25 Marks)
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS)
SEMESTER – III
Object Oriented Programming with C++ (2:0:2) 3
(Effective from the academic year 2023 -24)
Course Code BCS306B CIE Marks 50
Teaching Hours/Week 2:0:2:0 SEE Marks 50
(L: T:P)
Total Number of 28 Hours Theory + Exam Hours 3 Hours
Contact Hours 20 Hours Practical
Examination Type Theory
Note: - Students who have undergone “Introduction to C++ Programming-BPLCK105D/BPLCK205D” in
first year are not eligible to opt this course
Course Objectives:
⚫ Understanding about object oriented programming and Gain knowledge about the capability to store
information together in an object.
⚫ Understand the capability of a class to rely upon another class and functions.
⚫ Understand about constructors which are special type of functions.
⚫ Create and process data in files using file I/O functions
⚫ Use the generic programming features of C++ including Exception handling

Teaching-Learning Process:
These are sample Strategies, which teacher can use to accelerate the attainment of the various course outcomes
and make Teaching –Learning more effective
1. Chalk and talk .
2. Online demonstration
3. Hands on problem solving
Preamble:
This Course provides a comprehensive introduction to Python, covering fundamental concepts and practical
applications. Beginning with the basic elements of the Python language and progressing through decision
structures, data collections, and essential libraries such as NumPy and pandas, this course is designed to equip
students with the skills necessary for effective Python programming and data analysis.

Module – 1
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.

Textbook 1: Chapter 1(1.1 to 1.8) (6 Hours)

Module – 2
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.

Textbook 2: Chapter 3(3.2,3.3,3.4,3.13,3.14,3.19, 3.20) ,

chapter 4(4.3,4.4,4.5,4.6,4.7,4.9) (6 Hours)
Module – 3
Inheritance & Polymorphism: Derived class Constructors, destructors, Types of Inheritance, Defining Derived
classes, Single Inheritance, Multiple, Hierarchical Inheritance, Hybrid Inheritance.
Textbook 2: Chapter 6 (6.2,6.11) chapter 8 (8.1 to,8.8) (6 Hours)
Module – 4
I/O Streams: C++ Class Hierarchy- File Stream-Text File Handling- Binary File Handling during file operations.

Textbook 1: Chapter 12(12.5) , Chapter 13 (13.6,13.7) (5 Hours)

Module – 5
Exception Handling: Introduction to Exception, Benefits of Exception handling, Try and catch block, Throw
statement, Pre-defined exceptions in C++

Textbook 2: Chapter 13 (13.2 to13.6) (5 Hours)

PRACTICAL COMPONENT OF IPCC
SL.
Experiments
No.
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
3 Write a C++ program to swap 2 values by writing a function that uses call by reference
technique.
4 Write a C++ program to demonstrate function overloading for the following prototypes.
add(int a, int b)
add(double a, double b)
5 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.
6 Suppose we have three classes Vehicle, FourWheeler, and Car. The class Vehicle is the
base class, the class FourWheeler is derived from it and the class Car is derived from the
class FourWheeler. Class Vehicle has a method 'vehicle' that prints 'I am a vehicle', class
FourWheeler has a method 'fourWheeler' 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.
7 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.
8 Write aC++ program to write and read time in/from binary file using fstream
9 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.
10 Write a C++ program function which handles array of bounds exception using C++
Course Outcomes:
The students will be able to:
CO1: Able to understand and design the solution to a problem using object-oriented programming concepts.
CO2: Able to reuse the code with extensible Class types, User-defined operators and
function Overloading.
CO3: Achieve code reusability and extensibility by means of Inheritance and Polymorphism.
CO4: Implement the features of C++ including templates, exceptions and file handling for providing
programmed solutions to complex problems.

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 Book:
1. Paul Deitel and Harvey deitel, “Intro to Python for Computer Science and Datascience”, 1st edition
Pearson Publisher 2020.
Web links 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.

● Assign small tasks to Develop and demonstrate using C++
● Certification Courses
Lab/Practical Assessment (25 Marks)
 UHV(Social Connect and Responsibility)

BMS Institute of Technology and Management

Department of Humanities and Social Sciences
Choice Based Credit System (CBCS)
SEMESTER – III
(Common to all branches)
Social Connect and Responsibility
(Effective for 2022 Scheme)
Course Code BSCK307 CIE Marks 100
Teaching Hours/Week (L: T:P) 0:0:2 SEE Marks -
Total Number of Contact Hours 26 Hours Exam Hours -
Credits 01 - Credit
Course objectives: The course will enable the students to:
1. Provide a formal platform for students to communicate and connect to the surrounding.
2. create a responsible connection with the society.
3. Understand the community in general in which they work.
4. Identify the needs and problems of the community and involve them in problem –solving.
5. Develop among themselves a sense of social & civic responsibility & utilize
their knowledge in finding practical solutions to individual and community
problems.
6. Develop competence required for group-living and sharing of responsibilities & gain skills
in mobilizing community participation to acquire leadership qualities and democratic attitudes.
Social Connect & Responsibility –All Modules Activity Based Learning
Module-1
Plantation and adoption of a tree: Plantation of a tree that will be adopted for four years by a group of
BE / B.Tech students. (ONE STUDENT ONE TREE) They will also make an excerpt either as a documentary
or a photo blog describing the plant’s origin, its usage in daily life, its appearance in folklore and literature
- – Objectives, Visit, case study, report, outcomes. (04 Hours)

Module-2
Heritage walk and crafts corner: Heritage tour, knowing the history and culture of the city, connecting
to people around through their history, knowing the city and its craftsman, photo blog and documentary on
evolution and practice of various craft forms - – Objectives, Visit, case study, report, outcomes.
(05 Hours)
Module-3
Organic farming and waste management: Usefulness of organic farming, wet waste management in
neighboring villages, and implementation in the campus – Objectives, Visit, case study, report, outcomes.
(06 Hours)
Module-4
Water conservation: Knowing the present practices in the surrounding villages and implementation in
the campus, documentary or photoblog presenting the current practices – Objectives, Visit, case study,
report, outcomes. (06 Hours)
Module-5
Food walk: City’s culinary practices, food lore, and indigenous materials of the region used in cooking –
Objectives, Visit, case study, report, outcomes. (05 Hours)
Course outcomes (Course Skill Set): At the end of the course, the student will be able to:
CO1: Communicate and connect to the surrounding.
CO2: Create a responsible connection with society.
CO3: Involve in the community in general in which they work.
CO4: Notice the needs and problems of the community and involve them in problem –solving.
CO5: Develop among themselves a sense of social & civic responsibility & utilize their knowledge in
finding practical solutions to individual and community problems.
CO6: Develop competence required for group-living and sharing of responsibilities & gain skills in
mobilizing community participation to acquire leadership qualities and democratic attitudes.

ACTIVITIES: Jamming session, open mic, and poetry: Platform to connect to others. Share the stories
with others. Share the experience of Social Connect. Exhibit the talent like playing instruments, singing,
one-act play, art-painting, and fine art.

PEDAGOGY: The pedagogy will include interactive lectures, inspiring guest talks, field visits, social
immersion, and a course project. Applying and synthesizing information from these sources to define the
social problem to address and take up the solution as the course project, with your group. Social immersion
with NGOs/social sections will be a key part of the course. Will all lead to the course project that will
address the needs of the social sector?

COURSE TOPICS: The course will introduce social context and various players in the social space, and
present approaches to discovering and understanding social needs. Social immersion and inspiring
conversional will culminate in developing an actual, idea for problem-based intervention, based on an in-
depth understanding of a key social problem

Duration: A total of 26 hours engagement per semester is required for the 3rd semester of
the B.E./B.Tech. program. The students will be divided into groups. Each group will be handled by
faculty mentor. Faculty mentor will design the activities (particularly Jamming sessions open
mic, and poetry) Faculty mentors have to design the evaluation system as per VTU guidelines of
scheme & syllabus.

Guideline for Assessment Process: Continuous Internal Evaluation (CIE): After completion of the
course, the student shall prepare with daily diary as reference, a comprehensive report in
consultation with the mentor/s to indicate what he has observed and learned in the social
connect period. The report should be signed by the mentor. The report shall be evaluated on the
basis of the following criteria and/or other relevant criteria pertaining to the activity completed.
Marks allotted for the diary are out of 50. Planning and scheduling the social connect
Information/Data collected during the social connect Analysis of the information/data and
report writing Considering all above points allotting the marks as mentioned below
Excellent: 80 to 100
Good: 60 to 79
Satisfactory: 40 to 59 Unsatisfactory
and fail: <39
Special Note: NO Semester End Examination (SEE) – Completely Practical and activities-based
evaluation
Pedagogy – Guidelines: It may differ depending on local resources available for the study as well as
environment and climatic differences, location and time of execution.
Sl Topic Group Location Activity execution Reporting Evaluation of
No size the Topic
1. Plantation May be Farmers land/ Site selection Report Evaluation as
and individual parks / Villages / /Proper should be per the
adoption of or team roadside/ consultation/ submitted rubrics of
a tree community area / Continuous by scheme and
College campus etc monitoring/ individual syllabus by
Information board to the Faculty
concerned
evaluation
authority

2. Heritage May be Temples / Site selection Report Evaluation

walk and individual monumental /Proper should be as per the
crafts or team places / Villages/ consultation/ submitted rubrics of
corner City Areas / Grama Continuous by scheme and
panchayat/ public monitoring/ individual syllabus by
associations/Gover Information board to the Faculty
nment Schemes concerned
officers/ campus evaluation
etc authority

3. Organic May be Farmers land / Group selection / Report Evaluation

farming and individual parks / Villages proper should be as per the
waste or team visits consultation / submitted rubrics of
management / roadside/ Continuous by scheme and
community area / monitoring / individual syllabus by
College campus etc Information to the Faculty
board concerned
evaluation
authority
4. Water May be Villages/ City Areas site selection / Report Evaluation
conservation individual / Grama proper should be as per the
& or team panchayat/ public consultation/ submitted rubrics of
conservation associations/Gover Continuous by scheme and
techniques nment Schemes monitoring/ individual syllabus by
officers / campus Information board to the Faculty
etc concerned
evaluation
authority
5. Food walk: May be Villages/ City Areas Group selection / Report Evaluation as
Practices in individual / Grama proper should per the
society or team panchayat/ public consultation be rubrics of
associations/Gover / Continuous submitte scheme and
nment Schemes monitoring / d by syllabus by
officers/ campus etc Information individua Faculty
board l to the
concerne
d
evaluatio
n
authority
Plan of Action (Execution of Activities)

Sl.NO Practice Session Description

1 Lecture session in field to start activities
2 Students Presentation on Ideas
3 Commencement of activity and its progress
4 Execution of Activity
5 Execution of Activity
6 Execution of Activity
7 Execution of Activity
8 Case study-based Assessment, Individual performance
9 Sector/ Team wise study and its consolidation
10 Video based seminar for 10 minutes by each student At the end of semester with
Report.
• Each student should do activities according to the scheme and syllabus.
• At the end of semester student performance has to be evaluated by the faculty for the
assigned activity progress and its completion.
• At last consolidated report of all activities from 1st to 5th, compiled report should be submi as per
the instructions and scheme.

Assessment Details for CIE (both CIE and SEE)

Weightage CIE – 100% • Implementation strategies of the
project (NSS work).
Field Visit, Plan, Discussion 10 Marks
• The last report should be signed by
Commencement of activities and its 20 Marks
progress NSS Officer, the HOD and principal.
Case study-based Assessment 20 Marks • At last report should be evaluate the
Individual performance with report NSS officer of the institute.
Sector wise study & its consolidation 5*5= 25 Marks • Finally, the consolidated mark
25 sheet should be sent to university
Video based seminar for 10 minutes by 25 Marks and also to be m available at LIC
each student at the end of semester with visit.
Report.
Activities 1 to 5, 5*5 = 25
Total marks for the course in each 100 Marks
semester
For each activity, 20 marks CIE will be evaluated for IA marks at the end of semester, Report
and assessment copy should be made available in the department.
Students should present the progress of the activities as per the schedule in the prescribed practical
session in the field.
There should be positive progress in the vertical order for the benefit of society in general through
activities.
 Ability Enhancement Course/Skill Enhancement Course – III
(22CB358X)

B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS

Choice Based Credit System (CBCS)
SEMESTER - III
Data Analytics with Excel (0:0:2) 1
(Effective from the academic year 2023-24)
Course Code BCB358A CIE Marks 50
Teaching Hours/Week 0:0:2 SEE Marks 50
(L:T:P)
Total Number of Contact 26Hours Exam Hours 03
Hours
Examination Type Practical
Course Objectives:
This course enables students to:
1. To Apply analysis techniques to datasets in Excel
2. Learn how to use Pivot Tables and Pivot Charts to streamline your workflow in Excel
3. Understand and Identify the principles of data analysis
4. Become adept at using Excel functions and techniques for analysis
5. Build presentation ready dashboards in Excel
Sl. Programs List
No
Getting Started with Excel: Creation of spread sheets, Insertion of rows and columns, Drag & Fill,
1
use of Aggregate functions.
2 Working with Data : Importing data, Data Entry & Manipulation, Sorting & Filtering.
3 Working with Data: Data Validation, Pivot Tables & Pivot Charts.
4 Data Analysis Process: Conditional Formatting, What-If Analysis, Data Tables, Charts & Graphs.
5 Cleaning Data with Text Functions: use of UPPER and LOWER, TRIM function, Concatenate.
Cleaning Data Containing Date and Time Values: use of DATEVALUE function, DATEADD and
6
DATEDIF, TIMEVALUE functions.
Conditional Formatting: formatting, parsing, and highlighting data in spreadsheets during data
7
analysis.
Working with Multiple Sheets: work with multiple sheets within a workbook is crucial for
8 organizing and managing data, perform complex calculations and create comprehensive
reports.
Create worksheet with following fields: Empno, Ename, Basic Pay(BP), Travelling
Allowance(TA), Dearness Allowance(DA), House Rent Allowance(HRA), Income Tax(IT),
9
Provident Fund(PF), Net Pay(NP). Use appropriate formulas to calculate the above scenario.
Analyse the data using appropriate chart and report the data.
Create worksheet on Inventory Management: Sheet should contain Product code, Product name,
10 Product type, MRP, Cost after % of discount, Date of purchase. Use appropriate formulas to
calculate the above scenario. Analyse the data using appropriate chart and report the data.
Course Outcomes:
The student should be able to:
CO1: Choose functions and productivity tools to assist in developing worksheets.
CO2: Create and manipulate data lists using Outline and PivotTables in Microsoft Excel.
CO3: Utilize Consolidation features to summarize and report results from multiple
worksheets.
Textbooks
1. Berk & Carey - Data Analysis with Microsoft® Excel: Updated for Office 2007®, Third Edition, ©
2010 Brooks/Cole, Cengage Learning, ISBN-13: 978-0-495-39178-4
2. Wayne L. Winston - Microsoft Excel 2019: Data Analysis And Business Modelling, PHI, ISBN:
9789389347180
3. Aryan Gupta - Data Analysis in Excel: The Best Guide.
(https://www.simplilearn.com/tutorials/excel-tutorial/data-analysis-excel)
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS) applicable for 2022 Scheme
SEMESTER – III
Data Analytics with R (0:0:2) 1
(Effective from the academic year 2023 -24)
Course Code BCB358B CIE Marks 50
Teaching Hours/Week 0:0:2 SEE Marks 50
(L: T:P)
Total Number of Contact 26hrs Exam Hours 3 Hours
Hours
Examination Type Theory
Course Objectives:
This course will enable students to:
1. To explore and understand how R and R Studio interactive environment.
2. To understand the different data Structures, data types in R.
3. To learn and practice programming techniques using R programming.
4. To import data into R from various data sources and generate visualizations.
5. To draw insights from datasets using data analytics techniques.
Preamble: R analytics is data analytics using R programming language, an open-source language used
for statistical computing or graphics. This programming language is often used in statistical analysis and
data mining It can be used for analytics to identify patterns and build practical models.
Si. No Program
1 Demonstrate the steps for installation of R and R Studio. Perform the following:
a) Assign different type of values to variables and display the type of variable. Assign different
types such as Double, Integer, Logical, Complex and Character and understand the difference
between each data type.
b) Demonstrate Arithmetic and Logical Operations with simple examples.
c) Demonstrate generation of sequences and creation of vectors.
d) Demonstrate Creation of Matrices
e) Demonstrate the Creation of Matrices from Vectors using Binding Function.
f) Demonstrate element extraction from vectors, matrices and arrays
Suggested Reading – Text Book 1 – Chapter 1 (What is R, Installing R, Choosing an IDE –
RStudio, How to Get Help in R, Installing Extra Related Software), Chapter 2 (Mathematical
Operations and Vectors, Assigning Variables, Special Numbers, Logical Vectors), Chapter 3
(Classes, Different Types of Numbers, Other Common Classes, Checking and Changing
Classes, Examining Variables )
2 Assess the Financial Statement of an Organization being supplied with 2 vectors of data:
Monthly Revenue and Monthly Expenses for the Financial Year. You can create your own
sample data vector for this experiment) Calculate the following financial metrics:
a. Profit for each month.
b. Profit after tax for each month (Tax Rate is 30%).
c. Profit margin for each month equals to profit after tax divided by revenue.
d. Good Months – where the profit after tax was greater than the mean for the year.
e. Bad Months – where the profit after tax was less than the mean for the year.
f. The best month – where the profit after tax was max for the year.
g. The worst month – where the profit after tax was min for the year.
Note:
a. All Results need to be presented as vectors
 b. Results for Dollar values need to be calculated with $0.01 precision, but need to be
presented in Units of $1000 (i.e 1k) with no decimal points
c. Results for the profit margin ratio need to be presented in units of % with no decimal point.
d. It is okay for tax to be negative for any given month (deferred tax asset)
e. Generate CSV file for the data.
Suggested Reading – Text Book 1 – Chapter 4 (Vectors, Combining Matrices)
3 Develop a program to create two 3 X 3 matrices A and B and perform the following operations
a)Transpose of the matrix b) addition c) subtraction d) multiplication
Suggested Reading – Text Book 1 – Chapter 4 (Matrices and Arrays – Array Arithmetic)
4 Develop a program to find the factorial of given number using recursive function calls.
Suggested Reading – Reference Book 1 – Chapter 5 (5.5 – Recursive Programming)
Text Book 1 – Chapter 8 (Flow Control and Loops – If and Else, Vectorized If, while loops, for
loops),Chapter 6 (Creating and Calling Functions, Passing Functions to and from other
functions)
5 Develop an R Program using functions to find all the prime numbers up to a specified number
by the method of Sieve of Eratosthenes.
Suggested Reading – Reference Book 1 - Chapter 5 (5.5 – Recursive Programming)
Text Book 1 – Chapter 8 (Flow Control and Loops – If and Else, Vectorized If, while loops, for
loops), Chapter 6 (Creating and Calling Functions, Passing Functions to and from other
functions)
6 The built-in data set mammals contain data on body weight versus brain weight. Develop R
commands to:
a) Find the Pearson and Spearman correlation coefficients. Are they similar?
b) Plot the data using the plot command.
c) Plot the logarithm (log) of each variable and see if that makes a difference.
Suggested Reading – Text Book 1 –Chapter 12 – (Built-in Datasets) Chapter 14 –
(Scatterplots) Reference Book 2 – 13.2.5 (Covariance and Correlation)
7 Develop R program to create a Data Frame with following details and do the following
operations.
itemCode itemCategory itemPrice
1001 Electronics 700
1002 Desktop Supplies 300
1003 Office Supplies 350
1004 USB 400
1005 CD Drive 800

a) Subset the Data frame and display the details of only those items whose price is greater
than or equalto 350.
b) Subset the Data frame and display only the items where the category is either “Office
Supplies” or“Desktop Supplies”
c) Create another Data Frame called “item-details” with three different fields itemCode,
ItemQtyonHand and ItemReorderLvl and merge the two frames
Suggested Reading –Textbook 1: Chapter 5 (Lists and Data Frames)
8 Let us use the built-in dataset air quality which has Daily air quality measurements in New
York, May to September 1973. Develop R program to generate histogram by using
appropriate arguments for the following statements.
a) Assigning names, using the air quality data set.
b) Change colors of the Histogram
c) Remove Axis and Add labels to Histogram
d) Change Axis limits of a Histogram
e) Add Density curve to the histogram
Suggested Reading –Reference Book 2 – Chapter 7 (7.4 – The ggplot2 Package), Chapter 24
(Smoothing and Shading )
9 Design a data frame in R for storing about 20 employee details. Create a CSV file named
“input.csv” that defines all the required information about the employee such as id, name,
salary, start_date, dept. Import into R and do the following analysis.
a) Find the total number rows & columns
b) Find the maximum salary
c) Retrieve the details of the employee with maximum salary
d) Retrieve all the employees working in the IT Department.
e) Retrieve the employees in the IT Department whose salary is greater than 20000 and write
these details into another file “output.csv”
Suggested Reading – Text Book 1 – Chapter 12(CSV and Tab Delimited Files)
10 Using the built in dataset mtcars which is a popular dataset consisting ofthe design and fuel
consumption patterns of 32 different automobiles. The data was extracted from the 1974
Motor Trend US magazine, and comprises fuel consumption and 10 aspects of automobile
design and performance for 32 automobiles (1973-74 models). Format A data frame with 32
observations on 11 variables : [1] mpg Miles/(US) gallon, [2] cyl Number of cylinders [3]
disp Displacement (cu.in.), [4] hp Gross horsepower [5] drat Rear axleratio, [6] wt
Weight (lb/1000) [7] qsec 1/4 mile time, [8] vs V/S, [9] am Transmission (0 = automatic, 1 =
manual), [10] gear Number of forward gears, [11] carb Number of carburetors
Develop R program, to solve the following:
a) What is the total number of observations and variables in the dataset?
b) Find the car with the largest hp and the least hp using suitable functions
c) Plot histogram / density for each variable and determine whether continuous variables
are normally distributed or not. If not, what is their skewness?
d) What is the average difference of gross horse power(hp) between automobiles with 3 and
4 number of cylinders(cyl)? Also determine the difference in their standard deviations.
e) Which pair of variables has the highest Pearson correlation?

References (Web links):

1. https://cran.r-project.org/web/packages/explore/vignettes/explore_mtcars.html
2. https://www.w3schools.com/r/r_stat_data_set.asp
3. https://rpubs.com/BillB/217355
11 Demonstrate the progression of salary with years of experience using a suitable data set (You
can create your own dataset). Plot the graph visualizing the best fit line on the plot of the
given data points. Plot a curve of Actual Values vs. Predicted values to show their correlation
and performance of the model. Interpret the meaning of the slope and y-intercept of the line
with respect to the given data. Implement using lm function. Save the graphs and coefficients
in files. Attach the predicted values of salaries as a new column to the original data set and
save the data as a new CSV file.
Suggested Reading – Reference Book 2 – Chapter 20 (General Concepts, Statistical Inference,
Prediction)
Course outcomes:
The students will be able to:
CO1: Explain the fundamental syntax of R data types, expressions and the usage of the R-StudioIDE.
CO2: Develop a program in R with programming constructs: conditionals, looping and functions.
CO3: Apply the list and data frame structure of the R programming language.
CO4: Use visualization packages and file handlers for data analysis.
Textbooks
1. Cotton, R. (2013). Learning R: A Step by Step Function Guide to Data Analysis. 1st ed. O’Reilly Media
Inc.
References
1. Jones, O., Maillardet. R. and Robinson, A. Using R. Chapman & Hall/CRC, The R Series. (2014).
Introduction to Scientific Programming and Simulation
2. Davies, T.M. (2016) The Book of R: A First Course in Programming and Statistics. No Starch Press
 B.E. COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS)
SEMESTER - III
Data Visualization using Tableau and Power BI (0:0:2) 1
(Effective from the academic year 2023-24)

Course Code BCB358C CIE Marks 50

Teaching Hours/Week 0:0:2 SEE Marks 50
(L:T:P)
Total Number of Contact 26 Exam Hours 02
Hours
Examination Nature Practical
Course Objectives:
This course will enable students to:
1. To understand the fundamentals of data visualization and the role of visual analytics.
2. To develop proficiency in creating various types of visualizations and dashboards using Tableau.
3. To build skills in data modeling, visualization, and reporting with Power BI.
4. To enable students to design and implement interactive dashboards that facilitate data-driven
decision-making.
Preamble:
This course aims to provide students with the skills and knowledge required to create impactful data
visualizations using Tableau and Power BI. It covers the essentials from introductory concepts to
advanced techniques, enabling students to transform data into actionable insights through interactive
and visually appealing dashboards.

Sl.
Experiments
No
1 Introduction to Data Visualization:
Create a simple bar chart using a provided dataset in both Tableau and Power BI. Focus on
understanding how to connect to data sources and basic visualization principles.
2 Getting Started with Tableau:
Connect Tableau to a sample Excel dataset and create a line chart to visualize trends over time.
3 Getting Started with Tableau:
Build a dashboard in Tableau that includes a bar chart, a line chart, and a scatter plot, all linked
through interactive filters.
4 Advanced Tableau Techniques
Create a heat map in Tableau to show data density and distribution across geographical regions
using a provided dataset.
5 Develop a Tableau dashboard with calculated fields and parameters to allow dynamic user input
and view changes.
6 Use Tableau’s storytelling feature to create a presentation that guides viewers through different
insights in the dataset.
7 Getting Started with Power BI:
Import a dataset into Power BI and create a pie chart to represent the distribution of categories
within the data.
8 Construct a data model in Power BI by establishing relationships between different tables and
creating a basic report.
9 Create a Power BI dashboard with bar charts, line graphs, and KPIs, incorporating slicers to
enable interactive filtering.
10 Advanced Power BI Techniques:
Develop a complex Power BI report using DAX to create calculated columns and measures,
showcasing advanced analytical capabilities.
11 Utilize custom visuals in Power BI to create a more engaging and informative dashboard, focusing
on map visualizations and unique chart types.
12 Publish a Power BI report to the Power BI Service, configure sharing settings, and create a shared
workspace for collaboration.
Course outcomes:
The students will be able to:
CO1: Apply the principles of data visualization to create effective visualizations.
CO2: Use Tableau to develop a wide range of visualizations and interactive dashboards.
CO3: Utilize Power BI for comprehensive data integration, visualization, and reporting.
CO4: Analyze and interpret data to generate meaningful business insights.

Textbooks
1. Mastering Microsoft Power BI by Brett Powell

2 Tableau Your Data! by Daniel G. Murray

3 Data Visualization: A Practical Introduction by Kieran Healy

 B.E COMPUTER SCIENCE AND BUSINESS SYSTEMS
Choice Based Credit System (CBCS) applicable for 2022 Scheme
SEMESTER –III/ IV(AEC course)
BUSINESS COMMUNICATION-1(1:0:0) 1
(Effective from the academic year 2024-25)
Course Code BCB358D CIE Marks 50
Teaching Hours/Week (L:T:P) 1:0:0 SEE Marks 50
Total Number of Contact Hours 16 Exam Hours 1
Course Objectives:
This course will enable students to: (List as per the requirement of your course)
1. Enhance proficiency and competencies in verbal and non- verbal communication skills with
a holistic long-term perspective
2. Develop technical communication skills
3. Guide the participants to manage cross cultural communication
4. Address contemporary skills, issues and concepts
Preamble: This course introduces the fundamental principles of business communication and provides
the opportunity to distinguish between business communication and personal/social communication.
The course is designed to impart a basic understanding of written business communication, including
letters, reports, presentations and email and valuable insights into listening and non -verbal
communication. Every skill gained from this course will aid the learners in developing complete
confidence to communicate professionally with different audiences
Module – 1
Business Communication components, Types, formal communication network, Work team
communication, variables, goal, conflict resolution, nonverbal communication, Cross cultural
communication, Business meetings, Business Etiquette.

Text Book :1 04 Hours

Module – 2
Understanding Corporate Communication, Employee Communication, Managing Government Relations,
Writing for Media and Media Relations.

Text Book :1 03 Hours

Module – 3
Introduction of different kinds of technical documents, Information collection, factors affecting
information and document design, Strategies for organization, Information design and writing for print
and online media.

Text Book: 1 03 Hours

Module – 4
Report writing: Characterizing &amp; business reports, Types and forms &; reports,

Text Book:1 03 Hours

Module – 5
Business Presentation: Written and oral presentation, work, team presentation, Delivering the business
presentation visual aids, slides, electronic presentation, hand-outs, delivering the presentation.

Text Book:1 03 Hours

Course Outcomes:
The students will be able to
 CO1: Communicate with more clarity that would facilitate the organizational work process.
CO2: Break the barriers and help in the process of earning greater commitment among
stakeholders to goal achievement.
CO3: Handle all sorts of organizational communications, within and beyond.
CO4: Demonstrate cross - cultural skills in a trans-national business environment
Text Books:
1. Scot Ober, Contemporary business communication, Biztantra, 2014, ISBN-10: 9780198061847

Reference Books:
1.Lesiler &amp;Flat lay, Basic Business communication, Tata Mc Graw Hill, 2010, ISBN-10:
9780072537536
Alternate Assessment Tools (AATs) suggested:

• Activity Based Learning