M.Sc - Information Technology

Category: MCA SYLLABUS, MCA Updates 2008, Other MCA Topics, msc IT    |    191 views    |    Add a Comment

Mohanlal Sukhadia University, Udaipur is a state University of the Government of Rajasthan established as per UGC Act. The University is graded as B++ (80 - 85%, equivalent to five star by NAAC) for its high teaching standards, excellent infrastructure and a very good governance. The University is located in the city of Udaipur, known as city of lakes and fountains. Udaipur city is one of the top tourist centres in the country.

Mohanlal Sukhadia University has an excellent infrastructure in the area of Information Technology. In fact, this is the only University in the state of Rajasthan which is completely networked campus and connects other campuses to utilize the network facilities. In spite of two campuses, 4 km apart, both campuses are completely networked.

The Informatics and Computational Sciences programmes are offered at the Vigyan Bhawan - Information Technology campus which is located at the main campus of the University.

Share/Save/Bookmark

  • No Related Post

 

Hemchandracharya North Gujarat University,Patan

Category: MCA SYLLABUS    |    250 views    |    Add a Comment

First Year M.Sc. (CA & IT)

Sub No. Subject Name Teaching Scheme Examination Scheme TheoryPractical

Internal Marks External Marks Grand Total (I+E)

Lectures

Hours/

Week
Per Batch *

Hours/Week
Th.
Prac
tical
Total
(I)
Th.
Durations
Prac.
/Oral
Duration
Total

(E)

101
Communication Skills
4

20
10
30
50
3 hrs
20
(Oral)
15 Min
70
100

102
Advanced Mathematics
4

30

30
70
3 hrs


70
100

103
Computer Fundamental & Programming in `C’
3
3
15
15
30
35
3 hrs
35
3 hrs
70
100

104
Financial Accounting & Management
4

30

30
70
3 hrs


70
100

105
Basic Microcomputer & Application
3
3
15
15
30
35
3 hrs
35
3 hrs
70
100

106
Information Technology
4

30

30
70
3 hrs


70
100

107
Internet & Web
3
3
15
15
30
35
3 hrs
35
3 hrs
70
100

Total
25
9

210

490
700

* Note : 40 Students batch for Practical.

Share/Save/Bookmark

 

PUNE UNIVERSITY COMPUTER SCIENCE DEPTT

Category: MCA SYLLABUS, msc IT    |    232 views    |    Add a Comment

Common Courses (First two semesters)
Semester 1
CS-101 Introduction to Programming
CS-102 Logical Organization of Computers
CS-103 Mathematical Foundations
CS-104 Concrete Maths & Graph Theory
CS-105 Numerical Methods
Semester 2

CS-201 Data Structures & Algorithms
CS-202 Theoretical Computer Science
CS-203 Low-level Programming
CS-205 Computer Architecture and Operating Systems
CS-206 Programming Paradigms
Courses Specific to M.C.A. (Last four semesters)
Semester 3

CS-204 Design & Analysis of Algorithms
CS-301 Database Management System
CS-302 Computer Networks
CS-303 Systems Programming
Semester 4

CS-305 Computer Graphics
CS-401 Modelling and Simulation
CS-402 Operations Research
CS-403 Systems Analysis and Design
Elective-1
Semester 5

Full-time Industrial Training
Semester 6

CS-304 Science of Programming
CS-601 Software Engineering
Elective-2
Courses Specific to M. Sc. (Last two semesters)
Semester 3

CS-204 Design & Analysis of Algorithms
CS-301 Database Management System
CS-302 Computer Networks
CS-303 Systems Programming
CS-MSP Degree Project I
Semester 4

CS-304 Science of Programming
CS-601 Software Engineering
CS-MSP Degree Project II
Elective-1
Courses Specific to M.Tech. (Last two semesters)
Semester 3

CS-204 Design & Analysis of Algorithms
CS-301 Database Management System
CS-302 Computer Networks
CS-303 Systems Programming
CS-MTP Degree Project I
Semester 4

CS-304 Science of Programming
CS-601 Software Engineering
CS-MTP Degree Project II
Elective-1
Elective Courses (offered in the last few years)

Advanced Computer Architecture
Advanced Theoretical
Computer Science
Advanced Topics in DBMS
Artificial Intelligence and Tools
Category Theory
Code Optimization
Compiler Construction
Data Warehousing and Mining
Discrete Optimization
Implementation of RDBMS
Geometric Modelling
Issues in Programming
Logic Programming
Parallel Algorithms
Parallel Architectures
Programming Languages:Theory and Implementation
Soft Computing
Software Tools
Spatial Information Systems
System Management and Modeling
User Interface Design
CS-101 - Introduction to Programming
Aims and Objectives :
To give students the grounding that makes it possible to approach problems and solve them on the computer.

The aspects covered range across:

Modelling a given problem domain appropriately
Designing a solution
Implementing the solution in a high level programming language

Contents :
Two paradigms are used as vehicles to carry the ideas and execute practicals for this course the functional and the imperative.

The Functional Paradigm :
The central issue here is to be able to use the computer as a highlevel tool for problem solving. The paradigm conveyed may be simply expressed as:

A modern nonstrict functional language with a polymorphic type system is the medium for this part. The currently used language is the internationally standardized language, Haskell.

Important ideas that are to be covered include:

Standard Constructs
Function and type definition, block structure.
Guarded equations, pattern matching.
Special syntax for lists, comprehension.

Standard Data Types Fluency is to be achieved in the standard data types: numbers, boolean, character, tuple, list.
List programs in an algebraic vein.
Lists in the context of general collections sets, bags, lists, tuples. (MF)

calculus
A direct way for denoting functions.

First Classness
All values are uniformly treated and conceptualized.

Higher Order Functions Use of first class, higher order functions to capture large classes of computations in a simple way. An understanding of the benefits that accrue modularity, flexibility, brevity, elegance.

Laziness The use of infinite data structures to separate control from action.

Type discipline

Polymorphism:
The use of generic types to model and capture large classes of data�structures by factorizing common patterns.

Inference:
The types of expressions may be determined by simple examination of the program text.
Understanding such rules.

User defined types:
User defined types as
a means to model
a means to extend the language
a means to understand the built in types in a uniform framework.

Concrete types:
Types are concrete. i.e. values that are read or written by the system correspond directly to the abstractions that they represent. More specifically, unlike abstract types which are defined in terms of admissable operations, concrete types are defined by directly specifying the set of possible values.

Recursion
Recursive definitions as
a means of looping indefinitely
a structural counterpart to recursive data type definitions
a means to understand induction in a more general framework than just for natural numbers

Operational Semantics
Functional programs execute by rewriting.
calculus as a rewriting system
Reduction, confluence, reasons for preferring normal order reduction.

Type Classes
Values are to types as types are to classes. Only elementary ideas.

The Imperative Paradigm :
The imperative paradigm is smoothly introduced as follows:

Worlds The Timeless World World of Time
Domain Mathematics Programming
Syntax Expressions Statements
Semantics Values Objects
Explicit Data Structures Control Structure
Think with Input Output relations State Change
Abstractions Functions Procedures
Relation Denote programs Implement functions

In the following we spell out some of the points of how FP translates into Imp P. The examples may be analogized from say how one would teach assembly language to someone who understands structured programming.

Semantic relationsThe central relation is that imperative programming’s denotational semantics is FP, FP’s operational semantics is imperative programming.

Operational Thinking
IN FP data dependency implicitly determines sequencing whereas in Imp P it is done explicitly. Advantages and disadvantages of operational thinking.

Environment
In imperative programming there is a single implicit environment memory. In FP there are multiple environments; which could be explicit to the point of first classness (the value of variables bound in environments could be other environments). Use of environments to model data abstraction, various object frameworks, module systems.

Semi Explicit Continuation
Explicit in the sense that goto labels can be dealt with firstclassly (as in assembly), but not explicit in the sense of capturing the entire future of a computation dynamic execution of a code block may be ‘concave’.

Recursion iteration equivalence
General principles as well as scheme semantics of tailrecursion.

Type Issues
Monomorphic, polymorphic and latent typing: translating one into another.

Guile
A variety of vehicles have been used for the imperative paradigm, eg. Pascal, C, Java,Tcl. The current choice is Scheme in the guile dialect because it gives a full support for the functional and the imperative paradigm. In fact Guile has been chosen over C because the single data structure in guile sexpressions is universal (aka XML) and thus imperative and functional thinking do not quarrel with datastructure issues.

Orthogonal kinds of abstractions, which are usually considered ‘advanced’, such as functional, higherorder functional, objectoriented, streambased, datadriven, language extensions via eval, via macros, via C can be easily demonstrated. In fact, once guile has been learnt, it is much faster to pick up C in the subsequent semester.

Note: In addition to being a system programming and general purpose language Guile is also a scripting, extension and database programming language because it is the flagship language for FSF (The free software foundation).

Bibliography :
Introduction to Functional Programming, Bird and Wadler, Prentice Hall
Algebra of Programs, Bird, Prentice Hall
Structure and Interpretation of Computer Programs, Abelson and Sussman, MIT Press
Scheme and the Art of Programming, Friedmann and Haynes, MIT Press
Equations Models and Programs,, Thomas Myers, Prentice Hall
Algorithms + Data Structures = Programs, N Wirth
Functional Programming, Reade
Programming from First Principles, Bornat, Prentice Hall
Discrete Maths with a computer, Hall and Donnell, Springer Verlag
Guile Reference Manual, www.gnu.org

Share/Save/Bookmark

  • No Related Post

 

IGNOU BCA,MCA

Category: MCA SYLLABUS, bca papers    |    246 views    |    Add a Comment

Ignou BCA Papers CS63 : INTRODUCTION TO SYSTEM SOFTWARE

BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
December, 2005
CS63 : INTRODUCTION TO SYSTEM SOFTWARE
Time: 2 hours
Maximum Marks: 60
Note : Question number 1 is compulsory. Answer any three questions from the rest.
1. (a) Write an algorithm that will abbreviate the given name of any person. (6)
(b) Explain the concept of Macro-Processor. With the help of an example explain how […]

Share/Save/Bookmark

 

MASTER OF COMPUTER APPLICATIONS

Category: MCA Colleges, MCA Papers, MCA SYLLABUS    |    660 views    |    Add a Comment

Three Year Full Time Post Graduate Degree Program
Course Structure

SEMESTER - 1
MCA 111 : Mathematical Foundation of Computer Science
MCA 112 : Accounting & Financial Management
MCA 113 : Computer Organization
MCA 114 : Computer & ‘ C ‘ Programming
MCA 115 : Computer Based Numerical & Statistical techniques

Practicals
MCA-P11: Programming Lab
MCA-P12:Organization Lab
GP-100: General Proficiency

  SEMESTER - 2
MCA 121 : Organization Structure & Personal Management
MCA 122 : Data & File Structure using C
MCA 123 : Unix & ‘C’ Programming
MCA 124 : Combinatorics & Graphics theory
MCA 125 : System Analysis & Design

Practicals
MCA-P21: Unix & C Programming Lab
MCA-P22: Data Structure Lab
GP-200: General Proficiency

SEMESTER - 3
MCA 231: Data Communication & Computer Networks
MCA 232 : Design & Analysis of Algorithm
MCA 233 : Object Oriented Programming & C++
MCA 234 : Data Base Management System
MCA 235 : Computer Graphics & Animations

Practicals
MCA-P31: DBMS Lab
MCA-P32: Object Oriented Programming & Graphics Lab
GP-300: General Proficiency

  SEMESTER - 4
MCA 241: Management Information System
MCA 242: Operating System
MCA 243: Internet & Java Programming
MCA 244: Elective -I
MCA 245: Fundamentals of Electronics Commerce

Practicals
MCA-P41: Computer Network & Java Programming Lab.
MCA-P42: MIS
Lab GP-400: General Proficiency

SEMESTER - 5
MCA-351: Web Technology
MCA-352: Elective II
MCA-353: Distributed System
MCA-354: Software Engineering
MCA-355: Elective-III

Practicals
MCA-P51: Web Technology Lab
MCA-P52:Client Server & Database
Lab GP-500: General Proficiency

  SEMESTER - 6
CS-IT-361: Industrial Trainning
LIST OF ELECTIVE-I
(One of the Following )
LIST OF ELECTIVE-II
(One of the Following )
LIST OF ELECTIVE-III
(One of the Following )
Course Code: Course Code: Course Code:
MCA-244 (1) Compiler Design
MCA-244 (2) Discrete Structures
MCA-244 (3) Theory of Formal Languages & Automata
MCA-244 (4) Client Server Computing
MCA-352 (1) Advanced Concept in Database System
MCA-352 (2) Object Database
MCA-352 (3) Advanced Computer Network
MCA-352 (4) Parallel and Distributed Algorithms
MCA-355 (1) Advanced Concepts in Database System
MCA-355 (2) Object Database
MCA-355 (3) Intentional Business and Marketing
MCA-355 (4) Real Time System
  FEE STRUCTURE
  • The fees per annum is  Rs.50, 000/-

Share/Save/Bookmark

  • No Related Post

 

IGNOU - MCA Syllabus,NEW -MCS-014 Systems Analysis and Design (3 Credits)

Category: MCA Papers, MCA SYLLABUS    |    111 views    |    Add a Comment

The objectives of the course include the enabling of learner to identify the Software projects in an organization after studying various functionalities in the organization. Also, they should be able to structure various requirements, do the design and select the best method to develop the system. They should be able to implement and maintain the system . The learners should also get acquainted with different quality standards as well as learn about Management Information Systems.

Syllabus

Block 1:      Introduction to Systems Development

Unit 1:Introduction to SAD

·                 Fundamentals of System

o                Important Terms related to Systems

o                Classification of Systems

o                Real Life Business Subsystems

·                 Real Time Systems

·                 Distributed Systems

·                 Development of a successful System

·                 Various Approaches for development of  Information Systems

o                Structured Analysis and Design Approach

o                Prototype

o                Joint Application Development

Unit 2:Systems Analyst-A Profession

·                 Why do Businesses need Systems Analysts?

·                 Users

·                 Analysts in various functional areas

o                Systems Analyst in Traditional Business

o                Systems Analyst in Modern Business

·                 Role of a Systems Analyst

·                 Duties of a Systems Analyst

·                 Qualifications of a Systems Analyst

o                Analytical Skills

o                Technical Skills

o                Management Skills

o                Interpersonal Skills

Unit 3:Process of System Development

·                 Systems Development Life Cycle

·                 Phases of SDLC

o                Project Identification and   

Selection

o                Project Initiation and planning

o                Analysis

o                Logical Design

o                Physical Design

o                Implementation

o                Maintenance 

·                 Product of SDLC Phases

·                 Approaches to Development

o         Prototyping

o         Joint Application Design

o         Participatory Design

·                Case Study

Unit 4:Introduction to Documentation of Systems

·                 Concepts and process of

·                 Documentation

·                 Types of Documentation

o                System Requirements Specification

o                System Design Specification

o                Test Design Document

o                User Manual

·                 Different Standard for Documentation

·                 Documentation and Quality of Software

·                 Good Practices for Documentation

 

Block 2:      Planning and Designing Systems

Unit 5  :Process of System Planning

 

·                 Fact finding Techniques

o                Interviews

o                Group Discussion

o                Site Visits

o                Presentations

o                Questionnaires

·                 Issues involved in Feasibility Study

o                Technical Feasibility

o                Operational Feasibility

o                Economic Feasibility

o                Legal Feasibility

·                 Cost Benefit Analysis

·                 Preparing Schedule

·                 Gathering Requirements of System

o                Joint Application Development

o                Prototyping

Unit 6:Modular and Structured Design

·                 Design Principles

o                Top Down Design

o                Bottom Up Design

·                 Structure Charts

·                 Modularity

o                Goals of Design

o                Coupling

o                Cohesion

Unit 7:System Design and Modelling

·                 Logical and Physical Design

·                 Process Modeling

o              Data Flow Diagrams

·                 Data Modeling

o                E-R Diagrams

·                 Process Specification Tools

o                Decision Tables

o                Decision Trees

o                Notation Structured English

·                 Data Dictionary

 

Block 3:      More Design Issues and CASE Tools

Unit 8:Forms and Reports Design

·                 Forms

o                Importance of Forms

·                 Reports

o                Importance of Reports

·                 Differences between Forms and

Reports

·                 Process of Designing Forms and

Reports

·                 Deliverables and Outcomes

·                 Design Specifications

o                Narrative Overviews

o                Sample Design

o                Testing and Usability Assessment

·                 Types of Information

o                Internal Information

o                External Information

o                Turnaround Document

·                 General Formatting Guidelines

o                Meaningful Titles

o                Meaningful Information

o                Balanced Layout

o                Easy Navigation

·                 Guidelines for Displaying Contents

o                Highlight Information

o                Using Colour

o                Displaying Text

o                Designing Tables and Lists

·                 Criteria for Form Design

o                Organization

o                Consistency

o                Completeness

o                Flexible Entry

o                Economy

·                 Criteria for Report Design

o                Relevance

o                Accuracy

o                Clarity

o                Timeliness

o                Cost

Unit 9:Physical File Design and Data base Design

·                 Introduction to Database design

o                Flat files vs. Database

o                Steps in Database Design

o                E-R model to Database Design

o                Inputs to Physical Database Design

o                Guidelines for Database Design

·                 Design of Data Base Fields

o                Types of Fields

o                Rules for Naming Tables and Fields

·                 Design of Physical Records

·                 Design of Physical Files

o                Types of Files

o                File Organization

·                 Design of Database

·                 Case Study

Unit 10:CASE Tools for Systems Development

·                 Use of CASE tools by organizations

o                Definition of CASE Tools

o                Use of CASE tools by Organizations

o                Role of CASE Tools

o                Advantages of CASE Tools

o                Disadvantages of CASE Tools

·                 Components of CASE

o                Types of CASE Tools

o                Classification of CASE Tools

o                Reverse and Forward Engineering

·                 Visual and Emerging CASE tools

o                Traditional systems development and CASE based systems development

o                CASE environment

o                Emerging CASE Tools

o                Objected oriented CASE tools

o                Creating documentation and reports using CASE tools

o                Creating and executable prototype using Object Oriented CASE tools

o                Sequence Diagrams

 

Block 4:Implementation and Security of Systems & MIS

Unit 11:Implementation and Maintenance of Systems

·                Implementation of Systems

o                Conducting System Tests

o                  Preparing Conversion Plan

o                  Installing Databases

o                  Training the end users

o                  Preparation of User Manual

o                  Converting to the new System

·                 Maintenance of Systems

o                Different Maintenance activities

o                Issues involved in Maintenance

Unit 12:Audit and Security of Computer Systems

·                 Definition of Audit

o                Objectives of Audit

o                Responsibility and Authority of the System Auditor

o                Confidentiality

o                Audit Planning

·                 Audit of Transactions on Computer

o                Transaction Audit

o                Audit of Computer Security

o                Audit of Application

o                Benefits of Audit

·                 Computer Assisted Audit Techniques

o                Audit Software

o                Test Data

o                Audit Expert Systems

o                Audit Trail

·                 Computer System and Security issues

o                Analysis of Threats and Risks

o                Recovering from Disasters

o                Planning the contingencies

o                Viruses

·                 Concurrent Audit Techniques

o                Need for Concurrent Audit

o                Techniques

o                An Integrated Test Facility

o                Techniques

o                The Snapshot Techniques

o                SCARF

o                Continuous and Intermittent

o                Simulation Technique

Unit 13:Management Information Systems

·                 Role of MIS in an organization

·                 Different kinds of Information Systems

o                Transaction Processing System

o                Management Information

o                System

o                Decision Support System

o                Expert System

Share/Save/Bookmark

  • No Related Post

 

IGNOU - MCA Syllabus,MCS-013: Discrete Mathematics (2 Credits)

Category: MCA Papers, MCA SYLLABUS    |    176 views    |    Add a Comment

Discrete mathematics, sometimes called finite mathematics, is the study of mathematical structure that are fundamentally discrete, in the sense of not supporting notion of continuity. A study of discrete sets has become more and more necessary because of many application of Computer Science and various areas of engineering. Regarding computer science concept from discrete mathematics are useful to study or express objects or problems in computer algorithm and programming languages. For instance, to improve the efficiency of a computer programs, we need to study its logical structure, which involves a finite number of steps each requiring a certain amount of time. Using the theory of combinatory and graph theory, major areas of discrete mathematics, we can do this. Therefore, a study of these areas would complement and improve the understanding of courses based on algorithm and problem solving.

This course is designed to give basic concepts of propositions, predicates, Boolean algebra, logic circuit, sets, relations, functions, combinatorics, partitions and distributions.

Syllabus

Block 1:      Elementary Logic

Unit 1:Prepositional Calculus

·                 Propositions

·                 Logical Connectives

o                Disjunction

o                Conjunction

o                Negation

o                Conditional Connectives

o                Precedence Rule

·                Logical Equivalence

·                Logical Quantifiers

 

Unit 2:Methods of Proof

·                What is a  Proof?           

·                Different Methods of Proof                     

o                Direct Proof

o                Indirect Proofs

o                Counter examples

·                 Principle of Induction

Unit 3:Boolean Algebra and Circuits

·                 Boolean Algebras

·                 Logic Circuits

·                 Boolean Functions

         

Block 2:      Basic Combinatorics

Unit 1:Sets, Relations and Functions

·                 Introducing Sets                                                                                  

·                 Operations on Sets                                                                             

o                Basic Operations

o                Properties Common to Logic and Sets

·                 Relations                       

o                Cartesian Product

o                Relations and their types

o                Properties of Relations

·                 Functions                             

o                Types of Functions

o                Operations on Functions

 

Unit 2:Combinatorics – An Introduction

·                 Multiplication and Addition Principles

·                 Permutations

o                Permutations of Objects not Necessarily Distinct

o                Circular Permutations

·                 Combinations                                                                                      

·                 Binomial Coefficients

·                 Combinatorial Probability

 

Unit 3:Some More Counting Principles

·                 Pigeonhole Principle                                                                            

·                 Inclusion-Exclusion Principle                                                                

·                 Applications of Inclusion – Exclusion                                                    

o                Application to Surjective

          Functions

o                Application to Probability

o                Application to Derangements

 

Unit 4:Partitions and Distributions

·                 Integer Partitions                                                                                

·                 Distributions

o                Distinguishable Objects into Distinguishable Containers

o                Distinguishable Objects into Indistinguishable Containers

o                Indistinguishable Objects into Distinguishable Containers

o                Indistinguishable Objects into Indistinguishable Containers

Share/Save/Bookmark

  • No Related Post