BACHELOR OF TECHNOLOGY

COMPUTER SCIENCE AND ENGINEERING / COMPUTER SCIENCE AND INFORMATION TECHNOLOGY / INFORMATION
TECHNOLOGY / COMPUTER SCIENCE AND TECHNOLOGY
SECOND YEAR (FOURTH SEMESTER)
W.E.F. ADMISSION BATCH 2023-24
Contact
Sl. University Internal
Category Course Code Course Hrs. Credit
No. Marks Evaluation
L-T-P
Subject (Theory)
1 PC CSPC2004 Database Engineering 3-0-0 3 100 50
2 PC CSPC2005 Computer Organization and Architecture 3-0-0 3 100 50
3 PC CSPC2006 Design and Analysis of Algorithms 3-0-0 3 100 50
4 PC CSPC2007 Computer Networks 3-0-0 3 100 50

5 PC(ACC) PCAC2014 IT Fundamentals for Cybersecurity - II 3-0-0 2 100 50

6 HS HSHS2002 Organizational Behaviour 3-0-0 2 100 50

Subject (Sessional / Practical)
7 PC CSPC2204 Database Engineering Lab. 0-0-3 1.5 - 100
8 PC CSPC2205 Computer Organization and Architecture Lab. 0-0-3 1.5 - 100
9 PC CSPC2206 Design and Analysis of Algorithms Lab. 0-0-3 1.5 - 100
10 PC CSPC2207 Computer Networks Lab. 0-0-3 1.5 - 100
Total 18-0-12 22 600 700
Note : Minimum four (04) weeks of Summer Course / Training / Internship / Skill Course / etc. after 4th Semester.
 CSPC2004 DATABASE ENGINEERING (3-0-0)

Course Learning Objectives

CLO 1. To provide a strong foundation in database concepts, technology, and practice.
CLO 2. To practice SQL programming through a variety of database problems.
CLO 3. To Understand the relational database design principles.
CLO 4. To demonstrate the use of concurrency and transactions in database
CLO 5. To design and build database applications for real world problems.
CLO 6. To become familiar with database storage structures and access techniques.

Module-1 (8 hours)
Introduction to Databases and overview of Database Languages and architecture:
Overview, Database System vs File System, Overall Database Structure, Characteristics of
database approach, Advantages of using the DBMS approach, History of database
applications, Database System Concept, Types of users, Database design lifecycle, Data
Model Schema and Instances, Types of data model, Three schema architecture, Data
Independence and Database Language and Interfaces, Data Definitions Language, DML, the
Database System environment,
Data Modeling Using the Entity Relationship Model:
ER Model Concepts, Notation for ER Diagram, Mapping Constraints, Keys, Concepts of
Super Key, Candidate Key, Primary Key, Specialization, Generalization, Aggregation,
Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of Higher
Degree.

Module-2 (8 hours)
Introduction to Relational Data Model:
Relational Model Concepts, Codd’s rules, Integrity Constraints, Entity Integrity, Referential
Integrity, Key Constraints, Domain Constraints and relational database schemas, Update
operations, transactions, and dealing with constraint violations.
Relational Algebra and Calculus:
Selection and projection, set operations, renaming, Joins, Division, syntax, semantics.
Operators, grouping and ungrouping, relational comparison. Calculus: Tuple relational
calculus, Domain relational Calculus, calculus vs algebra, computational capabilities,
Relational Database Design using ER-to- Relational mapping.
Structured Query Language:
Introduction to SQL- Characteristics, advantages of SQL, Types of SQL commands, SQL
data definition and data types, specifying constraints in SQL, basic retrieval queries in SQL,
INSERT, DELETE, and UPDATE statements in SQL, Additional features of SQL. More
complex SQL retrieval queries, Specifying constraints as assertions and action triggers,
Views and Indexes, Queries and Sub Queries. Aggregate Functions. Insert, Update and
Delete Operations, Joins, Unions, Intersection, Minus, Cursors, Triggers, Procedures in
SQL/PL SQL.

Module-3 (9 hours)
Normalization:
Database Design Theory – Introduction to Normalization using Functional and Multivalued
Dependencies: Informal design guidelines for relation schema, Functional Dependencies,
Normal Forms based on Primary Keys, Second and Third Normal Forms, Boyce-Codd
Normal Form, Multivalued Dependency and Fourth Normal Form, Join Dependencies and
Fifth Normal Form. Examples on normal forms.
Normalization Algorithms:
Inference Rules, Equivalence, and Minimal Cover, Properties of Relational Decompositions,
Algorithms for Relational Database Schema Design, Nulls, Dangling tuples, and alternate
Relational Designs, Further discussion of Multivalued dependencies and 4NF, Other
dependencies and Normal Forms.

Module-4 (8 hours)
File Structures, Hashing and Indexing:
Introduction, placing file records on disk, hashing techniques, Parallelizing Disk Access
Using RAID Technology, indexing structures for files- Types of Single-Level Ordered
Indexes, Dynamic Multilevel Indexes Using B-Trees and B+-Trees, Indexes on Multiple
Keys
Query Processing, optimization and Database tuning:
Translating SQL Queries into Relational Algebra, Algorithms for External Sorting,
Algorithms for SELECT and JOIN Operations, Algorithms for PROJECT and Set
Operations, Implementing Aggregate Operations and OUTER JOINs, Combining Operations
Using Pipelining, Using Heuristics in Query Optimization, Using Selectivity and Cost
Estimates in Query Optimization, Physical Database Design in Relational Databases, an
Overview of Database Tuning in Relational Systems

Module-5 (7 hours)
Transaction Processing:
Introduction to Transaction Processing, Transaction and System concepts, ACID properties,
Testing of Serializability, Serializability of Schedules, Conflict & View Serializable
Schedule, Recoverability, Recovery from Transaction Failures, Log Based Recovery,
Checkpoints, Deadlock Handling
Concurrency Control Techniques:
Locking Techniques for Concurrency Control, Time Stamping Protocols for Concurrency
Control, Validation Based Protocol, Multiple Granularity, Multi Version Schemes, Recovery
with Concurrent Transaction.

Course Outcomes
At the end of the course the student will be able to:
CO1 Identify, analyze and define database objects, enforce integrity constraints on a
database using RDBMS.
CO2 Use Structured Query Language (SQL) for database manipulation and also demonstrate
the basic of query evaluation.
CO3 Design and build simple database systems and relate the concept of transaction,
concurrency control and recovery in database
CO4 Develop application to interact with databases, relational algebra expression. CO 5.
Develop applications using tuple and domain relation expression from queries

Textbooks
1. Fundamentals of Database Systems, Ramez Elmasri and Shamkant B. Navathe, 7th
Edition, 2017, Pearson.
2. Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014,
McGraw Hill
3. C. J. Date, A. Kannan and S. Swamynathan, “An Introduction to Database Systems”,
8th ed, Pearson Education, 2006

Reference Books:
Abraham Silberschatz, Henry F. Korth and S. Sudarshan’s Database System Concepts 6th
Edition Tata Mcgraw Hill Education Private Limited.

Weblinks and Video Lectures (e-Resources):

https://www.youtube.com/watch?v=ywTn9qHyI9I
https://www.youtube.com/watch?v=_qbKMdqQS6E
https://www.youtube.com/watch?v=PqPkYmRSQ_w
 CSPC2005 COMPUTER ORGANIZATION AND ARCHITECTURE (3-0-0)

Objectives of the course:

To expose the students to the following:
1. How Computer Systems work & the basic principles
2. Instruction Level Architecture and Instruction Execution
3. The current state of art in memory system design
4. How I/O devices are accessed and its principles.
5. To provide the knowledge on Instruction Level Parallelism
6. To impart the knowledge on micro programming
7. Concepts of advanced pipelining techniques.

Module-I: (8 Hrs.)
Functional blocks of a computer: CPU, memory, input-output subsystems, control Unit,
Overview of Computer Architecture and Organization: Fundamentals of computer
architecture, Organization of Von Neumann machine, Basic operation concepts, Performance
and Historical perspective, Instruction set architecture of a CPU–registers, instruction
execution cycle, RTL interpretation of instructions, addressing modes, instruction set.

Module-II: (08 Hrs.)

Data representation: signed number representation, fixed and floating point representations,
character representation. Computer arithmetic – integer addition and subtraction, ripple carry
adder, carry look-ahead adder, etc. multiplication – shift and add, Booth multiplier, carry save
multiplier, etc. Division restoring and non-restoring techniques, floating point arithmetic.

Module-III: (12 Hrs.)

CPU control unit design: hardwired and micro-programmed design approaches, Memory
system design: semiconductor memory technologies, Memory Organization- Memory
Hierarchy, Main Memory, Auxiliary memory, Associate Memory, Cache Memory.
Peripheral devices and their characteristics: I/O subsystems, I/O device interface, I/O
transfers–program controlled, Asynchronous data transfer, Modes of Transfer, interrupt
driven and DMA,
Privileged and non-privileged instructions, software interrupts and exceptions. Programs and
processes–role of interrupts in process state transitions, I/O device interfaces – SCII, USB

Module-IV: (07 Hrs.)

Reduced Instruction Set Computer: CISC Characteristics, RISC Characteristics.
Pipeline and Vector Processing: Pipelining: Basic concepts of pipelining, throughput and
speedup, pipeline hazards. Vector Processing, Array Processor.
Multi Processors: Characteristics of Multiprocessors, Interconnection Structures, Inter-
processor arbitration, Inter-processor communication and synchronization, Cores, and Hyper-
Threading ,Cache Coherence.

Module-V: (08 Hrs.)

Memory organization: Memory interleaving, concept of hierarchical memory organization,
cache memory, cache size vs. block size, mapping functions, replacement algorithms, write
policies.
Books:
1. “Computer Organization and Embedded Systems”, 6th Edition by CarlHamacher,
McGraw Hill Higher Education.
2. “Computer Organization and Architecture: Designing for Performance”, 10th Edition
by William Stallings, Pearson Education.
3. “Computer Architecture and Organization”, 3rd Edition by John P. Hayes,
WCB/McGraw-Hill
4. “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition by
David A. Patterson and John L. Hennessy, Elsevier.

Course outcomes
1. Draw the functional block diagram of a single bus architecture of a computer and
describe the function of the instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set.
2. Write assembly language program for specified microprocessor for computing 16-bit
multiplication, division and I/O device interface (ADC, Control circuit, serial port
communication).
3. Write a flowchart for Concurrent access to memory and cache coherency in Parallel
Processors and describe the process.
4. Given a CPU organization and instruction, design a memory module and analyze its
operation by interfacing with the CPU.
5. Given a CPU organization, assess its performance, and apply design techniques to
enhance performance using pipelining, parallelism and RISC methodology
 CSPC2006 DESIGN AND ANALYSIS OF ALGORITHMS (3-0-0)

Course Learning Objectives:

CLO1. Explain the methods of analyzing the algorithms and to analyze performance of
algorithms.
CLO 2. State algorithm’s efficiencies using asymptotic notations.
CLO3. Solve problems using algorithm design methods such as the brute force method,
greedy method, divide and conquer, decrease and conquer, transform and conquer,
dynamic programming, backtracking and branch and bound.
CLO4. Choose the appropriate data structure and algorithm design method for a specified
application.
CLO 5. Introduce P and NP classes.

Module-I: (8 Hours)
Notion of Algorithm: Growth of functions, Recurrences: The Master method, The
Substitution method, The Iteration method, Asymptotic Notations and Basic Efficiency
Classes (Use of Big O, θ, etc.) in analysis of algorithms, Mathematical Analysis of few Non-
Recursive and Recursive Algorithms.

Module-II: (8 Hours)
Sorting and Searching Techniques: Selection Sort, Bubble Sort, Insertion Sort, Sequential
Search, Binary Search, Depth First Search and Breadth First Search, Balanced Search Trees,
AVL Trees, Red-Black Trees, Heaps and Heap Sort, Disjoint Set and their Implementation,
Divide and Conquer Paradigm of problem solving, Complexity analysis and understanding of
Merge Sort, Quick Sort, Binary Search Trees.

Module-III: (8 Hours)
Greedy Techniques: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s and Bellman Ford
Algorithm, Huffman Trees, Knapsack problem.
Dynamic Programming Paradigm: Floyd-Warshall Algorithm, Optimal Binary Search trees,
Matrix Chain Multiplication Problem, Longest Common Subsequence Problem, 0/1
Knapsack Problem, Maximum
Network Flow Problem.

Module-IV: (8 Hours)
String Matching Algorithms: Naive string-matching algorithm, The Rabin-Karp Algorithm,
string matching with Finite Automata, Knuth Morris Pratt string matching algorithm.
Backtracking: n-Queen’s problem, Hamiltonian Circuit problem, Subset-Sum problem, State
Space Search Tree for these problems

Module-V: (8 Hours)
Branch and Bound: Travelling Salesman Problem and its State Space Search Tree.
Introduction to Computability: Polynomial-time verification, NP-Completeness and
Reducibility, NP- Complete problems. Approximation Algorithms: Vertex Cover Problem.

Course outcome:
At the end of the course the student will be able to:
CO1 Analyze the performance of the algorithms, state the efficiency using asymptotic
notations and analyze mathematically the complexity of the algorithm.
CO2 Apply divide and conquer approaches and decrease and conquer approaches in solving
the problems analyze the same
CO3 Apply the appropriate algorithmic design technique like greedy method, transform and
conquer approaches and compare the efficiency of algorithms to solve the given
problem.
CO4 Apply and analyze dynamic programming approaches to solve some problems, and
improve an algorithm time efficiency by sacrificing space.
CO5 Apply and analyze backtracking, branch and bound methods and to describe P, NP and
Complete problems.

Textbooks:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, “Introduction to Algorithms”,
PHI Publication.
2. A.V. Aho, J. E. Hopcroft and J.D. Ullman, “The Design and Analysis of Computer
Algorithms”, Pearson Education.
3. R. S. Salaria, Khanna, “Data Structure & Algorithms”, Khanna Book Publishing Co.
(P) Ltd.

Reference Books:
1. Computer Algorithms/C++, Ellis Horowitz, SatrajSahni and Rajasekaran, 2nd Edition,
2014, Universities Press.
2. Introduction to the Design and Analysis of Algorithms, Anany Levitin: 2nd Edition,
2009. Pearson.

Web links and Video Lectures (e-Resources):

1. https://nptel.ac.in/courses/106/101/106101060/
2. http://cse01-iiith.vlabs.ac.in/
 CSPC2007 COMPUTER NETWORKS (3-0-0)

Course Learning Objectives:

CLO1 Fundamentals of data communication networks.
CLO2 Software and hardware interfaces
CLO3 Application of various physical components and protocols
CLO4 Communication challenges and remedies in the networks.

Module-I (8Hours)
Introduction to Networks: Network hardware, Network software, OSI, TCP/IP Reference
models, Example Networks: ARPANET, Internet.
Physical Layer: Data and signals: analog and digital, periodic analog signals, digital signals,
transmission impairments, data rate limit, Guided transmission media twisted pairs, coaxial
cable, fiber optics, Wireless transmission, unguided transmission media.

Module–II (8 hours)
Data Link Layer: Design issues, framing, Error detection and correction, CRC codes
Elementary data link protocols: simplex protocol, A simplex stop and wait protocol for an
error-free channel, A simplex stop and wait protocol for noisy channel.
Sliding Window protocols: A one-bit sliding window protocol, A protocol using Go-Back-
N, A protocol using Selective Repeat, Example data link protocols.
Medium Access sub layer: The channel allocation problem, Multiple access protocols:
ALOHA, Carrier sense multiple access protocols, collision free protocols. Wireless LANs,
Data link layer switching.

Module–III (8 Hours)
Connecting devices: Learning bridges, spanning tree bridges, repeaters, hubs, bridges,
switches, routers and gateways, definition of multiplexing and types.
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding,
Hierarchical routing, Broadcast, Multicast, distance vector routing, link state protocols, path
vector routing, Congestion Control Algorithms, Quality of Service

Module–IV (10 Hours)

Internetworking: logical addressing, internet protocols, IP address, CIDR, IPv4 addressing,
IPv6 Protocol addressing, addresses mapping, ICMP, IGMP, ARP, RARP, DHCP.
Transport Protocols: process to process delivery, UDP, TCP, TCP Service Model, TCP
Sliding Window, TCP Congestion Control, congestion control and quality of service.

Module-V (6 Hours)
Application Layer- Introduction, providing services, Client server model, Standard client-
server application-HTTP, FTP, electronic mail, TELNET, DNS.

Course Outcomes:
At the end of the course the student will be able to:
CO1 Learn the basic needs of communication system.
CO2 Interpret the communication challenges and its solution.
CO3 Identify and organize the communication system network components CO 4. Design
communication networks for user requirements.
TEXT BOOKS:
1. A. S. Tanenbaum (2003), Computer Networks, 4th edition, Pearson Education/ PHI,
New Delhi, India.2
2. Behrouz A. Forouzan (2006), Data communication and Networking, 4th Edition, Mc
Graw-Hill, India.

REFERENCE BOOKS:
1. James F. Kurose, K. W. Ross, “Computer Networking: A Top-Down Approach
Featuring the Internet”, Pearson Education.
2. An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson
Education

Weblinks and Video Lectures (e-Resources):

https://nptel.ac.in/courses/106105183
https://nptel.ac.in/courses/106105081
 PCAC2014 IT Fundamentals for Cybersecurity – II (3-0-0)

OVERALL COURSE OBJECTIVES: The objective of this course series is to provide a robust foundation
in cybersecurity, emphasizing practical skills in network and database security, the application of
generative AI tools in cybersecurity challenges, and detailed methodologies in penetration testing
and incident response. This comprehensive approach is designed to prepare students for advanced
roles in the cybersecurity field, ensuring they can effectively address and mitigate potential security
threats.

LEARNING OUTCOMES: On successful completion of the course the students shall be able to:

1. Gain knowledge of Local Area Networks, TCP/IP, the OSI Framework, and routing basics, and
comprehend how networking affects security systems within an organization.
2. Learn about common vulnerabilities in various databases including SQL, Oracle, Mongo, and
Couch, and apply knowledge to mitigate risks such as SQL Injection.
3. Apply generative AI tools to combat cyber threats by detecting vulnerabilities and
automating the creation of cybersecurity content like playbooks and threat intelligence
reports.
4. Develop skills to perform penetration testing using various tools, gather essential data, and
understand the phases of testing to improve organizational security.
5. Understand the phases of incident response, from planning and preparation to
documentation and recovery, and develop skills in managing and responding to security
breaches effectively.
6. Learn key forensic processes and the collection of important digital evidence, enhancing
capabilities in analyzing and responding to cybersecurity incidents.
COURSE CONTENT:

Module 1: Network Security & Database Vulnerabilities [18 Hours]

This course gives you the background needed to understand basic network security. You will learn
the about Local Area Networks, TCP/IP, the OSI Framework and routing basics. You will learn how
networking affects security systems within an organization. You will learn the network components
that guard an organization from cybersecurity attacks.

In addition to networking, you will learn about database vulnerabilities and the tools/knowledge
needed to research a database vulnerability for a variety of databases including SQL Injection,
Oracle, Mongo and Couch.

Sub-Topics
Basics of IP Addressing and the OSI Model
Deep Dive - Injection Vulnerability
Final Project
Introduction to Databases
TCP/IP Framework

Formative Assessments:
4 Graded Quizzes & 1 Peer Review Assignment
Module 2: Generative AI: Boost Your Cybersecurity Career [10 Hours]

This short course provides cybersecurity professionals and enthusiasts with the latest Generative AI
tools to address complex cybersecurity challenges.

The course focuses on combating the exploitation of undetected vulnerabilities for which
organizations increasingly turn to Artificial Intelligence (AI) and Machine Learning (ML). Generative
AI, a transformative technology, emerges as a vital cybersecurity tool, detecting and preventing
attacks by identifying and neutralizing unknown vulnerabilities before causing significant harm.

The course explores foundational generative AI principles and their application in real-world
cybersecurity, encompassing User and Entity Behavior Analytics (UEBA), threat intelligence, report
summarization, playbooks, and its impact on phishing, malware, misinformation, and deepfakes.
Additionally, participants learn about potential Natural Language Processing (NLP) attack techniques,
like prompt injection, and strategies to mitigate them.

Sub-Topics
Final Project and Exam
Get Started with Gen AI in Cybersecurity
SIEM and SOC Tasks Using Generative AI

Formative Assessments:
3 Staff Graded Assessments

Module 3: Penetration Testing, Incident Response and Forensics [16 Hours]

This course gives you the background needed to gain Cybersecurity skills as part of the Cybersecurity
Security Analyst Professional Certificate program.

You will learn about the different phases of penetration testing, how to gather data for your
penetration test and popular penetration testing tools. Furthermore, you will learn the phases of an
incident response, important documentation to collect, and the components of an incident response
policy and team. Finally, you will learn key steps in the forensic process and important data to
collect. This course also gives you a first look at scripting and the importance to a system analyst.

Sub-Topics
Digital Forensics
Incident Response
Introduction to Scripting
Penetration Testing

Formative Assessments:
4 Graded Quizzes

ASSESSMENT:
For summative assessments, Coursera will provide question banks for which exams can be
conducted on the Coursera platform or the faculty will create their own assessments.
Note: If a Course or Specialization becomes unavailable prior to the end of the Term, Coursera may replace such
Course or Specialization with a reasonable alternative Course or Specialization.
 HSHS2002 ORGANISATIONAL BEHAVIOUR (3-0-0)

Objectives:
The objective is to develop an understanding of the behavior of individuals and groups inside organizations and to
enhance skills in understanding and appreciating individuals, interpersonal, and group process for increased
effectiveness both within and outside of organizations. Further, it is to develop theoretical and practical insights
and problem-solving capabilities for effectively managing the organizational processes.

Module-I: (06 Hrs.)

Fundamentals of OB: Definition, scope and importance of OB, Relationship between OB and the individual,
Evolution of OB, Theoretical framework (cognitive), behavioristic and social cognitive), Limitations of OB.

Module-II: (12 Hrs.)

Attitude: Importance of attitude in an organization, Right Attitude, Components of attitude, Relationship between
behavior and attitude, Developing Emotional intelligence at the workplace, Job attitude, Barriers to changing
attitudes.
Personality and values: Definition and importance of Personality for performance, The Myers-Briggs Type
Indicator and The Big Five personality model, Significant personality traits suitable to the workplace (personality
and job — fit theory), Personality Tests and their practical applications.
Perception: Meaning and concept of perception, Factors influencing perception, Selective perception,
Attribution theory, Perceptual process, Social perception (stereotyping and halo effect). Motivation: Definition &
Concept of Motive & Motivation, The Content Theories of Motivation (Maslow's Need Hierarchy & Herzberg's
Two Factor model Theory), The Process Theories (Vroom's expectancy Theory & Porter Lawler model),
Contemporary Theories — Equity Theory of Work Motivation.

Module-III: (10 Hrs.)

Foundations of Group Behavior: The Meaning of Group & Group behavior & Group Dynamics, Types of Groups,
The Five — Stage Model of Group Development.
Managing Teams: Why Work Teams, Work Teams in Organization, Developing Work Teams, Team Effectiveness
& Team Building.
Leadership: Concept of Leadership, Styles of Leadership, Trait Approach Contingency Leadership
Approach, Contemporary leadership, Meaning and significance of contemporary leadership, Concept of
transformations leadership, Contemporary theories of leadership, Success stories of today's Global and Indian
leaders.

Module-IV: (08 Hrs.)

Organizational Culture : Meaning & Definition of Organizational Culture, creating & Sustaining Organizational
Culture, Types of Culture (Strong vs. Weak Culture, Soft Vs. Hard Culture & Formal vs. Informal Culture),
Creating Positive Organizational Culture, Concept of Workplace Spirituality.
Module-V: (09 Hrs.)
Organizational Change: Meaning, Definition & Nature of Organizational Change, Types of Organizational
Change, Forces that acts as stimulants to change.
Implementing Organizational Change : How to overcome theResistance to Change,
Approaches to managing Organizational Change, Kurt Lewin's-Three step model, Seven Stage model of
Change & Kotter's Eight-Step plan for Implementing Change, Leading the Change Process, Facilitating
Change, Dealing with Individual & Group Resistance, Intervention Strategies for Facilitating Organizational
Change, Methods of Implementing Organizational Change, Developing a Learning Organization.

Course Outcomes:
At the end of the course, students will be able to:
1. Understand the basic concepts of OB, change management, organizational culture and their implementation in
organizations.
2. Identify and examine team characteristics for improved organizational performance.
3. Apply theories and frameworks to solve problems and take effective decisions for organizational success.
4. Analyze group behavior and leadership styles for effective people management.
5. Evaluate individual personality types and group behaviours for improving organizational processes and
practices.
6. Develop leadership competency to manage organizational situations.

Books:
1. Understanding Organizational Behaviour, Parek, Oxford
2. Organizational Behaviour, Robbins, Judge, Sanghi, Pearson.
3. Organizational Behaviour, K. Awathappa,HPH.
4. Organizational Behaviour, VSP Rao, Excel
5. Introduction to Organizational Behaviour, Moorhead, Griffin, Cengage.
6. Organizational Behaviour, Hitt, Miller, Colella, Wiley.