Curriculum
Curriculum
(Approved by AICTE, New Delhi, Government of Maharashtra & Affiliated to SGBAU, Amravati)
Page | 1
P. R. Pote Patil College of Engineering & Management, Amravati
Four Year Degree Program in Bachelor of Technology
Discipline: Computer Science and Engineering
Semester-III
OPEN ELECTIVE-I
1. Business Mathematics and Statistics 2. Quantitative Analysis and Logical Thinking 3. Foundations to Psychology and Counseling
Note: - It is mandatory for every student to submit any one Certificate from the list given in Annexure-I
Page | 2
P. R. Pote Patil College of Engineering & Management, Amravati
Four Year Degree Program in Bachelor of Technology
Discipline: Computer Science and Engineering
Semester-IV
OPEN ELECTIVE-II
1.Principles & Practice of Management 2. Quantitative and Logical Proficiency 3. Emotional Intelligence
Note: - It is mandatory for every student to submit any one Certificate from the list given in Annexure-I
Page | 3
P. R. Pote Patil College of Engineering & Management, Amravati
B. Tech. in
Computer Science and Engineering
III Semester
Semester-III
Course Computer Architecture and Organization
Course Type PCC Course Code CS301
Credits 03 L-3, T-0, P - 0
Course Objectives:
1. To introduce principles of computer organization and the basic architectural
concepts.
2. To analyze performance issues in processor and memory design of a digital
computer.
3. To analyze processor performance improvement using instruction level
parallelism.
4. To examine the concepts of pipelining, parallelism, and multiprocessor systems for
enhanced performance.
5. To apply theoretical knowledge to solve real-world computational problems using
architectural principles.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Basic Structure of Computer H/W & S/W: Functional Units, Basic
Operational Concepts, Bus structures, Memory Locations, Addresses,
1 Instruction and instruction sequencing, Addressing Modes, Basic I/O 08
Operations
Text Book/s
Semester-III
Course Data Structures & Algorithms
Course Type PCC Course Code CS302
Credits 03 L-3, T-0, P - 0
Course Objectives:
1. To understand the linear and nonlinear data Structures and its memory representations.
2. To perform different operations on data structures such as insertion, deletion, searching
and traversing.
3. To understand various data searching and sorting methods with its complexity.
4. To efficiently implement the different data structures and solutions for specific problems.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Introduction to Data Structures:
Introduction to Data structures, Data Structure Operations, Algorithmic
1 Notation, Complexity of algorithms, String processing: storing strings, 08
character data type, string operations, word processing, and pattern matching
algorithms.
Arrays:
Linear arrays: Memory Representation of arrays, traversing linear arrays,
2 08
insertion & deletion operations, Bubble sort, Linear search and Binary search
algorithms. Multi dimensional arrays, Pointer arrays. Record structures.
Linked Lists:
Linked lists: Memory Representation of Linked List, traversing a linked list,
3 08
searching a linked list. Memory allocation & garbage collection. Insertion &
deletion operations on linked lists. Header linked lists, Two- way linked lists.
Stack & Queue:
Stacks: Sequential Memory Representation of Stack, Arithmetic expressions:
4 08
Polish notation. Quick sort, Recursion, Tower of Hanoi. Queues: Sequential
Memory Representation of Queue, DeQueue, Priority queues
Trees:
Introduction to Trees, Binary trees, Memory Representation of Binary Tree,
5 08
Traversing binary trees, Header nodes, Binary Search Tree, Heap and heap
sort, Path length & Huffman’s algorithm.
Graphs & Sorting Algorithms:
Introduction to Graphs, Memory representation of graphs, Warshalls’
6 08
algorithm, operations on Graphs, Breadth First Search, Depth First Search.
Sorting: Insertion Sort, Radix sort, Merge Sort, Introduction to Hashing.
Text Book/s
Reference Book/s
Semester-III
Course Business Mathematics and Statistics
Course Type OPEN ELECTIVE-I Course Code CS304
Credits 03 L-2, T-1, P - 0
Course Objectives:
Course Outcomes: On successful completion of the course the learner will be able to:
Introduction to Statistics:
Meaning and Definition of Statistics, Scope and Limitations of Statistics,
4 08
Role of Statistics in Management Decisions, Measures of Central Tendency
and Dispersion. Correlation and Regression.
Probability Distributions:
5 Theoretical distributions - Binomial, Poisson and Normal Distributions. Their 08
characteristics and applications.
Time Series and Statistical Decision Theory:
Time Series and Its Components, Analysis, Models of Time Series,
6 Measurement of Trend, Seasonal Variations and Cyclic Variations. 08
Introduction to Statistical Decision Theory, Decision Making Process,
Decisions under Uncertainty and Risk, Decision tree.
Text Book/s
Semester-III
Course Quantitative Analysis and Logical Thinking
Course Type OPEN ELECTIVE-I Course Code CS304
Credits 03 L-2, T-1, P - 0
Course Objectives:
1. To enhance critical thinking skills through logical problem- solving.
2. To acquire techniques for modeling and interpreting quantitative data.
3. To cultivate decision-making abilities grounded in quantitative reasoning.
4. To foster a deep understanding of mathematical concepts applicable to real-world
scenarios.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Techniques of Multiplication:
Base multiplication, Two digit, Three digit, Repeated number, non-repeated,
Divisibility Test: Minimum 1 to 12 divisibility find out and divisibility for
some others specific number, Square and cube: Calculate Square and Cube
through different method, find out square and cube through different
1 08
Technique, Find out Unit digit : At the time of different number of power find
out unit digit through different method, Percentage calculation : four basic
percentage calculation method as like point base, multiplicative , fraction base
and 100 base, BODMAS Calculation : follow the proper sequence at the time
calculation simplification numerical.
Number System:
Fundamental of number, Different number of problems related to number
identification, Short approach at the time solving the Problem, Simplification:
2 08
Though various short cut method find out answer. Comparison of percentage:
comparison less, More, and what,, Ratio proportion: basic calculation ratio
technique, comparison between two or more entity, Average: Through proper
sum of observation and number of observation find out answer, Mixture &
Allegation: Use the concept Mean price, Cheaper Price dearer Price Solve the
different topics numerical, Ages: Applied the concept Present, past, Future and
ratio solve the Problem.
Time &Work:
On the basis of three major factors total work, Efficiency, and Time solve the
problem. Pipe and Cistern: Solve the problem regarding capacity of tank, In
3 this topic also concept apply as like time and work, Speed Time Distance: 08
Problem on Train, solve these concept, Late, Early, Meeting, Chasing,
Crossing, Direction, Conversion, Equating, Boat And Stream: Worked on
these concept Upstream, Downstream, Boat, Stream, and Equating distance.
Coding Decoding:
Use the proper concept of Alphabet and Number and solve the Problem
4 08
through logic, word Coding, Mix coding, Symbolic coding, Alphabet coding,
Straight line coding, word Formation,
Number Series:
Solve the Problem on this concept, Difference, Difference of Difference,
Ascending order and Descending order, Square, Cube, Addition, subtraction,
Multiplication, Division, Consecutive ,Decimal, Inequalities: Concept Solve ,
Condition Base , Simple, and Adjustment base , Blood relation: Solve the
5 08
concept Condition base, Simple And Complex, Puzzle base , Direct and
Indirect Speech base, Statement Base, Direction and Distance: Worked on
these Concept North , South, East, West, Clock : Solve the Concept , Angle
find out, Overlap, Opposite, Right Angle , Apart, Loss Gain, Calendar : Solve
problem Normal year and Leap Year ,
Counting of Figure, Decision Making, Input and Out Put, Data sufficiency,
6 Order and Ranking, Causes and Effect, Course of Action, Statement and 08
Argument, Statement and Argument, Statement and Assumption,
Text Book/s
Semester-III
Course Foundations to Psychology and Counseling
Course Type OPEN ELECTIVE-I Course Code CS304
Credits 03 L-2, T-1, P - 0
Course Objectives:
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Introduction and Methods:
What is Psychology? Definition – Goals – What is not psychology? Pseudo
psychology. The History of Psychology – Schools - Modern Perspectives –
1 Psychology in India – Psychology: The Science – Methods: Introspection – 08
Observation – Survey – Experiment – Case Study – Correlation Research –
Scope of Psychology: Branches of basic Psychology – Branches of applied
Psychology
Sensation, Perception and Attention:
Sensation: Meaning – Psychophysics -Thresholds – Weber’s Law –
Adaptation – Basic sensation: Vision – Hearing – Touch and other Skin
senses – Olfaction- Gustation - Proprioception: Kinesthetic sense –
2 Vestibular sense – Perception: Meaning– Organizing principles of 08
perception – Constancies-Pattern perception, Distance perception- Errors in
Perception - Illusion – Types; Hallucinations – Types; Extra Sensory
Perception. - Factors that influence perception – Depth perception Attention:
Meaning – Types – Determinants.
Text Book/s
Semester-III
Course Engineering Economics
Course Type EEM Course Code CS305
Credits 02 L-2, T-0, P - 0
Course Objective:
1. To make fundamentally strong base for decision making skills by applying the concepts
of economics.
2. Educate the students on how to systematically evaluate the various cost elements of
atypical manufactured product, an engineering project or service, with a view to
determining the price offer.
3. Prepare engineering students to analyze profit/revenue data and carry out make economic
analysis in the decision-making process to justify or reject alternatives/projects.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Definition and Scope of Engineering Economics, Subject Matter of
Economics, Principles of Engineering economics, Micro-economics Vs
1 10
Macro-economics, Utility Analysis, Laws of diminishing utility analysis,
derivation of demand curve and law of Demand, Elasticity: Methods, types
Theory of Production: Theory, Importance, Isoquants and its properties,
Marginal rate of Technical substitution, Law of variable proportions, Returns
to Scale, Cost of Production and Cost of Curves, The law of supply, Price
2 determination. 10
Depreciation, Causes of depreciation, Depreciable property, depreciation
methods.
Time value of Money, Techniques for adjusting time value of money, Types
and components of cash flow, cash flow diagrams, principles of equivalence,
Uses, significance and limitation of Cash flow statement.
3 10
Commercial Banking, Functions of Commercial Banks, Role of Commercial
banks in developing economy, sound baking system for under-developed
countries, types of banks, balance sheet of a bank.
Text Book/s
Reference Book/s
Semester-III
Course Ethics in IT
Course Type VEC Course Code CS306
Credits 02 L-2, T-0, P - 0
Course Objectives:
To maintain social respect of ethics in Information Technology and understand security &
privacy protection in IT.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Unit I: Introduction to Ethics:
Introduction of ethics, ethics in engineering, distinction between ethics,
moral, laws, type of ethics, Ethical theories: utilitarianism, duty, right, virtue,
1 Importance of Integrity, Ethical Considerations in Decision Making, 10
Develop a Problem Statement, ethical dilemmas, Concept and Evolution of
Sociology, definitions, Implement the Decision, Ethics in Information
Technology.
Unit II: Ethics in information Technology:
IT Security Incidents: Computer Incidents are so Prevalent, Types of
2 Exploits, Types of Perpetrators, Federal Laws for Prosecuting Computer 10
Attacks, Risk Assessment, Establishing a Security Policy, Information
Privacy, Privacy Protection and the Law, Applications, and Court Ruling.
Unit III: Intellectual Property Rights and Computer Technology
Intellectual Property, definition & Type, Copyright & related rights:
3 advances in technology and copyright, benefits, Patent, industrial design, 10
geographical indications, trademark, what can be registered under trademark,
categories of TM, World IP organization, TRIPS & WTO.
Text Book/s
Reference Book/s
Semester-III
Course Data Structures and Algorithms Lab
Course Type PCC Course Code CS307
Credits 01 L-0, T-0, P - 2
Course Objectives:
1. To perform different operations on data structures such as insertion, deletion, searching
and traversing.
2. To understand various data searching and sorting methods with its complexity.
3. To introduce various techniques for representation of the data in the real world.
Course Outcomes: On successful completion of the course the learner will be able to:
CO Course Outcomes BT Level PO
Implement linear data structures & apply different
1 3 1,2,3,4
operations on linear data structures.
Implement non-linear data structures & apply different
2 3 1,2,3,4
operations on non-linear data structures.
Practical
Name of Practical
No.
01 Implementation of array with applications of various operations on it in C/C++.
02 Apply search operation on array data structure using C/C++.
03 Develop C/C++ program to implement linked list and apply different operations on it.
Implementation of Stack data structure and application of various operations on in it
04
using C/C++.
05 Implementation of recursion in C/C++ programming.
06 Develop C/C++ program to implement queue and apply different operations on it.
07 Development of C/C++ program to implement tree data structure.
08 Perform C/C++ program to traverse tree data structures.
09 Perform C/C++ program to implement graph data structure.
10 Develop C/C++ program to traverse graph data structures.
11 Perform C/C++ program to apply sort operation on array data structure.
12 Develop C/C++ program to implement Huffman’s Algorithm.
13 Develop C/C++ program to implement Warshall’s Algorithm.
Semester-III
Course Programming Skills Lab I (JavaScript & React js)
Course Type PCC Course Code CS308
Credits 01 L-0, T-0, P - 2
Course Objectives:
Course Outcomes: On successful completion of the course the learner will be able to:
CO Course Outcomes BT Level PO
1 Develop web pages using JavaScript. 6 1,2,3,4
2 Apply React JS library in website development. 6 1,2,3,4
Practical
Name of Practical
No.
01 Implementation of JavaScript code with variables and operators .
02 Implementation of functions in JavaScript
03 Objects implementation in JavaScript.
04 Demonstration of arrow function implementation in JavaScript.
05 Development of JavaScript code to implement different array methods.
06 Callback functions implementation in JavaScript.
07 Development of promises in JavaScript.
08 Develop JavaScript code to implement async/await function.
09 Develop JavaScript code to implement DOM event listener.
10 Introduction to React js& Setup its environment for development.
11 Implementation of React renders HTML in the web page.
12 Implementation of React JSX in the web page.
13 Implementation of different React components.
14 Implementation of Hook in React js.
Semester-III
Course Hardware and Networking Lab
Course Type PCC Course Code CS309
Credits 01 L-0, T-0, P - 2
Course Objectives:
Train the students to acquire knowledge in PC Hardware, Software and the field of
Networking.
The Students will understood and gain knowledge in the basics of PC assembling and
networks.
Course Outcomes: On successful completion of the course the learner will be able to:
Practical
Name of Practical
No.
01 Assemble and Disassemble different components of Computer System.
02 Demonstrate partition and formatting of Hard Disk
03 Installation of Operating system (Linux/Window).
04 Study of Hardware/Software troubleshooting tools.
05 Understand network and networking devices.
06 Prepare LAN cable
07 Understand Network Topology.
08 Demonstrate LAN set up
09 Perform Ping, Ipconfig, netstat, lookup commands
10 Study Wireshark
Semester-III
Course Community Engagement Project
Course Type ELC Course Code CS310
Credits 01 L-0, T-0, P - 2
Course Objective:
1. To expose students to socio-economic issues in society.
2. To apply theoretical engineering knowledge to real-world problems.
3. To develop practical skills in project management, teamwork, and communication.
4. To foster a sense of social responsibility and ethical leadership among engineering students.
Course Outcomes: On successful completion of the course the learner will be able to:
Assessment:
B. Tech. in
Computer Science and Engineering
IV Semester
Semester-IV
Course Operating System
Course Type PCC Course Code CS401
Credits 03 L-3, T-0, P - 0
Course Objectives:
1. To understand how computers manage tasks like handling processes and memory.
2. Illustrate the concept of controlling concurrency and detecting deadlocks in OS.
3. Study of file and i/o management in operating system.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Introduction to OS
Concept of Operating Systems, Types of Operating System, Components of
1 08
Operating System, Services of Operating System, structure of Operating
System
Process & Scheduling
Processes: Definition, Different states & Process transitions, Process Control
Block (PCB), Context switching
Process Scheduling: Foundation and Scheduling objectives, Types of
2 08
Schedulers. Scheduling criteria: CPU utilization, Throughput, Turnaround
Time, Waiting Time, Response Time.
Scheduling algorithms: Pre-emptive and Non-pre-emptive, FCFS, SJF, RR,
Priority
Process Synchronization:
Process Synchronization: Inter-process Communication, Critical Section, Race
3 08
Conditions, Mutual Exclusion, Peterson’s Solution, The Producer\Consumer
Problem, Semaphores
Deadlock:
Definition & characterization, Necessary and sufficient conditions for
4 08
Deadlock, Deadlock Prevention, and Deadlock Avoidance: Banker’s
algorithm, Deadlock detection and Recovery
Memory Management:
Basic concept, Logical and Physical address map, Memory allocation:
Contiguous Memory allocation – Fixed and variable partition– Internal and
External fragmentation and Compaction
Paging: Principle of operation – Page allocation – Hardware support for
5 08
paging, Protection and sharing, Segmentation.
Virtual Memory: Basics of Virtual Memory – Page fault, Working Set,
Dirty page/Dirty bit – Demand paging,
Page Replacement algorithms: Optimal, First in First Out (FIFO), and
Least Recently used (LRU).
File & I/O Management:
File Management: Concept of File, Access methods, Allocation methods
(contiguous, linked, indexed), Free-space management (bit vector, linked
list, grouping)
6 I/O Management: 08
I/O Hardware: I/O devices, Device controllers, Software: Goals of Interrupt
handlers, Device drivers
Disk Management: Disk structure, Disk scheduling algorithms (FCFS,
SSTF, SCAN, C-SCAN)
Text Book/s
Semester-IV
Course Programming Methodology
Course Type PCC Course Code CS402
Credits 03 L-3, T-0, P - 0
Course Objectives:
1. To explore & implement the principles of Object-Oriented Programming (OOP) in Java
2. To design and develop GUI applications in Java.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Introduction to Java Programming
Features of Java, Java Programming Environment, Data Types, Type
1 08
Conversion & Casting, Operators, Precedence Rules & Associativity, Flow
of Control: Conditional, Loops & Branching Statements.
Encapsulation
2 Classes, Object, Methods, Constructors, this keyword, Garbage Collection, 08
Arrays, Command line arguments, Scanner Class, enumerated type.
Inheritance & Polymorphism
Inheritance: Types of Inheritance, Method Overloading, Method
3 Overriding, Interfaces, Abstract Class, super keyword, final keyword, 08
Packages.
Text Book/s
Reference Book/s
Semester-IV
Course Computer Networks
Course Type PCC Course Code CS403
Credits 03 L-3, T-0, P - 0
Course Objectives:
1. To understand the fundamentals of Computer Networking, Topologies & various kinds of
networks available.
2. To analyze Data-Link Control (DLC) services for flow control & error control.
3. To synthesize the significance of network layer in data transmission.
4. To analyze and compare key routing algorithms, including Distance Vector Routing and
Link State Routing.
5. To understand transport-layer protocols services using TCP & UDP.
6. To explore application layer protocols, including FTP, email architecture, DNS, and their
respective security aspects.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Introduction to Computer Networks:
Introduction: Brief history of computer networks & Internet, Components of
Computer Network, Network types: LAN, MAN and WAN, Switching,
1 Network Models: The OSI Model, TCP/IP Protocol Suite, 08
Physical Layer: Transmission Modes: Simplex, Half Duplex and Full
Duplex, Transmission media: Guided media & unguided media. Switching:
Introduction, Circuit Switching, Packet Switching.
Network Layer
Introduction to Network layer, Services: Packetizing, Routing and
Forwarding, Other Services Packet Switching: Datagram Approach, Virtual-
3 Circuit Approach, Network Layer performance: Delay, Throughput, Packet 08
Loss, Congestion Control, IPV4 Address: Address Space, Classful
Addressing, Classless Addressing, Dynamic Host Configuration Protocol
(DHCP), Network Address Resolution (NAT)
Transport Layer
Introduction to Transport layer: Transport-Layer Services, Connectionless
and Connection Oriented Protocols, Transport-Layer Protocols: Stop-and-
Wait Protocol, Go-Back-N Protocol (GBN), Selective-Repeat Protocol,
5 08
Bidirectional Protocols: Piggy backing, User Datagram Protocols: User
Datagram, UDP Services, UDP Applications, Transmission Control
Protocol: TCP Services, TCP Features , Segment, A TCP Connection, Flow
Control, Error Control, TCP Congestion Control.
Application layer
Introduction to Application layer: Services, Application-Layer Paradigms:
Client-Server, World Wide Web, Hyper-Text Transfer Protocol (HTTP),
FTP: Two Connections, Control Connection, Data Connection, Security for
6 08
FTP, Electronic Mail: Architecture, Web-Based Mail, E-Mail Security,
Domain Name System (DNS):Name Space, DNS in the Internet. Network
Management: Introduction, Configuration Management, Fault Management,
Performance Management, Security Management.
Text Book/s
Reference Book/s
Semester-IV
Course Principles & Practice of Management
Course Type OPEN ELECTIVE-II Course Code CS405
Credits 02 L-2, T-0, P – 0
Course Objectives:
Course Outcomes: On successful completion of the course the learner will be able to:
Organizing:
Organizing - Nature and purpose - Principles of Organization - Types of
Organization - Organizational Structure and Design – Line, Staff and
functional authority – Conflict between Line and Staff – Overcoming the
3 10
Line-Staff Conflict. Departmentation - Span of control – Authority,
Responsibility and Accountability - Principles of Delegation - Steps -
Centralization Vs Decentralization – Factors determining the degree of
Decentralization of authority
Text Book/s
Semester-IV
Course Quantitative and Logical Proficiency
Course Type OPEN ELECTIVE-II Course Code CS405
Credits 02 L-2, T-0, P - 0
Course Objectives:
1. To make students able to critically evaluate various real-life situations by resorting to an
analysis of key issues and factors.
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Percentage:
Problem on Concept Population, Election, vain diagram Salary, Examination,
Successive, and miscellaneous, Profit and loss: Concept on Mean Price, Cost
1 10
Price, Profit and loss, Discount, Partnership: On the basis of Capital, Time,
and Profit. Simple Interest and Compound Interest: on the basis of Principle,
Interest, Rate, Number of Year.
Permutation:
Concept on different number of Arrangement Alphabet
Number, Combination: Different number of Selection Process, Probability:
2 10
Concept on Coin, Dice, Cards, and Miscellaneous, Data Sufficiency: On the
basis of Different Number Of topics, Inequalities, Data Interpretation (Table,
Bar, Line, pie, Radar, Case let form) Geometry & Mensuration.
Puzzle Test:
Circular base, Tabulation, Floor base, Rectangular Base, Square base, straight
line base, direction base North, South
3 10
Blood relation With Puzzle, vain diagram base puzzle Non-Verbal:
Classification, Odd man Out, Classification, Data Sufficiency,
Text Book/s
Reference Book/s
Semester-IV
Course Emotional Intelligence
Course Type OPEN ELECTIVE-II Course Code CS405
Credits 02 L-2, T-0, P - 0
Course Objectives:
Course Outcomes: On successful completion of the course the learner will be able to:
Unit Contact
Content
No. Hr.
Fundamentals of Emotional Intelligence:
Nature and Significance - Models of emotional intelligence: Ability, Trait and
1 10
Mixed - Building blocks of emotional intelligence: self-awareness, self-
management, social awareness, and relationship management
Personal Competence:
Self-Awareness: Observing and recognizing one's own feelings, Knowing
2 10
one's strengths and areas of development.
Self-Management: Managing emotions, anxiety, fear, and anger.
Social Competence:
Social Awareness: Others' Perspectives, Empathy and Compassion
3 10
Relationship Management: Effective communication, Collaboration,
Teamwork and Conflict management
Text Book/s
Reference Book/s
Semester-IV
Course Universal Human Values
Course Type VEC Course Code CS406
Credits 02 L-2, T-0, P - 0
Course Objective:
1. To help the students appreciate the essential complementarity between ‘values’ and
‘skills’ to ensure sustained happiness and prosperity which are the core aspirations of all
human beings.
2. To facilitate the development of a holistic perspective among students towards life and
profession as well as towards happiness and prosperity based on a correct understanding
of the human reality and the rest of existence. Such a holistic perspective forms the basis
of Universal Human Values and progress towards value-based living in a natural way.
3. To highlight plausible implications of such a holistic understanding in terms of ethical
human conduct, trustful and mutually fulfilling human behavior and mutually enriching
interaction in nature.
Course Outcomes: On successful completion of the course the learner will be able to:
BT
CO Course Outcomes PO
Level
Explain the essentials of human values and skills, self-exploration, 2
1 8,12
happiness and prosperity
Identify and evaluate the role of harmony in family, society and 3
2 6,7,12
universal order.
Develop appropriate technologies and management patterns to 3
3 6,7,8,12
create harmony in professional and personal lives.
Unit Contact
Content
No. Hr.
Unit I: Introduction to Value Education:
Understanding Value Education, Self-exploration as the Process for Value
1 Education, Basic Human Aspirations and their Fulfillment, Right 10
Understanding, Relationship and Physical Facility, Happiness and Prosperity
– Current Scenario, Method to Fulfil the Basic Human Aspirations
Text Book/s
Semester-IV
Course Operating System- Lab
Course Type PCC Course Code CS407
Credits 01 L-0, T-0, P - 2
Course Objectives:
To understand how the operating system manages processes and to implement different
algorithms for resource allocation.
Course Outcomes: On successful completion of the course the learner will be able to:
BT
CO Course Outcomes PO
Level
1 Interpret various commands used in operating system 3 1,3,5,12
Expt.
Name of Experiment
No.
1 To Execute Unix/ Linux operating system commands
Semester-IV
Course Programming Methodology Lab
Course Type PCC Course Code CS408
Credits 01 L-0, T-0, P - 2
Course Objectives:
Course Outcomes: On successful completion of the course the learner will be able to:
BT
CO Course Outcomes PO
Level
1 Apply the principles of object-oriented programming in Java 3 1,12
Implement exception handling, file handling and event handling in
2 3 1,2,3
Java
3 Create GUI applications in Java 6 1,2,3
At least Ten Practical to be performed from the list covering the entire syllabus
Practical
Name of Practical
No.
01 Develop Java program using keywords, identifiers, operators & expressions.
Implementation of conditional, looping, and branching statements using Java
02
Programming.
03 Implementation of encapsulation in Java Programming.
04 Perform Java program to demonstrate uses of constructors.
05 Demonstrate various types of inheritance using java programs.
06 Develop Java program to demonstrate polymorphism.
07 Demonstrate utilization of Packages in Java programs.
08 Develop Java program to demonstrate Exception Handling mechanism.
09 Demonstrate File handling mechanism in Java.
10 Develop Java program to implement data structures using Collection Framework.
11 Design GUI based Java Application using swing.
12 Implement Event handling in Java Application.
Semester-IV
Course Programming Skills Lab II (Node-js & Mongo DB)
Course Type VSEC Course Code CS409
Credits 01 L-0, T-0, P - 2
Course Objectives:
1. To execute Node JavaScript at server side.
2. To implement database in website development.
Course Outcomes: On successful completion of the course the learner will be able to:
BT
CO Course Outcomes PO
Level
1 Develop Server-Side code using Node js. 6 1,2,3,4
2 Create databases using MongoDB and apply different operations on it. 6 1,2,3,4
At least Ten Practical (5 from Node & 5 from MongoDB) to be performed from the list
as below,
Practical
Name of Practical
No.
01 Introduction to Node js & Setup its environment for development.
02 Demonstrate Node js HTTP Module.
03 Demonstrate Node js File System Module.
04 Demonstrate Node js URL Module.
05 Implement Node js NPM.
06 Implement Node js Events.
07 Construct Node js Formidable Module.
08 Construct Node js Nodemailer Module.
09 Introduction to MongoDB & Setup its environment for development.
10 Creating Database & Collection using Node js & MongoDB.
11 Apply Insert operation on MongoDB.
12 Perform Query(Filter) operation in collection of MongoDB.
13 Apply sort operation in collection of MongoDB.
14 Perform Delete & Drop Operation on MongoDB
15 Perform Update Operation on MongoDB
16 Perform Limit Operation on MongoDB
17 Perform Join Operation on MongoDB
Semester-IV
Course Computer Networks
Course Type VSEC Course Code CS410
Credits 01 L-0, T-0, P - 2
Course Outcomes: On successful completion of the course the learner will be able to:
Practical
Name of Practical
No.
Identify & analyze the network topology implemented in the computer network
01
laboratory (consisting of Nodes, Cables, Peripherals & Host Computers).
Perform network ip address configuration (classification of address, static
02
And dynamic address)
03 Execute basic networking commands like ping, traceroute, netstat, ipconfig, nslookup