examinations, 2010-2011 first year m.c.a. master in ... · papers and articles, advertising and...
TRANSCRIPT
M.C
.A.
Prospectus No. 111722
First Year
∫…∆i… M……b˜M…‰ §……§…… +®…Æ˙…¥…i…“ ¥…t
……“`ˆ
SAN
T GA
DG
E BA
BA A
MR
AVATI UN
IVERSITY
(FACU
LTY OF EN
GIN
EERIN
G & TEC
HN
OLO
GY)
PRO
SPECTU
S
Prescribed for
MA
STER IN
CO
MPU
TER A
PPLICATIO
N
FIRST Y
EAR
M.C
.A.
Examinations, 2010-2011
CREDIT GRADE SYSTEM
2010
(Price Rs.10/-)
PUBLISH
ED BY
Dineshkum
ar JoshiR
egistrarSant G
adge Baba
Am
ravati University
Am
ravati- 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……Ω˛“"
"N
o part of this prospectus can be reprinted or publishedw
ithout specific permission of Sant G
adge Baba Am
ravatiU
niversity."Visit us at w
ww
.sgbau.ac.in
SYLLA
BUS
PRESC
RIBED
FOR
THREE YEAR PO
ST GRADUATE DEG
REE COURSE
MA
STER IN
CO
MPU
TER A
PPLICATIO
NS
FIRST YEARSEM
ESTER : FIR
ST
1 MC
A 1/ 1 C
S 1CO
MPUTER O
RGANIZATIO
N
Unit I
Chapter O
bjectives, Evaluation of Com
puters and computer
generations, Technological trends, Measuring perform
ance,speed up, A
mdahl’s law, Von N
eumann m
achine architecture,Functional units and com
ponents in computer organization,
Program developm
ent tools, Operating system
s.
Unit II
From Electron to B
its, Binary representation of positive
integers, Negative integers, Fixed point arithm
etic operationson positive and signed (N
egative) integers, Floating-Pointnum
bers (IEEE 754 standard) and operations, BCD arithm
eticoperation, D
esign of ALU
, Bit slice processors.
Unit III
Concept of instruction form
ats and instruction set, instructionset types, types of operands and operations, G
eneration ofm
emory addresses and addressing m
odes, Subroutinenesting using stacks to im
plement subroutine calls and calling
conventions, Processor organizations, Register organization,
Stack based organizations, Encoding of machine instructions,
General features of R
ISC and C
ISC instruction sets, m
odernprocessors convergence of R
ISK w
ith CISC
, Processorm
icroarchitecture-I - Fundamental concepts for data path
implem
entation,Processor microarchitecture-II - D
ata pathim
plementation, m
icroprogramm
ed execution, recentinnovations in execution unit design.
Unit IV
Instruction pipeline, instruction pipeline hazards, overcoming
hazards using a pipeline with forw
arding paths, instructionset design influence on pipelining, exam
ple of pipelined CISCprocessor, exam
ple of pipelined RISC processor, VLIW
(VeryLong Instruction W
ord) processors, Vector processors,M
ultithreaded processors, Com
pilation techniques supportto instruction level parallelism
, Extracting parallelism.
Unit V
Some basic concepts, m
emory hierarchy, internal organization
of semiconductor m
ain mem
ory chips - RA
M and R
OM
,sem
iconductor main m
emories - RA
M, sem
iconductor Read -O
nly mem
ories - RO
Ms, speed, size and cost, secondary
storage magnetic ferrite core m
emories, optical disks CD
-ROM
12
mem
ories, data caches, instruction caches, and unified cache,features describing a cache, cache im
plementations, m
ultilevelcaches.
Unit V
IV
irtual mem
ory 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 sw
apping, cache andvirtual sw
apping, cache and virtual mem
ory, inverted pagetables concept, protection betw
een programs running on the
same system
, accessing I/O devices, program
med I/O
,interrupts, direct m
emory access D
MA
, bus arbitration,interface circuits, I/O
interfaces, I/O processors, external I/O
devices.Text Book :
Com
puter Architecture by M
icholus Carter &
Rajkam
al,Schaum
Series Pub.
1 MC
A 2 / 1 C
S 2PR
OBLEM
SOLV
ING
USIN
G C
++
Unit I.
Objects &
Classes in C
++ : Declaring &
using classes,C
onstructors, Objects as functions argum
ents, Copy
Constructor, Static class data. A
rrays of objects, C++ String
class.
Unit II.
Operator overloading : O
verloading unary & binary operators.
Data conversion. Pitfalls of operator overloading. Pointers &
arrays. Pointers & functions. new
& delete operators. Pointers
for objects.
Unit III.
Inheritance in C++ : D
erived class & base class, D
erivedclass constructors, Function overloading, class hierarchies,Public and private inheritance, M
ultiple inheritance.C
ontainership : classes within classes.
Unit IV.
Virtual functions concepts, A
bstracts classes & pure virtual
functions. Virtual base classes, Friend functions, Static
functions, Assignm
ent and copy initialization, the this pointer.D
ynamic type inform
ation.
Unit V.
Streams &
Files in C++ : Stream
classes, stream errors, disk
file I/O w
ith streams, File pointers, Error handling in file I/O
.File I/O
with m
embers functions, overloading the extractions
& insertion operators, M
emory as a stream
object, comm
and-line argum
ents. Multifile program
s.
34
Unit V
I.Function Tem
plate, Class tem
plates, Exception syntax,M
ultiple exceptions, exception with argum
ents. Introductionto the Standard Tem
plate Library. Algorithm
s, SequentialC
ontainers, Iterates, Specialized iterates, Associative
containers. Function objects.Text-Book :1.
Savitch: Problem Solving using C
++ (Addison W
esley) Low-Priced
Edition.R
eferences :1.
Robert Lafore O
bject-Oriented Program
ming in C++ (G
algotia)2.
Herbert Schildt C
++ : Com
plete Reference (TM
H)
3.B
jarne Stroustrupe C++ Program
ming Language (A
ddison-Wesley)
4.Venugopal M
astering C++ (TM
H)
5.Lipm
ann C++ Prim
er (Addison-W
esley)
1MC
A3 / 1 C
S 3 CO
MPU
TER O
RIEN
TED STATISTIC
AL M
ETHO
DS
UN
IT-I :IntroductionD
efinitions : Websters, secrists, G
ronton and Cow
dendefinitions of statisticsIm
protance of statisticsScope of statistics : Industry, Econom
y, Planning, medical
science, Com
puter Science etc.Lim
itations of statistics.G
eneral principles of classification of data.C
onstruction of Frequency distribution, cumm
ulativefrequency distribution, relative frequency distribution.G
raphical representation of frequency distribution.D
iagramm
atic representation : Simple bar, subdivided bar, pie
diagram.
Num
erical Problems.
UN
IT-II : Measures of central Tendency &
Measures of dispersion:
Concept of central tendency, criteria for good m
easures ofcentral tendency.A
rithmetic m
ean for grouped and ungrouped date, propertiesof a.m
., combined m
ean, weighted m
ean, merits and dem
erits.M
edian, mode, G.M
., H.M
. for grouped & ungrouped data
with its m
erits & dem
erits.Partition values : quartiles, deciles, percentilesN
umerical problem
s on central tendency.C
oncept of dispersion criteria for good measures of
dispecrsion.
Measures of dispersion : R
ange, quartile deviation, mean
deviation, S.D. for grouped &
ungrouped data with its m
erits&
demerits
Variance : Definition for grouped &
ungroupeddata, com
bined variance, co-efficient of Dispersion, co-
efficient of variation. Num
erical problems on m
easures ofdispersion.
UN
IT-III :M
oments, m
easures of Skewness and K
urtosis correlationR
aw &
Central m
oments : for grouped &
ungrouped data(upto first four m
oments) &
their relationships. Skewness,
measures of skew
ness, co-efficient of skewness, bem
piricalrelation betw
een mean, m
ode, median. Pearson’s &
Bow
ley’sco-efficient of Skew
ness. Kurtosis &
types of kurtic curves,co-efficient at K
urtosis based on mom
ents.N
umerical problem
s on mom
ents, co-efficient of skenmen &
co-efficient of Kurtosis.
Unit-IV
Corelation : C
oncept of correlation for bivariate data, scatterdiagram
, positive, negative & no correlation, cause and effect
relationship.K
arl 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.Spearm
an’s Rank correlation, repeated rank correlation.
Num
erical problems on karl pearsons &
spearman’s rank
correlation co-efficient.
UN
IT-V :R
egression :C
oncept of regression & linear regression
Derivation of regression lines by m
ethod of least squares.Properties of regression co-efficients.Linear and N
on-linear regression : Fitting of second degreecurve &
curve y=abx by least square method.
Num
erical problems on linear &
non-linear regression.M
ultiple regression by yule’s notations (for tri-variat data)M
ultiple correlation & partial correlation.
UN
IT-VI :
Time series :
Definition of Tim
e series & uses of tim
e seriesCom
ponents of Time series, A
dditive & m
ultiplicative models.
Methods of estim
ating treand by moving average m
ethodgraphical m
ethod, semiavarage m
ethod & by least square
methods.
Num
erical problems on Tim
e Series.
56
Text Books:J.N
. Kapoor
:M
athematical Statistics (M
CG
)Trivedi
:Probability and Statistics w
ith Com
puter ScienceA
pplica tions (TMH
)R
eferences:1.
Statistical Methods (A
n Introductory Text) : J. Medhi
2.M
odern Elementary Statisics : J.E. Freund
3.Statistical M
ethods : S.P. Gupta
4.Fundam
entals of Statistics : Goon, G
upta, Dasgupta
1MC
A4 / 1 C
S 4PRINCIPLES O
F MANAG
EMENT
(8 hours/unit)U
NIT I
Introduction : Definition and concepts of m
anagement,
Importance of m
anagement .Various m
anagement functions
& control, responsibilities. H
uman resources planning ,
Decision-m
aking, Trade unions & collective bargaining.
UN
IT IIO
rganization planning, design and development: Production
resources, Production planning, types of production system,
production systems, production control.
UN
IT IIIProduct design &
development : Introduction, design of the
product, New
product development; M
aterial planning andcontrol. Inventory control technique .
UN
IT IVM
aintenance and system reliability: C
oncepts and Objectives
of maintenance. Failure analysis,R
eliability Maintenance
system &
Classification. M
aintenance planning, TQM
ISO9000 and Q
uality audit.
UN
IT VM
arketing managem
ent : Introduction, marketing planning .
Consum
er behavior, product managem
ent, Pricing &prom
otion decision.Financial planning. Source of finance.
UN
IT VI
Project Managem
ent: Concepts and im
portance of project,Project im
plementation, M
IS.MIS m
eaning and objectives.Types of data, m
ethods of data collection, analysis andpresentation of data. Editing, reporting and presentation ofdata, D
ecision options.Text book :
A.K
.Gupta,J.K
. Sharma : M
anagement of System
s (Macm
illan)
Referances :
1.Appleby
: Modern B
usiness Adm
inistration, 6/e (Macm
illan)2.Tritaphy &
Reddy
: Principals of Managem
ent, 2/e (TMH
)3.G
upta, Sharma et
: Principales of Practices of Managem
ent (Kalyani)
1MC
A5 / 1 C
S 5CO
MM
UNICATION SK
ILLS
Unit I:
Com
prehension - word study :-
Synonym, antonym
, meanings, m
atching words, adjectives,
adverbs, prefix and suffix, correct forms of com
monly
misspelled w
ords, understanding of the given passage.Skim
ming for general ideas, C
ontextual vocabulary, Errordetection, N
ote making and Location of argum
ent from text,
Ability to answ
er inferential, factual and personal response.
Unit-II C
omprehension - - Structure study :-
Simple and com
pound sentences, types of conjunctions,singular and plural, tenses and their effect on verb form
s.U
se of - not only - but also, if clause, since, may, can, could,
would, too etc. A
ctive and passive forms, negative and
interrogative, punctuation and capitalization.
Unit III
Theoretical background - importance of com
munication, its
process, model of com
munication its com
ponents & barriers.
Types of written com
munication, organization of a text (Titles,
summ
aries, headings, sequencing, signaling, cueing etc.),Im
portant text factors (length of paragraph, sentences, words,
clarification and text difficulty). Evaluation of written
comm
unication for its effectivity and subject content.
Unit IV
Specific formats for w
ritten comm
unication like - businesscorrespondence, form
al reports, technical proposals, researchpapers and articles, advertising and graphics. Form
at for day-to-day w
ritten comm
unication like applications, notices,m
inutes, quotations, orders, enquiries etc. Letter writing,
Preparation of Curriculum
– Vitae,C
omposing m
essages-telegram
s, telex,fax and e-mail W
riting mem
os, agendas andnotices of m
eetings, Preparing advertisements.
Unit-V
Oral com
munications - Im
portant objectives of interpersonalskills, Verbal com
munication, its significance, face to face
comm
unications, group discussion and personal interviews.
Voice modulation and logical argum
ent, Com
prehension oftext at norm
al reading speed. Listening skill and timely
response, Participation and contribution to discussion,C
omm
and over language Formal and inform
al style ofcom
munication, B
ody language.
BO
OK
S Recom
mended :
1)K
rishna Mohan, M
eera Banerjee : Developing Com
munication Skills,
MacM
illan India Limited.
78
2)Chrissie W
right (Editor) : Handbook of Practical Com
munication Skills,
Jaico Publishing House.
3)C
urriculum D
evelopment C
entre, TTTI WR
, Bhopal : A
Course in
Technical English, Somaiya Publication Pvt. Ltd.
4)F.Frank C
andlin : General English for Technical Students, U
niversityof London Press Ltd.
1 MC
A 6 / 1 C
S 6PR
OBLEM
SOLV
ING
USIN
G C
++LA
B: LIST OF PR
OG
RA
MS
The sample list of program
is given below. This list can be used as
guide line for problem statem
ents but the scope of the laboratory shouldnot be lim
ited to the same. A
im of the list is to inform
about minim
um expected
outcomes.
1W
rite a C++ program
to implem
ent a stack with its constructor and
two m
ember functions PU
SH and PO
P 2
Write a C
++ program to find product of tw
o same num
bers from 0 to
9 stored in an object array of 10 objects and then free the mem
oryspace occupied by an object array
3W
rite 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 circum
ference of an earth(subclass) after getting distance of it m
easured from sun from
planet(super class)
6W
rite a C++ program
for an inventory that stores the name of an
item, the num
ber on hand, and its cost. Include an inserter and anextractor for this class
7W
rite a C++ program
that creates an output file, writes inform
ationto it, closes the file and open it again as an input file and read theinform
ation from the file
8W
rite a C++ program
that counts number of w
ords in a file
9W
rite a C++ program
to create an abstract class area having anabstract function get A
rea which w
ill find an area of derived classesrectangle and triangle
10W
rite a C++ program
to create a generic function that swaps the
values of the two variables it is called w
ith”
1MC
A7 / 1 C
S 7 CO
MPU
TER O
RIEN
TED STATISTIC
AL M
ETHO
DS
Practicals on Statistical Methods:
Minim
um 12 practicles to be perform
ed throughout the semester based on
following (using C
or C++ language).
1.C
onstruction of frequency distribution, graphical methods &
diagramm
atic representation.2.
Problems on m
easures of Central Tendency.
3.Problem
s on measures of disperssion.
4.Problem
s on mom
ents, measures of Shew
men and K
urtosis.5.
Com
putation of correlation co-efficient for bivariate data.6.
Fitting of linear & non linear regression lines
7.C
omputation of rank correlation co-efficient
8.Problem
s on time series .
1MC
A8 / 1 C
S 8 CO
MM
UN
ICATIO
N SK
ILLS LABO
RATO
RYO
bjective :O
n completion of this laboratory the candidate should be able to
demonstrate adequate skills in oral and w
ritten comm
unication fortechnical English language, actively participate in group discussionsand interview
s and exhibit the evidence of vocabulary building.C
andidates should be assessed through continuous monitoring and
evaluation.The sam
ple list of experiments is given below. This list can be used as
guideline for problem statem
ents but the scope of the laboratoryshould not be lim
ited to the same. A
im of the list is to inform
aboutm
inimum
expected outcomes.
1.A
ssignments and tests for vocabulary building
2.Technical report w
riting3.
Group discussions
4.Interview
techniques5.
Projects and tasks such as class news letter
6.W
riting daily diaries and letters7.
Interactive language laboratory experiments.
Text Book :N
orman Lew
is : Word Pow
er Made Easy
http://ww
w.teachingenglish.org.uk
1MC
A 9/1 C
S 9 CO
MPU
TER LA
BOR
ATOR
Y-I
This laboratory is based on the study of following softw
are1.
The study of Window
s/Linux operating systems :
The topics to be covered include1)
The study of basic comm
ands handling files, directories, systemconfiguration and system
calls
910
2)Shell program
ming,
3)G
eneral purpose utilities & editors
4)Seeting/resetting file attributes/ m
odes, sharing files,5)
TCP/IP networking
2.The study of spreadsheets : C
reating Worksheets, Form
atting cells,conditional form
atting of cells and data, Use of functions, C
reatingM
acros, Creating different types of charts. (A
t least 6 exercises coveringabove m
entioned features) Use M
S-Excel or Calc from O
pen Office U
nderLinux.
3.The study of D
BMS : Creating D
atabase, Tables, Views, Q
ueries, CreatingR
eports (At least 6 exercises covering above m
entioned features)
*****SEM
ESTER : SEC
ON
D
2 MC
A 1 / 2 C
S 1 D
ATA STRU
CTU
RES &
ALG
OR
ITHM
S
Unit-ID
ata structures basics, Mathem
atical/algorithmic notations &
functions, Com
plexity of algorithms, Subalgorithm
s. Stringprocessing: storing strings, character data type, stringoperations, w
ord processing, and pattern matching algorithm
s.
Unit-IILinear arrays and their representation in m
emory, traversing linear
arrays, inserting & deleting operations, Bubble sort, Linear search
and Binary search algorithm
s. Multidim
ensional arrays, Pointerarrays. R
ecord structures and their mem
ory representation.M
atrices and sparse matrices.
Unit IIILinked lists and their representation in m
emory, traversing a linked
list, searching a linked list. Mem
ory allocation & garbage
collection. Insertion deletion operations on linked lists. Header
linked lists, Two-w
ay linked lists.
Unit-IVStacks and their array representation. A
rithmetic expressions:
Polish notation. Quick sort, an application of stacks, R
ecursion.Tow
er of Hanoi problem
. Implem
entation of recursive proceduresby stacks, Q
ueues. Deques. Priority queues.
Unit-V
Trees, Binary trees &
and their representation in mem
ory,Traversing binary trees. Traversal algorithm
s using stacks, Header
nodes: threads. Binary search trees, searching, inserting and
deleting in binary trees. Heap and heapsort. Path length &
Huffm
an’s’ algorithm. G
eneral trees.
Unit-VIG
raph theory, sequential representation of graphs, Warshalls’
algorithm, Linked representation, operations &
traversing thegraphs. Posets &
Topological sorting. Insertion Sort, SelectionSort. M
erging & M
erge-sort, Radix sort, H
ashing.
Text Book:Seymour Lipschutz: “Theory &
Problems of D
ata Structures”(TM
H)
References:
1.H
orowitz &
Sahni "Data Structures" (G
algotia)2.
Trembley &
Sorenson "Data Structures" (TM
H)
3.Standish "D
ata Structures in JAVA" (Pearson)
4.B
hagat Singh & N
aps "Data Structures" (TM
H)
*****2 M
CA
2 / 2 CS 2
OBJECT O
RIENTED PROG
RAMM
ING
Unit-I
Introduction, Software developm
ent, life-cycle approach,Softw
are requirement specifications, A
lgorithms, V
B N
etprojects, D
esigning objects, classes & applications, object
relationships, Class design exam
ples, class code in VB
Net
Unit-II
VB
Net language, C
LR, variables, expressions, statem
ents,blocks, structured variables &
enumerations. C
lasses, objectorientation &
variables, control structures, selectionstructures, repetitions, Subs, functions &
parameters, errors
& exception handling, scope.
Unit-III
Data &
object structures, organizing the data, arrays, otherdata structures, collections, inheritance in V
B, code
inheritance, interface inheritance, inheriting the datastructures, V
isual inheritance, polymorphism
.
Uint-IV
Winform
applications : Structure of application, Winform
basics, user interface code & the form
designer, tools forcreating a user interface, dialog boxes &
the other userinterface options, other form
styles, control collection,delegates and event handlers, visual inheritance.
Unit-V
Window
s controls, accessing controls, comm
and control,Sim
ple input controls, list controls, manipulating the controls
at runtime. G
raphics in Winform
programs, object m
odeling :application structure, real w
orlds object modeling w
ith objectrelationships, softw
are patterns.
Unit-V
IStoring application data, com
puter files, Window
s registry,file storage, structured data, Serialization. D
atabases in VisualB
asic. Net O
bject oriented database systems, N
et supportfor relational database system
s, data access in a three tieredsystem
, reading & w
riting data.
1112
Text Books:A
lisstair McM
onnies : Object O
riented Programm
ing in Visual
Basic.N
ET, Pearson Education.R
eferences:1.
Ham
ilton J.P. : OO
P with Visual Basic.N
ET, O'Reilly M
edia Inc.2.
Reynolds-Haertle R.A
. : OO
P with Visual Basic.N
ET & Visual C#.N
ET,M
icrosoft Press.3.
Michael H
alvorson : Microsoft V
isual Basic.N
ET Step by Step,M
icrosoft Press.4.
Francesco Balena : Program
ming M
icrosoft Visual B
asic.NET,
Microsoft Press.
2 MC
A 3 / 2 CS 3 SY
STEM A
NA
LYSIS &
DESIG
N
UN
IT I.Introduction : System
Analysis &
Design concepts. R
ole ofsystem
analyst. Review
of System D
LC. O
rganization assystem
s. Levels of m
anagement culture. Project
fundamentals. Feasibility study. A
ctivity planning & control.
Managing analysis &
design activities.
UN
IT II.Sam
pling and investigating hard data. Interviewing. Planning
& conducting interview
& reporting. Joint application design.
Using questionnaries. Planning designing and adm
inisteringthe questionnaire.
UN
IT III.C
oservation of a decision-makers behavior and office
environment. Prototyping : U
ser reactions. Approaches to
prototyping & developing prototype. D
ata flow aproach to
requirements. D
eveloping DFD
s. Logical & Physical D
FDs.
Examples of D
FDs.
UN
IT IV.D
ata dictionary concept. Data repository. C
reating & using
data dictionary. Overview
of process specifications.Structured English, D
ecision tables/trees. Decision support
system &
decision making concepts relevant to D
SS. Semi
structured decisions. Multiple-criteria decision-m
aking.
UN
IT V.System
Proposal : Ascertaining hardw
are/software needs.
Identifying & forecasting cost/benefit &
comparing cost/
benefit. Writing and presenting the system
s proposals.Principles of D
elivery.
UN
IT VI.
Output D
esign Objectives. D
esigning printed output, Screenoutput. Input D
esign objectives. Form D
esign. Screen Design
for input. Introduction to OO
SAD
. : Object-O
riented Analysis.
Object-O
riented Design.
Text-book :K
enneth E.Kendall &
:“System
Analysis and D
esign”Julie E.K
endall(Pearson Education) 3/e
References :
1.Yeates “System
Analysis &
Design” (M
acmillan)
2.J.Fitgerald &
A.Fitgerald. “Fundam
entals of System A
nalysis &D
esign” (John-Wiley) 3/e
3.Edw
ard “System A
nalysis & D
esign” (McG
raw-H
ill)4.
Whilten, B
entley, Barlow
“System A
nalysis & D
esign Methods”
(Galgotia) 2/e.
2MC
A 4 / 2 C
S 4DATA CO
MM
UNICATIONS
U
nit-I:
Data com
munication concepts, uses and applications.
Telephone : Voice comm
unication networks, Sw
itches, PBX
cellular technologies, Fax. IVR, Voice M
ail.
Unit-II
:H
ardware; netw
ork architecture, Hosts, C
lients, Circuits,
Special purpose Com
munication D
evices, FEP, Multiplexers,
Protocol Coverters, Line adapters.
Unit-III
:D
ata transmission : Coding, Transm
ission modes, Band w
idth,M
odulation, Modem
: Types and Standards, PAM
& PC
Mtechniques, C
onnector cables.
Unit-IV
:O
SI model, M
AC
protocol; Controlled &
contention-based,Error control in netw
orks, Data link Protocols : asynchronous
& synchronous Transm
ission effeciency.
Unit-V
:N
etwork Layer : Topologies. N
etwork routing, N
etwork
Standards and network protocols : TC
P/IP, IPX/SPX
, X.25 &
GO
SIP protocols.
Unit-V
I:
LAN
s : uses and types, LAN
components. Ethernet :
topology, MA
C, types, Token rings : topology, M
AC
, types,O
ther types of LAN
s, MA
P (IEEE 802.4)., ArcN
et, Apple
Talk.LAN
performance im
provement, selecting a LA
N.
Text Book :1.
J.Fitzgerald & A D
enis Business Data Com
munication &
Netw
orking,(5/e) (John W
iley & Sons)
References:
1.Schw
eber: Data Com
munication (M
cGraw
Hill)
2.M
iller : Digital &
Data Com
munication (Jaico)
*****
1314
2 MC
A 5
BUSIN
ESS SYSTEM
S
Unit-I
Introduction : Nature of business, objectives, com
ponentsof business, environm
ent of business system, business
system and its sub-system
s, forms of legal ow
nership : soleproprietership, partnership organisation, com
panyform
of organisation. Social responsibilities of business.
Unit-II
Com
pany Managem
ent : Structure of company m
anagement,
patterns and problems of com
pany managem
ent,com
panym
eetings & resolutions, com
pany office - its organisationand m
anagement. B
usiness combinations,G
overnment &
business.
Unit-III
Production functions : Plant location, factory planning,production control and cost control, B
udgets andbudgetory control, purchasing and storekeeping.
Unit-IV
Personnel functions : Personnel managem
ent; definition, roleof personnel m
anager, job evaluation, merit rating.
Industrial relations, Trade Unionism
, employee rem
unerations,w
age payments, incentives &
wage policies.
Unit-V
Financial functions : Financial planning, various sources offinance, institutions of industrial finance. Securities m
arket.
Unit-V
IM
arketing functions : Marketing &
its function, transport,selling or distributions of goods, channels of distribution,salesm
anship, advertising and promotion.
Text Book :M
.C.Shukla : B
usiness Organisation &
Managem
ent, S.C
hand & C
ompany.
References:
1.P. G
opalkrishnan: M
aterials Managem
ent, PHI.
2.R
eddy & G
ulshan : Business O
rganisation & M
anagement, S. C
hand&
Company.
3.R
.C.A
ppleby : Modern B
usiness Adm
inistration, 6/e, Macm
illan.
******2 M
CA
6/2CS6
DATA STR
UC
TUR
ES & A
LGO
RITH
MS - LA
BOR
ATORY
The sample list of program
is given below. This list can be used as guidelinefor problem
statements but the scope of the laboratory should not be lim
itedto the sam
e. Aim
of the list is to inform about m
inimum
expected out comes.
Further, C,C
++ or Java may be used as the program
ming language.
1.W
rite an application to implem
ent Tower of H
anoi Problem A
lgorithm.
2.W
rite an application to implem
ent Abstract data type stack
3.W
rite an program to evaluate Post fix expression using stack
4.W
rite a program to im
plement A
bstract data type queue.5.
Write a program
to implem
ent singly linked list that performs various
operation such as insertion, deletion, searching a node in linearlinked list.
6.W
rite a program to im
plement Preorder Traversal of a binary tree.
7.W
rite a Program to search a given elem
ent using Binary Search.
8.W
rite a Program to im
plement Selection Sort.
9.W
rite a Program to im
plement M
erge Sort.10.
Write a Program
to Perform insertion or search in a specified level of
a stack implem
ented tree- structured symbol table.
*****2 M
CA
7 / 2 CS 7 O
bject Oriented Program
ming Labs:
Minim
um ten program
ming assignm
ents should be completed based on
above syllabus.*****
2MC
A 8 / 2 CS 8 SY
STEM A
NA
LYSIS &
DESIG
N LA
B.8 to 10 Exam
ples of SAD
from text book covering each unit of syllabus,
using any available SAD
tool, as from one available w
ith text book.*****
2MC
A 9
COM
PUTER LABORATO
RY-II
In this lab, the students have to develop a mini project based on any
technology they have learnt. They have to properly follow and
practice the system developm
ent life cycle. They will have to prepare
a project report and submit it as a com
pletion of this lab.
*****
8A
PPEND
IX-A
THR
EE YEA
R PO
ST GR
AD
UATE D
EGR
EE CO
UR
SE IN M
ASTER
IN C
OM
PUTER
APPLIC
ATION
SEMESTER PATTERN
CREDIT GRADE SYSTEM
FIRST Y
EAR
SEMESTER
-I
Teaching Scheme
Examination Schem
eH
ours/Week
TheoryPractical
Sr.No.
Subject Code
LectureTutorial
P/DTotal
Credits
Duration
Max.
Max.
TotalM
in.PassingM
ax.Marks
TotalM
in.H
ours/of Paper
Marks
Marks
Marks
ExternalInternal
PassingW
eek(H
r.)Theory
CollegeM
arksPaper
Assessm
ent
11M
CA
1C
omputer O
rganization4
00
44
380
20100
40_
__
_
21M
CA
2Problem
Solving Using C
++4
00
44
380
20100
40_
__
_
31M
CA
3C
omputer O
riented4
00
44
380
20100
40_
__
_
Statistical Methods
41M
CA
4Principles of M
anagement
40
04
43
8020
10040
__
__
51M
CA
5C
omm
unication Skills4
00
44
380
20100
40_
__
_
61M
CA
6Problem
Solving Using C
++-Lab.0
02
21
__
__
_25
2550
25
71M
CA
7C
omputer O
riented0
02
21
__
__
_25
2550
25
Statistical Methods-Lab
81M
CA
8C
omm
unication Skills-Lab.0
02
21
__
__
_25
2550
25
91M
CA
9Com
puter Lab-I0
04
42
__
__
_50
5050
50
TO
TAL
200
1030
25500
250
TO
TAL : 750
9A
PPEND
IX-A
THR
EE YEA
R PO
ST GR
AD
UATE D
EGR
EE CO
UR
SE IN M
ASTER
IN C
OM
PUTER
APPLIC
ATION
SEMESTER PATTERN
CREDIT GRADE SYSTEM
FIRST Y
EAR
SEMESTER
-II
Teaching Scheme
Examination Schem
eH
ours/Week
TheoryPractical
Sr.No.
Subject Code
LectureTutorial
P/DTotal
Credits
Duration
Max.
Max.
TotalM
in.PassingM
ax.Marks
TotalM
in.H
ours/of Paper
Marks
Marks
Marks
ExternalInternal
PassingW
eek(H
r.)Theory
CollegeM
arksPaper
Assessm
ent
12M
CA
1D
ata Structure & A
lgorithms
40
04
43
8020
10040
__
__
22M
CA
2O
bject Oriented Program
ming
40
04
43
8020
10040
__
__
32M
CA
3System
Analysis &
Design
40
04
43
8020
10040
__
__
42M
CA
4D
ata Com
munication
40
04
43
8020
10040
__
__
52M
CA
5B
usiness Systems
40
04
43
8020
10040
__
__
62M
CA
6D
ata Structure & A
lgorithms-Lab.
00
22
1_
__
__
2525
5025
72M
CA
7O
bject Oriented Program
ming-Lab.
00
22
1_
__
__
2525
5025
82M
CA
8System
Analysis &
Design-Lab.
00
22
1_
__
__
2525
5025
92M
CA
9Com
puter Lab-II0
04
42
__
__
_50
50100
50
TO
TAL
200
1030
25500
250
TOTA
L : 750
10A
PPEND
IX-A
THR
EE YEA
R PO
ST GR
AD
UATE D
EGR
EE CO
UR
SE IN M
ASTER
IN C
OM
PUTER
APPLIC
ATION
SEMESTER PATTERN
CREDIT GRADE SYSTEM
SECO
ND
YEA
R SEM
ESTER-I
Teaching Scheme
Examination Schem
eH
ours/Week
TheoryPractical
Sr.No.
Subject Code
LectureTutorial
P/DTotal
Credits
Duration
Max.
Max.
TotalM
in.PassingM
ax.Marks
TotalM
in.H
ours/of Paper
Marks
Marks
Marks
ExternalInternal
PassingW
eek(H
r.)Theory
CollegeM
arksPaper
Assessm
ent
13M
CA
1O
perating Systems
40
04
43
8020
10040
__
__
23M
CA
2File Structure &
Data Processing
40
04
43
8020
10040
__
__
33M
CA
3Java Program
ming
40
04
43
8020
10040
__
__
43M
CA
4C
omputer N
etworks
40
04
43
8020
10040
__
__
53M
CA
5C
omputer O
riented4
00
44
380
20100
40_
__
_
Optim
ization Techniques
63M
CA
6File Structure &
Data Processing-Lab.
00
22
1_
__
__
2525
5025
73M
CA
7Java Program
ming-Lab.
00
22
1_
__
__
2525
5025
83M
CA
8C
omputer O
riented0
02
21
__
__
_25
2550
25
Optim
ization Techniques-Lab.
93M
CA
9C
omputer Lab-III
00
44
2_
__
__
5050
10050
TO
TAL
200
1030
25500
250
TOTA
L : 750
11
APPEN
DIX
-ATH
REE Y
EAR
POST G
RA
DU
ATE DEG
REE C
OU
RSE IN
MA
STER IN
CO
MPU
TER A
PPLICATIO
NSEM
ESTER PATTERNCREDIT G
RADE SYSTEM SEC
ON
D Y
EAR
SEMESTER
-II
Teaching Scheme
Examination Schem
eH
ours/Week
TheoryPractical
Sr.No.
Subject Code
LectureTutorial
P/DTotal
Credits
Duration
Max.
Max.
TotalM
in.PassingM
ax.Marks
TotalM
in.H
ours/of Paper
Marks
Marks
Marks
ExternalInternal
PassingW
eek(H
r.)Theory
CollegeM
arksPaper
Assessm
ent
14M
CA
1D
atabase Managem
ent Systems
40
04
43
8020
10040
__
__
24M
CA
2C
lient Server Com
puting4
00
44
380
20100
40_
__
_
34M
CA
3M
ultimedia Technologies
40
04
43
8020
10040
__
__
44M
CA
4Electronic C
omm
erce4
00
44
380
20100
40_
__
_
54M
CA
5Elective-I
40
04
43
8020
10040
__
__
64M
CA
6D
atabase Managem
ent Systems-Lab.
00
22
1_
__
__
2525
5025
74M
CA
7C
lient Server Com
puting-Lab.0
02
21
__
__
_25
2550
25
84M
CA
8M
ultimedia Technologies-Lab.
00
22
1_
__
__
2525
5025
94M
CA
9Electronic C
omm
erce-Lab.0
02
21
__
__
_25
2550
25
104M
CA
10Sem
inar2
00
21
__
__
_--
5050
25
TO
TAL
220
830
25500
250
TOTA
L : 750
Elective-I : 1) Com
puter Graphics 2) M
odelling & Sim
ulation
12
APPEN
DIX
-ATH
REE Y
EAR
POST G
RA
DU
ATE DEG
REE C
OU
RSE IN
MA
STER IN
CO
MPU
TER A
PPLICATIO
NSEM
ESTER PATTERNCREDIT G
RADE SYSTEM TH
IRD YEAR SEMESTER-I
Teaching Scheme
Examination Schem
eH
ours/Week
TheoryPractical
Sr.No.
Subject Code
LectureTutorial
P/DTotal
Credits
Duration
Max.
Max.
TotalM
in.PassingM
ax.Marks
TotalM
in.H
ours/of Paper
Marks
Marks
Marks
ExternalInternal
PassingW
eek(H
r.)Theory
CollegeM
arksPaper
Assessm
ent
15M
CA
1A
rtificial Intelligence4
00
44
380
20100
40_
__
_
25M
CA
2Softw
are Project Managem
ent4
00
44
380
20100
40_
__
_
35M
CA
3System
Adm
inistration & Security
40
04
43
8020
10040
__
__
45M
CA
4M
anagement Inform
ation System4
00
44
380
20100
40_
__
_
55M
CA
5Elective-II
40
04
43
8020
10040
__
__
65M
CA
6A
rtificial Intelligence-Lab.0
02
21
__
__
_25
2550
25
75M
CA
7Softw
are Project Managem
ent-Lab.0
02
21
__
__
_25
2550
25
85M
CA
8System
Adm
inistration & Security-Lab.
00
22
1_
__
__
2525
5025
95M
CA
9M
ini Project0
04
42
__
__
_25
2550
25
TO
TAL
200
1030
25500
250
TO
TAL : 750
Elective-II : 1) Data W
arehousing 2) Bioinform
atics
13
APPEN
DIX
-ATH
REE Y
EAR
POST G
RA
DU
ATE DEG
REE C
OU
RSE IN
MA
STER IN
CO
MPU
TER A
PPLICATIO
NSEM
ESTER PATTERNCREDIT G
RADE SYSTEMTH
IRD YEAR SEMESTER-II
Teaching Scheme
Examination Schem
eH
ours/Week
TheoryPractical
Sr.No.
Subject Code
LectureTutorial
P/DTotal
Credits
Duration
Max.
Max.
TotalM
in.PassingM
ax.Marks
TotalM
in.H
ours/of Paper
Marks
Marks
Marks
ExternalInternal
PassingW
eek(H
r.)Theory
CollegeM
arksPaper
Assessm
ent
16M
CA
1PR
OJEC
T & D
ISSERTATION
FUL
L T
IME
25 --
__
__
150100
250150
TOTA
L : 250
DIRECTION
No. 33/2010
Date : 24/6 /2010
Subject :Exam
inations leading to the Degree of M
aster in Com
puterA
pplication (Three Year C
ourse .... Bi-A
nnual Pattern ....C
redit Grade System
)W
hereas the schemes of teaching &
examinations of M
aster inC
omputer A
pplication course has been accepted by the Academ
ic Council
vide Item N
o. 49 (J) in its meeting held on 28-05-2010 as per the Credit G
radeSystem
for its implem
entation from the A
cademic Session 2010-2011,
AN
DW
hereas admissions to the First Year of M
aster in Com
puterA
pplication course are to be made in the A
cademic Session 2010-2011,
AN
DW
hereas the matter for adm
ission of the students at theexam
inations is required to be regulated by an Ordinance,
AN
DW
hereas the schemes of teaching &
examinations of I and II
Semesters of M
aster in Com
puter Application course are to be im
plemented
from the academ
ic session 2010-2011,A
ND
Whereas the schem
es of teaching & exam
inations are required tobe regulated by the R
egulation,A
ND
Whereas the process of m
aking an Ordinance and the R
egulationis likely to take som
e time,
AN
DW
hereas syllabus for I and II Semesters of M
aster in Com
puterA
pplication course is to be sent for printing.N
ow, therefore, I, Dr.K
u.Kam
al Singh, Vice-Chancellor of Sant Gadge
Baba A
mravati U
niversity in exercise of powers confirm
ed upon me under
sub section (8) of Section 14 of the Maharashtra U
niversities Act, 1994,
hereby direct as under :1.
This Direction m
ay be called “Examinations leading to the D
egree ofM
aster in Com
puterA
pplication (ThreeYear C
ourse .... Bi-A
nnual Pattern .... Credit G
rade System) D
irec-tion, 2010.
2.This D
irection shall come into force w
.e.f. the session :-i)
2010-2011 for First Year,ii)
2011-2012 for Second Year, andiii)
2012-2013 for Third Year
3.Subject to their com
pliance with the provisions of this D
irectionand other ordinances in force from
time to tim
e, the following
person shall be eligible for admission to M
CA
.(a)
Graduate in any D
iscipline with m
inimum
50% m
arks and Math
upto 10+2 level (5% Relaxation for B.C.)
(b)A
person passing a PGD
CS Exam. of Sant G
adge Baba Am
ravatiU
niversity, satisfying the condition given in "a" above areeligible to take adm
ission directly at second year of MCA
(subjectto condition of availability of seats, in total intake capacity)subject to condition that he w
ill pass the subject heads of 1stM
CA
not covered at PGD
CS level.
4.(i)
Duration of the course shall be three academ
ic years.(ii)
Courses of First year M
CA
, Second year MC
A and Third year
MC
A are divided into tw
o parts every year i.e. part-I and part-IIand the U
niversity shall held Examination in W
inter and inSum
mer every year for both the Part-I &
II.(iii)
The main Exam
ination of Part-I shall be held in Winter &
theM
ain Examination of Part-II shall be held in Sum
mer every year.
The Supplementary exam
ination for Part-I shall be held in Summ
erand the Supplem
entary Examination for Part-II shall be held in
Winter every year.
5.For purposes of instruction and exam
ination the student shall studysequentially.
6.The period of academ
ic session/term shall be such as m
ay benotified by the U
niversity.7.
The Examinations shall be held at such places and on such dates
as may be notified by the U
niversity.8.
Subject to his/her compliance w
ith the provisions of this Direction
and of other Ordinances (Pertaining to Exam
inations in General) in
force from tim
e to time, the applicant for adm
ission, at the end ofthe course of study of a particular term
shall be eligible to appearat it, if,
i)H
e/She satisfied the condition in the table and the provisionthereunder.
ii)H
e/She was prosecuted a regular course of study in the
University/C
ollege affiliated to the University.
iii)H
e/She has in the opinion of the Head of the D
epartment/Principal
shown satisfactory progress in his/her studies.
34
Nam
e of ExamThe student should have
The student shouldpassed the exam
ination ofhave com
pleted thesession / term
satisfactorily1.
2.3.
First YearThe qualifying Exam
inationFirst Y
r. MC
AM
CA
Part-Im
entioned in para-3Part-I
First YearFirst Y
r. MC
AM
CA
Part-IIPart-I &
IISecond Year
Second Year MC
AM
CA
Part-IPart-I
Second YearSecond Year M
CA
MC
A Part-II
Part I & II
Third YearShall have cleared Ist of
Third year MC
AM
CA
Part - IM
CA
& qualified for
Part-IThird Year
admission to Third Year
Third Year MC
AM
CA
Part - IIas per para-4
Part-I & II
9.The schem
es of teaching & exam
inations shall be as provided under“A
ppendix-A” appended w
ith this Direction.
10.i)
The scope of the subject is as indicated in the syllabus.ii)
The medium
of instruction and examination shall be English.
11.The fees for each M
.C.A
. Examinations (Theory &
Practical) shallbe as prescribed by U
niversity from tim
e to time.
12.The com
putation of Semester G
rade Point Average (SGPA
) andC
umulative G
rade Point Average (CG
PA) of an exam
inee shall beas given below
:-The m
arks will be given in all exam
inations which w
ill includecollege assessm
ent marks and the total m
arks for each Theory /Practical shall be converted into G
rades as per Table II.SG
PA shall be calculated based on G
rade Points corresponding toG
rade as given in Table II and the Credits allotted to respective
Theory / Practical shown in the schem
e for respective semester.
SGPA
shall be computed for First Year (Part I &
II), Second Year(Part I &
II) and Third Year (Part I & II) and C
GPA shall be com
putedin Third Year (Part II) based on SG
PAs of First Year (Part I &
II),Second Year (Part I &
II) and Third Year (Part I & II). :-
SGPA
=C
1 x G1 + C
2 x G2 + ....... + C
n x Gn
C1 + C
2 + ......... + Cn
Where
C1 = C
redit of individual Theory / PractialG
1 = Corresponding G
rade Point obtained in therespective Theory / Practical
CG
PA=(SG
PA) First Year Part-I X
(Cr) First Year Part-I + ...... + (SG
PA) Third Year Part-II X
(Cr) Third Year Part-II
(Cr) First Year Part-I + ......... + (C
r) Third Year Part-II
Where(SG
PA) First Year Part-I to Third Year Part-II =
SGPA of First Year
Part-I to Third Year Part-II (C
r) First Year Part-I to Third Year Part-II =Total C
redits for First Year Part-I to Third Year Part-II
CG
PA equal to 6.00 and above shall be considered as equivalent to
First Class w
hich shall be mentioned on G
rade Card of Third Year
Part-II as a foot note.TABLE II
THEO
RYG
radePercentage of M
arksG
rade Points
AA
80 ≤ Μarks ≤ 100
10
AB
70 ≤ Marks < 80
9
BB60 ≤ M
arks < 70 8
BC55 ≤ M
arks < 60 7
CC50 ≤ M
arks < 55 6
CD45 ≤ M
arks < 50 5
DD40 ≤ M
arks < 45 4
FF00 ≤ M
arks < 40 0
ZZA
bsent in Examination
—
PRA
CTIC
AL
Grade
Percentage of Marks
Grade Points
AA
85 ≤ Μarks ≤ 100
10
AB
80 ≤ Marks < 85
9
BB75 ≤ M
arks < 80 8
BC70 ≤ M
arks < 75 7
CC65 ≤ M
arks < 70 6
CD60 ≤ M
arks < 65 5
DD50 ≤ M
arks < 60 4
FF00 ≤ M
arks < 50 0
ZZA
bsent in Examination
—
56
13.Provisions of O
rdinance No.18 of 2001 in respect of an O
rdinanceto provide grace m
arks for passing in a Head of passing and
improvem
ent of Division (H
igher Class) and getting distinction in
the subject and condonation of deficiency of marks in a subject
in all the faculties prescribed by the Statute No.18, O
rdinance, 2001shall apply to each exam
ination under this Direction.
14.A
n examinee w
ho does not pass or who fails to present him
self/herself for the exam
ination shall be eligible for readmission to the
same exam
ination, on payment of fresh fees and such other fees
as may be prescribed.
15.A
s soon as possible after the examination, the B
oard ofExam
inations shall publish a result of the examinees. The result of
final MC
A Exam
ination shall be classified as above and meritlist
shall be notified as per Ordinance N
o.6.
16.N
otwithstanding anything to the contrary in this D
irection, noperson shall be adm
itted to an examination under this D
irection,if he/she has already passed the sam
e examination or an
equivalent examination of any statutory U
niversity.
17.i)
The examinees w
ho have passed in all the subjects prescribedfor all the exam
inations shall be eligible for award of the D
egreeof M
aster in Com
puter Application.
ii)A
n examinee successful at the exam
ination shall on payment of
prescribed fees receive a degree in prescribed form signed by
the Vice-Chancellor.Sd/-
Dr. K
amal Singh
Vice-Chancellor*****
7
SAN
T GA
DG
E BABA A
MR
AVATI UN
IVER
SITY.
SPECIA
L NO
TE FOR
INFO
RM
ATION
OF TH
E STUD
ENTS
(1)N
otwithstanding anything to the contrary, it is notified for
general information and guidance of all concerned that a
person, who has passed the qualifying exam
ination and iseligible for adm
ission only to the corresponding next higherexam
ination as an ex-student or an external candidate, shallbe exam
ined in accordance with the syllabus of such next
higher examination in force at the tim
e of such examination
in such subjects papers or combination of papers in w
hichstudents from
University D
epartments or C
olleges are to beexam
ined by the University.
(2)B
e it known to all the students desirous to take exam
ination/s for w
hich this prospectus has been prescribed should, iffound necessary for any other inform
ation regardingexam
inations etc., refer the University O
rdinances Booklet
the various conditions/provisions pertaining to examination
as prescribed in the following O
rdinances.
Ordinance N
o. 1:
Enrolment of Students.
Ordinance N
o. 2:
Adm
ission of Students
Ordinance N
o. 4:
National cadet corps
Ordinance N
o. 6:
Examinations in G
eneral (releventextracts)
Ordinance N
o. 18/2001:
An O
rdinance to provide grace marks
for passing in a Head of passing and
Inprovement of D
ivision (Higher Class)
and getting Distinction in the subject
and condonation of defficiency ofm
arks in a subject in all the facultiesprescribed by the Statute, N
o.18,O
rdinance, 2001.
Ordinance N
o. 9:
Conduct of Exam
inations (releventextracts)
Ordinance N
o. 10:
Providing for Exemptions and
Com
partments
Ordinance N
o. 19:
Adm
ission of Candidates to
Degrees.
Ordinance N
o. 109:
Recording of a change of nam
e of aU
niversity student in the records of theU
niversity.
Ordinance N
o. 6/2008:
For improvem
ent of Division/G
rade.
Ordinance N
o.19/2001:
An O
rdinance for Central A
ssessment
Programm
e, Scheme of Evaluation and
Moderation of answ
erbooks andpreparation
of results
of the
examinations, conducted by the
University, O
rdinance 2001.
Dineshkum
ar JoshiR
egistrarSant G
adge Baba
Am
ravati University.
12