Post Graduate Diploma Prospectus
No.081738
in Computer Science
AMRAVATI UNIVERSITY
(FACULTY OF ENGINEERING & TECHNOLOGY)
PROSPECTUS
Prescribed For
Post Graduate Diploma in
Computer Science
Examination of 2007-2008
(One year Course)
(Bi-Annual Pattern)
2007
Price Rs.8/-
visit us at www.sgbau.ac.in
PUBLISHED
BY
C. D. Deshmukh
Registrar
Sant
Gadge Baba
Amravati
University
Amravati
- 444 602.
Ó "ªÉÉ +¦ªÉɺÉGòʨÉEäòiÉÒ±É (Prospectus) EòÉähÉiÉɽþÒ
¦ÉÉMÉ ºÉÆiÉ MÉÉb÷MÉä ¤ÉɤÉÉ +¨É®úÉ´ÉiÉÒ Ê´ÉtÉ{ÉÒ`öÉSªÉÉ {ÉÚ´ÉÉÇxÉÖ¨ÉiÉÒ
ʶɴÉÉªÉ EòÉähÉɺɽþÒ {ÉÖxɨÉÖÇÊpùiÉ ËEò´ÉÉ |ÉEòÉʶÉiÉ Eò®úiÉÉ ªÉähÉÉ®ú xÉɽþÒ"
Ó "No part of this prospectus can be
reprinted or published without specific permission of Sant Gadge Baba Amravati
University."
syllabus
prescribed
for
one
year post graduate diploma in
computer
science
semester
: first
1 CS 1/1 MCA 1 computer organization
unit I Chapter Objectives, Evaluation of
Computers and computer generations, Technological trends, Measuring
performance, speed up, Amdahl’s law, Von Neumann machine architecture,
Functional units and components in computer organization, Program development
tools, Operating systems.
Unit II From
Electron to Bits, Binary representation of positive integers, Negative
integers, Fixed point arithmetic operations on positive and signed (Negative)
integers, Floating-Point numbers (IEEE 754 standard) and operations, BCD
arithmetic operation, Design of ALU, Bit slice processors.
Unit III Concept
of instruction formats and instruction set, instruction set types, types of
operands and operations, Generation of memory addresses and addressing modes,
Subroutine nesting using stacks to implement subroutine calls and calling
conventions, Processor organizations, Register organization, Stack based
organizations, Encoding of machine instructions, General features of RISC and
CISC instruction sets, modern processors convergence of RISK with CISC,
Processor microarchitecture-I - Fundamental concepts for data path
implementation,Processor microarchitecture-II - Data path implementation,
microprogrammed execution, recent innovations in execution unit design.
Unit IV Instruction
pipeline, instruction pipeline hazards, overcoming hazards using a pipeline
with forwarding paths, instruction set design influence on pipelining, example
of pipelined CISC processor, example of pipelined RISC processor, VLIW (Very
Long Instruction Word) processors, Vector processors, Multithreaded processors,
Compilation techniques support to instruction level parallelism, Extracting
parallelism.
Unit V Some basic concepts, memory
hierarchy, internal organization of semiconductor main memory chips - RAM and
ROM, semiconductor main memories - RAM, semiconductor Read - Only memories -
ROMs, speed, size and cost, secondary storage magnetic ferrite core memories,
optical disks CD-ROM memories, data caches, instruction caches, and unified
cache, features describing a cache, cache implementations, multilevel caches.
Unit VI Virtual
memory organization, mapping functions for translating the program pages in
virtual to physical addresses space, partitioning, segmentation (superpages or
page blocks) partitioning of virtual address space in to segment and page
address, demand paging and swapping, cache and virtual swapping, cache and
virtual memory, inverted page tables concept, protection between programs
running on the same system, accessing I/O devices, programmed I/O, interrupts,
direct memory access DMA, bus arbitration, interface circuits, I/O interfaces,
I/O processors, external I/O devices.
Text Book : Computer Architecture by Micholus Carter &
Rajkamal, Schaum Series Pub.
1 CS 2/1 MCA 2 Problem
Solving using C++
unit I. Objects
& Classes in C++ : Declaring & using classes, Constructors, Objects as
functions arguments, Copy Constructor, Static class data. Arrays of objects,
C++ String class.
unit II. Operator
overloading : Overloading unary & binary operators. Data conversion.
Pitfalls of operator overloading. Pointers & arrays. Pointers &
functions. new & delete operators. Pointers for objects.
unit III. Inheritance
in C++ : Derived class & base class, Derived class constructors, Function
overloading, class hierarchies, Public and private inheritance, Multiple
inheritance. Containership : classes within classes.
unit IV. Virtual
functions concepts, Abstracts classes & pure virtual functions. Virtual
base classes, Friend functions, Static functions, Assignment and copy
initialization, the this pointer. Dynamic type information.
unit V. Streams
& Files in C++ : Stream classes, stream errors, disk file I/O with streams,
File pointers, Error handling in file I/O. File I/O with members functions,
overloading the extractions & insertion operators, Memory as a stream
object, command-line arguments. Multifile programs.
Unit VI. Function
Template, Class templates, Exception syntax, Multiple exceptions, exception
with arguments. Introduction to the Standard Template Library. Algorithms, Sequential Containers, Iterates,
Specialized iterates, Associative containers. Function objects.
Text-Book :
1. Savitch:
Problem Solving using C++ (Addison Wesley) Low-Priced Edition.
References :
1. Robert Lafore Object-Oriented Programming in C++ (Galgotia)
2. Herbert Schildt
C++ : Complete Reference (TMH)
3. Bjarne
Stroustrupe C++ Programming Language (Addison-Wesley)
4. Venugopal
Mastering C++ (TMH)
5. Lipmann C++
Primer (Addison-Wesley)
1 CS 2/1MCA2 Lab: List of Programs
The sample list of
program is given below. This list can be used as guide line for problem
statements but the scope of the laboratory should not be limited to the same.
Aim of the list is to inform about minimum expected outcomes.
1 Write
a C++ program to implement a stack with its constructor and two member
functions PUSH and POP
2 Write
a C++ program to find product of two same numbers from 0 to 9 stored in an
object array of 10 objects and then
free the memory space occupied by an object array
3 Write
a C++ program to overload minus operator as an unary and binary operator
4 Write
a C++ program using friend operator function to overload plus binary operator
5 Write
a C++ program to calculate the circumference of an earth (subclass) after
getting distance of it measured from
sun from planet (super class)
6 Write
a C++ program for an inventory that stores the name of an item, the number
on hand, and its cost. Include an
inserter and an extractor for this class
7 Write
a C++ program that creates an output file, writes information to it, closes the
file and open it again as an input file
and read the information from the file
8 Write
a C++ program that counts number of words in a file
9 Write
a C++ program to create an abstract class area having an abstract function
get Area which will find an area of
derived classes rectangle and triangle
10
Write a C++ program to create a generic function that swaps the values
of the two variables it is called with”
1 CS 3 /1MCA3 3Computer Oriented Statistical Methods
UNIT-I : Introduction
Definitions
: Websters, secrists, Gronton and Cowden definitions of statistics
Improtance
of statistics
Scope
of statistics : Industry, Economy, Planning, medical science, Computer Science
etc.
Limitations
of statistics.
General
principles of classification of data.
Construction
of Frequency distribution, cummulative frequency distribution, relative
frequency distribution. Graphical
representation of frequency distribution.
Diagrammatic
representation : Simple bar, subdivided bar, pie diagram.
Numerical
Problems.
UNIT-II : Measures of central Tendency &
Measures of dispersion:
Concept
of central tendency, criteria for good measures of central tendency.
Arithmetic
mean for grouped and ungrouped date, properties of a.m., combined mean,
weighted mean, merits and demerits. Median, mode, G.M., H.M. for grouped &
ungrouped data with its merits & demerits.
Partition
values : quartiles, deciles, percentiles
Numerical
problems on central tendency.
Concept
of dispersion criteria for good measures of dispecrsion.
Measures
of dispersion : Range, quartile deviation, mean deviation, S.D. for grouped
& ungrouped data with its merits & demerits Variance : Definition for
grouped & ungrouped data, combined variance, co-efficient of Dispersion,
co-efficient of variation. Numerical problems on measures of dispersion.
UNIT-III : Moments,
measures of Skewness and Kurtosis correlation
Raw
& Central moments : for grouped & ungrouped data (upto first four
moments) & their relationships. Skewness, measures of skewness, co-efficient
of skewness, bempirical relation between mean, mode, median. Pearson’s &
Bowley’s co-efficient of Skewness. Kurtosis & types of kurtic curves,
co-efficient at Kurtosis based on moments.
Numerical
problems on moments, co-efficient of skenmen & co-efficient of Kurtosis.
Unit-IV Corelation
: Concept of correlation for bivariate data, scatter diagram, positive,
negative & no correlation, cause and effect relationship.
Karl
pearson’s co-efficient of correlation(r), limits at r and interpretation of r,
assumption on r.
Effect
of change of origin & scale on r, independence of variables.
Spearman’s
Rank correlation, repeated rank correlation.
Numerical
problems on karl pearsons & spearman’s rank correlation co-efficient.
UNIT-V : Regression
:
Concept
of regression & linear regression
Derivation
of regression lines by method of least squares.
Properties
of regression co-efficients.
Linear
and Non-linear regression : Fitting of second degree curve & curve y=abx by
least square method.
Numerical
problems on linear & non-linear regression.
Multiple
regression by yule’s notations (for tri-variat data)
Multiple
correlation & partial correlation.
UNIT-VI : Time series :
Definition
of Time series & uses of time series
Components
of Time series, Additive & multiplicative models.
Methods
of estimating treand by moving average method graphical method, semiavarage
method & by least square methods.
Numerical
problems on Time Series.
Text Books:
j.N. Kapoor : Mathematical
Statistics (MCG)
Trivedi : Probability
and Statistics with Computer Science Applica tions (TMH)
References:
1. Statistical
Methods (An Introductory Text) : J. Medhi
2. Modern
Elementary Statisics : J.E. Freund
3. Statistical
Methods : S.P. Gupta
4. Fundamentals of
Statistics : Goon, Gupta, Dasgupta
1 CS 3/ 1MCA3 Practicals on Statistical Methods:
Minimum 12 practicles to
be performed throughout the semester based on following (using C or C++
language).
1. Construction of frequency distribution,
graphical methods & diagrammatic representation.
2. Problems on measures of Central
Tendency.
3. Problems on measures of disperssion.
4. Problems on moments, measures of
Shewmen and Kurtosis.
5. Computation of correlation co-efficient
for bivariate data.
6. Fitting of linear & non linear
regression lines
7. Computation of rank correlation
co-efficient
8. Problems on time series .
1 CS 4/1MCA4 PRINCIPLES
OF MANAGEMENT
(8
hours/unit)
UNIT I Introduction
: Definition and concepts of management, Importance of management .Various
management functions & control, responsibilities. Human resources planning
, Decision-making, Trade unions & collective bargaining.
UNIT II Organization
planning, design and development: Production resources, Production planning,
types of production system, production systems, production control.
UNIT III Product
design & development : Introduction, design of the product, New
product development; Material planning
and control. Inventory control technique .
UNIT IV Maintenance and system reliability:
Concepts and Objectives of maintenance. Failure analysis,Reliability
Maintenance system & Classification. Maintenance planning, TQM ISO 9000 and
Quality audit.
UNIT V Marketing
management : Introduction, marketing
planning . Consumer behavior, product management, Pricing & promotion
decision.Financial planning. Source of
finance.
UNIT VI Project
Management: Concepts and importance of project, Project implementation, MIS.MIS
meaning and objectives. Types of data, methods of data collection, analysis and
presentation of data. Editing,
reporting and presentation of data, Decision options.
Text book :
A.K.Gupta,J.K.
Sharma : Management of Systems (Macmillan)
Referances :
1.Appleby :
Modern Business Administration, 6/e (Macmillan)
2.Tritaphy & Reddy :
Principals of Management, 2/e (TMH)
3.Gupta, Sharma et :
Principales of Practices of Management
(Kalyani)
1 CS 5/1MCA5 COMMUNICATION
SKILLS
Unit I: Comprehension - word study :-
Synonym,
antonym, meanings, matching words, adjectives, adverbs, prefix and suffix,
correct forms of commonly misspelled words, understanding of the given passage.
Skimming
for general ideas, Contextual vocabulary, Error detection, Note making and
Location of argument from text, Ability to answer inferential, factual and
personal response.
Unit-II
Comprehension - - Structure study :-
Simple
and compound sentences, types of conjunctions, singular and plural, tenses and
their effect on verb forms. Use of - not only - but also, if clause, since,
may, can, could, would, too etc. Active and passive forms, negative and
interrogative, punctuation and capitalization.
Unit
III Theoretical background -
importance of communication, its process, model of communication its components
& barriers. Types of written communication, organization of a text (Titles,
summaries, headings, sequencing, signaling, cueing etc.), Important text
factors (length of paragraph, sentences, words, clarification and text
difficulty). Evaluation of written communication for its effectivity and
subject content.
Unit IV Specific
formats for written communication like - business correspondence, formal
reports, technical proposals, research papers and articles, advertising and
graphics. Format for day-to-day written communication like applications,
notices, minutes, quotations, orders, enquiries etc. Letter writing,
Preparation of Curriculum – Vitae,Composing messages-telegrams, telex,fax and
e-mail Writing memos, agendas and notices of
meetings, Preparing advertisements.
Unit-V
Oral
communications - Important objectives of interpersonal skills, Verbal
communication, its significance, face to face communications, group discussion
and personal interviews. Voice modulation and logical argument, Comprehension
of text at normal reading speed. Listening skill and timely response,
Participation and contribution to discussion, Command over language Formal and
informal style of communication, Body language.
Unit-VI Non-verbal communication, types of
graphics and pictoral devices. Meaning
and purpose of meetings,seminars, symposia, conference and workshop.
Methodology of conduction of meetings, seminars, symposia, conference and workshop. Brochure preparation for
seminars, symposia, conference and
workshop. Preparation of minutes of meeting.
Books
Recommended :
1) Krishna
Mohan, Meera Banerjee : Developing Communication Skills, MacMillan India
Limited.
2) Chrissie
Wright (Editor) : Handbook of Practical Communication Skills, Jaico Publishing
House.
3) Curriculum
Development Centre, TTTI WR, Bhopal : A Course in Technical English, Somaiya
Publication Pvt. Ltd.
4) F.Frank
Candlin : General English for Technical Students, University of London Press
Ltd.
COMMUNICATION SKILLS
LABORATORY
Objective :
On
completion of this laboratory the candidate should be able to demonstrate
adequate skills in oral and written
communication for technical English language, actively participate in group discussions and interviews and exhibit
the evidence of vocabulary building. Candidates should be assessed through continuous monitoring and evaluation.
The
sample list of experiments is given below. This list can be used as guideline
for problem statements but the scope of the laboratory should not be limited to the same. Aim of
the list is to inform about minimum expected
outcomes.
1. Assignments and tests for vocabulary
building
2. Technical report writing
3. Group discussions
4. Interview techniques
5. Projects and tasks such as class news
letter
6. Writing daily diaries and letters
7. Interactive language laboratory
experiments.
Text book : Norman Lewis : Word power made easy
http://www.teachingenglish.org.uk
1 CS 6/1MCA 6 Computer Laboratory-I
1. Introduction
to Windows.
2. Introduction to MS-Word.
3. Introduction to MS-Excel.
4. Introduction to MS-PowerPoint.
5. Introduction to MS-Access
6. Introduction to Tally.
7. Introduction to MS-Internet Explorer.
*****
semester :
second
2 CS 1/2 MCA 1 Data Structures & Algorithms
Unit-I Data
structures basics, Mathematical/algorithmic notations & functions,
Complexity of algorithms, Subalgorithms. String processing: storing strings,
character data type, string operations, word processing, and pattern matching
algorithms.
Unit-II Linear
arrays and their representation in memory, traversing linear arrays, inserting
& deleting operations, Bubble sort, Linear search and Binary search
algorithms. Multidimensional arrays, Pointer arrays. Record structures and
their memory representation. Matrices and sparse matrices.
Unit III Linked
lists and their representation in memory, traversing a linked list, searching a
linked list. Memory allocation & garbage collection. Insertion deletion
operations on linked lists. Header linked lists, Two-way linked lists.
Unit-IV Stacks
and their array representation. Arithmetic expressions: Polish notation. Quick
sort, an application of stacks, Recursion. Tower of Hanoi problem.
Implementation of recursive procedures by stacks, Queues. Deques. Priority
queues.
Unit-V Trees,
Binary trees & and their representation in memory, Traversing binary trees.
Traversal algorithms using stacks, Header nodes: threads. Binary search trees,
searching, inserting and deleting in binary trees. Heap and heapsort. Path
length & Huffman’s’ algorithm. General trees.
Unit-VI Graph
theory, sequential representation of graphs, Warshalls’ algorithm, Linked
representation, operations & traversing the graphs. Posets &
Topological sorting. Insertion Sort, Selection Sort. Merging & Merge-sort,
Radix sort, Hashing.
Text Book:
Seymour
Lipschutz: “Theory & Problems of Data Structures”, Schaum’s Outline Series
(McGraw-Hill) Int. Editions.
References:
1. Ellis Horowitz, Sartaj Sahni –
Fundamentals of Data Structures (CBS Publications)
2. Trembley, Sorenson:- An Introduction
to Data Structures with Applications. (TMH)
3. Kutty: Data Structures using C++ (PHI)
4. Bhagat Singh, Naps : Introduction to
Data Structures (TMH)
DATA STRUCTURES- LABORATORY
The sample list of
program is given below. This list can be used as guideline for problem
statements but the scope of the laboratory should not be limited to the same.
Aim of the list is to inform about minimum expected out comes. Further, C,C++
or Java may be used as the programming
language.
1. Write an application to implement
Tower of Hanoi Problem Algorithm.
2. Write an application to implement Abstract
data type stack
3. Write an program to evaluate Post fix
expression using stack
4. Write a program to implement Abstract
data type queue.
5. Write a program to implement singly
linked list that performs various operation such as insertion, deletion, searching
a node in linear linked list.
6. Write a program to implement Preorder
Traversal of a binary tree.
7. Write a Program to search a given
element using Binary Search.
8. Write a Program to implement Selection
Sort.
9. Write a Program to implement Merge
Sort.
10. Write a Program to Perform insertion or
search in a specified level of a stack implemented tree- structured symbol
table.
2 CS 2/2 MCA 2 Object Oriented Programming
Unit-I MFC
Introduction: MFC history, Architecture & class hierarcy, Creating an
application, modifying the application, tooltips, DDX, uses of standard dialog
boxes, File Open/Save, color selector, Font Selector, Print Dialog.
Unit-II Windows
Common Controls: Initialization & Modification, Hotkey controls, Spin
control, Slide Control, Progress bar, Image list, List View controls, List view
items, Tree view controls, Tab Controls, Animate Controls Rich Edit Controls.
Unit-III Device
Controls & GDI: MFC Dc classes, Windows graphics objects, Vector Graphics,
Fonts & Text, Raster graphics. Bitmaps: Device dependent & independent
bitmaps. Bitmap resources. Sample Programs.
Uint-IV Custom
control development: Validating control, clock state control, hyperlink
control, Cursor Control, Mouse & Keyboard inputs, MFC Apllication object:
details, Message routing, message maps & categories, Idle processing,
Splash screen component.
Unit-V Document
–view Architecture: Documents, Frames, & Views, New document creation,
Views: various views classes & their applications in SDI/MDI. Extending the
user interface: Keyboard /Mouse messaging, Extending Menus, Property sheets
& Wizards.
Unit-VI Printing
Fundamentals: Printing with MFC, GDI mapping modes, WYSIWYG printing,
pagination, stopping & aborting the printing. String classes. Cfile
class, CfileDialog class, Practical
usage of Cfile class, CfileDialog classes. MFC Exceptions.
Text Books:
1. David White, others: MFC Programming
Using Visual C++ Unleashed (Techmedia
Publications)
2. Jeff Prosise: Programming Windows with
MFC (Microsoft Press)
References:
1. Herbert Schildt : MFC
from Bottom up (TMH)
2. Al Steven : MFC Black Book (IDG)
3. Kruglinski : Inside Visual C++ (Microsoft Press)
2 CS 2/2 MCA 2 Object Oriented Programming Labs:
Minimum 12 programs
based on the above syllabus with at least two programs on each unit and the
recent version of VC++ should be used.
2 CS 3 /2 MCA 3
System Analysis & Design
unit I. Introduction : System Analysis &
Design concepts. Role of system analyst. Review of System DLC. Organization as
systems. Levels of management culture. Project fundamentals. Feasibility study.
Activity planning & control. Managing analysis & design activities.
unit II. Sampling and investigating hard data.
Interviewing. Planning & conducting interview & reporting. Joint
application design. Using questionnaries. Planning designing and administering
the questionnaire.
unit III. Coservation of a decision-makers
behavior and office environment. Prototyping : User reactions. Approaches to
prototyping & developing prototype. Data flow aproach to requirements.
Developing DFDs. Logical & Physical DFDs. Examples of DFDs.
unit IV. Data dictionary concept. Data
repository. Creating & using data dictionary. Overview of process
specifications. Structured English, Decision tables/trees. Decision support
system & decision making concepts relevant to DSS. Semi structured
decisions. Multiple-criteria decision-making.
unit V. System Proposal : Ascertaining hardware/software needs.
Identifying
& forecasting cost/benefit & comparing cost/benefit. Writing and
presenting the systems proposals. Principles of Delivery.
unit VI. Output Design Objectives. Designing
printed output, Screen output. Input Design objectives. Form Design. Screen
Design for input. Introduction to OOSAD. : Object-Oriented Analysis.
Object-Oriented Design.
Text-book :
Kenneth E.Kendall & : “System Analysis and Design”
Julie E.Kendall (Pearson
Education) 3/e
References :
1. Yeates “System Analysis & Design”
(Macmillan)
2. J.Fitgerald & A.Fitgerald.
“Fundamentals of System Analysis & Design” (John-Wiley) 3/e
3. Edward “System Analysis & Design”
(McGraw-Hill)
4. Whilten, Bentley, Barlow “System
Analysis & Design Methods” (Galgotia) 2/e.
2 CS 3/2MCA 3 Labs : 8 to 10 Examples of SAD from text book
covering each unit of syllabus, using any available SAD tool, as from one
available with text book.
2 CS 4/2MCA 4 Data Communications
Unit-I : Data communication concepts, uses
and applications.
Telephone
: Voice communication networks, Switches, PBX cellular technologies, Fax. IVR,
Voice Mail.
Unit-II : Hardware; network architecture,
Hosts, Clients, Circuits, Special purpose Communication Devices, FEP,
Multiplexers, Protocol Coverters, Line adapters.
Unit-III: Data
transmission : Coding, Transmission modes, Band width, Modulation, Modem :
Types and Standards, PAM & PCM techniques, Connector cables.
Unit-IV: OSI
model, MAC protocol; Controlled & contention-based, Error control in
networks, Data link Protocols : asynchronous & synchronous Transmission
effeciency.
Unit-V : Network Layer : Topologies. Network
routing, Network Standards and network protocols : TCP/IP, IPX/SPX, X.25 &
GOSIP protocols.
Unit-VI: LANs :
uses and types, LAN components. Ethernet : topology, MAC, types, Token rings :
topology, MAC, types, Other types of LANs, MAP (IEEE 802.4)., ArcNet, Apple
Talk.LAN performance improvement, selecting a LAN.
Text book
:
1. J.Fitzgerald & A Denis Business
Data Communication & Networking, (5/e) (John Wiley & Sons)
References:
1. Schweber: Data Communication (McGrawHill)
2. Miller : Digital & Data Communication
(Jaico)
*****
2CS5 Business
Computing
Unit-I : Database definitions. Various types,
Relational Database, Oracle & its recent versions, ORDBMS characteristics.
Oracle Architecture, Memory, Process, Physical and Logical Structures in
Oracle.
Unit-II : Various Database Objects : Table
space, Schema, Table, Views, Sequence, Clusters, Snapshots, Data access SQL
Commands, Oracles’ Procedural Extension, Oracle Queries.
Unit-III : Various
Functions In SQL : Oracle Conversion, Date, Numeric, and Character Functions,
Single and Multiple row Functions, Complex queries, Outer Joins.
Unit-IV : Tables
& table-related commands, Privileges, Storage for tables, commands for
modifying, Renaming, dropping, altering the table, commands for modifying the
table data.
Unit-V : PL/SQL : Syntax overview, block
structure, Variables, Program flow, Procedures, Functions, triggers, cursors,
Packages, in PL/SQL, Error handling in PL/SQL.
Unit-VI : Database
Constraints : basics, Creating & modifying constraints, Keys and other
constraints, Oracle users, different types of privileges, Roles, Profiles.
Books :
1. Lave Singh etal
Orcle Developers’ Guide (Techmedia)
2. Oracle Press
Introduction to Oracle (TMH)
3. Oracle
Unleashed (Sams)
2CS5 Laboratory : Based
on above syllabus : Minimum Twelve lab.
Assignments
2 CS 6 PROJECT
******
*Ordiance No. 3 of 1987
Examination leading to the Post-Graduate Diploma in
Computer Science (One Year Course) Ordiance, 1987.
Whereas it is expedient to make
an Ordiance in respect of Examination leading to the Post-Graduate Diploma in
Computer Science (One Year) for the purpose hereinafter appearing, the
Executive Council is hereby pleased to make the following Ordiance.
1. This
Ordiance may be called Examination leading to the Post-Graduate Diploma in
Computer Science (One Year) Ordinace 1986.
2. This Ordiance shall come into
force w.e.f. the session 86-87.
3. Following shall be the
Examinations leading to the Post - Graduate Diploma in Computer Science namely.
(i). Post Graduate Diploma in ComputerScience.Part-I Examination.
(ii). Post Graduate Diploma in Computer Science.Part-IIExamination.
4. Duration of each of the above
Parts shall be one Term with an examinations at the end of each Term.
5 .(i) The examinations specified in paragraph 3
above shall be held twice a year at such places and on such dates as may be
appointed bythe Academic Council.
(ii) Main Examination of Part-I shall be held in Winter and
Supplementary Examination inSummer.
(iii) Main Examination of Part-II shall be heldin
Summer and Supplementry Examination in Winter.
6. Subject to his/her compliance with the provisions of this Ordinance and other Ordinances in force time to time folowing candidates are eligible for admission to the Post-Graduate Diploma (One Year) in Computer Science :-
Graduates of the University or of any statutory University equivalent there to, in any faculty with 50% marks (45% for B.C. Candidates at the degree level) and offering Mathematics and Statistics at the H.S.S.C. XII th standard of equivalent Examination.
7. For purposes of instruction and examinations the students shall study sequentially.
8. Subject to his/her compliance with the provisions of this Ordiance and other Ordinances (Pertaining to examination in General) in force from time to time, the applicant for admission to examination at the end of the course of study of a particular part shall be eligible to appear at it, if:
(i) He/She satisfied the condition in the table and the Provision there under :-
* Ordiance to be effective from the Academic session 1986-87 as approved by the Executive Council, Dt. 4-3-1987.
TABLE
Sr. Name
of examination The student
should have
No. completed the
term satisfactorily
1 2 3
1. Diploma
inComputer Part I
Science
Part I
2. Diploma
in Computer Part - II
Science
Part II
(Note - Subjects prescribed and numbered in the scheme of Examination shall be treated as seperate subjects, however, the theory and pracital, if any, of the subject shall be treated as seperate Head of Passing.)
(ii) He/She has compiled with provisions ofOrdiance pertaining to Examination ingeneral.
(iii) He/She has prosecuted a regular courseof study in University Department/CollegeAffiliated to the University.
(iv) He/She has in the opinion of the Head oftheDepartment/Principal,shown satisfactory progress in his/her studies.
9. Papers and the Practicals in ‘which an examinee is to examined, Maximum marks for these and the minimum pass mark which an examinee must obtain in order to pass in the subject and the examination are detailed in the Examination Scheme.
10. Examination fees for each part of the examination and also the practical examination shall be as prescribed by the University for time to time.
11. An examinee who is successful at Part-I and Part-II examinations under this Ordinance and who obtaine 75% or more marks in aggregate of Part-I and Part-II Examinations shall be placed in the First Division with Distinction, those obtaining 60% or more but less than 75% shall be placed in the First Division and all other successful examiness shall be placed in the Second Division.
12. (i) Scope of the subjects shall be as indicated in the syllabus.
(ii) Medium of instruction and examination shall be English.
13. Provisions of Ordinance No. 7-A relating to condonation of deficiency of marks for passing an examination shall apply to the examination under this Ordinance.
14. An examinee who does not pass or who fails to present himself/herself for the examination shall be eligible for readmission to the same examination on payment of fresh fees and such othe fees as may be prescribed.
15. As soon as possible after the examination, the Executive Council shall publish a result of the examinees. The result of the examinations shall be classified as above and merit list shall be notified as per Ordiance No. 6
16. Notwistanding anything to the contary in this Ordiance no one shall be admitted to an examination under this Ordinance, if he/she has already passed the same examination or an equivalent examination of any Statory University.
17. Examinees who have passed in all the subject prescribed for Part-I and Part-II of the examination of the Diploma course shall be eligible for award of the Post-Graduate Diploma in Computer Science (One Year)
******
direction
No.14/2007. Date
:12/4/2007.
Subject : Examinations
leading to the Post Graduate Diploma (One Year Course) in Computer Science
Whereas Regulation No. 19 of 1986 in respect of Examinations leading to
the Post Graduate Diploma (One Year Course) in Computer Science Regulation, 1986 is in existence in the University,
AND
Whereas the Academic Council in
its meeting held on 29-12-2006 vide
Item No. 78 (7) (D) (R-1) (b) has accepted modified schemes of teaching &
examinations and syllabi of Post Graduate Diploma (One Year Course) in Computer
Science to be implemented from the academic session 2007-2008,
AND
Whereas the modified schemes of
teaching & examinations of Post Graduate Diploma (One Year Course) in
Computer Science are required to be regulated by the Regulation,
AND
Whereas the matter regarding
making of amendments in existing Regulation is likely to take some time,
AND
Whereas the modified schemes of
teaching & examinations of Post Graduate Diploma (One Year Course) in
Computer Science are to be implemented
from the academic session 2007-2008 and syllabi of Post Graduate Diploma (One Year Course) in Computer Science
course has to be sent for printing for the session 2007-2008.
Now, therefore, I, Prof. Dr.
Kamal Singh, Vice-Chancellor of Sant
Gadge Baba Amravati University, Amravati in exercise of powers conferred upon
me under sub section (8) of Section 14 of the Maharashtra Universities Act,
1994, hereby directs as under :-
1. This Direction shall be called “Examinations leading to the Post Graduate Diploma (One Year Course) in Computer Science, Direction, 2007.”
2. This Direction shall come into force from the date of its issuance.
3. ‘Appendix-A’ appended with the Regulation in respect of Examinations leading to the Post Graduate Diploma (One Year Course) in Computer Science Regulation, 1986 i.e. Regulation No. 19 of 1986, be substituted by “Appendix-A” annexed with this Direction.
Amravati Sd/-
(Kamal Singh)
Date :9/4/2007 Vice-Chancellor
“Appendix-A”
One
Year Post Graduate Diploma Course
Post graduate
Diploma in computer science
semester
pattern
semester-I
Sr. Sub. Subject No.
Code Teaching
Scheme Examination
Scheme
No. L P Total Theory Practical
periods/ Dura-
Max. Max. To- Min. Max. Max.
To- Min.
week tion
Marks Marks tal pass Mar- Marks tal Pass
of Theory College marks ks College Marks
Papers Papers Assess- Assess-
Hrs) ment. ment
1. 1CS1/1MCA1 Computer
Organisation 4 - 4 3 80 20 100
40 -- -- -- --
2. 1CS2/1MCA2 Problem
Solving using C++ 4 2 6 3 80 20 100
40 25 25 50 25
3. 1CS3/1MCA3 Computer
Oriented Statistical 4 2 6 3 80 20 100
40 25 25 50 25
Methods
4. 1CS4/1MCA4 Prinples of
Management 4 - 4 3 80 20 100
40 -- -- -- --
5. 1CS5/1MCA5 Communication
Skills 4 2 6 3 80 20 100
40 25 25 50 25
6. 1CS6/1MCA6 Computer
Lab.-I - 4 4 - -- -- -- -- 50 50 100 50
TOTAL 20 10 30 500 250
grand
total : 750
semester-II
1. 2CS1/2MCA1 Data Structures
& Algorithms 4 2 6 3 80 20 100
40 25 25 50 25
2. 2CS2/2MCA2 Object
Oriented Programming 4 2 6 3 80 20 100
40 25 25 50 25
3. 2CS3/2MCA3 Systems
Analysis & Design 4 2 6 3 80 20 100
40 25 25 50 25
Methods
4. 2CS4/2MCA4 Data
Communications 4 - 4 3 80 20 100
40 -- -- -- --
5. 2CS5 Business
Computing 4 2 6 3 80 20 100
40 25 25 50 25
6. 2CS6 Project - 4 4 - -- -- --
-- 50 50 100 50
TOTAL 20 12 32 500 300
grand
total : 800
v