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

R2023 I MCA - First Semester Syllabus

Uploaded by

tamilzhan da
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
15 views

R2023 I MCA - First Semester Syllabus

Uploaded by

tamilzhan da
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

`

23MAT601 APPLIED STATISTICS FOR DATA ANALYSIS L T P C


3 0 0 3
COURSE OBJECTIVES:
1. To impart the knowledge on basics of statistics, distributions and measures like central tendency and
dispersion.
2. To expose the statistical methods for analysis of variance and control limits.
UNIT I STATISTICAL DATA REPRESENTATIONS 9+3
Frequency distributions of data: cumulative and relative frequency distributions- Graphical representation of data
– Pie charts, Bar graphs, Histogram, Frequency Polygon and Ogives.
UNITII QUANTITATIVE STASTICAL MEASURES 9+3
Measures of Central tendency: Arithmetic Mean, Median, Mode - Measures of Dispersion: Range, Quartile
deviation, Standard deviation, Variance and Co-efficient of Variation.
UNIT III TESTING OF HYPOTHESIS 9+3
Sampling distributions – Testing of hypothesis for large samples by Z-test and small samples by Student’s t-test
for single Mean, Proportion, equality of means and equality of proportions – F- test for single variance and
equality of variances – Chi-square test for Goodness of fit and Independence of attributes.
UNIT IV DESIGN OF EXPERIMENTS 9+3
ANOVA(Analysis of variance) – Completely Randomized Design(CRD-one way classification)– Randomised
Block Design (RBD-two way classification) - Latin Square Design (LSD-Three way classification) - Control
charts for measurements: mean chart or x - chart, R- chart.
UNIT V DATA ANALYSIS 9+3
Correlation analysis : Karl Pearson’s Coefficient of Correlation - Regression Analysis: Least Square fit of a
Linear Regression -Two lines of Regression - Multivariate Analysis: Random vectors and matrices - mean
vectors and covariance matrices – multivariate normal density function- Principal Component Analysis -
Population Principal Components.
L :45 T:15 P: 0 Total: 60 PERIODS
Note : Use of approved statistical table is permitted in the examination.
TEXT BOOKS
1 Gupta.S.C.,&Kapoor,V.K., “Fundamentals of mathematical statistics”, 11th edition, Sultan Chand & Sons publishers, New Delhi,
2013.
2. Levin R.I., Rubin S. David, “Statistics for Management”, Eight edition, Pearson, 2017. [e-resource: Levin R.I., Rubin S. David,
“Statistics for Management”, Pearson, 2019].
REFERENCES
1 Veerarajan.T., “Probability, Statistics and Random Processes”, Tata McGraw-Hill publishing company Limited, New Delhi,
2014.
2 R.E. Walpole, R.H. Myers, S.L. Myers, and K Ye, “Probability and Statistics for Engineers and Scientists”, Pearson Education,
Asia , 8th edition, 2007.
3 Miller and Freund., “Probability and Statistics for Engineers”, Pearson Education, Asia, 7th edition, 2012.
4. Arora.P.N. and Arora.S., “Statistics for Management”, S.Chand& Company Ltd, 2009.
5. Keller, G, “Statistics for Management and Economics”, Cengage Learning (Textbook/ eBook), 2019.

COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Understand statistical data using bar graphs, pie graphs, histograms, frequency polygons and ogives.
CO2 Calculate the measure of Central tendencies and Dispersion of the frequency distributions of data.
CO3 Depict conclusions through hypothesis testing.

SNSCT /MCA/ R2023


`
CO4 Acquaint with the knowledge of analysis of variance for decision making and analyse the control limits of a sample.
CO5 Applying data analysis such as Correlation, Regression, Principal Component analysis with statistical tools

SNSCT /MCA/ R2023


`
23CAT601 DATA COMMUNICATION AND NETWORK L T P C
3 0 0 3
COURSE OBJECTIVES:
1. To understand the basic concepts of computer networks and data communication
2. To explore knowledge on network protocols and standards
UNIT-I DATA COMMUNICATION 9
Introduction: Networks – Protocols and standards – Standards organizations – Line configurations – Topology –
Transmission mode – Categories of networks – Inter networks.OSI model: Functions of the layers. Encoding and
modulating: Digital-to-digital conversion – Analog-to-digital conversion – Digital-to-analog conversion –
Analog-to-analog conversion. Transmission media: Guided media – Unguided media – Transmission impairment
– Performance.
UNIT-II ERROR CONTROL AND DATA LINK PROTOCOLS 9
Error detection and correction: Types of errors – Detection – Vertical Redundancy Check (VRC) – Longitudinal
Redundancy Check (LRC) – Cyclic Redundancy Check (CRC) –Check sum – Error correction. Data link control:
Line discipline – Flow control – Error control. HDLC, Project 802 – Ethernet – Token ring – FDDI- SONET –
Bridges.
UNIT-III NETWORKS AND SWITCHING, NETWORKING DEVICES 9
Switching: Circuit switching – Packet switching – Message switching.
Internetworks- IP addressing methods – Subnetting –Networking and internetworking devices: Repeaters –
Bridges – Gateways – Other devices – Routing algorithms – Distance vector routing – Link state routing.
UNIT-IV TRANSPORT LAYER AND APPLICATION LAYER 9
Duties of transport layer – Multiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control
Protocol (TCP) – Congestion Control – Quality of services (QOS).Domain Name Space (DNS) – SMTP – FTP –
HTTP – WWW
UNIT-V NETWORK SECURITY AND APPLICATIONS 9
Network Security and Applications Cryptographic Building Blocks, Key Pre-distribution, Firewalls, Traditional
Applications, Infrastructure Services.
L :45 T:0 P: 0 Total: 45 PERIODS
TEXT BOOKS
1 BehrouzA.Forouzan, “Data Communication and Networking”, 5th Edition, Tata McGraw Hill, 2012.
2. Andrew Tannenbaum.S, “Computer Networks”, 5th Edition, Pearson Education, 2011.
REFERENCES
1 William Stallings, “Data and Computer Communication”, 10th Edition, Pearson Education, 2013.
2 Larry L Peterson and Bruce S Davie, Computer Networks A Systems Approach, 5th Edition, MKP – 2012

COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Understand and explain Data Communications System and its components.
CO2 Identify the different types of network topologies and protocols.
CO3 Enumerate the layers of the OSI model and TCP/IP and identify the different types of Network devices and their functions
within a network.
CO4 Able to understand the use of various networking devices.
CO5 Understand the role of application layer protocols in different scenarios

SNSCT /MCA/ R2023


`

23CAT602 DATA STRUCTURES & ALGORITHMS L T P C


3 0 0 3
COURSE OBJECTIVES:
1. Understand and apply linear data structures-List, Stack and Queue
2. To analyze the efficiency of algorithm using asymptotic notations
UNIT-I ELEMENTARY DATA STRUCTURES 9
Introduction – Arrays – Structures – Stack: Definition and examples, Representing Stacks - Queues and lists:
Queue and its Representation, lists – Applications of Stack, Queue and Linked Lists.
UNIT II TREES 9
Binary Trees – Operations on binary trees - Binary Tree Representations – node representation, internal and
external nodes, implicit array representation – Binary tree Traversals - Huffman Algorithm – Representing Lists
as Binary Trees
UNIT III SORTING AND SEARCHING 9
General Background – Exchange sorts – Selection and Tree Sorting – Insertion Sorts – Merge and Radix Sorts –
Basic Search Techniques – Tree Searching – General Search Trees – Hashing
UNIT IV GREEDY AND BACKTRACKING 9
Fundamentals of the analysis of algorithm efficiency - Asymptotic notations - Greedy method – Prim’s algorithm
– Kruskal’s algorithm – Dijkstra’s algorithm – Backtracking: N-Queens problem
UNIT V NP-HARD AND NP-COMPLETE PROBLEMS 9
P & NP problems – NP-complete problems – Approximation algorithms for NP-hard problems – Traveling
salesman problem – Knapsack problem
L :45 T:0 P: 0 Total: 45 PERIODS
TEXT BOOKS
1 Tanaenbaum A.S., Langram Y. Augestein M.J “Data Structures using C”, Pearson Education , 2008.
2. AnanyLevitin “Introduction to the Design and Analysis of Algorithms” Pearson Education 2012.
REFERENCES
1. Robert Kruse & Clovis L. Tondo “Data Structures and Program Design in C”, Prentice Hall , 2nd edition., 2007.
2. M.K.Venkataraman “Engineering Mathematics”, Volume II, National Publishing Company, Second Edition,1989.
3. A.Tamilarasi&A.M.Natarajan, “Discrete Mathematics and its Application”, Khanna Publishers, Second Edition, 2005.

COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Gain knowledge to describe array, stack,queue and linked list operation.
CO2 Implement different types of trees and apply them to problem solutions
CO3 Apply Algorithm for solving problems like sorting,searching, insertion and deletion of data
CO4 Ability to apply backtracking method in real cases
CO5 Able to understand the use of NP hard and NP Complete problems

SNSCT /MCA/ R2023


`

23CAT603 DATABASE MANAGEMENT SYSTEMS L T P C


3 0 0 3
COURSE OBJECTIVES:
1. To understand the fundamentals of data models and database design
2. To impart knowledge on query language and apply the same in real cases
UNIT-I INTRODUCTION 9
File systems versus Database systems – Data Models – DBMS Architecture – Data Independence – Data Modeling
using Entity – Relationship Model –E-R Modeling.
UNIT-II RELATIONAL MODEL AND QUERY EVALUATION 9
Relational Model Concepts – Relational Algebra – SQL – Basic Queries – Complex SQL Queries – Views –
Constraints.
UNIT-III DATABASE DESIGN & APPLICATION DEVELOPMENT 9
Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms, Dependency Preservation –
Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth Normal Form – Join Dependencies and Fifth
Normal Form.
UNIT-IV ADVANCED SQL AND TRANSACTION MANAGEMENT 9
Complex Queries, Triggers, Views, and Schema Modification More Complex SQL Retrieval Queries, Specifying
Constraints as Assertions and Actions as Triggers, Views (Virtual Tables) in SQL, Schema Change Statements in
SQL.
UNIT-V COLUMN ORIENTED DATABASE 9
Definition of NOSQL- NOSQL Storage Architecture, CRUD operations with MongoDB, Querying, Modifying
and Managing NOSQL Data stores, Indexing and ordering datasets
L :45 T: 0 P: 0 Total: 45 PERIODS
TEXT BOOKS
1. Raghu RamaKrishnan and Johannes Gehrke, “Database Management Systems”, McGraw Hill International Editions, 2000.
2. Author Shakuntala Gupta Edward, NavinSabharwal, “Practical MongoDB, Architecture, Developing and Administrating MongoDB”,
Apress, 2015
REFERENCES
1 C. J. Date, “An Introduction to Database Systems”, Seventh Edition, Addison Wesley, 1997.
2 Abraham Silberschatz, Henry. F. Korth and S. Sudharshan, “Database system Concepts”, Third Edition, Tata McGraw Hill, 1997.
3 Hector Garcia- Molina, Jeffrey D Jennifer widom, “Database Systems – The complete book”, Pearson Education, 2nd edition,
2008.
COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Understand the basics of the data models and database using ER diagrams
CO2 Acquire the knowledge of query evaluation to monitor the performance of the DBMS
CO3 Apply normalization in the relations during database design
CO4 To impart knowledge in transaction processing, concurrency control techniques and recovery procedures
CO5 Understand column oriented database and apply the database operations in the open source database management system

SNSCT /MCA/ R2023


`

23CAT604 PRINCIPLES OF MANAGEMENT L T P C


3 0 0 3
COURSE OBJECTIVES:
1. Enable the students to study the evolution of Management and its functions
2. Learn the application of the principles in an organization

UNIT-I INTRODUCTION TO MANAGEMENT 9


Management: Definition - Evolution of Management Studies –Nature, Functions, Levels and role of
management - Basic Principles and Process of Management - Management vs. Administration – Taylor
&Fayol’s contribution to Management - Management styles -Qualities of good manager.
UNIT-II PLANNING 9
Planning: Basic types of planning – Characteristics of a good plan- Features - Planning process- Obstacles in
planning - MBO, MBE, Policy - Policy formulation - Types of policies - Forecasting, Process, Importance –
Decision making process.
UNIT-III ORGANISING 9
Organization: Need - forms of organization - features of a good organization. Departmentation – organizational
charts - manuals - span of management, factors affecting span of management - authority relationship –
delegation of authority and responsibility - centralization and decentralization.
UNIT-IV STAFFING & DIRCTING 9
Staffing: Meaning, Nature, Need, and Process. Directing - Characteristics, Importance and Techniques of
directing. Event & Time Management - Scope, Importance - Coordination - Need for coordination, Techniques
for securing effective coordination.
UNIT-V CONTROLLING 9
Concept of Control – Importance of control- Essentials of control system - Process of control – Communication
- Process of Communication - Types - Barriers - Management Information Systems.
L :45 T: 0 P: 0 Total: 45 PERIODS
TEXT BOOKS
1 Harold Koontz, and Weihrich, “Essentials of Management”, 8th Edition, 2010
REFERENCES
1 Tripathy.P.C and Reddy.P.N., “Principles of Management” , 4th Edition, Tata McGraw Hill, 2011.
2 Stephen.P.Robbins, Mary coulter, Neharikavohra, Pearson, Management, 10th Edition, 2010.
3 Dr.Kumkum Mukherjee, Principles of Management, 2nd Edition, Tata McGraw Hill, 2009.

COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Understand various functions of management
CO2 Work as an effective team member and leader.
CO3 Effectiveness of organizing and controlling aspects of management.
CO4 Use problem-solving strategies and critical thinking in real life situations.
CO5 Able to understand the significance of communication in business.

SNSCT /MCA/ R2023


`
23GET601 PROFESSIONAL DEVELOPMENT L T P C
1 0 2 3
COURSE OBJECTIVES:
1. Develop creativity and effective communication
2. Advance the students' intellectual curiosity, competency and skills using networking and socialization

UNIT-I PROFESSIONAL COMMUNICATION 6


Importance of communication- Types of communication- Verbal and Non-verbal Communication -Barriers to
communication
UNIT-II PERSONALITY DEVELOPMENT 6
Significance of Personality development- Attitude - Motivation-Self Esteem-Body language - Problem-solving-
Decision-making skills- Leadership qualities-Character building -Team-work -Work ethics -Good manners and
etiquette
UNIT-III PUBLIC SPEAKING 6
Introduction to public speaking- Barriers- Speech organization-Understanding audience-Information &
Communicative Technologies (ICT)-Effective power point presentation-feedback
UNIT-IV NETWORKING 6
Introduction to networking-Types of networking- Business Card- strategies for networking-networking database-
Role of social media& internet
UNIT-V SOCIALIZATION 6
Importance of socialization-Theories of self-development-Agents of socialization-socialization across the life
L :30 T:0 P: 0 Total: 30 PERIODS
TEXT BOOKS
1 Personality development- 1. Hurlock, E.B (2006). Personality Development, 28th Reprint. New Delhi: Tata McGraw Hill.
2. Stephen P. Robbins and Timothy A. Judge(2014), Organizational Behaviour 16th Edition: Prentice Hall
REFERENCES
1 Butterfield, Jeff Soft Skills for Everyone. Cengage Learning: New Delhi, 2015

COURSE OUTCOMES
At the end of the course student should be able to:

CO1 To demonstrate effective verbal and written communication skills


CO2 Exhibit an understanding of ethical principles and professional behavior
CO3 To understand key leadership principles and demonstrate the ability to work collaboratively within diverse teams.
CO4 Able to identify and utilize networking opportunities to build professional relationships
CO5 Individuals learn how to communicate effectively, cooperate, and interact positively with others,

SNSCT /MCA/ R2023


`
DATA STRUCTURES & ALGORITHMS
23CAP601 L T P C
LABORATORY
0 0 4 2
COURSE OBJECTIVES:
1. Apply skills to choose appropriate data structures for problem solving.
2. Assess on how the choice of data structures and algorithm design methods influence the
performance of programs.
LIST OF EXPERIMENTS
1. Strassen’s matrix multiplication
2. Stack and Queue
3. Merge Sort
4. Quick Sort
5. Binary tree Traversals
6. DFS and BFS
7. Prim’s Algorithm
8. Knapsack Problem – Dynamic Programming
9. Subset Sum Problem – Backtracking
10. Travelling salesperson problem – Branch and Bound

MAJOR EQUIPMENTS / SOFTWARE REQUIRED

Hardware
 Intel Pentium IV Processor,
 Intel Mother Board,
 2 GB RAM,
 125 GB Hard Disk or above
Software
 Windows 7/ Higher OS
 C Compiler

L :0 T: 0 P: 60 Total: 60 PERIODS

COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Ability to design and analyze the time and space efficiency of the data structure.
CO2 Gain practical knowledge on the applications of data structure.
CO3 Ability to analyze and implement the various algorithms.
CO4 Able to understand dynamic programming concepts and write programs
CO5 Able to write programs implementing backtracking and branch & bound approaches

SNSCT /MCA/ R2023


`

23CAP602 DATABASE MANAGEMENT SYSTEM LABORATORY L T P C

0 0 4 2
COURSE OBJECTIVES:
1. Ability to define a conceptual and physical design of data mode for application programs.
2. Apply SQL Statements to access and manage database using procedure, cursor, trigger and functions.

LIST OF EXPERIMENTS
1. Creation of base tables and views.
2. Data Manipulation : a) INSERT, DELETE and UPDATE in tables b) SELECT, Sub Queries and JOIN
3. Data Control Commands.
4. High level language extensions – PL/SQL Or Transact SQL.
5. Use of Cursors, Procedures and Functions.
6. Embedded SQL or Database Connectivity.
7. Develop Triggers.
8. Create the schema in a document database, add a key and insert data
9. Create cricket database with necessary information.
(i) list all the records(ii) Search for particular player using ID
(iii) list the player having batting average 40 and above (iv) List the player who have scored 1000 and
apply to find list of all the records in the world cup
10. Case 1: Students Information System
11. Case 2: Call Taxi Management system
12. Case3: Start NoSQL Database instance and load the user profile data
MAJOR EQUIPMENTS / SOFTWARE REQUIRED
Hardware
1. Intel Pentium IV Processor,
2. Intel Mother Board,2 GB RAM,
3. 125 GB Hard Disk or above
Software
1. Windows 7/ Higher OS
2. C Compiler, Microsoft SQL Server/ Oracle/ MySQL
L :0 T: 0 P: 60 Total: 60 PERIODS
COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Creation of tables, queries, forms, reports, data access pages, & macros.
CO2 To provide comprehensive instruction in the SQL and transact-SQL for Microsoft's SQL Server users.
CO3 Develop multiple forms and reports using PL/SQL triggers, the Object Navigator, and Oracle's Form & Report Builders.
CO4 Able to write triggers and procedures for effectively utilizing the backend for application Development.
CO5 Apply visual basic technology for application development.

SNSCT /MCA/ R2023


`
23GEB601 DESIGN THINKING L T P C
1 0 4 3
COURSE OBJECTIVES:
1. Identify empathize and solve a challengeable problems
2. Conceive and articulate design thinking approach to solve challengeable problems.
UNIT I INTRODUCTION TO DESIGN THINKING 3+12
A brief insight to Design Thinking and Innovation- People Centered Design & Evoking the ‘right problem’-
Purpose of Design Thinking- Design Thinking Framework
UNIT II PROCESS IN DESIGN THINKING (EMPATHY, DEFINE) 3+12
Design Thinking Process – Empathy – Uncovering and Investigating Community Concerns - Define : Examine
and Reflect on the problem
UNIT-III PUBLIC SPEAKING 3+12
Introduction to public speaking- Barriers- Speech organization-Understanding audience-Information &
Communicative Technologies (ICT)-Effective power point presentation-feedback
UNIT IV TESTING, REFINING AND PITCHING THE IDEAS 3+12
Importance & Testing the Design with People-Retest and Redefine Results-Creating a Pitch for the design
UNIT V VALUE PROPOSITION DESIGN 3+12
Business Vs Startup-Briefing the Problem-Problem Validation and User Discovery- Challenge Brief
L :15 T:0 P:60 Total: 75 PERIODS
TEXT BOOKS
1 Robert A Curedale, Design Thinking Process & Methods 4th Edition, December 2017, Design Community College Inc.
2. Andrew Pressman, Design Thinking: A Guide to Creative Problem Solving for Everyone, First Edition, Nov 2018, Routledge.
REFERENCES
1 IdrisMootee, Design Thinking for Strategic Innovation - What They Can't Teach You at Business or Design School, First
Edition, 2017, Wiley
2 Yves Pigneur, Greg Bernarda, Alan Smith, Trish Papadakos Alex Osterwalder, Value Proposition Design: How to Create
Products and Services Customers Want, 2015, Wiley
3 Brown, Tim, and Barry Katz. Change by Design: How Design Thinking Transforms Organizations and Inspires Innovation,
2009, Harper Business

COURSE OUTCOMES
At the end of the course student should be able to:
CO1 Learn new approach-design thinking—that enhances innovation activities in terms of market impact, value creation, and
speed.
CO2 Feel the Empathy and can define their problems based on the Community Concerns
CO3 Strengthen their individual and collaborative capabilities to identify customer needs, create sound concept hypotheses, collect
appropriate data, and develop a prototype that allows for meaningful feedback in a real-world environment
CO4 Translate broadly defined opportunities into actionable innovation possibilities and recommendations for client organization
CO5 Become an Entrepreneurs

SNSCT /MCA/ R2023

You might also like