Resources

MBA | MCA

| Syllabus | Textbooks | Class Notes | Seminar Topics | Question Papers |

| Semester1 | Semester2 | Semester3 | Semester4 | Semester5 | Semester6 |

M.C.A (MASTER OF COMPUTER APPLICATIONS)

Semester 1

Subject Code	Subject Name	L	T	P	M
THEORY
MC101	Digital Fundamentals and Computer Organization	3	1	0	100
MC102	Problem Solving Techniques	3	0	0	100
MC103	Business Processes	3	0	0	100
MC104	Data Structures	3	1	0	100
MC105	Programming in ‘C’	3	0	0	100
PRACTICALS
MC106	Office Automation Lab	0	0	3	100
MC107	Data Structures Lab	0	0	3	100
MC108	Programming in ‘C’ Lab	0	0	3	100

 

 

MC101 DIGITAL FUNDAMENTALS AND COMPUTER ORGANIZATION

1. INTRODUCTION TO DIGITAL DESIGN

Data Representation – Data Types – Complements – Arithmetic Operations – Representations – Fixed Point, Floating Point , Error detection codes – Binary Codes- Logic Gates, Boolean Algebra, Map Simplification – Combinational Circuits: Half-Adder, Full Adder- Flip Flops - Sequential Circuits

2. DIGITAL COMPONENTS - REGISTER TRANSFER & MICRO OPERATIONS

ICs – Decoders – Multiplexers – Registers – Shift Registers – Binary Counters – Memory Unit – Register Transfer Language – Register Transfer – Bus And Memory Transfers – Arithmetic , Logic And Shift Micro Operations , Arithmetic Logic Shift Unit.

3. COMPUTER ORGANIZATION AND PROGRAMMING

Instruction Codes – Computer Registers – Computer Instructions – Timing And Control – Instruction Cycle – Memory Reference Instructions – I/O And Interrupt – Machine Language – Assembly Language – Assembler - Program Loops – Programming Arithmetic And Logic Operations – Subroutines – I/O Programming.

4. INPUT – OUTPUT ORGANIZATION

Peripheral Devices – Input-Output Interface – Asynchronous Data Transfer – Modes Of
Transfer – Priority Interrupt – DMA – IOP – Serial Communication.

5. MEMORY ORGANIZATION AND CPU

Memory Hierarchy – Main Memory – Auxiliary Memory – Associative Memory – Cache Memory – Virtual Memory – Memory Management Hardware – CPU: General Register Organization – Control Word – Stack Organization – Instruction Format – Addressing Modes – Data Transfer And Manipulation – Program Control.

REFERNCES:
1. M..Morris Mano,”Computer System Architecture”, Prentice Hall of India, 3rd edition,2003.
2. M.Morris Mano , “Digital Logic & Computer Design” PHI 2006.
3. Alan B.Marcovitz, “Introduction to Logic design”, Tata McgrawHill ,Second edition,2005.

 

MC102 PROBLEM SOLVING TECHNIQUES

1. INTRODUCTION TO COMPUTER PROBLEM-SOLVING

Introduction – The Problem-solving Aspect - Top-down Design-implementation of Algorithms-Program Verification - The Efficiency of Algorithms. Fundamental Algorithms - Exchanging the values of Two Variables – Counting - Summation of a set of Numbers - Factorial Computation-Sine function computation - Generation of
the Fibonacci sequence - Reversing the Digits of an Integer - Base Conversion- Character to Number Conversion.

2. FACTORING METHODS

Finding the square Root of a number - The Smallest Divisor of an Integer - The Greatest Common Divisor of Two Integers - Generating Prime Numbers - Computing the Prime Factors of an Integer - Generation of Pseudo - random Numbers - Raising a Number to a Large Power - Computing the nth Fibonacci Number.

3. ARRAY TECHNIQUES

Array Order Reversal-Array Counting or Histogramming - Finding the Maximum Number in a Set - Removal of Duplicates from an Ordered Array - Partitioning an Array - Finding the kth Smallest Element - Longest Monotone Subsequence.
4. SORTING AND SEARCHING

The Two-way Merge - Sorting by Selection - Sorting by Exchange-Sorting by Insertion - Sorting by Diminishing Increment - Sorting by Partitioning - Binary Search - Hash Searching.
5. TEXT PROCESSING AND PATTERN SEARCHING

Text Line Length Adjustment - Left and Right Justification of Text - Keyword Searching in Text - Text Line editing - Linear Pattern Search - Sub linear Pattern Search.


REFERENCES:

1. R.G.Dromey “ How to Solve it by Computer ”, Pearson Education,India,2007.
2. Seymour Lipschutz, “Essentials computer Mathematics”, Schaums’ outlines series, Tata McGrawHill Edition, 2004.

MC103 BUSINESS PROCESSES

1. INTRODUCTION

Organizational behaviour- Foundations of Individual behavior-Perception and Individual decision making-values, attitude and job satisfaction.

2. GROUPS IN ORGANISATION

Foundations of group behaviour- Understanding work teams- Communication – Leadership .

3. ORGANISATION SYSTEM

Foundations of organization structure – Technology – Work design and stress – Human resource policies and practices – Organisational Culture.

4. BUSINESS PROCESS RE-ENGINEERING AND IT

Basic concepts and the need for BPR-Principles of BPR and the role of IT- BPR and restructuring the organization.

5. NETWORK ORGANIZATIONS

Networked organization- virtual corporations.

REFERENCES:

1. Stephen P.Robbins “Organizational behavior”, PHI, 12th edition, 2006.
2. Turban,Mclean,wetherbe,”Information Technology for management” John Wiely and Sons, 2001.
3. Ravi Kalakota and Marcia Robinson, “E-Business; Roadmap for Success; Pearson Education, 2000.
4. Vikram Sethi & William R King, “ Organizational transformation through business process reengineering”, Pearson education, 2006.


MC 104 DATA STRUCTURES

1. LISTS, STACKS AND QUEUES

Abstract data types- List ADT-Stack ADT-recursion-Queue ADT

2. TREES

Trees – General, Binary trees– Search tree ADT- Binary Search Trees- AVL trees, Threaded trees- Splay Trees- B-Trees.

3. SORTING AND SEARCHING

Sorting – Internal Sorting – Quick Sort, Heap Sort, Radix Sort – External Sorting – Merge Sort, Multi-way Merge Sort, Polyphase Sorting– Basic Search Techniques – Tree Searching – General Search Trees – Hashing.

4. GRAPHS AND THEIR APPLICATIONS

Graphs – Definitions – Topological sort- Shortest Path Algorithms – Network flow problems- Minimum Spanning Tree – Applications of Depth First search – Introduction to NP-completeness.

5. STORAGE MANAGEMENT

Automatic list Management- Garbage Collection - Algorithms for Garbage collection- collection and compaction- Dynamic memory management- Buddy Systems.

REFERENCES

1. Weiss “Data Structures and Algorithm Analysis in C ”, Addison Wesley , Second Edition, 2007
2. Aaron M.Tanaenbaum, Yedidyah Langsam, Moshe J.. Augenstein “ Data Structures using C” , Printice hall of India, 2007
3. Seymour Lipschutz, “ Data Structures” Schaums’ outline series, Tata Mcgraw Hill, NewDelhi, 2007.

MC105 PROGRAMMING IN ‘C’

1. INTRODUCTION TO C LANGUAGE

Overview of ‘C’language – Constants, Variables and Data Types – Operators, Expressions and Assignment statements – Managing Input/Output Operations – Formatted I/O – Decision Making - Branching – IF, Nested IF – Switch – goto - Looping- While, do, for statements.

2. ARRAYS AND FUNCTIONS

Arrays – dynamic and multi-dimensional arrays - Character arrays and Strings – String handling Functions - User defined Functions – Categories of Functions – Recursion.

3. STRUCTURES AND UNIONS

Basics of Structures-Declaring a Structure – Array of Structures –Passing Structures elements to Functions- Passing entire Structure to Function – Structures within Structures - Union – Union of Structures – Enumerated Data Types – typedef Statement.

4. POINTERS

Pointers – Declaration, Accessing a variable, dynamic memory allocation, Pointers versus Arrays, Array of pointers, Pointers to functions and structure Pointers.

5. FILE MANAGEMENT

File Management in C – Data hierarchy- Files and Streams – Sequential access file- Random access file - Preprocessors.

REFERENCES:

1. E.Balagurusamy “ Programming in ANSI C ” , Tata McGraw Hill, 2004
2. Yashavant P. Kanetkar “Understanding Pointers In C” , BPB Publications, NewDelhi, 2002
3. Byron C Gottried, Programming with C, Schuams’ outline series, 2nd edition, Tata McGraw Hill,2006.

MC106 OFFICE AUTOMATION LAB

WORD

1. Creating and Formatting a simple document(using bulleted and Numbered list, adding Headers, Footers and Page numbers)
2. Navigating Long document with the Document Map
3. Working with Tables ( create tables, editing tables, formatting tables, converting tables, sorting table contents, etc.,).
4. Mail Merge
5. Creating a Birthday Card

EXCEL
6. Formatting the worksheets( Formatting the cell, rows and columns)
7. Working with functions and formulae.
8. Presenting Data with Charts
9. Performing What-If analysis with data table.
10. summarize the data using pivot table.

POWER POINT
11. Presentation using Text with animation
12. Presentation using images, media file
13. Creating a graph in a PowerPoint slides
14. Creating self running presentations
15. Hiding and showing the slides

ACCESS
16. Creating a database ( create a table, setting field properties and setting the key)
17. Entering and editing data using forms
18. Retrieving data from more than one related table using queries(using Query Wizard)
19. Generating Report using Report Wizards.

TALLY
20. Creation of company, Accounts Configuration, Classification of Accounts using Tally.
21. Accounts Masters, Accounts Voucher – Voucher Entry, conversion, Interest Calculation, Printing of voucher using Tally.
22. Create a Contra Voucher, Payment and Receipt Voucher using Tally.
23. Create Sales and Purchase Voucher, Credit notes and Debit notes using Tally.
24. Create Trading Account, Profit / Loss Account, Balance Sheet using Tally.

MC 107 DATA STRUCTURES LABORATORY

1. Represent the given sparse matrix using one dimensional array and linked list.

2. Create a Stack and do the following operations using arrays and linked lists
(i)Push (ii) Pop (iii) Peep

3. Create a Queue and do the following operations using arrays and linked lists
(i)Add (ii) Remove

4. Implement the operations on singly linked list, doubly linked list and circular linked list.

5. Create a binary search tree and do the following traversals
(i)In-order (ii) Pre order (iii) Post order

6. Implement the following operations on a binary search tree.
(i) Insert a node (ii) Delete a node

7. Sort the given list of numbers using heap and quick sort.

8. Perform the following operations in a given graph
(i) Depth first search (ii) Breadth first search

9. Find the shortest path in a given graph using Dijkstra algorithm

MC 108 PROGRAMMING IN ‘C’ LAB

1. Display the following:
(i) Floyd’s triangle (ii) Pascal Triangle

2. Generate the following series of numbers:
(i) Armstrong numbers between 1 to 100
(ii) Prime numbers between 1 to 50
(iii) Fibonacci series up to N numbers

3. Manipulate the strings with following operations.
(i) Concatenating two strings (ii) Reversing the string (iii) Finding the substring
(iv) Replacing a string (v) Finding length of the string

4. Find the summation of the following series:
(i) Sine (ii) Cosine (iii) Exponential

5. Create the sales report for M sales persons and N products using two dimensional
array.

6. Simulate following Banking operations using functions.
(i)Deposit (ii) Withdrawal (iii) Balance Enquiry

7. Implement using recursion
(i) Find the solution of Towers of Hanoi problem using recursion.
(ii) Fibonacci number generation.
(iii) Factorial

8. Generate Student mark sheets using structures.

9. Create a collection of books using arrays of structures and do the following:
(i) Search a book with title and author name (ii) Sorts the books on title.

10. Perform string operations using pointers.

11. Program to implement dynamic memory allocation.

12. Create, Reading and displaying a sequential and random access file.