RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science and Engineering, VII-Semester

CS701 Software Architectures

Pre-Requisite: Software Engineering

Course Outcomes:
After completing the course student should be able to:
1. Describe the Fundamentals of software architecture, qualities and terminologies.
2. Understand the fundamental principles and guidelines for software architecture design,
architectural styles, patterns, and frameworks.
3. Use implementation techniques of Software architecture for effective software development.
4. Apply core values and principles of software architectures for enterprise application development.

Course Contents:

Unit 1. Overview of Software development methodology and software quality model, different models of
software development and their issues. Introduction to software architecture, evolution of software
architecture, software components and connectors, common software architecture frameworks,
Architecture business cycle – architectural patterns – reference model.

Unit 2. Software architecture models: structural models, framework models, dynamic models, process
models. Architectures styles: dataflow architecture, pipes and filters architecture, call-and return
architecture, data-centered architecture, layered architecture, agent based architecture, Micro-services
architecture, Reactive Architecture, Representational state transfer architecture etc.

Unit 3. Software architecture implementation technologies: Software Architecture Description Languages

Unit 4. Software Architecture analysis and design: requirements for architecture and the life-cycle view
of architecture design and analysis methods, architecture-based economic analysis: Cost Benefit Analysis
Method (CBAM), Architecture Tradeoff Analysis Method (ATAM). Active Reviews for Intermediate
Design (ARID), Attribute Driven Design method (ADD), architecture reuse, Domain –specific Software
architecture.

Unit 5. Software Architecture documentation: principles of sound documentation, refinement, context

Text Books
1. Bass, L., P. Clements, and R. Kazman, “Software Architecture in Practice”, Second Edition, Prentice-
Hall.
2. Jim Keogh, “J2EE – Complete Reference”, Tata McGraw Hill.
3. Dikel, David, D. Kane, and J. Wilson, “Software Architecture: Organizational Principles and
Practices”, Prentice-Hall.
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science and Engineering, VII-Semester

Departmental Elective – CS702 (D) Big Data

Course Outcomes:

1. Students should be able to understand the concept and challenges of Big data.

2. Students should be able to demonstrate knowledge of big data analytics.

3. Students should be able to develop Big Data Solutions using Hadoop Eco System

4. Students should be able to gain hands-on experience on large-scale analytics tools.

5. Students should be able to analyse the social network graphs.

Course Content
Unit1: Introduction to Big data, Big data characteristics, Types of big data, Traditional versus Big
data, Evolution of Big data, challenges with Big Data, Technologies available for Big Data,
Infrastructure for Big data, Use of Data Analytics, Desired properties of Big Data system.
Unit2: Introduction to Hadoop, Core Hadoop components, Hadoop Eco system, Hive Physical
Architecture, Hadoop limitations, RDBMS Versus Hadoop, Hadoop Distributed File system,
Processing Data with Hadoop, Managing Resources and Application with Hadoop YARN,
MapReduce programming.

Unit3: Introduction to Hive Hive Architecture, Hive Data types, Hive Query Language, Introduction
to Pig, Anatomy of Pig, Pig on Hadoop, Use Case for Pig, ETL Processing, Data types in Pig
running Pig, Execution model of Pig, Operators, functions,Data types of Pig.

Unit4: Introduction to NoSQL, NoSQL Business Drivers, NoSQL Data architectural patterns,
Variations of NOSQL architectural patterns using NoSQL to Manage Big Data, Introduction to
MangoDB

Unit5: Mining social Network Graphs: Introduction Applications of social Network mining, Social
Networks as a Graph, Types of social Networks, Clustering of social Graphs Direct Discovery of
communities in a social graph, Introduction to recommender system.

Text Books:
1. RadhaShankarmani, M. Vijaylakshmi, " Big Data Analytics", Wiley, Secondedition
2. Seema Acharya, SubhashiniChellappan, " Big Data and Analytics", Wiley, Firstedition

Reference Books:
1. KaiHwang,Geoffrey C., Fox. Jack, J. Dongarra, “Distributed and Cloud Computing”,
Elsevier, Firstedition
2. Michael Minelli, Michele Chambers, AmbigaDhiraj, “Big Data Big Analytics”,Wiley
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science and Engineering, VII-Semester

Open Elective – CS703 (A) Cryptography & Information Security

COURSE OUTCOMES:
CO1: Understanding of the basics of Cryptography and Network Security and working knowledge of
Mathematics used in Cryptology.
CO2: Understanding of previous attacks on cryptosystems to prevent future attacks from securing a
message over an insecure channel by various means.
CO3: Knowledge about how to maintain the Confidentiality, Integrity and Availability of a data.
CO4: Understanding of various protocols for network security to protect against the network threats.
CO5: Getting hands-on experience of various Information Security Tools.

UNIT I:
Mathematical Background for Cryptography: Abstract Algebra, Number Theory, Modular Inverse,
Extended Euclid Algorithm, Fermat's Little Theorem, Euler Phi-Function, Euler's theorem.
Introduction to Cryptography: Principles of Cryptography, Classical Cryptosystem, Cryptanalysis on
Substitution Cipher (Frequency Analysis), Play Fair Cipher, Block Cipher. Data Encryption Standard
(DES), Triple DES, Modes of Operation, Stream Cipher.

UNIT II:
Advanced Encryption Standard (AES), Introduction to Public Key Cryptosystem, Discrete Logarithmic
Problem, Diffie-Hellman Key Exchange Computational & Decisional Diffie-Hellman Problem, RSA
Assumptions & Cryptosystem,RSA Signatures & Schnorr Identification Schemes, Primarily Testing,
Elliptic Curve over the Reals, Elliptic curve Modulo a Prime., Chinese Remainder Theorem.

UNIT III:
Message Authentication, Digital Signature, Key Management, Key Exchange, Hash Function. Universal
Hashing, Cryptographic Hash Function, MD, Secure Hash Algorithm (SHA), Digital Signature Standard
(DSS), Cryptanalysis: Time-Memory Trade-off Attack, Differential Cryptanalysis. Secure channel and
authentication system like Kerberos.

UNIT IV:
Information Security: Threats in Networks, Network Security Controls–Architecture, Wireless Security,
Honey pots, Traffic Flow Security, Firewalls – Design and Types of Firewalls, Personal Firewalls,
IDS, Email Security: Services Security for Email Attacks Through Emails, Privacy-Authentication of
Source Message, Pretty Good Privacy(PGP), S-MIME. IP Security: Overview of IPSec, IP& IP version 6
Authentication, Encapsulation Security Payload ESP, Internet Key Exchange IKE, Web
Security: SSL/TLS, Basic protocols of security. Encoding –Secure Electronic Transaction SET.

UNIT V:Cryptography and Information Security Tools: Spoofing tools: like Arping etc., Foot
printing Tools (ex-nslookup, dig, Whois,etc..), Vulnerabilities Scanning Tools (i.e. Angry IP,
HPing2, IP Scanner, Global Network Inventory Scanner, Net Tools Suite Pack.), NetBIOS Enumeration
Using NetView Tool, Steganography Merge Streams, Image Hide, Stealth Files, Blindsideusing:STools,
Steghide, Steganos.Stegdetect, Steganalysis - Stego Watch- Stego Detection Tool, StegSpy.Trojans
Detection Tools( i.e. Netstat, fPort, TCPView, CurrPorts Tool, Process Viewer), Lan Scanner Tools
(i.e.look@LAN, Wireshark, Tcpdump). DoS Attack Understanding Tools- Jolt2, Bubonic.c, Land and
LaTierra, Targa, Nemesy Blast, Panther2, Crazy Pinger, Some Trouble, UDP Flood, FSMax.