Institute Name: Institute of Computer Application
Recommended Programs :
1. Master of Computer Application (MCA)
Semester III
Course Name
Data Communication and Computer Networks
Course Code
CAPDCDCC006T
Credit Hours
L
T
P
N
Total Credits
4
4
Prerequisites
Digital Electronics, BCADE04T
Course Objectives
To expect from students to learn basics of Communication Technologies and data communication which will help them to build fundamentals for learning.
To provide idea of Computer Networks that can be utilized in higher semester.
The course is designed to let students demonstrate an understanding of the fundamentals of data communication, types of transmission mediums and interfacing standards along with current edge of the data compression techniques.
Course Content
Unit -I
Signal Characteristic: Analog and Digital, Periodic Analog Signals, Digital Signals, Transmission Impairments, Data rate limits, Performance Data Communication: Basics of data communication, Networks, Internet and protocol standards, OSI, TCP-IP models. [12]
Unit -II
Signal Encoding Techniques: Digital to digital Conversion, Data transmission modes, Analog to analog transmission, Digital to analog transmission. Bandwidth Utilization: Multiplexing and Spreading Frequency division multiplexing (FDM), Time division multiplexing (TDM), T1 multiplexing hierarchy, E1 multiplexing hierarchy, Statistical TDM, Spread Spectrum, SONET/SDH [12]
Unit -III
Transmission Media: Guided media, optical fiber, wireless media Switching System and Communication Networks: Circuit Switching, Datagram and virtual network, structure of switch networks, Telephone network, Modem and DSL, cable TV networks[11]
Unit-IV
Wireless WAN: Cellular telephone, Satellite communication, Communication Technologies: Ethernet , Bluetooth, Wifi, RF, Infrared, Zigbee, NFC[11]
Unit-V
Data Link Control: Framing, Flow and error control, protocols, noiseless channels, noisy channel, HDLC, Point to Point Protocol [12]
Institute Name: Institute of Computer Application | ||||||
Recommended Programs : 1.Master of Computer Application (MCA) | Semester: III | |||||
Course Name | Principle of Cyber Security | Course Code | CAPDCPCS019T | |||
Credit Hour | L | T | P | N | Total Credits | 4 |
4 | 0 | 0 | 0 | |||
Prerequisites | Fundamental of Cyber Security ; SCIDCFCY001T | |||||
Course Objectives |
| |||||
Course Content | Unit 1: Introduction to Cyber Security Overview of Cyber Security, Internet Governance – Challenges and Constraints, Cyber Threats:- Cyber Warfare-Cyber Crime-Cyber terrorism-Cyber Espionage, Need for a Comprehensive Cyber Security Policy, Need for a Nodal Authority, Need for an International convention on Cyberspace. [12] Unit 2: Cyber Security Vulnerabilities and Cyber Security Safeguards Cyber Security Vulnerabilities-Overview, vulnerabilities in software, System administration, Complex Network Architectures, Open Access to Organizational Data, Weak Authentication, Unprotected Broadband communications, Poor Cyber Security Awareness. Cyber Security Safeguards- Overview, Access control, Audit, Authentication, Biometrics, Cryptography, Deception, Denial of Service Filters, Ethical Hacking, Firewalls, Intrusion Detection Systems, Response, Scanning, Security policy, Threat Management. [13] Unit 3: Securing Web Application, Services and Servers Introduction, Basic security for HTTP Applications and Services, Basic Security for SOAP Services, Identity Management and Web Services, Authorization Patterns, Security Considerations, Challenges.[11] Unit 4: Intrusion Detection and Prevention Intrusion, Physical Theft, Abuse of Privileges, Unauthorized Access by Outsider, Malware infection, Intrusion detection and Prevention Techniques, Anti-Malware software, Network based Intrusion detection Systems, Network based Intrusion Prevention Systems, Host based Intrusion prevention Systems, Security Information Management, Network Session Analysis, System Integrity Validation.[12] Unit 5: Cryptography and Network Security Introduction to Cryptography, Symmetric key Cryptography, Asymmetric key Cryptography, Message Authentication, Digital Signatures, Applications of Cryptography. Overview of Firewalls- Types of Firewalls, User Management, VPN Security Security Protocols: - security at the Application Layer- PGP and S/MIME, Security at Transport Layer- SSL 1 TLS, Security at Network Layer-IPSec. [13] |
- Unix / Linux Operating System
Institute Name: Institute of Computer Application | |||||||
Recommended Programs : Master of Computer Application (MCA) | Semester: III | ||||||
Course Name | Unix / Linux Operating System | Course Code | CAPDEULP016T | ||||
Credit Hours | L | T | P | N | Total Credits | 4 | |
4 | 0 | 0 | 0 | ||||
Prerequisites | Modern Operating Systems , CAPDCMOS004T | ||||||
Course Objectives |
| ||||||
Course Content | Unit-I Management of File using Command Line Introduction to BASH, Command-line shortcuts, File Types, Ownership and Permissions, File management and manipulation, Moving users & its directories, Miscellaneous Tools, Editors Managing Users and Groups Creating and managing user/s and group commands, User management Tools, Users and Access Permissions, Updating users and group attributes, PAM (Pluggable Authentication Modules) [12] Unit -II Booting and Shutting down Boot Loaders, The init process, rc scripts, enabling and disabling services, Booting in recovery mode 4 4 File Systems Makeup of file systems, Managing file systems, Adding a new disk, Volume Management, Creating file systems.[13] Unit-III File Systems Makeup of file systems, Managing file systems, Adding a new disk, Volume Management, Creating file systems. Core System Services The init Daemon, xinetd and inetd, The Logging Daemon, Configuring Logging Daemon, The CRON program[12] Unit-IV Compiling the Linux Kernel Kernel concepts, Finding Kernel Source Code, Building the Kernel, Patching the Kernel, DNS Installing DNS Server, Configuring DNS server, DNS records types, Setting up BIND database file, The DNS Toolbox, Configuring DNS clients.[12] Unit V Apache Web Server HTTP Protocol, Installing Apache HTTP Server, Starting up and shutting down apache, Testing Apache Installation, Configuring Apache, Troubleshooting Apache ,Virtualization Implementation, Kernel based Virtual Machines (KVM)[12] |
- Mca syllybus all subjects
Institute Name: Institute of Computer Application | |||||||
Recommended Programs : 1. Master of Computer Application (MCA) | Semester: III | ||||||
Course Name | Theory of Computation | Course Code | CAPDETOC021T | ||||
Credit Hours | L | T | P | N | Total Credits | 4 | |
4 | - | 0 | 0 | ||||
Prerequisites | Discrete Mathematics , CAPDEDMA006T | ||||||
Course Objectives | The purpose of offering this course are: 1.To give an overview of the theoretical foundations of computer science from the perspective of formal languages 2. To illustrate finite state machines to solve problems in computing 3. To explain the hierarchy of problems arising in the computer sciences. 4. To familiarize Regular grammars, context frees grammar. | ||||||
Course Content | UNIT – I FINITE AUTOMATA (FA): Introduction, Deterministic Finite Automata (DFA) -Formal definition, simpler notations (state transition diagram, transition table), language of a DFA. Nondeterministic Finite Automata (NFA)- Definition of NFA, language of an NFA, Equivalence of Deterministic and Nondeterministic Finite Automata, Applications of Finite Automata, Finite Automata with Epsilon Transitions, Eliminating Epsilon transitions, Minimization of Deterministic Finite Automata, Finite automata with output (Moore and Mealy machines) and Inter conversion. [15] UNIT - II REGULAR EXPRESSIONS (RE): Introduction, Identities of Regular Expressions, Finite Automata and Regular Expressions- Converting from DFA’s to Regular Expressions, Converting Regular Expressions to Automata, applications of Regular Expressions. REGULAR GRAMMARS: Definition, regular grammars and FA, FA for regular grammar, Regular grammar for FA. Proving languages to be non-regular -Pumping lemma, applications, Closure properties of regular languages. [12] UNIT - III CONTEXT FREE GRAMMER (CFG): Derivation Trees, Sentential Forms, Rightmost and Leftmost derivations of Strings. Ambiguity in CFG’s, Minimization of CFG’s, CNF, GNF, Pumping Lemma for CFL’s, Enumeration of Properties of CFL ( Proof’s omitted ). [11] UNIT – IV PUSHDOWN AUTOMATA: Definition, Model, Acceptance of CFL, Acceptance by Final State and Acceptance by Empty stack and its Equivalence, Equivalence of CFG and PDA. TURING MACHINES (TM): Formal definition and behavior, Languages of a TM, TM as accepters, and TM as a computer of integer functions, Types of TMs. [10] UNIT V RECURSIVE AND RECURSIVELY ENUMERABLE LANGUAGES (REL): Properties of recursive and recursively enumerable languages, Universal Turing machine, The Halting problem, Undecidable problems about TMs. Context sensitive language and linear bounded automata (LBA), Chomsky hierarchy, Decidability, Post's correspondence problem (PCP), undecidability of PCP. [12] |
Institute Name: Institute of Computer Application | ||||||
Recommended Programs :
| Semester: III | |||||
Course Name | Analysis of Algorithms | Course Code | CAPDEAAL007T | |||
Credit Hours | L | T | P | N | Total Credits | 4 |
4 | 0 | 0 | 0 | |||
Prerequisites | Data Structure and Algorithm, CAPDCDSA003T | |||||
Course Objectives | The course objectives are:
| |||||
Course Content | Unit-I Analysis of Algorithm: The efficient algorithm, Average, Best and worst case analysis, Amortized analysis , Asymptotic Notations, Analyzing control statement, Loop invariant and the correctness of the algorithm, Sorting Algorithms and analysis: Bubble sort, Selection sort, Insertion sort, Heap sort, Sorting in linear time : Bucket sort, Radix sort .[10] Unit-II Divide and Conquer Algorithm: Introduction, Recurrence and different methods to solve recurrence, Multiplying large Integers Problem, Problem Solving using divide and conquer algorithm - Binary Search, Max-Min problem, Sorting (Merge Sort, Quick Sort), Matrix Multiplication. [12] Unit-III Dynamic Programming: Introduction, The Principle of Optimality, Problem Solving using Dynamic Programming –Knapsack problem, All Points Shortest path, Matrix chain multiplication, Longest Common Subsequence. [12] Unit-IV Backtracking and Branch and Bound: Introduction, The Eight queens problem , Knapsack problem, Travelling Salesman problem [11] Unit V The class P and NP, Polynomial reduction, NP- Completeness Problem, NP-Hard Problems. Travelling Salesman problem, Hamiltonian problem, Approximation algorithms [10] |
Modern Artificial Intelligence |
Institute Name: Institute of Computer Application | ||||||
Recommended Programs : 1.Master of Computer Application (MCA) | Semester: III | |||||
Course Name | Modern Artificial Intelligence | Course Code | CAPDCMAI010T | |||
Credit Hour | L | T | P | N | Total Credits | 4 |
4 | - | 0 | 0 | |||
Prerequisites | Discrete Mathematics , CAPDEDMA006T | |||||
Course Objectives | This course aims
| |||||
Course Content | UNIT- I INTRODUCTION: Introduction - Foundation and history of AI - AI Problems and techniques - AI programming languages – Introduction to LISP and PROLOG – Problem spaces and searches - Blind search strategies; Breadth first - Depth first – Heuristic search techniques Hill climbing - Best first – A* algorithm AO* algorithm – game trees - Minimax algorithm – Game playing – Alpha beta pruning. [13] UNIT- II KNOWLEDGE REPRESENTATION: Knowledge representation issues – Predicate logic – logic programming – Sematic nets - Frames and inheritance - constraint propagation –Representing Knowledge using rules – Rules based deduction system. [12] UNIT- III REASONING UNDER UNCERTAINTY Introduction to uncertain knowledge review of probability – Baye’s Probabilistic inferences and Dempster Shafer theory –Heuristic methods – Symbolic reasoning under uncertainty- Statistical reasoning – Fuzzy reasoning – Temporal reasoning- Non monotonic reasoning. [11] UNIT- IV PLANNING AND LEARNING Planning - Introduction, Planning in situational calculus - Representation for planning – Partial order planning algorithm- Learning from examples- Discovery as learning – Learning by analogy – Explanation based learning –Introduction to Neural nets – Genetic Algorithms. [12] UNIT- V EXPERT SYSTEMS: Architecture of expert systems, Roles of expert systems - Knowledge Acquisition - Meta knowledge, Heuristics. Typical expert systems - MYCIN, DART, XOON, Expert systems shells. APPLICATIONS - Principles of Natural Language Processing Rule Based Systems Architecture - AI application to robotics - Current trends in Intelligent Systems. [12] |
Institute Name: Institute of Computer Application | |||||||
Recommended Programs:
| Semester: III | ||||||
Course Name | Learn Programming using C#.Net | Course Code | CAPDSCSP019P | ||||
Credit Score | L | T | P | N | Total Credit | C | |
0 | 0 | 4 | 0 | 2 | |||
Prerequisites | Fundamentals of Computers, BCAFCP01T and Lab Fundamentals of Computers , BCAFCP01P | ||||||
Course Objectives |
| ||||||
Course Content |
|
Institute Name: Institute of Computer Application | |||||||
Recommended Programs : 1.Master of Computer Application (MCA) | Semester: III | ||||||
Course Name | Java Programming | Course Code | CAPDSAJP012P | ||||
Credit Hours | L | T | P | N | Total Credits | 2 | |
- | - | 4 | - | ||||
Prerequisites | Fundamentals of Computers, BCAFCP01T and Lab Fundamentals of Computers- BCAFCP01P | ||||||
Course Objectives |
| ||||||
Course Content |
|