Course code Course Name Course Outcomes Program Outcomes Program Specific Outcomes

II/IV B.TECH I SEM (R-15)

CS211 MATHEMATICS – III At the end of this course the student can able to
C211.1: Solve the partial differential equations.
C211.2: Find the Fourier Transform, Sine Transform and Cosine Transform.
C211.3: Solve the system of equations using Bisection method, Newton Rap son method-U decomposition method.
C211.4: Apply the Concepts of Operators& finite differences.
C211.5: Find the numerical solutions of ordinary and partial differential equations
PO1, PO2 PSO2
CS212 DIGITAL LOGIC DESIGN On successful completion of this course, the students will be able to:
C212.1: Define the basic digital logic fundamentals such as numbering system, binary codes and Boolean algebra.( Knowledge)
C212.2: Solve Boolean functions using Karnaugh maps and tabulation method. (Analysis)
C212.3: Design combinational logic circuits like adders,substactors,multiplexer and demultiplexer. (Synthesis)
C212.4: Design sequential logic circuits like shift registers and counters(synthesis)
C212.5: Describe different types of memory elements like RAM,ROM and PLDs.(knowledge)
PO1, PO2, PO3, PO4 PSO1, PSO2
CS213 OPERATING SYSTEMS On successful completion of this course, the students will be able to:
C213.1: Ability to define, understand and explain concepts of Operating system
C213.2: Ability to apply scheduling algorithm
C213.3: Ability to analyze various devices and resource management techniques for timesharing
C213.4: Ability to analyze Deadlock problems
C213.5: Ability to Validate various Memory Allocation technologies.
PO1, PO2, PO4 PSO1, PSO2
CS214 DISCRETE MATHEMATICAL STRUCTURES On successful completion of this course, the students will be able to:
C214.1: Solve mathematical problems with discrete structures (Evolution level)
C214.2: Explain basics of logic, set theory and functions (Knowledge level)
C214.3: Solve Elementary combinatory (Evolution level)
C214.4: Apply the recurrence relations in programming.(Application level)
C214.5: Apply graph theory concepts in various fields of computer science and engineering. (Application level)
PO1, PO2, PO3, PO4 PSO1
CS215 DATA STRUCTURE USING C On successful completion of this course, the students will be able to:
C215.1: Ability to define, understand and explain the storage structures for arrays
C215.2: Ability to Analyze the various trees and searching techniques
C215.3: Ability to apply various applications in linear Data structures
C215.4: Ability to Analyze various techniques in linear Data structures
C215.5:Ability to Validate searching and sorting algorithms.
PO1, PO2, PO4 PSO1, PSO2
CS216 PROFESSIONAL ETHICS AND HUMAN VALUES On successful completion of this course, the students will be able to:
C216.1: Ability to explain engineering ethics
C216.2: Ability to apply various types of negative and positive phases of engineering ethics
C216.3: Ability to analyze ideas on engineering ethics
C216.4: Ability to Develop environmental ethics and moral leaderships
C216.5: Ability to Validate ethical theories of engineering ethics
PO1, PO2, PO3, PO4 PSO1, PSO2

II/IV B.TECH II SEM (R-15)

CS221 PROBABILITY & STATISTICS On successful completion of this course, the students will be able to:
C221.1: Explain sampling distribution of mean and variance.( Knowledge)
C221.2: Calculate Inferences concerning mean and variance.(Evolution)
C221.3: Apply variances on randomized designs.(Application)
C221.4: Explain quality improvement programs on Experimental designs. Knowledge
C221.5: Explain various applications of Exponential models. Knowledge
PO1, PO2, PO3, PO4 PSO2
CS222 COMPUTER ORGANIZATION & Architecture After completion of this course student will able to:
C222.1:Ability to Explain the concepts of Computer architecture
C222.2: Ability to apply various algorithm in Computer arithmetic
C222.3: Ability to analyze different memory in Memory Organization.
C222.4: Ability to Differentiate various addressing modes of CPU
C222.5 Ability to Differentiate various pipeline concepts
PO1, PO2 PSO1, PSO2
CS223 UNIX PROGRAMMING After completion of this course student will able to:
C223.1 Ability to define, understanding and explain concepts of regular file manage
C223.2 Ability to apply extended regular expressions
C223.3 Ability to analyze passing command line arguments
C223.4 Ability to Design the unix architecture and explain the features of unix
C223.5 Ability to validating the predefined local variables and predefined environmental variables
PO1, PO2, PO3, PO4 PSO1, PSO2
CS224 Logical Foundations of Computer Science On successful completion of this course, the students will be able to:
C224.1 Ability to define and explain concepts of the Normal forms
C224.2 Ability to apply proof rules for structured statements
C224.3 Ability to analyze the general form of commands
C224.4 : Ability to Differentiate various conditions
C224.5 Ability to validate the Resolution principle
PO1, PO2, PO4 PSO1, PSO2
CS225 INTRODUCTION TO ALGORITHMS On successful completion of this course, the students will be able to:
C225.1 Ability to define, understand and explain concepts of algorithms
C225.2 Ability to apply and implement learned algorithm to solve problems
C225.3 Ability to analyze variety of advanced Data structures & their implementations
C225.4 : Ability to Differentiate various techniques like divide and conquer, greedy, dynamic
C225.5 Ability of validating of searching algorithms
PO1, PO2, PO4 PSO1, PSO2
CS226 Object oriented programming using Java On successful completion of this course, the students will be able to:
C226.1 Ability to define & explain the object oriented concepts
C226.2 Ability to Differentiate the various interfaces
C226.3 Ability to analyze the various input output applets
C226.4 Ability to apply string handling in window toolkit
C226.5 Ability to validate the exception handling in overview of Java
PO1, PO2, PO4 PSO1, PSO2

III/IV B.TECH I SEM (R-15)

CS311 Data Base Management System On successful completion of this course, the students will be able to:
C311.1:Ability to define,understand and explain concepts of data base management system.
C311.2:Ability to apply SQL as well as relational algebra to find solutions to a broad range of queries.
C311.3:Ability to analyse various data base design tachniques for a given scenario.
C311.4: Ability to design E-R diagram or data base for given scenario.
C311.5:Ability to validating data and identifying anomalies.
PO1, PO2, PO3, PO4 PSO1, PSO2
CS312 Software Engineering On successful completion of this course, the students will be able to:
C312.1 Ability to define,understand and explain concepts of software engineering.
C312.2 Ability to apply process models to develop a software.
C312.3 Ability to analyse various software engineering practices.
C312.4 Ability to analyse different levels of software design.
C312.5 Ability to validate data in different test cases.
PO1, PO2, PO4 PSO1, PSO2
CS313 Advanced microprocessors On successful completion of this course, the students will be able to:
C313.1: Explain generalized architecture of Advanced Microprocessors and explain the need for advance microprocessors. (Knowledge level)
C313.2: Analyze and Compare the characteristics of various microprocessors. (Analysis level)
C313.3: Explain the PC system layout, components and it design. (Knowledge level)
C313. 4: Analyze the hardware installation and configuration of PC system. (Analysis level)
C313.5: Explain operation of input devices and power supply chassis. (Knowledge level)
PO1, PO2, PO4,PO12 PSO2
CS314 Advanced Data Structures and Algorithms On successful completion of this course, the students will be able to:
C314.1: Ability to define,explain the basic concepts of time complexity for different algorithms.
C314.2: Ability to Analyse the techniques used in data structure.
C314.3 : Ability to Analyse different algorithms using dynamic programming.
C314.4: Ability to understand different algorithms and their perfomance.
C314.5: Ability to Validate on the partition ADT to solve complex problems.
PO1, PO2, PO4 PSO1, PSO2
CS315 Computer networks On successful completion of this course, the students will be able to:
C315.1: Ability to define, explain the basic concepts related to computer network. C315.2: Ability to Apply routing algorithms/techniques to solve the problems. C315.3: Ability to Analyse the network performance of various algorithms or algorithm for a given problem. C315.4: Ability to Analyse various types of transport protocols. C315.5: Ability to Validate error correction and detection technique.
PO1, PO2,PO4 PSO1, PSO2
CS316 Languages, machines and Computation Students who complete the course will have demonstrated the ability to do the following:
C316.1 Ability to define, explain the basic concepts of finite automata and regular languages.
C316.2 Ability to apply non- deterministic and regular expressions on languages.
C316.3 Ability to analyse different types of context free grammar.
C316.4 Ability to solve or compute turing machine problems.
C316.5 Ability to Validate the pumming ,cnf,gnf.
PO1, PO2, PO3, PO4 PSO1, PSO2

III/IV B.TECH II SEM (R-15)

CS321 Artificial Intelligence On successful completion of this course, the students will be able to:
C321.1: Ability to define and understand AI concepts and neural networks.
C321.2 : Ability to apply learning evaluation function for game playing.
C321.3 Ability to analyse different searching techniques.
C321.4 Ability to apply intelligent algorithm for game playing.
C321.5 Ability to Validate AI problems.
PO1, PO2, PO4 PSO1, PSO2
CS322 Network Programming C322.1 Ability to define, understand and explain concepts of network program.
C322.2 Ability to apply different functions in tcp socket programming.
C322.3 Ability to analyse various techniques in network programming.
C322.4 Ability to apply various names and address congestion function.
C322.5 Ability to Validate various techniques in ipc and remote login.
PO1, PO2, PO4 PSO1, PSO2
CS323 Compiler Design C323.1 Ability to understand and explain different phases of compiler.
C323.2 Ability to apply formal models of lexical analysis phases.
C3223.3 Ability to apply LEX compiler in compiler design.
C323.4 Ability to analyse pattern recognization technique.
C323.5 Ability to Validate various parsing techniques.
PO1, PO2, PO4 PSO1, PSO2
CS324 Internet Programming C324.1: Ability to understand and explain basic networks and web concepts.
C324.2: Ability to apply tags and styles in web applications.
C324.3:Ability to apply various server side program techniques in web applications.
C324.4: Ability to apply various DHTML techniques in web applications.
C324.5: Ability to validate various applications and data base servers.
PO1, PO4 PSO1, PSO2
CS325 Foundations of cryptography On successful completion of this course, the students will be able to:
C325.1 : Ability to explain basic functions of cryptography and computational number theory. C325. 2: Ability to apply different algorithms on security. C325. 3: Ability to analyse various security models. C325. 4: Ability to apply various security schemes of digital signatures. C325. 5: Ability to Validate rsa algorithm,diffie-hellman key exchange algorithm.
PO1, PO2, PO4 PSO1, PSO2

IV/IV B.TECH I SEM

CS411 Data Engineering On successful completion of this course, the students will be able to:
C411.1 Ability to define, understand and explain concepts of Data engineering.
C411.2 Ability to apply various techniques for data analysis.
C411.3 Ability to analyse large sets of data to gain useful business understanding.
C411.4 Ability to Differentiate various classifications and prediction techniques in data mining
C411.5 Ability to validate given frequent item sets
PO1, PO2, PO3, PO4 PSO1, PSO2
CS412 Cloud Computing On successful completion of this course, the students will be able to:
C412.1 Ability to define,understand and explain concepts of cloud computing.
C412.2 Ability to apply different cloud programming model as per need.
C412.3 Ability to analyse various techniques in cloud computing.
C412.4 Ability to develop designs based on technical and non-technical computing.
C412.5 Ability to validate the test practices and the future of the cloud computing.
PO1, PO2, PO3,PO4 PSO1, PSO2
CS413 Cyber Security On successful completion of this course, the students will be able to:
C413.1 Ability to define,understand and explain concepts of cyber security.
C413.2 Ability to apply common cryptographic techniques and controls for authentication and encryption.
C413.3 Ability to analyse the threats,risks and attacks.
C413.4 Ability to Analyse the appropriate techniques for operating system security.
C413.5 Ability to validate various attacks.
PO1, PO2, PO4 PSO1, PSO2
CS414 Design And Analysis Of Parallel Algorithms On successful completion of this course, the students will be able to:
C414.1 Ability to define,understand and explain concepts of parallel algorithms.
C414.2 Ability to apply sorting and searching techniques on networks.
C414.3 Ability to analyse various parallel algorithms.
C414.4 Ability to apply various techniques for solving the graph theory problem.
C414.5 Ability to validate time complexitys of algorithms.
PO1, PO2, PO4 PSO1, PSO2
CS415 Machine Learning On successful completion of this course, the students will be able to:
C415.1: Ability to define,understand and explain concepts of machine learning.
C415.2: Ability to apply various learning techniques in ML.
C415.3: Ability to analyse learning algorithms and models.
C415.4: Ability to construct decision to given scenario.
C415.5: Ability to validating for what is involved in learning from data.
PO1, PO2,PO3, PO4 PSO1, PSO2