give a miss call on
|Course Code||Title of the Course||Hours(L+T+P)||Credit|
|CAL4416||Object Oriented Programming||4+0+0=4||4|
|CAP2416||Object Oriented Programming – Lab||0+0+4=4||2|
|Electives Set I (Students to opt for any one of the elective sets)||4+0+4=8||6|
|Elective – Set A|
|CAL2411||Advanced Web Development||4+0+0=4||4|
|CAP2411||Advance Web Development-Lab||0+4+0=4||2|
|Elective – Set B|
|CAL4609||Computer Graphics & Image Processing||4+0+0=4||4|
|CAP2609||Computer Graphics & Image Processing- Lab||0+4+0=4||2|
|Course Code||Title of the Course||Hours(L+T+P)||Credit|
|CAL4206||Advanced Data Structure||4+0+0=4||4|
|CAL4414||Database Management System||4+0+0=4||4|
|CAP2508||Database Programming – Lab||0+0+4=4||2|
|CAP2214||Advanced Data Structure-Lab||0+4+0=4||2|
|CAP1406||Operating System – Lab||0+2+0=2||1|
|Electives Set II (Students to opt for any one of the elective sets)||4+0+4=8||6|
|Elective – Set A|
|CAP2418||System Testing – Lab||0+4+0=4||2|
|Elective – Set B|
|CAP2507||Assembly Language Programming||0+0+4=4||2|
|Course Code||Title of the Course||Hours(L+T+P)||Credit|
|CAL4603||Theory of Computation||4+0+0=4||4|
|CAL4607||Data Mining and Business Intelligence||4+0+0=4||4|
|CAL4511||Rapid Application Development||4+0+0=4||4|
|CAP2607||Data Mining and Business Intelligence –Lab||0+2+0=2||1|
|CAP2511||Rapid Application Development –Lab||0+4+0=4||2|
|CAP4513||Android Application Development –Lab||0+4+0=4||4|
|CAT5605||Gateway to Industry||5|
|Course Code||Title of the Course||Hours(L+T+P)||Credit|
|CAT9502||Industrial Training/ Major Projects||0+0+0=0||20|
YEAR – I (SEMESTER 1)
Introduction to Operation Research, Methodology & Techniques of OR, Operation research Models, Applications & limitations of OR, Terminology and requirements of LPP, Construction of the LP Model, Graphical LP Solution, Basic Solution, The Simplex Method, The M-method, alternative optimal solution ,The two- phase simplex method , Sensitivity Analysis, Special cases in Applying Simplex Method (Degeneracy, Unbounded problems, Infeasible Problems), The relationship between the primal and dual solution, The primal-dual computations, Transportation Problem: Methods for finding initial basic feasible solutions(NWCM,LCM,VAM), Optimality Test :Stepping Stone & MODI Method, Degeneracy ,Unbalanced Transportation Problems, Trans-Shipment Problem, Transportation Problem: Methods for finding initial basic feasible solutions(NWCM,LCM,VAM), Optimality Test :Stepping Stone & MODI Method, Degeneracy, Unbalanced Transportation Problems, Trans-Shipment Problem, Introduction to assignment problem, The Hungarian method(Minimisation and Maximisation Case), Network Analysis, Terminology used in Network analysis, Computation of Critical Path, Construct a PERT network ,Difference between CPM and PERT, Queuing Theory, Features of queuing system, Role of exponential distribution, Birth and death models, Steady state measures of performance, Single server model, multiple server models, Machine servicing models, Queuing decision models.
Taha, H. A. (1982). Operations Research: An Introduction (For VTU). Pearson Education India.
K.K. Chawla, Vijay Gupta, Operations Research (15th Edition)
Introduction to Software Engineering/Software Development, SDLC, The Evolving Role of Software , Software , Software: A Crisis on the Horizon , Software Myths , The Management Spectrum , People , The Product , The Process , The Project Software Engineering–A Layered Technology , The Software Process , Software Process Models ,Requirements Analysis, Types of requirement Requirements Elicitation for Software , Analysis Principles , Software Prototyping ,Specification ,An Overview of Unified Modeling Language (UML), Object-Oriented Analysis and Design with Use-Case View, Types of Views in UML. Use-Case Diagrams, Class Diagrams, Object Diagrams, Collaboration Diagrams, Sequence Diagrams, State Diagrams, Activity Diagrams, Component Diagrams, and Deployment Diagrams, Analysis Concepts and Principles with UML, Requirements Analysis, Requirements Elicitation for Software, the Mechanics of Structured Analysis, DFD, the Data Dictionary, Creating Use Cases, Finding Classes ,Discovering Object Interaction, Specifying Relationships, Design Concepts and Principles with UML, Software Design and Software Engineering, The Design Process, Design Principles, Design Concepts, Software Testing Fundamentals, Test Case Design , White Box Testing , Basis Path Testing , Control Structure Testing, Black-Box Testing ,Testing for Specialized Environments, Architectures, and Applications, A Strategic Approach to Software Testing , Strategic Issues , Unit Testing Integration Testing , Validation Testing , System Testing , The Art of Debugging.
Pressman, R. S. (2010). Software Engineering: A practitioner’s approach. Seventh Edition, McGraw-Hill
Intro to OOPs, Introduction C++,Structure Of C++ program, Keywords, Basic Data Types, Derived Data types, Declaration of Variables, Operators in C++,Scope Resolution Operator, Control Structure, Function, Actual & Formal arguments, Default Arguments, Storage class specifiers, Arrays Declaration, Initialization, Processing Arrays, Arrays and Functions, Character Array, Pointers declaration, Pointer Arithmetic, Pointers And Function, Pointers And Arrays, Classes & Class Specifies Declaration, Member functions, Inline Function, Arrays within class, Static data, Static member functions, Friend Functions, Friend class, Constructor, Parameterized constructor, Multiple Constructor, Copy Constructor, Dynamic memory Allocation, Destructor, Operator Overloading, Overloading assignment operator, Overloading arithmetic operator, Overloading comparison operator, Function Overloading, Inheritance, Single Inheritance, Multilevel Inheritance, Multiple Inheritance, Advantages & Disadvantages of Inheritance, Virtual Functions, Pure Virtual, Functions, Virtual Base class, Abstract Class, Working With Files, File Stream, Opening And Closing Files, File modes, Sequential Input output, Updating File: Random Access, Templates (Function Template, Class Template), Introduction to OOAD, Software Life Cycle, Coad and Yourdan OOA, Booch’s OOD, Class Design, How to build reliable code, OO Performance Tuning.
Herbert Schildt. 1998. C++: The Complete Reference (3rd ed.). Osborne/McGraw-Hill, Berkeley, CA, USA.
Cloud Computing Overview, Cloud Computing History & Evolution, Components of Cloud Computing ,Requirements of Cloud Computing, Deployment Models, Service Models, Understanding cloud Architecture, Understanding Virtualization, Benefits & disadvantages of Cloud Computing, Security Concerns, Best Practices & Future of Cloud Computing, Examples about some clouds, Introduction To ERP, Two-tier ERP, Characteristics of ERP, General Model Of ERP, Functional Areas of ERP, Develop an ERP Business Case, ERP Vendors names, benefits of ERP, Intro to Green Computing, Regulations & Industry Initiative, Benefits of Green Computing, Approaches for green computing, Goals of Green Computing, Intro to semantic web, purpose, challenges, Semantic web stack (Architecture), Semantic web security.
Velte, A. T., Velte, T. J., Elsenpeter, R. C., & Elsenpeter, R. C. (2010). Cloud computing: a practical approach (p. 44). New York: McGraw-Hill.
Sosinsky, B. (2010). Cloud computing bible (Vol. 762). John Wiley & Sons.
Elective – I (A)
Basics of PHP: Identifiers, Variables, Defined Constants, Operators and Expressions. Adding Controls and Implementation
PHP Forms and User Input: HTML Form Fields (Controls), PHP Form Handling, Form Validations, $_GET, $_POST, $_REQUEST functions.
Looping and branching statements: Designing PHP Program Logic: Conditional or Branching Statements – if and switch Statements, Loops.
Implementing Functions: User-Defined Functions in PHP, Scope of Variables: Global and Local Variables, Creating Static Function Variables, Returning Values from Function.
Arrays: Creating Arrays, Counting Number of Elements in Array, Multidimensional Arrays, Navigating Arrays, Using for-each.
PHP State Management : Sessions, Cookies.
DataBase Connectivity with My SQL: Connecting to My SQL from PHP, Basic Connection Functions.
Ullman, L. (2011). Php and mysql for dynamic web sites: visual quickpro guide. Peachpit Press.
Elective – I (B)
Introduction to Computer Graphics : Definition, Application areas of Computer graphics, Graphical user interface, Cathode ray tubes, Random scan displays, Raster scan displays ,Color CRT monitors, Flat panel displays (Plasma Panels, Liquid crystal displays, Electroluminescent displays), Graphics software (GKS, PHIGS), Color Models (RGB, CMYK, HSV, Lookup tables etc.), Raster Graphics Algorithms: Line drawing algorithms (DDA, Bresenham’s algo), Circle and Ellipse drawing algorithms, filling (Scan-converting Polygon filling, inside outside tests boundary fill and area fill algo). Transformations and Projections: 2-D transformations, Homogeneous coordinate representation, 3-D transformations, Projection- Parallel projections, Perspective projections. Two dimensional Clipping and visible surface detection methods: Viewing pipeline, window and view port, Sutherland Cohen sub division algorithm, Cyrus-beck algorithm, classification of visible surface detection algorithm, Backface algo, Depth sorting method, Area subdivision method etc. Fundamentals of Digital Image Processing: Introduction – Steps in Image Processing Systems – Image Acquisition – Sampling and Quantization – Pixel Relationships – Color Fundamentals and Models, File Formats, Image operations – Arithmetic, Geometric and Morphological. Image Enhancement:Spatial Domain Gray level Transformations Histogram Processing Spatial Filtering – Smoothing, Sharpening. Frequency Domain: Filtering in Frequency Domain – DFT, FFT, DCT – Smoothing and Sharpening filters – Homomorphic Filtering. Image Compression: Fundamentals – Models – Elements of Information Theory – Error Free Compression – Lossy Compression – Compression Standards. Applications of Image Processing: Image Classification, Image Recognition, Image Understanding – Video Motion Analysis, Image Fusion, Steganography, Digital, Compositing, Mosaics, Colour Image Processing.
Hearn, D., & Baker, M. P. (2015). “Computer Graphics C Version”, Pearson Education, 2003.
YEAR – I (SEMESTER 2)
Introduction – Mainframe systems, Desktop Systems , Multiprocessor Systems , Distributed Systems ,Clustered Systems , Real Time Systems Handheld Systems . System Components, Operating System Services, System Calls/API, System Programs, Process Concept – Process Scheduling – Operations on Processes – Cooperating Processes – Inter-process Communication. Threads Multithreading Models, Overview, Threading issues, Linux Threads, CPU Scheduling , Basic Concepts, Scheduling Criteria Scheduling Algorithms Multiple-Processor, Scheduling Real Time Scheduling. Process Synchronization – The Critical-Section Problem. Synchronization Hardware – Semaphores – Classic problems of Synchronization – Critical regions – Monitors. System Model Deadlock Characterization , Methods for handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock detection , Recovery from Deadlocks, Case studies. Memory Management Swapping, paging, Segmentation, Segmentation with paging, Virtual Memory, Demand Paging, Process creation, Page Replacement Algorithms, Allocation of frames, Thrashing. File Concept Access Methods Directory Structure File System Mounting – File Sharing – Protection, File System Structure, File System Implementation Directory Implementation Allocation Methods Free-space Management. Kernel I/O Subsystems. Disk Structure – Disk Scheduling, Disk Management – Swap-Space Management. Case Study: The Linux System, Windows, Security Problem, User Authentication Problem, Program Threats, System Threats
Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.
An introduction to various types of data structures, various operations associated with each data structure. Various Algorithm, Conventions used ,Introduction to array as first data structure. Types of arrays, Operations on Arrays: Creation, Insertion, Deletion, Polynomial representation, Polynomial representation, addition, multiplication, An Introduction to Sparse Matrices, Creation stack, Operations on Stack: Push, pop, Application of stack: Infix to postfix and prefix forms for expressions ,Evaluation of postfix expressions, Queue as a Data structure, Operations on Queue, Insertion, deletion, Types of queues, Types of traversals, Inorder, Preorder and post order, Insertion and deletion of nodes in a binary search tree ,Heap as an application of trees, Sorting of arrays using a heap, AVL trees: Concept of balancing of trees, Types of rotations in AVL trees and its significance, Introduction to B-Tree, Graph as a nonlinear data structure: Traversals in Graphs.
Lipschutz, S. (1987). Schaum’s Outline of Data Structure. McGraw-Hill, Inc.
Introduction to Databases, Concepts and Architecture, Relational Model: Concepts, Constraints, Languages and Design. Data Modeling using ER Model, Data Modeling using Network Model and Hierarchical Model, Relational Algebra and Relational & Tuple Calculus, Dependencies and Anomalies, Normalization, Introduction to SQL, Introduction to Transaction processing Concepts and Theory, Concurrency Control Techniques, Deadlocks Avoidance and Prevention, Introduction to Client Server Databases, Introduction to Distributed Databases, Database Backup, Recovery, Integrated & Security Techniques , Introduction to Object databases, Levels of data and process Management, Data Mining concepts and Introduction to Data Warehousing and OLAP
Elmasri, R., & Navathe, S. (2016). Fundamentals of database systems. Seventh Edition, Pearson
Introduction to Computer Network, Distributed processing, Characteristics of networks; Importance of Networks; Applications of Networks, Topologies: BUS, MESH, STAR, RING, Classification of Networks: PAN, LAN, WAN and Internetworks; Protocols; Transmission modes, Networking Models: OSI, TCP/IP; Benefits of layered approach, The need of security, Security Approaches, Principles of security – Confidentiality, Authentication, Integrity, Non-repudiation, Types of Attacks – Active Attacks, Passive Attacks, Application Level Attacks, Network Level Attacks, Virus, Worm, Trojan Horse, Packet Sniffing, Packet Spoofing, Cryptographic Techniques – Plain Text & Cipher text, Encryption & Decryption, Symmetric & Asymmetric Cryptography – Diffie-Hellman key Exchange Algorithm, Symmetric Key Cryptographic Algorithms – Data Encryption Standards (DES), Advanced Encryption Standards (AES), Asymmetric Key Cryptographic Algorithms – The RSA algorithm, Internet Security Protocols – SSL, SHTTP, TSP, SET, IP Security – IP Security Overview, IP Security Policy, Encapsulating Security Payload, Combining Security Associations, Wireless Network Security & E-mail Security – IEEE 802.11 Wireless LAN Overview, IEEE 802.11i Wireless LAN Security, Wireless Application Protocol Overview, Wireless Transport Layer Security, WAP End-to-End Security, Pretty Good Privacy, S/MIME,
Intruders, Intruders Detection, Password Management
Tanenbaum, A. S. (2003). Computer networks, 4-th edition. ed: Prentice Hall.
Kahate, A. (2013). Cryptography and network security. Tata McGraw-Hill Education.
Stallings, W. (2007). Network Security Essentials: applications and standards. Pearson Education India.
Elective – II (A)
Fundamentals of Testing- Why is testing necessary, What is testing, Seven Testing Principles, Fundamental Test Process, The Psychology of Testing. Testing throughout the Life cycle – Software Development Model, Test Levels, Test Types. Static Techniques – Static Techniques and test process, Activities of Formal Review, Types of Review, Success factors of Review. Test Design Techniques – The Test development process, its categories, Specification Based of Black Box Testing. Structured Based or White Box Testing – Statement Testing , Decision Testing. Unit Testing, Static Unit Testing, Dynamic Unit Testing, Debugging. Control Flow Testing , Control Flow Graph, Path Selection Criteria Data Flow , Data Flow Path Selection Criteria Testing and Domain Testing. System Integration Testing, Integration Testing Techniques, Test Plan for integration Testing ,Functional Testing , Equivalence Partitioning, Boundary Value Analysis, Decision Tables. System Test Design, Requirement Identification, Test Objective Identification, Modeling a Test Process. Tools Support for Testing – Tools support for classification Testing, Static Testing , Test Specification , Performance and monitoring. Software Quality – MC Calls Quality Factors, CMMI Maturity Models
Naik, K., & Tripathy, P. (2011). “Software Testing and Quality Assurance: Theory and Practice”. John Wiley & Sons.
Elective – II (B)
Introduction to software processors and Toy Compiler, Elements of assembly language programming, Statement format, assembly language statements, assembly scheme, Flow Charts and Algorithm of Single pass and two pass assembler, Assembler Directives general design procedure of a two pass assembler, Macro definition, macro expansion, Nested Macro calls and features of macro facility, Design of a macro processor, Data Structures, Flow Charts and Algorithm of Pass 1 and Pass 2 Macro processor, Compiler process and Databases of compiler, Linkers concepts, Relocation concepts, self relocating programs, Design of an linker, Loader concepts and Loader Schemes: Compile and Go loader, General Loader and Absolute loader, Subroutine linkage, Relocating loader, Other loader schemes: Binders, Dynamic loading, Dynamic linking, Design of Absolute loader, Design of DLL with pass 1 and pass 2 flowcharts and Algorithm. Databases used in DLL.
Donovan, J. J. (1972). Systems programming. McGraw-Hill, Inc.
Aho, A. V., Sethi, R., & Ullman, J. D. (1986). Compilers, Principles, Techniques (pp. 670-671). Addison Wesley.
YEAR – II (SEMESTER 3)
Theory Of Automata: Definition, Description, Transition Systems, Properties of Transition functions. Acceptability of a string by Finite Automata. Nondeterministic finite state machines, Equivalence of DFA and NDFA, Mealy and Moore Models. Minimization of Finite Automata Finite Automata and Regular Expressions: Transition system containing λ moves, NDFA with λ moves and regular expressions. Conversion of Non-Deterministic System to Deterministic system. Regular Sets and Regular Grammars Regular Expressions, Algebraic Laws for Regular Expressions. Algebraic Method using Arden’s Theorem, Kleene’s Theorem. Construction of finite Automata equivalent to a regular expression , Equivalence of two finite automatas. Formal Languages: Basic Definitions and derivations, Chomsky classification of Languages.Context Free Grammars and Languages: Context free Languages and Derivation trees Ambiguity in CFG, Simplification of Context Free Grammars Normal forms for context free Grammars – Chomsky Normal Forms, Greibach Normal Forms.
Pandey, A. K. (2007). An Introduction To Automata Theory & Formal Languages.
Data Mining: Introduction: Motivation, Importance, Knowledge Discovery Process, Data Mining vs. Query Tools, Types of Variables for Data Mining, categorical and Continuous Attributes, Data Mining Functionalities: Class description, introduction to cluster analysis, outlier analysis and evolution analysis, classification and Prediction: Issues regarding Classification and prediction, Bayesian Classification, Using If then rules for Classification, Market basket Analysis, Decision Support Systems: Introduction, Structure and Applications, Applications and trends in data mining, Need for data warehouse, definition, goals of data warehouse, Data warehouse types, Data warehouse architecture, Extract, Transform and load routines. Evolution of Business Intelligence Systems, Data warehouse and OLAP technology, multidimensional data models and different OLAP operations, OLAP Server: ROLAP, MOLAP and HOLAP, Synthetic data for testing business intelligence applications, methods for generating synthetic test data. Steps for the Design and Implementation Methods of Data Warehouse Systems. Distributed Data Warehouse Architecture and design Issues, from data warehousing to data mining
Han, J., Pei, J., & Kamber, M. (2011). “Data mining: concepts and techniques”. Elsevier.
History and Goals of Java, Java Virtual Machine, Garbage Collection, JAVA BASICS, Identifiers and Keywords, Primitive Data Types, Integral, Operators, BRANCHING AND LOOPING, OO Programming, Creating a Data Type, Arrays–Declaring, Creating, and Accessing Arrays, Initializing Array , Multidimensional Arrays, Copying Arrays, ADVANCED CLASS CONCEPTS, EXCEPTIONS, STREAM I/O, SERVLET BASICS, Web Sphere Studio Application Developer Integration Edition Web Sphere Studio Enterprise Developer, Basic Operations with RAD Views and Perspectives, Searching, Setup Compiler Class Path, JRE Switching, Refactoring, Changing Class, Method, and Variable Name, Moving a Class to a Different Package, Extracting Code to a Method, Pull-up Method, Migrating Workspace from WSAD v5.x ,Project Interchange Feature, Migrating J2EE.
Shildt, H. (2007). Java: The Complete Reference. McGraw-Hill.
Mobile Adaptive Computing: Adaptability, Mechanisms for Adaptation Support for Bulding Adaptation, Mobile Applications, Mobile Management Location Management, Location Management Case Study, Data Dissemination and Management, Mobile Data Caching, Cache Management, Mobile Web Catching, Content Aware Computing, Prevasive Computing, Content Aware Computing Applications, Middleware Support, Mobile Middle Ware, Adaptation Agemts, Service Directory, Introduction to AhHoc and Sensor Network, Sensor Network, Features of Sensor Network, Proposed Applications, Protocols, Mobile Security.
Mobile Computing by Asoke. K Talukder, Roopa R. Yavagal, Asoke K. Talukder