SEMESTER III

Computer Architecture

Objectives

This course enables students to understand the basic computer organization and its internal hardware architecture design.

Learning Outcomes

• Understand the basics of computer organization and computer architecture.
• Learn how micro-operations, interrupts and instruction cycles are executed in logic circuits.
• Understand memory organization and input-output organization of a simple microprocessor.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question of short answer type covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT I

Computer Organization and Digital Systems

Definition of Computer Organization, Computer Design and Computer Architecture.

Digital Systems: Basic Block Diagram of Computer.

ALU Design and Microoperations

Register Transfer Language, Bus and Memory Transfer.

Arithmetic Microoperations: Binary Adder Subtractor, Binary Incrementer, Arithmetic Circuit.

Logic Microoperations: Logic Circuit.

Shift Microoperations: 4-bit Combinational Shifter.

Arithmetic Logic Shift Unit.

UNIT II

Basic Computer Organization

Stored Program Organization, Von Neumann Architecture, Microoperations and Macrooperations.

Instruction Code Format, Direct and Indirect Addressing, Basic Computer Registers.

Types of Instructions

Memory Reference Instructions, Register Reference Instructions and Input Output Instructions.

Common Bus System, Instruction Cycle, Interrupt Cycle and Types of Interrupts.

Assembly Language

Introduction to Assembly Language, Assembly Language vs Machine Language.

UNIT III

Memory Organization

Memory Hierarchy, RAM and ROM Chips.

Memory Connection of Four 128x8 RAM and One 512x8 ROM Chip to CPU.

Associative Memory.

Cache Memory: Associative, Set Associative and Direct Mapping.

Virtual Memory: Paging and Segmentation.

Microprocessor Architecture

8086/8088 Features, Block Diagram, Memory Organization, Register Organization, Flag Register and Addressing Modes.

UNIT IV

Input Output Organization

Input Output Interface, IOP Design, Isolated I/O and Memory Mapped I/O.

Asynchronous Data Transfer

Source Initiated and Destination Initiated Strobe Control.

Handshaking Modes of Transfer, Programmed I/O Data Transfer, Interrupt Initiated Data Transfer.

Direct Memory Access (DMA)

DMA Controller, Cycle Stealing and Burst Mode DMA Transfer.

Suggested Readings

1. Mano, M. Morris : Computer System Architecture, Third Edition, Pearson Education India, 2007.
2. Mano, M. Morris and Rajib Mall : Computer System Architecture, Revised Third Edition, Pearson Education India, 2017.
3. Stallings, William : Computer Organization and Architecture: Designing for Performance, 11th Edition, Pearson Education India, 2022.
4. Hayes, John P. : Computer Architecture and Organization, 3rd Edition, McGraw Hill Education, 2017.
5. Chaudhuri, P. Pal : Computer Organization and Design, 3rd Edition, Prentice Hall of India Learning Pvt. Ltd., 2008.

Data Structure

Objective

This course helps students understand various data structures and the operations performed using them.

After completing this course, students will be able to use data structures for solving real world problems effectively.

Learning Outcomes

• Choose appropriate data structures for specified problem definitions.
• Perform various operations on different data structures.
• Analyze time and space complexity using Big O notation.
• Understand applications of data structures in real-world software development and systems.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT - I

Basic Concepts

Introduction to Complexity, Data Structure and Data Structure Operations.

Applications of Data Structure and Basic Data Structures.

Arrays

Introduction to Arrays, Types of Arrays, Memory Representation, Applications and Operations.

Stacks

Introduction, Memory Representation, Applications, Operations and Recursion.

UNIT - II

Linked List

Definition and Types of Linked Lists: Singly Linked List, Doubly Linked List, Header Linked List and Circular Linked List.

Operations: Traversing, Searching, Inserting, Deleting, Operations on Singly and Doubly Linked Lists.

Memory Representation, Applications and Polynomial Manipulation.

Queue

Introduction, Types of Queue, Memory Representation and Applications.

UNIT - III

Trees

Definition and Basic Concepts, Representation in Contiguous Storage, Binary Tree, Binary Tree Traversal.

Searching, Insertion and Deletion in Binary Trees, Binary Search Tree.

Graphs

Introduction, Memory Representation, Graph Traversal: DFS and BFS.

UNIT - IV

Searching

Linear Search and Binary Search.

Sorting

Bubble Sort, Insertion Sort, Selection Sort, Merge Sort and Quick Sort.

Comparison of Various Searching and Sorting Algorithms.

Suggested Readings

1. Schaum Lipschutz : Data Structures with C, Schaums’ Outlines Series, Tata McGraw Hill, 2017.
2. Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed : Fundamentals of Data Structures in C, W.H. Freeman and Company, 2018.
3. Yashavant Kanetkar : Data Structures Through C, BPB Publication, 2022.
4. R. S. Salaria : Data Structures and Algorithms using C, Khanna Publishing, 2022.
5. E. Balagurusamy : Data Structures Using C, Tata McGraw Hill, 2017.
6. Gilberg and Forouzan : Data Structure – A Pseudocode Approach with C, Cengage Learning, 2005.
7. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein : Data Structures Using C, Pearson Publication, 2019.

Practical Based on Data Structure

BCA-DSC-3(Min)-302P

List of Practicals

Array Operations

• Program for Array Traversal
• Program for Array Insertion
• Program for Array Deletion

Sorting Programs

• Bubble Sort
• Insertion Sort
• Selection Sort
• Merge Sort
• Quick Sort

Searching Programs

• Linear Search
• Binary Search

Stack and Queue Programs

• Program to Implement Stack using Array
• Program to Implement Linear Queue using Array
• Program to Implement Circular Queue using Array

Linked List Programs

• Program to Implement Linear Linked List
• Program to Implement Doubly Linked List

Binary Tree Programs

• Program to Perform Insertion in Binary Tree
• Program to Perform Deletion in Binary Tree
• Program to Perform Searching in Binary Tree

Graph Programs

• Program to Perform Traversal in Graph

Computer Oriented Numerical Methods

Objective

This course helps students learn essential numerical methods to solve complex mathematical problems using computer programs.

These techniques are useful in scientific and engineering applications.

Learning Outcomes

• Understand error analysis and propagation of errors in numerical computations.
• Solve linear, non-linear and differential equations using numerical methods.
• Perform interpolation and numerical integration for given data.
• Implement numerical algorithms when analytical solutions are not possible.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.
• Students can use only Basic Scientific (Non-programmable and Non-storage) Calculators.
• Log tables are allowed and may be provided for computation.

UNIT I

Numerical and Error Analysis

Introduction, Need of Numerical Methods, Numerical Analysis vs Numerical Methods.

Exact and Approximate Numbers, Accuracy and Precision, Significant Digits.

Measures of Error: Absolute Error, Relative Error and Percentage Error.

Types of Errors: Blunder Error, Modeling Error, Inherent Error, Numerical Errors such as Round Off, Chopping and Truncation Errors.

Error Propagation in Addition, Subtraction, Multiplication and Division.

Arithmetic of Normalized Floating Point Numbers and Error Consequences.

UNIT II

Types of Equations

Linear, Quadratic, Higher Degree Polynomial and Transcendental Equations.

Non-Linear Equations

Direct and Indirect Methods, Bracketing and Open End Iterative Methods.

Choosing Initial Approximation: Largest Possible Root, Search Bracket and Search Interval.

Termination Criteria and Intermediate Value Theorem.

Methods to Find Roots of Non-Linear Equations:

• Bisection Method
• False Position Method
• Newton Raphson Method
• Birge Vieta Method

UNIT III

Simultaneous Linear Equations

Direct Methods: Gauss Elimination Method, Concept of Pivoting and Gauss-Jordan Method.

Iterative Method: Gauss Seidal Method.

Interpolation

Need of Interpolation, Interpolation vs Extrapolation.

Finite Differences: Forward, Backward and Divided Difference Tables.

Methods of Interpolation:

• Newton’s Forward Difference Method
• Newton’s Backward Difference Method
• Newton’s Divided Difference Method
• Lagrange’s Method

Concept of Inverse Interpolation.

UNIT IV

Numerical Integration

Newton-Cotes Integration Formulae:

• Trapezoidal Rule
• Simpson’s 1/3rd Rule
• Simpson’s 3/8th Rule

Ordinary Differential Equations

Methods to Solve ODEs:

• Euler’s Method
• Runge-Kutta Method (2nd Order)
• Runge-Kutta Method (4th Order)
• Predictor Corrector Method
• Modified Euler’s Method

Suggested Readings

1. Salaria, R.S. : Computer Oriented Numerical Methods: Theory, Problems, Algorithms & Implementation Using C, C++ & Python Languages, Sixth Edition, Khanna Publishers, New Delhi, 2023.
2. Rajaraman, V. : Computer Oriented Numerical Methods, 4th Edition, Prentice Hall of India Pvt. Ltd., New Delhi, 2019.

Practical Based on Computer Oriented Numerical Methods

BCA-DSC-3(Min)-303P

Programs in C/C++ for Numerical Methods

1. Programs for Non-Linear Equations

• Implementation of Bisection Method
• Implementation of False Position Method
• Implementation of Newton Raphson Method
• Implementation of Birge Vieta Method

2. Programs for Simultaneous Linear Equations

• Implementation of Gauss Elimination Method
• Implementation of Gauss Jordan Method
• Implementation of Gauss Seidal Method

3. Programs for Interpolation

Equal Intervals

• Newton’s Forward Difference Method
• Newton’s Backward Difference Method

Unequal Intervals

• Newton’s Divided Difference Method
• Lagrange’s Method

4. Programs for Numerical Integration

• Trapezoidal Rule
• Simpson’s 1/3rd Rule
• Simpson’s 3/8th Rule

5. Programs for Ordinary Differential Equations

• Runge-Kutta Method
• Euler’s Method

Introduction to Machine Learning

Objective

This course introduces the basic concepts of Machine Learning and implementation of Machine Learning algorithms.

Learning Outcomes

• Learn the basics of Machine Learning and its applications.
• Understand data preprocessing, regression and data reduction techniques.
• Understand supervised learning algorithms and their implementation.
• Understand unsupervised learning algorithms, deep learning concepts and their implementation.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT - I

Introduction to Machine Learning

Concept of Machine Learning, Supervised Learning, Unsupervised Learning and Reinforcement Learning.

Training Data vs Test Data, Designing a Learning System, Issues in Machine Learning and Applications of Machine Learning.

UNIT - II

Data Preprocessing

Understanding Data and Data Preprocessing.

Normalizing Data, Feature Scaling and Feature Selection Techniques.

Overfitting and Data Reduction using Principal Component Analysis (PCA).

UNIT - III

Supervised Learning

Concept of Classification.

Decision Tree, K-Nearest Neighbor, Naïve Bayes Classifier, Support Vector Machine (SVM).

Neural Networks and Backpropagation Algorithm.

Classification Evaluation Metrics.

UNIT - IV

Unsupervised Learning and Deep Learning

K-Means Clustering, Limits of K-Means and DBSCAN.

Concept of Deep Learning.

Architecture of Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN).

Suggested Readings

1. Andreas C. Müller and S. Guido : Introduction to Machine Learning with Python, O'Reilly, 2017.
2. Amanda Casari and Alice Zheng : Feature Engineering for Machine Learning, O'Reilly Media Inc., 2018.
3. Sharma, A. : Essentials of AI and Soft Computing, PHI Learning, 2024.
4. Mitchell, T.M. : Machine Learning, McGraw Hill Education, 2017.
5. Ian Goodfellow, Yoshua Bengio and Aaron Courville : Deep Learning, MIT Press, 2016.
6. Alpaydin, E. : Introduction to Machine Learning, MIT Press, Fourth Edition, 2020.

SEMESTER IV

Operating System Concepts

Objective

This course helps students understand the basic concepts of Operating Systems, including process management, memory management, hardware interaction and Linux operating system concepts.

Learning Outcomes

• Understand operating system features, types and functions.
• Learn process management and CPU scheduling algorithms.
• Understand deadlocks and Banker’s Algorithm concepts.
• Learn memory management techniques.
• Understand basic Linux programming.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT - I

Operating Systems

Introduction to Operating Systems, Need and Services of Operating Systems.

Types of Operating Systems: Multi-user, Multitasking, Multiprocessing, Real-Time Operating Systems, Parallel Systems and Distributed Systems.

Process Management

Introduction to Process, Process Control Block (PCB), Process States.

CPU Scheduling

Scheduling Criteria and Scheduling Algorithms:

• FCFS
• SJF
• Priority Scheduling
• Round Robin
• Multilevel Queue Scheduling
• Multilevel Feedback Queue Scheduling

UNIT - II

Deadlocks

Necessary and Sufficient Conditions for Deadlocks.

Methods for Handling Deadlocks, Deadlock Detection and Recovery.

Memory Management

Logical vs Physical Address Space, Swapping.

Fragmentation: External Fragmentation and Internal Fragmentation.

Compaction, Paging, Segmentation and Virtual Memory.

Demand Paging and Page Replacement Algorithms:

• FIFO
• Optimal Page Replacement
• LRU

UNIT - III

Introduction to Linux

Linux Shell, Kernel, Features of Linux, History of Linux, Minimum System Requirements.

Boot and Root Disks, Starting and Stopping Linux System, Logging In and Logging Out.

General Purpose Utilities

Commands: cal, date, echo, printf, bc, script, passwd, more, less, who, uname and tty.

Using File System

Types of Files, File Names, Parent Directory, Subdirectory, Home Directory, Naming Rules for Directories.

Important Directories in Linux File System, Absolute and Relative Filenames.

File and Directory Handling Commands

cat, mkdir, cd, ls, pwd, mv, cp, rm, rmdir.

File Handling Commands: wc, cmp, comm, diff.

Wildcards with Files and Directories, File and Directory Permissions, Changing Group Ownership, umask Settings, Environment Variables.

I/O Redirection, Piping, tee, pr, head, tail, cut, paste, sort, uniq, Regular Expressions and grep.

UNIT - IV

Process Management in Linux

Types of Processes, ps, bg, fg, nice and kill commands.

vi Editor

Starting vi, vi Modes, Inserting Text, Quitting vi, Deleting Text, Copying and Moving Text, Searching and Replacing Text.

Basic Shell Programming

Shell Scripts, read command, if statement, Numeric and String Comparison Operators, case statement, expr command, while loop and for loop.

System Administration Activities

Superuser (su) Command, Taking Backup using tar, Managing Disk Space, Mounting and Unmounting File System, Managing Users.

Managing Printers using lpd, mknod, lpc, lpq and lprm.

Suggested Readings

1. Peterson, J.L. and Silberschatz, A. : Operating System Concepts, Addison Wesley.
2. John Goerzen : Linux Programming Bible, IDG Books, New Delhi, 2000.
3. A.S. Tenenbaum : Operating System Design and Implementation, PHI, 1989.
4. Petersen Richard : Linux: The Complete Reference, McGraw Hill, 2017.
5. Brinch Hansen : Operating System Principles, Prentice Hall of India.
6. Haberman, A.N. : Introduction to Operating System Design, Galgotia Publication, New Delhi.
7. Sumitabha Das : Your Unix – The Ultimate Guide, TMH, 2000.

Database Management System

Objective

This course helps students understand the basic concepts of Database Management Systems and implement database concepts using database software.

Learning Outcomes

• Gain a solid understanding of fundamental database concepts.
• Understand the basic elements of Relational Database Management Systems.
• Learn SQL and construct database queries using SQL.
• Understand programming concepts using PL/SQL.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT - I

Basic Concepts

Historical Perspective, File System vs DBMS, Characteristics of Database Approach, Abstraction and Data Integration, Database Users, Advantages and Disadvantages of DBMS.

Database System Concepts and Architecture

Schemas and Instances, DBMS Architecture, Data Independence, Database Languages and Interfaces, DBMS Functions and Component Modules.

Entity Relationship Model

Entity Types, Entity Sets, Attributes and Keys, Relationships, Relationship Types, Roles and Structural Constraints.

Design Issues, Weak Entity Types, E-R Diagrams and Design of E-R Database Schema.

UNIT - II

Relational Data Model

Relational Model Concepts, Integrity Constraints over Relations and Relational Algebra Basic Operations.

Conventional Data Models

Overview of Network Data Model and Hierarchical Data Model.

Relational Database Design

Functional Dependencies, Decomposition, Desirable Properties of Decomposition.

Normal Forms: 1NF, 2NF, 3NF and BCNF.

RDBMS

RDBMS Terminology and Codd’s 12 Rules for RDBMS.

UNIT - III

Understanding SQL - I

SQL Data Types, Creating Tables, Creating Tables from Another Table, Inserting Values, Updating Columns, Deleting Rows and Dropping Columns.

Querying Database Tables, Conditional Retrieval of Rows, Working with Null Values, Pattern Matching and Ordering Query Results.

Aggregate Functions, Grouping Results, Creation and Deletion of Views.

Managing Privileges using GRANT and REVOKE Commands, COMMIT and ROLLBACK.

Functions: Character Functions, Date Functions and Group Functions.

UNIT - IV

Understanding SQL - II

Querying Multiple Tables using: Equi Joins, Cartesian Joins, Outer Joins and Self Joins.

SET Operators: UNION, INTERSECT and MINUS.

Introduction to Nested Queries.

PL/SQL

Introduction to PL/SQL, Advantages of PL/SQL, PL/SQL Block Structure and PL/SQL Architecture.

PL/SQL Data Types, Variables and Constants, Scope and Visibility of Variables, Assignments and Expressions, Operator Precedence.

Conditional and Iterative Control Statements, Cursor Management in PL/SQL, Implicit and Explicit Cursor Attributes.

Exception Handling in PL/SQL: Predefined Exceptions and User Defined Exceptions.

Database Triggers, Types of Triggers and Dropping Triggers.

Suggested Readings

1. Elmasri & Navathe : Fundamentals of Database Systems, 7th Edition, Addison Wesley, 2017.
2. Ivan Bayross : SQL and PL/SQL, Fourth Edition, BPB Publication, New Delhi, 2020.
3. C. J. Date : An Introduction to Database Systems, 8th Edition, Addison Wesley, 2003.
4. Korth & Silberschatz : Database System Concepts, 6th Edition, McGraw Hill International Edition, 2010.
5. Bipin C. Desai : An Introduction to Database System, Galgotia Publication, New Delhi, 2015.
6. Raghu Ramakrishnan and Johannes Gehrke : Database Management Systems, 3rd Edition, McGraw Hill International Edition, 2002.

Practical Based on Database Management System

BCA-DSC-4(Maj)-402P

List of Practicals

Implementation of SQL Concepts

• DDL Commands
• DML Commands
• DCL Commands
• TCL Commands
• Data Retrieval Queries
• Functions and Aggregate Functions
• Views
• Joins
• Set Operators

Implementation of Programs in PL/SQL

1. Write PL/SQL blocks to show the declaration of variables.
2. Write a PL/SQL program to check whether a number is even or odd.
3. Write a PL/SQL program to find the greatest of three numbers.
4. Write a PL/SQL program to display the grade of a student using else-if ladder.
5. Write a PL/SQL program to display the description against a grade using CASE statement.
6. Write a PL/SQL program to print first n numbers.
7. Write a PL/SQL program to find factorial of a number.
8. Write a PL/SQL program to print table of a given number.
9. Write a PL/SQL program to print average of first n numbers.
10. Write a PL/SQL program to reverse a given number.
11. Write a PL/SQL program to show the use of nested loops to print a pattern.
12. Write a PL/SQL program to show the use of %TYPE and %ROWTYPE.
13. Write a PL/SQL program to demonstrate implicit and explicit cursors.
14. Write a PL/SQL program to include implicit and explicit exceptions.
15. Write a PL/SQL program to show the execution of triggers.

Information System Design and Implementation

Objectives

This course helps students understand the various aspects of Information Systems, their analysis, design and implementation.

It also introduces students to software development concepts and associated methodologies.

Learning Outcomes

• Understand System Development Life Cycle and the role of a System Analyst.
• Learn SRS, Flow Diagrams and structured analysis tools.
• Understand feasibility study, testing and quality assurance concepts.
• Learn system implementation, maintenance and installation procedures.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT - I

System Concepts and Information Systems Environment

Definition and Characteristics of a System, Elements of a System, Environment, Boundaries and Interface.

Types of Systems: Physical Systems, Abstract Systems, Open Systems, Closed Systems and Man-Made Information Systems.

Types of System Models.

System Development Life Cycle (SDLC)

Introduction to Various Phases: Recognition of Need, Feasibility Study, Analysis, Design, Implementation, Post-Implementation and Maintenance.

Role of System Analyst

Skills of a System Analyst and Duties of a System Analyst.

UNIT - II

System Planning and Initial Investigation

Bases for Planning in System Analysis, Initial Investigation, Determining User Information Requirements, Problem Definition and Project Initiation.

Background Analysis, Fact Finding, Fact Analysis and Determination of Feasibility.

Information Gathering

Introduction to Information Gathering, Review of Literature, Procedures and Forms, On-site Observation, Interviews and Questionnaires.

Tools of Structured Analysis

SRS Features and Structure.

Data Flow Diagram (DFD), Data Dictionary, Decision Tree, Structured English, Decision Table and ER Diagrams.

Advantages and Disadvantages of Structured Analysis Tools.

UNIT - III

Feasibility Study

System Performance, Statement of Constraints, Identification of Specific System Objectives and Description of Outputs.

Feasibility Considerations, Steps in Feasibility Analysis and Feasibility Report.

System Design

Logical Design, Physical Design, Structured Design and Functional Decomposition.

System Testing

System Testing, Test Phases, Types of System Testing, White Box Testing (WBT) and Black Box Testing (BBT), Object Oriented Testing.

Quality Assurance

Quality Assurance, Goals in System Life Cycle, Levels of Quality Assurance and Trends in Testing.

UNIT - IV

Implementation and Software Maintenance

Introduction to System Conversion, Activity Network for Conversion, File Conversion, User Training and Post Implementation Review.

Software Maintenance, Primary Activities of Maintenance Procedure, Reducing Maintenance Costs and Types of Software Maintenance.

Hardware and Software Selection

Types of Software, Procedure for Hardware and Software Selection.

Major Phases in Selection, Evaluation and Validation, Vendor Selection and Post Installation Review.

Criteria for Software Selection and Evaluation Process.

Suggested Readings

1. W.S. Jawadekar and S.S. Dubey : Management Information System, McGraw Hill, Sixth Edition, 2020.
2. Alan Dennis, Barbara Haley Wixom and Roberta M. Roth : Systems Analysis and Design, John Wiley & Sons Inc., 2018.
3. Hardgrave Bill C., Siau Keng and Chiang Roger H.L. : Systems Analysis and Design: Techniques, Methodologies, Approaches and Architectures, M.E. Sharpe Publications, 2017.
4. E.M. Awad : Systems Analysis and Design, Galgotia Publications, 2015.

Cyber Security

Objective

This course helps students understand Cyber Security concepts and their practical implications in the digital world.

Learning Outcomes

• Understand the architecture and regulatory aspects of cyberspace and key cyber security terminologies.
• Identify web-based attacks, network vulnerabilities and exploit tools.
• Understand different types of cybercrimes and cyber laws.
• Learn data privacy, data protection and cyber security regulations.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT - I

Introduction to Cyber Security

Defining Cyberspace, Overview of Computer and Web Technology.

Architecture of Cyberspace, Communication and Web Technology, Internet, World Wide Web, Advent of Internet, Internet Infrastructure for Data Transfer and Governance.

Internet Society, Regulation of Cyberspace, Concept of Cyber Security, Issues and Challenges in Cyber Security.

Cyber Security Terminologies

Cyberspace, Attack, Attack Vector, Attack Surface, Threat, Risk, Vulnerability, Exploit, Exploitation, Hacker, Controls, Authentication, Access Control and Cryptography.

UNIT - II

Web Attacks

Browser Attacks, Web Attacks Targeting Users, Obtaining User or Website Data, Email Attacks.

Network Vulnerabilities

Overview of Vulnerability Scanning, Open Ports, Port and Service Identification, Banner and Version Check, Traffic Probe and Vulnerability Probe.

Vulnerability Examples, OpenVAS, Metasploit, Network Vulnerability Scanning, Netcat, Socat, Network Sniffers and Injection Tools.

UNIT - III

Cyber Crime and Cyber Law

Classification of Cyber Crimes, Cyber Crimes Targeting Computers and Mobiles, Cyber Crime against Women and Children, Financial Frauds and Social Engineering Attacks.

Malware, Ransomware Attacks, Zero Day Attacks and Zero Click Attacks.

Cybercriminals Modus Operandi, Reporting of Cyber Crimes, Remedial and Mitigation Measures.

Legal Perspective of Cyber Crime, IT Act 2000 and Amendments, Cyber Crime Offences, Organizations dealing with Cyber Crime and Cyber Security in India.

UNIT - IV

Data Privacy and Data Security

Defining Data, Metadata, Big Data and Non-Personal Data.

Data Protection, Data Privacy, Data Security and Personal Data Protection Bill.

Data Protection Principles, Big Data Security Issues and Challenges.

Data Protection Regulations: GDPR, PIPEDA, Social Media Data Privacy and Security Issues.

Cyber Security Threats and Attacks

Firewalls and Packet Filters, Password Cracking, Keyloggers, Spyware, Viruses and Worms, Trojan and Backdoors.

Steganography, DOS and DDOS Attacks, SQL Injection, Buffer Overflow and Attacks on Wireless Networks.

Suggested Readings

1. P.W. Singer and Allan Friedman : Cyber Security and Cyber War: What Everyone Needs to Know, 2014.
2. Sumit Belapure and Nina Godbole : Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives, Wiley India Pvt. Ltd., 2011.
3. Henry A. Oliver : Security in the Digital Age: Social Media Security Threats and Vulnerabilities, Create Space Independent Publishing Platform, 2015.
4. Marjie T. Britz : Cybercrime and Digital Forensics: An Introduction, 3rd Edition, 2019.
5. Nosseir, Ekici and Cavallaro : Security and Privacy in Communication Networks, 2021.
6. W. Krag Brothy : Information Security Governance, Guidance for Information Security Managers, Wiley Publication, 2009.
7. Martin Weiss and Michael G. Solomon : Auditing IT Infrastructures for Compliance, 2nd Edition, Jones Bartlett Learning, 2015.

Python Programming

Objective

This course helps students understand the basic concepts of Python programming, including lists, tuples, dictionaries, classes and file handling.

It also enables students to develop programs using Python libraries and functions.

Learning Outcomes

• Understand the fundamentals of Python programming, syntax and semantics.
• Use lists, tuples, dictionaries and functions in Python.
• Create and manage files in Python.
• Use Python modules and standard library functions.

Note

• The Question Paper will consist of Four Units.
• Examiner will set a total of nine questions comprising two questions from each Unit and one compulsory question covering the whole syllabus.
• Students are required to attempt one question from each Unit and the compulsory question.
• All questions carry equal marks unless specified.

UNIT - I

Introduction to Python

Introduction to Python Programming, Data Types, Operators, Expressions, Variables and Scope of Variables.

Type Conversion in Python.

Conditional Statements

if Statement, if-else Statement, if-elif-else Chain and if Statement with Lists.

Loops

Selection, Indentation, Repetition, Break Statement, Continue Statement, Nested Loops, while Loop with Lists and Dictionaries.

Strings

Introduction to Strings, String Operations, Traversal of Strings, String Methods and Inbuilt Functions.

UNIT - II

Lists

Definition, Operations, Traversal, Methods and Inbuilt Functions.

Nested Lists, Copying Lists, Lists as Arguments, Mutable and Immutable Data Types.

Tuples

Introduction, Operations, Traversal, Methods, Inbuilt Functions and Nested Tuples.

Dictionaries

Introduction, Traversal, Methods, Inbuilt Functions and Manipulating Dictionaries.

UNIT - III

Functions

Definition of Functions, Advantages of Functions, User Defined Functions, Defining Functions, Passing Arguments, Return Values and Passing Lists to Functions.

Python Standard Libraries.

Classes

Creating and Using Classes, Working with Classes and Instances, Importing Classes and Python Standard Library.

UNIT - IV

Exception Handling

Exceptions and Errors, try-except Block, else Block, Handling ZeroDivisionError and FileNotFoundError Exception.

File Handling

Introduction to File Handling, Types of Files, Opening and Closing Files, Writing to Files, Reading from Files, Setting Offset in Files, Creating and Traversing Files.

Suggested Readings

1. Mark Lutz : Learning Python, 5th Edition, O'Reilly Media Inc., 2015.
2. Brian Draper : Python Programming: A Complete Guide for Beginners to Master Python Programming Language, CreateSpace Independent Publishing, 2016.
3. Adam Stark : Python Programming for Beginners, CreateSpace Independent Publishing Platform, 2016.
4. David M. Beazley : Python Essential Reference, 4th Edition, Pearson Education Inc., 2009.
5. John M. Zelle : Python Programming: An Introduction to Computer Science, 2nd Edition, 2003.
6. Eric Matthes : Python Crash Course, 2nd Edition, No Starch Press, 2019.

Practical Based on Python Programming

BCA-DSC-4(Min)-405P

List of Practicals

1. Program to find the largest out of two numbers.
2. Program to find whether a given number is even or odd.
3. Program to print the first ten natural numbers.
4. Program to find the factorial of a number.
5. Program to find whether a given number is prime or not.
6. Program to find whether a given string is palindrome or not.
7. Program to implement string functions: len(), count(), join() and split().
8. Program to print all the elements of a list.
9. Program to reverse the elements of a list.
10. Program to find whether an element exists in a list or not.
11. Program to clear a list.
12. Program to copy a list.
13. Program to find the largest and smallest elements from a list.
14. Program to find the length of a tuple.
15. Program to remove tuples from a list.
16. Program to sort tuples.
17. Program to create a dictionary, access dictionary items, add items, remove items, change items and find dictionary length.
18. Program to swap two numbers.
19. Program to implement recursion.
20. Simple programs to implement classes and objects in Python.
21. Program to handle ZeroDivisionError and FileNotFoundError exceptions.
22. Program to read from and write to a file.