BPUT MCA 2nd Sem Syllabus

Hii Buddy , Here I Need to MCA Programme Syllabus of Biju Patnaik University Of Technology, , Can you please Provide me Same Syllabus ?

[Pathak]

Friend On your Demanding Here providing Semester Wise MCA Programme Syllabus of Biju Patnaik University Of Technology,

Semester-I

Programming in C
Micro-processors and Assembly Language Programming
Discrete Mathematics
Engineering Economics and Costing
Financial Accounting
Communicative English
Communicative English Lab-I
Lab – I (C Programming Lab)
Lab – II (Assembly Language Programming Lab)


Semester-II
Data Structures Using C
Computer Organization and System architecture
Object orientated Programming using C++
Theory of Computation
Computer Based Numerical Methods
Business Communication in English
Communicative Practice Lab-II
Lab – III (Data Structure in C Lab)
Lab – IV (C++ Programming Lab.)
Seminar

Semester-III

Analysis and Design of Algorithms
Operating Systems
Computer Networks
Data Base Systems
Probability and Statistics
Management Information System
Lab – V (Operating System & Network Lab.)
Lab – VI (Data base Lab)
Communication and Interpersonal Skills for Corporate Readiness

Semester – IV

Programming with Java
Computer Graphics & Multimedia
Software Engineering
Compiler Design
Quantitative Techniques-I (Operations Research)
E-Commerce & ERP
Lab – VII (Programming with Java Lab.)
Lab – VIII (Comp. Graphics & Multimedia Lab.)
Seminar

Semester – V

Artificial Intelligence and Expert system
Object Oriented Analysis and Design with UML
Internet Technology and enterprise Java
Quantitative Techniques-II (Modeling & Simulation)

Elective-I
Distributed Systems
Parallel Computing
Image Processing
Web Engineering

Elective-II
Computer Security
Software Design
Bioinformatics
Soft Computing
Assignment
Lab – X (Enterprise Web Computing Java Lab.)
Comprehensive Viva-voce

Semester –VI
Project work for 16 weeks

Biju Patnaik University Of Technology Syllabus for MCA Programme

3RD SEMESTER
MCC 301 ANALYSIS AND DESIGN OF ALGORITHMS
Module-I (13 hours)
Introduction to analysis and design of algorithm, Growth of functions, Asymptotic notations,
Recurrences, Solution of recurrences by substitution, Recurrence tree and the master method.
Divide and conquer algorithms (Worst case analysis of merge sort, quick sort and heap sort
algorithms), Priority queue, Data structure for disjoint sets (Disjoint set operations, linked list
representation, disjoint set forests)
Module-II (13 hours)
Dynamic programming approach: Matrix chain multiplication, longest common subsequence.
Greedy method: Activity solution problem, Greedy verses dynamic programming, Huffman codes.
Concept of backtracking, branch & bound design techniques.
Graph algorithms: Minimal spanning tree (Kruskal and Prim’s algorithms), Single source shortest
paths (Bellman-Ford and Dijkstra’s algorithm), Floyd’s algorithm.
Module –III (14 hours)
Flow Network, Ford-Fulkerson method, Fast Fourier Transform, Rabin-Karp string matching
algorithm.
NP-Completeness, Polynomial time solvability, Verification and Reducibility, NP complete problems
(without proof), Approximation algorithm for the traveling salesman problem.
Text book:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and L.Stein, “Introduction to Algorithms” , Second
Edition, PHI Learning, 2002
Chapters: 1, 2, 3, 4(excluding 4.4), 6, 7 (7.4.1), 15(15.2, 15.3. 15.4), 16(16.1, 16.2, 16.3),
21(21.1, 21.2, 21.3) 23, 24(24.1, 24.2, 24.3), 26(26.1, 26.2), 30(30.1, 30.2), 32(32.1, 32.2), 34,
35(35.2)
Reference books:
1. E. Horowitz, S. Sahani, S. Rajsekharan, ”Fundamentals of Computer Algorithms”, Second
Edition, Universities Press, 2007
2. J. Kleinbers, E.Tardos, Algorithm design, Pearson Education Inc., New Delhi , 2006
3. R. Johnsonbaugh, M. Schaefer, “Algorithms”, Pearson Education Inc., New Delhi , 2004
4. Kenneth A. Berman & Jerome L. Paul, “Algorithms”, Revised Edition, 2005, CENGAGE
Learning India Pvt. Ltd., New Delhi.
5. Anany V. Levitin, “Introduction to the Design and Analysis of Algorithms”, Second Edition,
2007, Pearson Education Inc., New Delhi.
6. Michael T. Goodrich and Roberto Tamassia, “Algorithm Design: Foundations, Analysis,
and Internet Examples”, 2
nd
Edition, Wiley India Pvt. Ltd., New Delhi
MCC 302: OPERATING SYSTEMS
Module-1
(16 hours)
Introduction — Evolution of Operating Systems, Types of operating systems, Operating System
Structures, Hardware and software structures needed for an operating system.
Process Management: Processes—States & Life cycle of process, Schedulers, Context Switching,
Process scheduling policies—Preemptive vs. Non-preemptive, CPU scheduling algorithms,
Threads—States & Life cycle of thread, thread scheduling, Types of threads & Examples. Inter-
process Communication (IPC) Mechanisms—Concurrent processes, Process synchronization,
Critical Section, Peterson’s Solution, Classic IPC Problems, Semaphores, Concurrent
programming, Monitors.
Module-2
(14hours)
Deadlock—Basic cause of deadlock, Conditions for deadlock, resource allocation graph, Wait for
graph, Strategies for handling deadlocks, Starvation, Havender’s linear ordering principle, deadlock
avoidance & detection, Safe state, Dijikstra’s Banker’s Algorithm.
Memory Management: Main Memory, Static & Dynamic Partition schemes, multiple partitions
schemes, Fragmentation, Compaction, Buddy Systems, Partition selection algorithms, de-allocation
strategy, Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table,
Segmentation, Virtual Memory: Demand Paging, Copy-on-Write, Page Replacement Policies,
Belady’s Anomaly, Thrashing, Working set model.
Module-3
(10hrs)
Storage (File and Device) Management: File-System Interface, File-System Implementation,
Mass-Storage Structure, Disk Scheduling, RAID Structure, I/O Systems.
Outline of : Multiprocessor Management, Protection & Security, Real-Time Operating Systems,
and Multimedia Operating Systems, Case Studies: Windows XP/ Vista, Linux.
Text books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Concepts”, Eighth
Edition, 2009, Wiley India Pvt. Ltd., New Delhi.
Reading Chapters: 1-15 & 19-22 (excluding chapters: 16, 17, 18, and 23).
2. Harvey M. Deitel, Paul J. Deitel, David R. Choffnes, “Operating Systems”, Third Edition, 2004,
Pearson Education Inc., New Delhi.
Reference Books:
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Third Edition, 2008, PHI Learning Pvt. Ltd., /
Pearson Education Inc., New Delhi.
2. Ramez Elmasri, A. G. Carrick, David Levine, “Operating Systems: A Spiral Approach”, First
Edition, 2009, McGraw-Hill Education (India), New Delhi.
3. Ann McIver Hoes and Ida M. Flynn, "Understanding Operating Systems”, Fifth Edition, 2009,
CENGAGE Learning India Pvt. Ltd., New Delhi.
4. Gary Nutt, “Operating Systems”, 3rd Edition, 2004, Pearson Education Inc., New Delhi.
5. William Stallings, “Operating Systems: Internals and Design Principles”, Sixth Edition, 2009, PHI
Learning Pvt. Ltd., / Pearson Education Inc., New Delhi.
MCC 303: COMPUTER NETWORKS
Module-I
(12 hours)
Introduction to Data Communications and Networking, Evolution of Computer Networks, General
Principles of Network Design: Topologies, Network Models (ISO-OSI, TCP/IP), Network
Architecture & Standardization (IEEE 802.x), Example Networks, Access Networks.
Physical Layer: Theoretical Basis for Data Communication-Data, Signals, Transmission (Digital vs
Analog), Throughput, Bandwidth, Bit rate, Baud Rate, Data rate measurement-Nyquist formula &
Shannon capacity, Multiplexing, Transmission Media (Guided Media, Unguided media: Wireless),
Switching (Circuit , Message, Packet).
Module-II
(16 hours)
Data Link Layer: Data Link Layer Design Issues, Error detection and Correction, Data Link
Control, Elementary Data Link Protocols, Sliding Window Protocols, Protocol Verification, MAC
Sub layer: Channel Allocation Problems, Multiple Access Protocols, Ethernet, Wireless LANs,
Broadband Wireless, Bluetooth, Data Link Layer Switching, Network devices: Repeater, Hubs,
Bridges, Switches, Routers, Gateways, Backbone networks and Virtual LANs, Wireless WANs,
Virtual Circuit Networks: Frame Relay and ATM
Network Layer: Network Layer Design Issues, Logical Addressing, Internet Protocol, Address
Mapping, Error Reporting and Multicasting, Delivery, Forwarding, Routing Algorithms.
Module-III
(12 hours)
Transport Layer: Transport Service, Elements of Transport Protocols, Process to Process
Delivery—UDP, TCP, Congestion Control, Congestion Control Algorithms, Quality of Service.
Application Layer: DNS, Remote Logging, File transfer, SNMP, Multimedia, Ziff’s law.
Security: Cryptography, Network Security, Kerberos, Internet Security: IPSec, SSL/TLS, PGP,
VPN, Firewalls.
Text Books:
1. Behrouz A. Forouzan, “Introduction to Data Communications and Networking”, Fourth
Edition, 2007, McGraw-Hill Education (India), New Delhi.
2. Natalia Olifer & Victor Olifer, “Computer Networks: Principles, Technologies and
Protocols”, First Edition, 2006, Wiley India Pvt. Ltd., New Delhi.
Reference Books:
1. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, 2003, PHI Learning Pvt.
Ltd., / Pearson Education Inc., New Delhi.
2. James F. Kurose, Keith W. Ross, “Computer Networking: A Top-Down Approach
Featuring the Internet”, 4
th
Edition (2008), Pearson Education Inc., New Delhi.
3. Wayne Tomasi, “Introduction to Data Communications and Networking”, First Edition,
2005, Pearson Education Inc., New Delhi.
4. Prakash Gupta, “Data Communication and Computer Networks”, 2008, PHI Learning Pvt.
Ltd., New Delhi.
5. Curt White, “Data Communications and Networking”, First Edition, 2008, CENGAGE
Learning India Pvt. Ltd., New Delhi.
6. L. L. Peterson & B. S. Davie,” Computer Networks”, Fourth Edition, Elsevier Inc,
MCC 304: DATABASE SYSTEMS
Module 1
(10 hours)
Introduction: Data & Information, Evolution of Database Systems, Overview of a DBMS,
Database System Concepts & Architecture - Data models, schemas and instances, Data Abstraction,
Data Independence, Database languages and interfaces.
Database Characteristics: Data modeling using Entity - Relationship (ER) Model: Entity sets,
attributes and keys, Relationship types, sets, roles and structural constraints, Weak Entity types.
Data Models: Relational, Network, Hierarchical and Object Oriented.
The Relational model: Relational data model concepts, Codd’s 12 rules, Relational model
constraints and schemas, Relational Algebra and Relational calculus, Constraints on Relations,
Relational database design by ER & EER to Relational Mapping, Database Language SQL & QBE.
SQL Programming Techniques: Constraints and Triggers, Views and Indexes, SQL in Server
Environment.
Module 2
(16 hours)
Database Design: Data dependency, Armstrong’s Axioms, Functional dependencies and
Normalization of Relational Databases, First, Second and Third Normal forms, Boyce-Codd
Normal form (BCNF), Relational Database design Algorithms and further dependencies, De-
normalization
Storage Strategies and file organizations: Disc Storage, Basic File Structures and Hashing,
Indexing structures for files, multi-level indexing using B-trees and B
+
-trees.
Query Processing and Optimization: Evaluation of Relational Algebra Expressions, Query
Equivalence, Join strategies, Query Execution, Query Compiler, and Query Optimization
Algorithms.
Module 3
(14 hrs)
Transaction processing concepts: Introduction to Transaction Processing concepts and Theory,
ACID Properties, concurrency control, Serializability and Recoverability, Database recovery
techniques - Shadow paging, ARIES recovery algorithm, Database Security. Deadlock: Detection,
Avoidance and Recovery.
Outline of: Information Integration, Data Mining, Data Warehousing and OLAP, Database
Systems and the Internet, Search Engines, Semi-structured Data Model, XML and Web Databases,
Object & Object Relational Databases, Distributed Databases, Deductive Databases, Mobile
Databases, Multimedia Databases, GIS.
Text Books:
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, Fifth
Edition (2007) , Pearson Education Inc., New Delhi.
2. Abraham Silberschatz, Henry F. Korth and S. Sudarshan, “Database Systems Concepts”, Fifth Edition
(2006), McGraw-Hill Education , New Delhi
Reference Books:
1. Hector Garcia-Molina, Jeffret D. Ullman, Jenniffer Widom, “Database Systems: A Complete
Book”, Second Edition, 2009, Pearson Education Inc., New Delhi.
2. Peter Rob & Carlos Coronel, “Database Systems: Design, Implementation, and Management”,
Eighth Edition, 2009, CENGAGE Learning India Pvt. Ltd., New Delhi.
3. Mark L. Gillenson, “Fundamentals of Database Management Systems”, First Edition, 2005, Wiley
India Pvt. Ltd., New delhi.
4. Nilesh Shah, “Database Systems Using Oracle”, Second Edition, 2005, PHI Learning Pvt. Ltd.,
New Delhi.
5. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, Third
Edition (2003), McGraw-Hill Education (India), New Delhi.
MCC: 305 PROBABILITY AND STATISTICS
Module 1
(13 hours)
Probability: Introduction, Probability of an event, additive rule & multiplication rule, conditional
probability Bayes’ rule, random variable, discrete and continuous probability distribution, Joint
probability distribution, Mathematical expectation, Variance and co-variance of random variables,
Mean and co-variance of linear combination of random variables, Chebyshev theorem, Binomial &
Multinomial, Hypo-geometric, Geometric, Poisson distribution.
Module 2
(13 hours)
Uniform, Normal, Exponential Distribution, Weibull’s Distribution, Chi-square distribution,
Sampling Distribution: Sampling distribution of S
2
, t- distribution, F-distribution
Estimation of parameter: methods of estimation, Estimating the mean of a sinle sample, Standard
error, Prediction interval, Tolerance limits, Estimating the difference between means of two
samples, Estimating proportion and variance of a single sample, Estimating the difference between
two proportions and variances of two samples, maximum likelihood estimation.
Module 3
(14 hours)
Test of hypothesis: one and two tailed test, test on a single mean when variance is known &
variance is unknown. Test on two means, test on a single mean population and test on two
populations. One and two sample test for variance. χ
2
test for goodness of fit and test for
independence.
Introduction to linear regression: Simple regression models, Method of least square, Properties of
least square estimators, Inferences concerning the regression coefficients, Coeficients of
determination and its application.
Statistical quality control (Simple idea only)
Text Book:
1. Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers & Keying Ye, “Probability &
Statistics for Engineers & Scientists", Eighth Edition, 2007, Pearson Education Inc.,
New Delhi.
2. Jay L. Devore, “Probability and Statistics for Engineering and Sciences”,
Seventh Edition, Thomson/CENGAGE Learning India Pvt. Ltd
Reference Books:
1. William Mendenhall, Robert J. Beaver & Barbara M. Beaver, "Introduction to Probability
and Statistics", 13th Edition, 2009, CENGAGE Learning India Pvt. Ltd., New Delhi.
2. Arnold Allen, “Probability Statistics and Queuing Theory with Computer Science
Applications”, Second Edition, 2005, Elsevier India Pvt. Ltd., New Delhi.
3. Levin and Rubin, “Statistics for Management”, PHI
4. T. Veerarajan,” Probability, Statistics and Random Processes”, Tata McGraw
Hill
5. Ronald Deep, “ Probability and Statistics”, Academic Press

Contact No :
0661 248 2556

Address :

Biju Patnaik University of Technology
Chhend Main Rd
Chhend
Rourkela, Odisha 769004

Here I am Uploading pdf file Which Having Complete Syllabus for MCA Programme of Biju Patnaik University Of Technology You can Download free of cost :