ACADEMIC YEAR: 2025-2026(EVEN)
Cloud Computing: BCS601 Scheme : 22 Sem: 6th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Describe various cloud computing platforms and service providers. | L2 |
CO2 | Illustrate the significance of various types of virtualization. | L2 |
CO3 | Identify the architecture, delivery models and industrial platforms for cloud computing based applications. | L3 |
CO4 | Analyze the role of security aspects in cloud computing. | L4 |
CO5 | Demonstrate cloud applications in various fields using suitable cloud platforms. | L3 |
Machine Learning : BCS602 Scheme : 22 Sem: 6th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Describe the machine learning techniques, their types and data analysis framework. | L2 |
CO2 | Apply mathematical concepts for feature engineering and perform dimensionality reduction to enhance model performance. | L3 |
CO3 | Develop similarity-based learning models and regression models for solving classification and prediction tasks. | L3 |
CO4 | Build probabilistic learning models and design neural network models using perceptrons and multilayer architectures | L3 |
CO5 | Utilize clustering algorithms to identify patterns in data and implement reinforcement learning techniques | L2 |
Advanced Java: BCS613D Scheme : 22 Sem: 6th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply appropriate collection class/interface to solve the given problem | L3 |
CO2 | Demonstrate the concepts of String operations in Java | L3 |
CO3 | Apply the concepts of Swings to build Java applications | L3 |
CO4 | Develop web based applications using Java servlets and JSP | L3 |
CO5 | Use JDBC to build database applications | L3 |
Machine Learning Lab: BCSL606 Scheme : 22 Sem: 6th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Illustrate the principles of multivariate data and apply dimensionality reduction techniques. | L2 |
CO2 | Demonstrate similarity-based learning methods and perform regression analysis. | L3 |
CO3 | Develop decision trees for classification and regression problems, and Bayesian models for probabilistic learning. | L3 |
CO4 | Implement the clustering algorithms to share computing resources. | L3 |
DevOps: BCSL657D Scheme : 22 Sem: 6th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Demonstrate different actions performed through Version control tools like Git | L3 |
CO2 | Perform Continuous Integration and Continuous Testing and Continuous Deployment using Jenkins by building and automating test cases using Maven & Gradle. | L3 |
CO3 | Experiment with configuration management using Ansible. | L3 |
CO4 | Demonstrate Cloud-based DevOps tools using Azure DevOps. | L3 |
ACADEMIC YEAR: 2025-2026(EVEN)
Analysis & Design of Algorithms: BCS401 Scheme : 22 Sem: 4th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply asymptotic notational method to analyze the performance of the algorithms in terms of time complexity. | L3 |
CO2 | Demonstrate divide & conquer approaches and decrease & conquer approaches to solve computational problems. | L2 |
CO3 | Make use of transform & conquer and dynamic programming design approaches to solve the given real world or complex computational problems. | L3 |
CO4 | Apply greedy and input enhancement methods to solve graph & string based computational problems. | L3 |
CO5 | Analyse various classes (P,NP and NP Complete) of problems | L4 |
CO6 | Illustrate backtracking, branch & bound and approximation methods. | L3 |
Microcontrollers: BCS402 Scheme : 22 Sem: 4th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Explain the ARM Architectural features and Instructions. | L2 |
CO2 | Develop programs using ARM instruction set for an ARM Microcontroller | L3 |
CO3 | Explain C-Compiler Optimizations and portability issues in ARM Microcontroller. | L2 |
CO4 | Apply the concepts of Exceptions and Interrupt handling mechanisms in developing applications. | L3 |
CO5 | Demonstrate the role of Cache management and Firmware in Microcontrollers | L2 |
Database Management System: BCS403 Scheme : 22 Sem: 4th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Describe the basic elements of a relational database management system | L2 |
CO2 | Design entity relationship for the given scenario | L3 |
CO3 | Apply various Structured Query Language (SQL) statements for database manipulation | L3 |
CO4 | Analyse various normalization forms for the given application. | L4 |
CO5 | Develop database applications for the given realworld problem. | L3 |
CO6 | Understand the concepts related to NoSQL databases. | L2 |
Analysis & Design of Algorithms Lab: BCSL404 Scheme : 22 Sem: 4th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Develop programs to solve computational problems using suitable algorithm design strategy. | L3 |
CO2 | Compare algorithm design strategies by developing equivalent programs and observing running times for analysis (Empirical). | L3 |
CO3 | Make use of suitable integrated development tools to develop programs | L3 |
CO4 | Choose appropriate algorithm design techniques to develop solution to the computational and complex problems. | L3 |
CO5 | Demonstrate and present the development of program, its execution and running time(s) and record the results/inferences. | L3 |
Discrete Mathematical Structures: BCSL405A Scheme : 22 Sem: 4th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply concepts of logical reasoning and mathematical proof techniques in proving theorems and statements. | L3 |
CO2 | Demonstrate the application of discrete structures in different fields of computer science | L3 |
CO3 | Apply the basic concepts of relations, functions and partially ordered sets for computer representations. | L3 |
CO4 | Solve problems involving recurrence relations and generating functions. | L3 |
CO5 | Illustrate the fundamental principles of Algebraic structures with the problems related to computer science & engineering. | L3 |
Technical Writing using LaTeX: BCSL456D Scheme : 22 Sem: 4th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply basic LaTeX command to develop simple document | L3 |
CO2 | Develop LaTeX script to present the tables and figures in the document | L3 |
CO3 | Illustrate LaTeX script to present theorems and mathematical equations in the document | L3 |
CO4 | Develop programs to generate the complete report with citations and a bibliography | L3 |
CO5 | llustrate the use of Tikz and algorithm libraries to design graphics and algorithms in the document | L3 |
ACADEMIC YEAR: 2025-2026(ODD)
Internet of Things : BCS701 Scheme : 22 Sem: 7th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Explain the evolution of IoT, IoT networking components, and addressing strategies in IoT | L2 |
CO2 | Analyze various sensing devices and actuator types | L2 |
CO3 | Demonstrate the processing in IoT | L3 |
CO4 | Apply different connectivity technologies | L3 |
CO5 | Elaborate the need for Data Analytics and Security in IoT | L3 |
Parallel Computing : BCS702 Scheme : 22 Sem: 7th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Understand the need for parallel programming | L2 |
CO2 | Demonstrate parallelism in MIMD system | L3 |
CO3 | Apply MPI library to parallelize the code to solve the given problem | L3 |
CO4 | Apply OpenMP pragma and directives to parallelize the code to solve the given problem | L3 |
CO5 | Design a CUDA program for the given problem | L3 |
Cryptography and Networks Security : BCS703 Scheme : 22 Sem: 7th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Understand the basic concepts of security and cryptography | L2 |
CO2 | Describe the random number generation and cryptographic protocols | L2 |
CO3 | Explain the key management scenario | L2 |
CO4 | Apply different hash functions and concept of cryptography for more security in different scenario | L3 |
Big Data Analytics : BCS714D Scheme : 22 Sem: 7th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Identify and list various Big Data concepts, tools and applications | L2 |
CO2 | Use Hadoop Cluster to deploy Map Reduce jobs | L3 |
CO3 | Understand the given data set and identify deep insights for data- driven systems | L2 |
CO4 | Illustrate PIG, HIVE and Spark programs | L3 |
ACADEMIC YEAR: 2025-2026(ODD)
Software Engineering : BCS501 Scheme : 22 Sem: 5th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Differentiate process models to judge which process model has to be adopted for the given scenarios | L2 |
CO2 | Derive both functional and non-functional requirements from the case study | L2 |
CO3 | Analyze the importance of various software testing methods and agile methodology | L3 |
CO4 | Illustrate the role of project planning and quality management in software development | L3 |
CO5 | Identify appropriate techniques to enhance software quality | L3 |
Computer Networks : BCS502 Scheme : 22 Sem: 5th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Explain the fundamentals of computer networks | L2 |
CO2 | Applying the concepts of computer networks to demonstrate the working of various layers and protocols in communication network | L3 |
CO3 | Implement the principles of protocol layering and routing protocols in modern communication systems | L3 |
Theory of Computation : BCS503 Scheme : 22 Sem: 5th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply the fundamentals of automata theory to write DFA, NFA, Epsilon-NFA and conversion between them | L2 |
CO2 | Prove the properties of regular languages using regular expressions | L2 |
CO3 | Design context-free grammars (CFGs) and pushdown automata (PDAs) for formal languages | L3 |
CO4 | Design Turing machines to solve the computational problems | L3 |
CO5 | Explain the concepts of decidability and undecidability | L3 |
Artificial Intelligence : BCS515B Scheme : 22 Sem: 5th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Understand the architecture and components of intelligent agents, including their interaction with the AI environment | L2 |
CO2 | Apply problem-solving agents and various search strategies to solve a given problem | L3 |
CO3 | Illustrate logical reasoning and knowledge representation using propositional and first-order logic | L3 |
CO4 | Demonstrate proficiency in representing knowledge and solving problems using first-order logic | L3 |
CO5 | Describe classical planning in the context of artificial intelligence, including its goals, constraints, and applications in problem-solving | L3 |
Research Methodology and IPR : BRMK557 Scheme : 22 Sem: 5th | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply the Objectives of engineering research in solution development | L3 |
CO2 | Identify the procedure of Literature Review and Technical Reading | L3 |
CO3 | Outline the fundamentals of patent drafting procedure and laws | L2 |
CO4 | Illustrate the copyright procedure leading to an IPR | L3 |
CO5 | Relate the basic principles of design rights with problem solution | L2 |
ACADEMIC YEAR: 2025-2026(ODD)
Mathematics for computer Stream: BCS301 Scheme : 22 Sem: 3rd | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply suitable probability distribution models for the given scenario | L3 |
CO2 | Apply the notion of a discrete-time Markov chain and n-step transition probabilities to solve the given problem | L3 |
CO3 | Use statistical methodology and tools in the engineering problem solving process | L2 |
CO4 | Compute the confidence intervals for the mean of the population. | L2 |
CO5 | Apply the ANOVA test related to engineering problems | L3 |
Digital Design and Computer Organization: BCS302 Scheme : 22 Sem: 3rd | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Apply the K–Map techniques to simplify various Boolean expressions | L3 |
CO2 | Design different types of combinational and sequential circuits along with Verilog programs | L3 |
CO3 | Describe the fundamentals of machine instructions, addressing modes and Processor performance | L2 |
CO4 | Explain the approaches involved in achieving communication between processor and I/O devices | L2 |
CO5 | Analyze internal Organization of Memory and Impact of cache/Pipelining on Processor Performance | L4 |
Operating Systems : BCS303 Scheme : 22 Sem: 3rd | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Explain the structure and functionality of the operating system | L1 |
CO2 | Apply appropriate CPU scheduling algorithms for the given problem | L3 |
CO3 | Analyze the various techniques for process synchronization and deadlock handling | L3 |
CO4 | Apply the various techniques for memory management | L3 |
CO5 | Explain file and secondary storage management strategies | L2 |
CO6 | Describe the need for information protection mechanisms | L2 |
Data Structures and Applications : BCS304 Scheme : 22 Sem: 3rd | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Explain different data structures and their applications | L2 |
CO2 | Apply Arrays, Stacks and Queue data structures to solve the given problems | L3 |
CO3 | Use the concept of linked list in problem solving | L3 |
CO4 | Develop solutions using trees and graphs to model the real-world problem | L4 |
CO5 | Explain the advanced Data Structures concepts such as Hashing Techniques and Optimal Binary Search Trees | L2 |
OOPS with JAVA : BCS306A Scheme : 22 Sem: 3rd | ||
|---|---|---|
CO Number | At the end of the course, student should be able to . . . | Blooms’ Level |
CO1 | Demonstrate proficiency in writing simple programs involving branching and looping structures | L2 |
CO2 | Design a class involving data members and methods for the given scenario | L2 |
CO3 | Apply the concepts of inheritance and interfaces in solving complex problem | L3 |
CO4 | Use the concept of packages and exception handling in solving complex problem | L3 |
CO5 | Apply concepts of multithreading, autoboxing and enumerations in program development | L3 |



