0% found this document useful (0 votes)
26 views

MCA 2nd Sem Detailed Syllabus

MCA Girijananda chowdhury university

Uploaded by

Rahul Das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views

MCA 2nd Sem Detailed Syllabus

MCA Girijananda chowdhury university

Uploaded by

Rahul Das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

GIRIJANANDA CHOWDHURY UNIVERSITY

MCA (2 YR)

DETAILED SYLLABUS
SEMESTER-II

Theory/ Sl. Course Hours per week Credit Mark


Course Code Course Name
Practical No Type L T P C CA FA
Data Structures and
T 1 DSCC MCA23 506T 3 0 0 3 40 60
algorithms
T 2 DSCC MCA23 507T Database Management Systems 3 0 0 3 40 60
Object Oriented Programming
T 3 DSCC MCA23 508T 3 0 0 3 40 60
using Java
Data Communication and
T 4 DSCC MCA23 509T 3 0 0 3 40 60
Computer Networks
T 5 OEC MCA23 5XXT Elective-I ( As per Table-I) 3 1 0 4 40 60
P 6 DSCC MCA23 507P DBMS Lab ( SQL/ NoSQL) 0 0 4 2 40 60
Object Programming Lab
P 7 DSCC MCA23 508P 0 0 4 2 40 60
using Java
15 1 8 20 280 420

Table-I

CODE Elective-I
MCA23 510T Advanced web Technology
MCA23 511T Cloud Computing
MCA23 512T Data warehousing and Data mining
MCA23 512T Natural Language Processing
MCA23 514T Malware Analysis and Intrusion Detection
MCA23 515T Bioinformatics And Sequence Analysis
MCA23 516T Cyber Security

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 506T Data Structure and algorithms 3-0-0 DSCC 3

Prerequisite: Introduction to Programming


Course Objectives: The objective of this course are:

1. To understand the basic data structures and implement them .


2. Know about da searching and sorting techniques arising out in science and engineering problems.

Course Outcomes: After completing this course, the students would be able to

1. Students will be able to learn about the basic properties of an algorithm and what are the important points one has to
consider while designing an efficient and correct algorithm.
2. Students will be able to analyze the running time of an algorithm for all possible input.
3. Students will be able to learn and analyze a variety of algorithm design techniques such as divide and conquer
algorithms, dynamic programming, greedy methods etc.

Module Topic Course Content Hours

I Introduction Introduction: Introduction to Data Structure, Linear, Non-linear, Abstract and 7


Primitive Data Structures. Introduction to Algorithm and its role in computing,
Time and Space Complexity of algorithms, Concept of Asymptotic Notation,
Big-Oh, small-oh & Big-Omega, Theta
II Elementary Elementary Data Structure: Stack, Queue, Linked List, Binary Tree ,Hash Tables, 7
Data Structure Graphs- Properties and Application
III Advanced Data Advanced Data Structure: Height Balanced Tree, Red Black Tree, B tree, Binomial 12
Structure Heap, Fibonacci Heap- Properties and Application.
IV Algorithm Algorithm Design Paradigms: Divide and Conquer Algorithm- Merge Sort, Quick 12
Design Sort, Recurrences, Dynamic Programming: Matrix chain Multiplication, Longest
Paradigms Common Subsequence Problems, Greedy Algorithm: Activity Selection Problem,
Huffman Code.
V NP 7
NP Completeness: Polynomial Time, Polynomial Time verification, NP
Completeness Completeness and reducibility
Total 45

Text Books:
1. Classic Data Strcurure : By D Samanta ,PHI
2. Data Structure Through C++ By Y Kanetkar, BPB Publication
3. Weiss, Data Structures and Algorithm Analysis in C++, Pearson Education
4. Introduction to Algorithms, T Cormen,C,Leiserson,R. Rivest,C.Stein,PHI Publication
Reference Books:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B.A. Forouzan,
Cengage Learning.
2. Programming in ANSI C, 5th ed, E. Balaguruswamy, TMH

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University

Course Code Course Title Hours Per Week Course Credit


L-T-P Type
MCA23 507T Database Management Systems 3-0-0 DSCC 3
Prerequisite: Data structures and algorithms
Course Objective :
The students after learning this course will able to know about the basics of databases. They will know how a database can be
designed for an organisation and implement it with DBMS software.

Course Outcomes :
At the end of the course the student will be able to
CO 1: Illustrate the concept of databases, database management systems, database languages, databasestructures
and their work
CO 2: Apply ER modelling and Relational modelling for designing simple databases.
CO 3: Summarize the concepts related to relational model and SQL and Write database queries usingrelational
algebra and structured query language.
CO 4: Design and develop databases from the real world by applying the concepts of Normalization.
CO 5: Outline the issues associated with Transaction Management and Recovery,

Module Topic Course Content Hours


I Introduction Introduction, An Example, Characteristics of the Database Approach, Actors on 3
to Databases Scene, Workers behind the scene, Advantages of Using the DBMS Approach, A
Brief Historyof Database Applications, When Not to Use a DBMS
II Overview of Data Models, Schemas and Instances, Three- Schema Architecture and Data 3
Database Independence, Database Languages and Interfaces, The Database System
Languages Environment, Centralized and Client/Server Architecture for DBMSs,
and Classification of Database Management Systems
Architectures:
III Introduction Database Design and ER Diagrams, Entities, Attributes and Entity Sets, 7
to Database Relationships and Relationship Sets, Additional Features of the ER Model,
Design Conceptual Design with the ER Model, Conceptual Design for Large Enterprises
IV Relational Introduction to the Relational Model, Integrity Constraints over Relations, 5
Model Enforcing Integrity Constraints, Querying Relational Data, Logical Database
Design: ER to Relational, Introduction to Views, Destroying/Altering Tables and
Views
V Relational Relational Algebra: Selection and Projection, Set Operations, Renaming, Joins, 10
Algebra Division, More Examples of Algebra Queries.
SQL: Queries, Constraints, Triggers: The Form of a Basic SQL Query,
UNION, INTERSECT and EXCEPT, Nested Queries, Aggregate Operators, Null
Values, Complex Integrity Constraints in SQL, Triggers and Active Databases,
Designing Active Databases.
VI Introduction Informal Design Guidelines for Relation Schema, Functional Dependencies, 10
to Normal Forms Based on Primary Keys, General Definitions of Second and Third
Normalisation Normal Forms, Boyce-Codd Normal Form, Multivalued Dependency and Fourth
Normal Form, Join Dependencies and Fifth Normal Form.
VII Transaction Transaction Concept, A Simple Transaction Model, Storage Structure, ACID 4
Management Properties, Serializability, Transaction Isolation Levels, Concurrency Control,
and Lock-Based Protocols, Validation-Based Protocols
Concurrency
Control
VIII Recovery Log based recovery (deferred and immediate database modification), 3
System checkpoints, shadow paging, recovery with concurrent with transactions, buffer
managements in recovery, recovery from loss of non - volatile storage, logical
undo logging, transaction rollback, restart recovery, fuzzy checkpointing
Total 45
Text Books:
1) Database System Concepts, 6/e, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Mc Graw-Hill
2) Database Systems, 6/e Ramez Elmasri, Shamkant B. Navathe, Pearson
3) Database Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke, Mc Graw-Hill
Reference Books:
1) Database Systems, 9/e, Carlos Coronel, Steven Morris, Peter Rob, Cengage
2) Introduction to Database Systems, 8/e, C J Date, Pearson

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 508T Object Oriented Programmimg Using Java 3-0-0 DSCC 3

Prerequisite: Introduction to Programming


Course Objective:

This course is about the fundamentals of Object-Oriented Programming (OOP) Concept and OOP-based software development
methodology. Java as a class-based and pure OOP language is used to demonstrate and implement appropriate concepts and
techniques. The students are exposed to the concepts, fundamental syntax, and the thought processes behind object-oriented
programming. By end of the course, students will acquire the basic knowledge and skills necessary to implement object-
oriented programming techniques in software development using Java.

Course Outcomes
CO 1: Define, understand, and differentiate the Object Oriented concepts and Java Programming concepts;
CO 2: Apply object oriented concepts on real time scenarios.
CO3 : Use Exception handling and multithreading mechanisms to create efficient software applications.
CO 4: Utilize modern tools and collection framework to create Java applications to solve real world problems
CO5 : Design and develop GUI based applications using applets and swings for internet and system based applications.

Module Topic Course Content Hours


I History of Java, Byte code, JVM, Java Buzzwords, OOP principles, Data types,
Introduction 3
Variables, Operators, Control statements, Type casting, Arrays.
II Concepts of Introducing methods, Method overloading, Constructors, Constructor overloading,
Classes and 5
How to use of static keyword with data and method, Access control, this keyword
Object
III Inheritance Inheritance basics, Types of inheritance, Member access rules, Usage of super key
5
And Interfaces word, Method overriding, Usage of final
IV Packages - defining, creating and accessing a package, importing packages, access
Packages, control in packages.
Abstract Class Abstract classes, Interfaces - differences between abstract classes and interfaces, 10
and Interface defining an interface, implementing interface, applying interfaces, variables in
interface and extending interfaces
V Exceptional Concepts of exception handling, Types of exceptions, Usage of try, catch, throw,
7
Handling throws and finally keywords, Built-in exceptions, Creating user defined exception
VI Concepts of multithreading, Differences between process and thread, Thread life
Multithreading cycle, Creating multiple threads using Thread class and Runnable interface, 7
Synchronization, Thread priorities
VII GUI Exploring Swing Controls: JLabel, JText Field, JButton, JCheckBox, JRadioButton,
programming JTabbed Pane, JList, JCombo Box 8
with Swing and
Event Events, Event Handling in Java, Event Types
Total 45

Text Books/Reference:

1. Matt Weisfeld: The Object Oriented Thought Process, Addison-Wesley.


2. Rambaugh et al.: Object Oriented Modeling and Design, PHI (EEE).
3. Rambaugh Booch, Jackobson : Unified Modelling Language Referance Mannual.
4. Barclay, Savage : Object-Oriented Design with UML and Java, Elsevier Butterworth-Heinemann

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 509T Data Communication and Computer 3-0-0 DSCC 3
Networks

Prerequisite: Computer organisation and architectures

COURSE OBJECTIVE:
1. Independently understand basic computer network technology, Data Communications System and its components.
Identify the different types of network topologies and protocols.
2. Enumerate the layers of the OSI model and TCP/IP. Explain the function(s) of each layer.
3. Identify the different types of network devices and their functions within a network
4. Understanding the different networking layers protocols.
5. Understand and transport layer and application layer protocols and its applications in real world problem.

COURSE OUTCOME:

After the completion of the course, the student will be able to:
1. CO1: Understand the architectural principles of computer networking and compare different approaches to organising
networks.
2. CO2: Analyze and apply various routing algorithms to find shortest paths for packet delivery.
3. CO3: Explain the details of Transport Layer and application layer Protocols and analyze the features and operations of
various protocols
4. CO4: To study about various types of wireless networks and understand the challenges in wireless.

Module Topic Course Content Hours


I Introduction Introduction to TCP/IP, The OSI Model and TCP/IP Protocol Suites,IP Addressing,
Sub netting and Super netting, CIDR, Internet Protocol (IP), ARP and RARP,
Internet Control Message Protocol (ICMP), Internet Group Management Protocol
7
(IGMP).
II Data Data Forwarding and Routing: Introduction, Forwarding and Routing, Network
Forwarding and Service Models, Virtual Circuit and Datagram Networks, Virtual-Circuit Networks, 7
Routing Datagram Networks, Origins of VC and Datagram Networks.
III Routing Routing Algorithms: The Link-State (LS) Routing Algorithm, The Distance-Vector
Algorithms (DV) Routing Algorithm, Hierarchical Routing, Routing in the Internet: Intra-AS
Routing in the Internet: RIP, Intra-AS Routing in the Internet: OSPF, Inter-AS
Routing: BGP, Routing Information Protocol (RIP), Interior Gateway Routing
8
Protocol (IGRP), Switching Services, Spanning Tree Protocol (STP), Standard
Network Management Protocol.
IV Transport Transport Layer-Elements of transport protocols; Internet transport protocols: TCP
Layer and UDP, TCP connection management, congestion control.
7
V Application Application Layer-Network application architectures: Client-server, P2P and
Layer hybrid;
Application layer protocols: DNS, FTP, TFTP, TELNET, HTTP and WWW,
7
SMTP and electronic mail; Network management and SNMP.
VI Adhoc and Adhoc and Cellular networks- Applications of Adhoc wireless networks, Issues in
Cellular Adhoc wireless networks. Hidden and exposed terminal problems, Error prone shared
networks broadcast channel, Contention-Based Protocols, Contention-Based Protocols with 10
Reservation Mechanisms. Routing Protocols for Ad-hoc Wireless Networks: Table
Driven Routing Protocols.
Total 45
Text Books:
1. Andrew S Tanenbaum, David. J. Wetherall, “Computer Networks”, Pearson Education, 5th
Edition
2. Stallings, W., “Network Security and Cryptography”, 4th Ed., Prentice-Hall of India, 6th edition
Reference Books:
1. Behrouz A. Forouzan, "Data Communications and Networking", Tata McGraw-Hill, Fourth Edition
2. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann Publishers, 5th
Edition, 2011.
3. Theodore S. Rappaport, Wireless Communication: Principles and Practices (2ndEdition), Pearson Education

Signature Signature
Internal Member External Member / Expert
ELECTIVE-I COURSES
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 510T Advanced Web Technology 3-1-0 DSCC 4
Prerequisite: Web Technology
Course Objective :
This course enables the students:
1. Understand the fundamentals of web services architecture and design principles.
2 Learn how to implement web services using SOAP and RESTful APIs.
3. Understand the principles of microservice architecture and design patterns
4. Understand the evolution of the internet and the concept of Web 3.0.
5. Understand the fundamentals of the metaverse, including virtual reality (VR), augmented reality (AR), and mixed
reality (MR)
Course Outcomes:
After the completion of this course, students will be able to:
1. Explore the fundamentals of the metaverse, including virtual reality (VR), augmented reality (AR), and mixed
reality (MR)
2. Examine the underlying technologies driving Web 3.0 and the metaverse, such as blockchain, decentralized finance
(DeFi), and non-fungible tokens (NFTs), Smart contracts and decentralized autonomous organizations (DAOs)
3. Blockchain technology and its applications
4. Know Webservices Architecture
5. Know Microservices building blocks

Module Topic Course Content Hours


I XML and XML document vs HTML, uses of XML, XML doc tree structure, XML and syntax, 7
DTD XML elements, XML standard and Naming rules, XML attributes, XML Validation,
DTD, constituents of XML-DTD, example, DTD elements, DTD attributes, attribute
declaration example, DTD entities: internal, external. External parsed and unparsed
general entity declaration. Example of external and internal entity.
II Introduction RPC, Web services 1.0: SOAP, Web services 2.0: REST, 3 tier Architecture, SOA, 8
to SOAP Webservices, Web Services stack: XML, WSDL, DISCO, UDDI. SOAP message
Webservices structure, WSDL Schema overview, UDDI information model.
WSDL Document Structure, PortType Element, Types Element, Binding Element,
Service Element,
III Microservice Goal oriented layered approach, Designing micro services system, Service design: API 7
s Design, Distributed Transaction, Asynchronous message passing, pragmatic mobility.
System design and operations: Docker and microservices, role of service discovery,
security and routing.
IV Web 3.0 Understanding Web 1.0, Web 2.0, and the evolution to Web 3.0, Technologies Shaping 8
standards Web 3.0: Decentralized finance (DeFi) and cryptocurrency, Smart contracts and
and decentralized autonomous organizations (DAOs), Blockchain technology and its
technologies applications,
V Metavarse Building Blocks of the Metaverse: Virtual reality (VR) and its applications, Augmented 7
and the Web reality (AR) and mixed reality (MR), Spatial computing and 3D virtual environments,
Navigating the Metaverse: Virtual worlds and social platforms, Gaming and
entertainment in the metaverse, Collaborative workspaces and virtual events. Economic
Models in the Metaverse: Non-fungible tokens (NFTs) and digital collectibles,
Metaverse economies and virtual commerce
Total 45
Text Book:
1. Developing Java Web Services, R. Nagappan, R. Skoczylas, R.P. Sriganesh, Wiley India, rp 2008.
2. Developing Enterprise Web Services, S. Chatterjee, J. Webber, Pearson Education, 2008.
3. XML, Web Services, and the Data Revolution, F.P.Coyle, Pearson Education.
4. Java web services, D.A. Chappell and T.Jewell, O’Reilly,SPD.
7. Metaverse and Web 3.0, A Beginer’s Guide, Utpal Chakraborty, BPB Publications.

Reference Book:
8. Java Web Services Architecture, McGovern, Sameer Tyagi etal.., Elsevier.
9. Web Services, G. Alonso, F. Casati and others, Springer, 2005
10. Microservices from Theory to Practice Creating Applications in IBM Bluemix Using the Microservices Approach, Shahir
Daya, Nguyen Van Duy; RedBooks.

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 511T Cloud Computing 4-0-0 DSCC 4
Prerequisite: Web Technology

Course Objective :

This course enables the students:

1. Understand the elements of distributed computing and core aspects of cloud computing.
2. Understand the concepts and aspects of virtualization and application of virtualization technologies in cloud
computing environment.
3. Understand the architecture and concept of different cloud models: IaaS, PaaS, SaaS and gain comprehensive
knowledge of different types of clouds.
4. Be familiar with application development and deployment using services of different cloud computing technologies
provider: Google app Engine, Amazon Web Services (AWS) and Microsoft Azure.
5 Understanding the key security, compliance, and confidentiality challenges in cloud computing.
6 Understand the commonly used cloud programming platforms, tools, and simulator.
Course Outcomes :
After the completion of this course, students will be able to:
1. Recall the various aspects of cloud computing and distributed computing
2. Understand the specifics of virtualization and cloud computing architectures.
3. Develop and deploy cloud application using services of different cloud computing technologies provider: Google
app Engine, Amazon Web Services (AWS) and Microsoft Azure.
4. Evaluate the security and operational aspects in cloud system design, identify and deploy appropriate design
choices when solving real-world cloud computing problems.
5. Provide recommendations on cloud computing solutions for an enterprise.

Module Topic Course Content Hours


I Introduction: Cloud computing at a glance: vision of cloud computing, defining a cloud, 8
cloud computing reference model, characteristics and benefits, challenges
ahead, Historical Developments: DS, virtualization, web 2.0, SOC, UOC,
Building cloud computing environments: application, infrastructure and
system development, Computing Platforms and Technologies
II Principles of Parallel Parallel vs. Distributed computing, Elements of parallel computing: parallel 9
and Distributed processing, H/W architecture of parallel processing, parallel programming,
Computing: levels of parallelism, Elements of distributed computing: Defination,
components architectural style and models for inter-prosses communication,
Technologies for distributed computing: RPC, distributed object framework
III Virtualization: Introduction, Characteristics of virtualized environments, Taxonomy of 9
virtualization techniques, Virtualization and cloud computing, Pros and cons
of virtualization, Technology examples: XEN, VMware, Microsoft hyper-V.
IV Cloud computing Introduction, Cloud reference model (IAAS, PAAS and SAAS), Types of 10
architecture and clouds, Economics of the cloud, Cloud compliance, Data confidentiality and
Cloud Security: interoperability challenges, Salability and Fault tolerance, Security, trust and
privacy issues in cloud computing
V Cloud platforms in Amazon web services: EC2, S3, communication services, Google app engine: 9
industry and Cloud Architecture, core concept and application, Microsoft azure: core concept,
applications: SQL azure and windows azure platform appliance, Cloud application:
Scientific applications, Business, and Consumer applications
Total 45
Text Books:
1. Rajkumar Buyya, C. Vecchiola, S. Thamarai Selvi, Mastering Cloud Computing, McGraw Hill
2. Nick Antonopoulos and Lee Gillam, Cloud Computing: Principles, Systems and Applications, Editors, springer publication

Reference Books:
1. Borko Furht Armando Escalante, Hand book of Cloud Computing, Editors, springer Publication.
2. Judith Hurwitz, Robin Bloor, Marcia Kaufman, Fern Halper, Cloud Computing for Dummies, Wiley Publication.
3. John W. Rittinghouse, JamesF. Ran some, Cloud Computing: Implementation, management and security, CRC Press,
Taylor and Francis Publication.

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University

Course Code Course Title Hours Per Week Course Credit


L-T-P Type
MCA23 512T Data Warehousing and Data Mining 4-0-0 DSCC 4

Prerequisite: Web Technology, DBMS

Course Objective : The objective of this course is to learn about data warehousing , how to create data warehouses and thus
retrieving information from data warehouse using different tools.

Course Outcome:

CO1: Understand essential data mining and data warehousing concepts and explore datasets effectively.
CO2: Master classification techniques and evaluate classifier performance.
CO3: Develop skills in association analysis and overcome data mining challenges.
CO4: Understand clustering techniques and web data mining fundamentals, exhibiting competence in these areas.

Module Topic Course Content Hours


I Introduction Introduction to Data mining, types of Data, Data Quality, Data Processing, Measures 6
of Similarity and Dissimilarity, Exploring Data: Data Set, Summary Statistics,
Visualization, Data Warehouse, OLAP and multi dimensional data analysis.
II Classification Basic Concepts, Decision Trees and model evaluation: General approach for solving 7
a classification problem, Decision Tree induction, Model over fitting: due to
presence of noise, due to lack of representation samples, Evaluating the performance
of classifier. Nearest Neighborhood classifier, Bayesian Classifier, Support vector
Machines: Linear SVM, Separable and Non Separable case.
III Association Problem Definition, Frequent Item-set generation, rule generation, compact 8
Analysis representation of frequent item sets, FP-Growth Algorithms. Handling Categorical,
Continuous attributes, Concept hierarchy, Sequential, Sub graph patterns
IV Clustering Over view, K-means, Agglomerative Hierarchical clustering, DBSCAN, Cluster 12
evaluation: overview, Unsupervised Cluster Evaluation using cohesion and
separation, using proximity matrix, Scalable Clustering algorithm
V Web data Introduction, Web terminology and characteristics, Web content mining, Web 12
mining usage mining, web structure mining, Search Engines: Characteristics,
Functionality, Architecture, Ranking of WebPages, Enterprise search
Total 45
Text Books:
1) Introduction to Data Mining, Tan, Steinbach and Vipin Kumar, Pearson Education, 2016
2) Data Mining: Concepts and Techniques, 2ndEdition, Jiawei Han and Micheline Kamber,ELSEVIER
Reference Books:
1) Data Mining: The Textbook, Springer, May 2015, Charu C. Aggarwal.
Web resources:
1) NPTEL: https://nptel.ac.in/courses/106/105/106105174/
2) https://www.saedsayad.com/data_mining.htm

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University

Course Code Course Title Hours Per Week Course Credit


L-T-P Type
MCA23 513T Natural Language Processing 4-0-0 DSCC 4

Prerequisite: Web Technology


Course Objective: To introduce the basics of Language processing from algorithmic viewpoint.

Course Outcome

CO1: Understand fundamental NLP concepts, gaining insights into text data processing techniques and developing skills in
tokenization, corpora analysis, and text normalization.
CO2: Explore N-Grams, evaluate language models, comprehend lexical and vector semantics, and delve into the world of
word embeddings.
CO3: Acquire proficiency in advanced NLP topics such as sequence models, Hidden Markov Models, neural networks,
convolutional and recurrent neural networks, attention mechanisms, transformers, and transfer learning.
CO4: Apply Naive Bayes classifiers, optimize sentiment analysis, address ethical concerns in classification, and master the
evaluation of models using metrics like precision, recall, and F-measure.

Module PARA Content Hours


Introduction, Overview of NLP, Importance and applications, Regular
Introduction to
Expressions, Basics, Applications in NLP, Handling words in NLP,
1 NLP and Basics 7
Introduction to corpora in NLP, Tokenization, Text Normalization,
of Text Processing
Techniques for text normalization, Minimum Edit Distance
N-Grams, Definition and applications, Evaluating Language Models,
Statistical Models
2 Techniques for evaluation, Sampling sentences, Generating sentences using 8
for NLP
language models, Smoothing, Techniques for smoothing

Lexical Semantics, Understanding, Vector Semantics, Introduction, Words


Semantic
and Vectors, Representing words as vectors, Cosine for measuring similarity,
Representations
3 Measuring similarity, Word Embeddings, Training Word Embeddings, 6
and Advanced
Techniques for training, Word Embeddings Evaluation, Methods for
Model evaluation
Sequence Models, Hidden Markov Models, Understanding, Conditional
Random Fields (CRFs), Neural Networks for NLP, Basics, Convolutional
Advanced NLP Neural Networks (CNNs) for NLP, Applications, Recurrent Neural Networks
4 12
Techniques (RNNs) for NLP, Understanding, Long Short-Term Memory (LSTM)
Networks, Introduction, Attention Mechanisms, Basics of attention
mechanisms, Transformers, Overview of transformer models
Naive Bayes Classifiers, Introduction, Training the Naive Bayes Classifier,
Techniques, Optimizing for Sentiment Analysis, Strategies, Applications
Advanced
beyond sentiment, Naive Bayes as a Language Model, Role in language
Linguistic
5 modelling, Evaluation: Precision, Recall, F-measure, Metrics, Test sets and 12
Annotation and
Cross-validation, Techniques for testing and validating, Statistical
Applications Significance Testing, Methods for significance testing, Avoiding Harms in
Classification, Ethical considerations
Books
Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to Natural Language
1.
Processing,Computational Linguistics and Speech, Pearson Publication, 2014
Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing with Python‖, First Edition, O‗Reilly
2.
Media, 2009.
REFERENCES

Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing, Second Edition, Chapman
1.
and Hall/CRC Press, 2010.
2. Breck Baldwin, ―Language Processing with Java and LingPipe Cookbook, Atlantic Publisher, 2015.
3. Carlo Ghezzi, Mehdi Jazayeri, Fundamentals of Software Engineering, PHI

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 514T Malware Analysis and Intrusion Detection 4-0-0 DSCC 4

Prerequisite: Cyber Security


Course Objective:
The basic objective is to prevention of the system from malware attacks.

Course outcome:
CO 1: To understand the concept of malware and reverse engineering.
CO 2: Implement tools and techniques of malware analysis.
CO 3: Implement tools and techniques of malware detection .

Module Topic Course Content Hours


I Introduction Malware classification, types, and platform specific issues with malware, Intrusion 9
into IT and operational network (OT) and their signs

II Basic Malware Manual Malware Infection analysis, signature based malware detection and 9
Analysis classification – pros and cons, and need for machine learning based techniques

III Advanced Static Analysis, Dynamic Analysis and Hybrid Analysis of Windows Malware, Linux 9
Techniques Malware and Android Malware
Malware
Analysis
IV Basic Intrusion Intrusion into network – Firewalls, Rule based techniques, signature based 9
Detection Techniques, Simple Machine Learning Models on Network Data
V Advanced Advanced Machine Learning Models for Intrusion Detection in IT Networks, 9
Intrusion Machine Learning in OT network especially with Cyber Physical Systems
Detection
Total 45

Books and References :

1. Stephen Northcutt and Judy Novak , Network Intrusion Detection”, 3rd edition by. ISBN: 0735712654.
2. Extrusion Detection: Security Monitoring for Internal Intrusions By Bejtlich, Pearson Education.
3. Guide to Intrusion Detection and Prevention Systems (IDPS) Recommendations: Recommendations of the National
Institute of Standards and Technology by Karen Scarfone and Peter Mell.
4. IETF RFC/RFP/standards related to Intrusion detection.
5. CCNP Security: Intrusion Prevention and Intrusion Detection Systems. By David Burns, OdunayoAdesina, Keith
Barker, Cisco Press.
6. Intrusion Detection and correlation: challenges and solutions: by Christopher Kruegel, Fredrik Valeur, Giovanni
Vigana, Advances in Information Security Volume 14, ISBN 0-387-23398-9 2005 Springer

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 516T Introduction To Cyber Security 3-1-0 DSCC 4
Pre-requisite : NIL
Course Objectives:

1. Understand the field of digital security and concepts of access control mechanism.
2. To introduce keywords and jargons involved in securing browser
3. Understanding network basic and familiarize on security of network protocols
4. Awareness and understanding on cyber-attacks and data privacy

Course Outcomes:
1. Apply a solid foundation in digital security and measures taken to protect device from threats.
2. Learning access control mechanism and understand how to protect servers
3. Understand the importance of a network basics and brief introduction on security of network protocols
4. To understand cyber-attacks and learn data privacy issues and preventive measures

Module Topic Course Content Hours

1 Introduction Security threats - Sources of security threats- Motives - Target Assets and 15
vulnerabilities – Consequences of threats- E-mail threats - Web-threats -
Intruders and Hackers, Insider threats, Cyber crimes. Network Threats: Active/
Passive – Interference – Interception –Impersonation – Worms –Virus – Spam’s
– Ad ware - Spy ware – Trojans and covert channels –Backdoors – Bots – IP,
Spoofing - ARP spoofing - Session Hijacking - Sabotage-Internal treats
Environmental threats - Threats to Server security.
2 Security Risk Assessment - Forensic Analysis - Security threat correlation –Threat 10
Threat awareness - Vulnerability sources and assessment- Vulnerability assessment
Management tools –Threat identification - Threat Analysis - Threat Modelling - Model for
Information Security Planning.
3 Security Authorization and Authentication - types, policies and techniques – Security 10
Elements certification - Security monitoring and Auditing - Security Requirements
Specifications – Security Policies and Procedures, Firewalls, IDS, Log Files,
Honey Pots
4 Access control Trusted Computing and multilevel security - Security models, Trusted 10
Systems,Software security issues, Physical and infrastructure security, Human
factors – Security awareness,training , Email and Internet use policies.

Books and References:

1. Swiderski, Frank and Syndex, “Threat Modelling”, Microsoft Press, 2004.


2. William Stallings and Lawrie Brown, “Computer Security: Principles and Practice”, Prentice Hall, 2008.
3. Joseph M Kizza, “Computer Network Security”, Springer Verlag, 2005
4. Thomas Calabres and Tom Calabrese, “Information Security Intelligence: Cryptographic Principles & Application”,
Thomson Delmar Learning, 2004.

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Type Credit
L-T-P
MCA23 508P Object Oriented Programming Lab using Java 0-0-4 DSCC 2
Prerequisite: NA

Course Objectives:

This course is about the implementation of Object-Oriented Programming (OOP) Concept using Java Programming Language.
Java as a class-based and pure OOP language is used to demonstrate and implement appropriate concepts and techniques. The
students are exposed to the concepts, fundamental syntax, and the thought processes behind object-oriented programming. By
end of the course, students will acquire the basic knowledge and skills necessary to implement object-oriented programming
techniques in software development using Java.

Course Outcomes (COs): At the end of the course, student will be able to

COs Course Outcomes

1 Understand the basic structure of Java Programming Language and the Object Oriented concepts in Java Programming

2 Use Exception handling and Multithreading concept tocreate efficient software applications.
3 Design and develop GUI based applications using swings

JAVA PROGRAM LIST

1 Write a Java program to print “Welcome to Girijananda Chowdhury University”.

2 Write a Java program to find the sum of even numbers upto 100.

3 Write a Java program to print the following output.


1
23
456
7 8 9 10
4 Write a Java program to read the different types of data from the user and display that data using Scanner class.

5 Write a Java program to read the different types of data from the user and display that data using command line
arguments.
6 Write a Java program that prompts the user for an integer and then prints out all prime numbers up to that integer

7 Write a Java Program to define a class, describe its constructor, overload the Constructors and instantiate its object

8 Write a Java Program to define a class, define instance methods and overload them and use them for dynamic
method invocation
9 Write a Java Program to implement inheritance and demonstrate use of method overloading
10 Write a Java Program to implement inheritance and demonstrate use of method overriding
11 Write a Java Program to implement multilevel inheritance by applying various access controls to its data members and
methods
12 Write a program to demonstrate use of implementing interfaces
13 Write a program to demonstrate use of extending interfaces
14 Write a Java program to implement the concept of importing classes from user defined package and creating
packages
15 Write a program to implement the concept of threading by extending Thread Class
16 Write a program to implement the concept of threading by implementing Runnable Interface
17 Write a program to implement the concept of Exception Handling using predefined exception

Signature Signature
Internal Member External Member / Expert
18 Write a program to implement the concept of Exception Handling by creating user defined Exceptions

19 Write a program using Applet to display a message in the Applet


20 Write a Java Program to demonstrate Keyboard event
21 Write a Java Program to demonstrate Mouse events
22 Write programs for using Graphics class
 to display basic shapes and fill them
 draw different items using basic shapes
 set background and foreground colors
23 Write a Menu Driven Program in Java which performs sorting of a group of integer values using bubble sort
method
24 Write a class called “Student” with
a) Instance variable roll_no, name, semester and branch
b) A method called “setdata ()” which takes 4 parameters and returns void. This method mustcontain statements to
set the values of instance variables of each object of” Student” class
c) A method called “calculate ()” which does not have any input parameter and returns a double value. This
method must contain statements to take input for marks of 5 subjects (Physics, Chemistry, Mathematics,
English and Hindi) and calculate the percentage of marks using formula:
Percentage marks= (Total marks/500) *100
The method must also contain a return statement to return the calculated percentage value
d) A method called “showdata ()” which does not take any parameter and returns void. Thismethod must contain
statement to display the values of roll no, name, semester, branch and percentage of mark of each object of
“Student” class
Write another class “StudentRecord” which contains the main () method. Inside the main() method write statements
to create 3 different object of “Student” class and display the values of their instance variable with the calculated
percentage of marks for each of them using Menu
25 Write a class called “Employee” with
a) Instance variables Employee code, Employee name and Basic salary
b) A parameterized constructor which contains statements to set the values of instance variables of each object of
“Employee” class
c) A method called “calculate ()” which does not have input parameter and it returns a doublevalue. This method
contains statements to calculate the gross salary of an Employee objectusing the formula
HRA= 60% of Basic salaryDA=
98% Basic salary
Gross Salary= Basic Salary + HRA + DA
This method must contain a return statement to return the calculated value of Gross salary
d) A method called “showdata ()” which does not take any parameter and return void. This method must contain
statements to display the values of instance variables and calculatedgross salary of each object of “Employee”
class
Write another class “EmployeeRecord” which contains the main () method. Inside the main()method write statements
to create 3 different object of “Employee” class and display the values of their instance variable with the calculated
gross salary for each of them using Menu

Text Books/Reference:

1. Matt Weisfeld: The Object Oriented Thought Process, Addison-Wesley.


2. Rambaugh et al.: Object Oriented Modeling and Design, PHI (EEE).
3. Rambaugh Booch, Jackobson : Unified Modelling Language Referance Mannual.
4. Barclay, Savage : Object-Oriented Design with UML and Java, Elsevier Butterworth-Heinemann

Signature Signature
Internal Member External Member / Expert
Girijananda Chowdhury University
Course Code Course Title Hours Per Week Course Credit
L-T-P Type
MCA23 508P DBMS Lab 0-0-4 DSCC 2
Prerequisite: NA
Course Objectives:
1. This Course will enable students to
2. Populate and query a database using SQL DDL/DML Commands
3. Declare and enforce integrity constraints on a database
4. Writing Queries using advanced concepts of SQL
5. Programming PL/SQL including procedures, functions, cursors and triggers
Course Outcomes:
1. At the end of the course the student will be able to:
2. Utilize SQL to execute queries for creating database and performing data manipulation
operations
3. Examine integrity constraints to build efficient databases
4. Apply Queries using Advanced Concepts of SQL
5. Build PL/SQL programs including stored procedures, functions, cursors and triggers
List of Experiments:
1) Execute all DDL, DML and DCL commands on sample tables.
2) Implementation of different types of operators and built-in functions with suitable examples
3) Implementation of different types of joins with suitable examples
4) Create views, partitions, Sequence, Indexes and locks for a particular DB
5) Implement different types of constraints on relations.
6) Implementation of sub queries and nested queries.
7) Implement Queries on Group By & Having Clauses, ALIAS, Sequence By, Order By
8) Control Structure
a) Write a PL/SQL block for Addition of Two Numbers
b) Write a PL/SQL block for IF, IF and else condition
c) Write a PL/SQL block for implementation of loops
d) Write a PL/SQL block for greatest of three numbers using IF and ELSEIF
9) Exception Handling- Implement the following with respect to exception handling. Raising
Exceptions, User Defined Exceptions, Pre-Defined Exceptions
10) Write PL/SQL block for an application using exception handling Procedures
a) Write a PL/SQL Procedure using Positional Parameters
b) Write a PL/SQL Procedure using notational parameters
c) Write a PL/SQL Procedure for GCD Numbers
d) Write a PL/SQL Procedures for cursor implementation (explicit and implicit cursors)
11) Functions:
a) Write a PL/SQL block to implement factorial using functions
b) Write a PL/SQL function to search an address from the given database
12) Write a DBMS program to prepare Pl/SQL reports for an application using functions.
13) Triggers:
a) Write a Trigger to pop-up the DML operations
b) Write a Trigger to check the age valid or not Using Message Alert.
c) Create a Trigger to Raise appropriate error code and error message.
d) Create a Trigger on a table so that it will update another table while inserting values
14) Write PL/SQL block for an application using cursors and all types
oftriggers.
15) Write a PL/SQL block for transaction operations of a typical
applicationusing package
Text Books:
1) Oracle: The Complete Reference by Oracle Press
2) Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
3) Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education, 2007
4) Quality Software Project Management, Futrell,Donald F. Shafer, Donald I. Shafer, PEA

Signature Signature
Internal Member External Member / Expert

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy