(faculty of engineering & technology) sant … · · 2018-01-06tions, processor...
TRANSCRIPT
Post Graduate D
iploma
Prospectus No.111724
in Com
puter Science
∫…∆i… M……b˜M…‰ §……§…… +®…Æ˙…¥…i…“ ¥…t
……“`ˆSA
NT G
AD
GE BA
BA AM
RAVATI U
NIV
ERSITY
(FAC
ULTY O
F ENG
INEER
ING
& TEC
HN
OLO
GY
)
PRO
SPEC
TU
S
Prescribed For
Post Graduate D
iploma in C
omputer Science
Examination of 2010-2011
(One year C
ourse)(Bi-A
nnual Pattern)C
redit Grade System
2010
Price Rs.10/-
visit us at ww
w.sgbau.ac.in
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 published without
specific permission of Sant G
adge Baba A
mravati U
niversity."
Unit V
IVirtual m
emory organization, m
apping functions for trans-lating the program
pages in virtual to physical addressesspace, partitioning, segm
entation (superpages orpage blocks) partitioning of virtual address space in tosegm
entand page address, dem
and pagingand sw
apping, cache and virtual swapping, cache and
virtual mem
ory, invertedpage tables concept,
protection between program
s running on the same sys-
tem, accessing I/O
devices,program
med I/
O, interrupts, direct m
emory access D
MA
, bus arbitra-tion, interface circuits, I/O
interfaces, I/Op
ro-
cessors, external I/O devices.
Text Book : Com
puter Architecture by M
icholus Carter &
Rajkam
al,Schaum
Series Pub.
1 CS 2/1 M
CA
2PR
OBLEM
SOLV
ING
USIN
G C
++
Unit I.
Objects &
Classes in C
++ : Declaring &
using classes,C
onstructors, Objects as functions argum
ents, Copy C
on-structor, Static class data. A
rrays of objects, C++ String
class.U
nit II.O
perator overloading : Overloading unary &
binary op-erators. D
ata conversion. Pitfalls of operator overload-ing. Pointers &
arrays. Pointers & functions. new
& de-
lete operators. Pointers for objects.U
nit III.Inheritance in C
++ : Derived class &
base class, Derived
class constructors, Function overloading, class hierar-chies, Public and private inheritance, M
ultiple inheritance.C
ontainership : classes within classes.
Unit IV.
Virtual functions concepts, A
bstracts classes & pure vir-
tual functions. Virtual base classes, Friend functions, Staticfunctions, A
ssignment and copy initialization, the this
pointer. Dynam
ic type information.
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 arguments. M
ultifile programs.
Unit V
I.Function Tem
plate, Class tem
plates, Exception syntax,M
ultiple exceptions, exception with argum
ents. Introduc-tion to the Standard Tem
plate Library. Algorithm
s, Se-quential C
ontainers, Iterates, Specialized iterates, Asso-
ciative containers. Function objects.
SYLLA
BUS
PRESC
RIBED
FOR
ON
E YEA
R PO
ST GR
AD
UATE D
IPLOM
A INCO
MPUTER SCIENCE
SEMESTER
: FIRST
1 CS 1/1 M
CA
1CO
MPUTER O
RGANIZATIO
N
Unit I
Chapter Objectives, Evaluation of Com
puters and computer gen-
erations, Technological trends, Measuring perform
ance, speedup, A
mdahl’s law, Von N
eumann m
achine architecture, Func-tional units and com
ponents in computer organization, Program
development tools, O
perating systems.
Unit II
From Electron to B
its, Binary representation of positive inte-
gers, Negative integers, Fixed point arithm
etic operations onpositive and signed (N
egative) integers, Floating-Point num-
bers (IEEE 754 standard) and operations, BC
D arithm
etic opera-tion, 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, Subroutine nestingusing stacks to im
plement subroutine calls and calling conven-
tions, Processor organizations, Register organization, Stack
based organizations, Encoding of machine instructions, G
eneralfeatures of R
ISC and C
ISC instruction sets, m
odern processorsconvergence of RISK
with CISC, Processor m
icroarchitecture-I -Fundam
ental concepts for data path implem
entation,Processorm
icroarchitecture-II -
Data
path im
plementation,
microprogram
med execution, recent innovations in
executionunit design.
Unit IV
Instruction pipeline, instruction pipeline hazards, overcoming
hazards using a pipeline with forw
arding paths, instruction setdesign influence on pipelining, exam
ple of pipelined CISC
pro-cessor, exam
ple of pipelined RISC
processor, VLIW
(Very LongInstruction W
ord) processors, Vector processors, Multithreaded
processors, Com
pilation techniques support to instruction levelparallelism
, Extracting parallelism.
Unit V
Some basic concepts, m
emory hierarchy, internal organization
of semiconductor m
ain mem
ory chips - RA
M and R
OM
, semi-
conductor main m
emories - R
AM
, semiconductor R
ead - Only
mem
ories - RO
Ms, speed, size and cost, secondary storage m
ag-netic ferrite core m
emories, optical disks C
D-R
OM
mem
ories,data caches, instruction caches, and unified cache, features de-scribing a cache, cache im
plementations, m
ultilevel caches.
12
Text-Book :1.
Savitch: Problem Solving using C
++ (Addison W
esley) Low-Priced
Edition.
References :
1.R
obert Lafore Object-O
riented Programm
ing in C++ (Galgotia)
2.H
erbert Schildt C++ : C
omplete R
eference (TMH
)3.
Bjarne Stroustrupe C
++ Programm
ing Language (Addison-W
esley)4.
Venugopal Mastering C
++ (TMH
)5.
Lipmann C
++ Primer (A
ddison-Wesley)
1 CS 3 /1M
CA
3CO
MPUTER O
RIENTED STATISTICALM
ETHO
DS
UN
IT-I :IntroductionD
efinitions : Websters, secrists, G
ronton and Cow
den defi-nitions 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
ulative fre-quency distribution, relative frequency distribution. G
raphi-cal 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, proper-ties of a.m
., combined m
ean, weighted m
ean, merits and de-
merits. 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.M
easures of dispersion : Range, quartile deviation, m
eandeviation, S.D
. for grouped & ungrouped data w
ith its merits
& dem
eritsVariance : D
efinition for grouped & ungrouped
34
data, combined variance, co-efficient of D
ispersion, co-effi-cient of variation. N
umerical problem
s on measures of dis-
persion.U
NIT-III :
Mom
ents, measures of Skew
ness and Kurtosis correlation
Raw
& C
entral mom
ents : for grouped & ungrouped data
(upto first four mom
ents) & their relationships. Skew
ness,m
easures of skewness, co-efficient of skew
ness, bempirical
relation between m
ean, mode, m
edian. Pearson’s & B
owley’s
co-efficient of Skewness. K
urtosis & types of kurtic curves,
co-efficient at Kurtosis based on m
oments.
Num
erical problems on m
oments, co-efficient of skenm
en &co-efficient of K
urtosis.U
nit-IVC
orelation : Concept of correlation for bivariate data, scatter
diagram, positive, negative &
no correlation, cause and ef-fect 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 cor-
relation co-efficient.U
NIT-V :
Regression :
Concept of regression &
linear regressionD
erivation of regression lines by method 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 seriesC
omponents of Tim
e series, Additive &
multiplicative m
od-els.M
ethods of estimating treand by m
oving average method
graphical method, sem
iavarage method &
by least squarem
ethods.N
umerical problem
s on Time Series.
Text Books:J.N
. Kapoor
:M
athematical Statistics (M
CG
)
Trivedi:
Probability and Statistics with C
omputer Science
Applica tions (TM
H)
References:
1.Statistical M
ethods (An Introductory Text) : J. M
edhi2.
Modern Elem
entary Statisics : J.E. Freund3.
Statistical Methods : S.P. G
upta4.
Fundamentals of Statistics : G
oon, Gupta, D
asgupta
1 CS 4/1M
CA
4PRINCIPLES O
F MANAG
EMENT
(8 hours/unit)U
NIT I
Introduction : Definition and concepts of m
anagement, Im
-portance of m
anagement .Various m
anagement functions &
control, responsibilities. Hum
an resources planning , Deci-
sion-making, Trade unions &
collective bargaining.U
NIT II
Organization planning, design and developm
ent: Productionresources, Production planning, types of production sys-tem
, 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 Objec-
tives of maintenance. Failure analysis,Reliability M
aintenancesystem
& C
lassification. Maintenance planning, TQ
M ISO
9000 and Quality audit.
UN
IT VM
arketing managem
ent : Introduction, marketing planning .
Consum
er behavior, product managem
ent, Pricing & prom
o-tion 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 and pre-sentation of data. Editing, reporting and presentation of data,D
ecision options.
Text book :A
.K.G
upta,J.K. Sharm
a : Managem
ent of Systems (M
acmillan)
R
eferances :1.A
ppleby: M
odern Business A
dministration, 6/e (M
acmillan)
2.Tritaphy & R
eddy: Principals of M
anagement, 2/e (TM
H)
3.Gupta, Sharm
a et: Principales of Practices of M
anagement (K
alyani)
1 CS 5/1M
CA
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.U
nit-II Com
prehension - - Structure study :-Sim
ple 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, m
ay, can, could,w
ould, too etc. Active and passive form
s, negative andinterrogative, 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.U
nit IVSpecific form
ats for written com
munication like - business
correspondence, formal reports, technical proposals, research
papers and articles, advertising and graphics. Format for day-
to-day written com
munication like applications, notices,
minutes, quotations, orders, enquiries etc. Letter w
riting,Preparation of C
urriculum – V
itae,Com
posing messages-
telegrams, telex,fax and e-m
ail Writing m
emos, agendas and
notices of meetings, Preparing advertisem
ents.U
nit-VO
ral comm
unications - Important objectives of interpersonal
skills, Verbal comm
unication, its significance, face to facecom
munications, group discussion and personal interview
s.Voice m
odulation and logical argument, C
omprehension of
text at normal reading speed. Listening skill and tim
elyresponse, Participation and contribution to discussion,C
omm
and over language Formal and inform
al style ofcom
munication, B
ody language.U
nit-VI
Non-verbal com
munication, types of graphics and pictoral
devices. Meaning and purpose of m
eetings,seminars,
symposia, conference and w
orkshop. Methodology of
conduction of meetings, sem
inars,sym
posia, conferenceand w
orkshop. Brochure preparation for sem
inars, symposia,
conference and workshop. Preparation of m
inutes of meeting.
56
78
BO
OK
S Recom
mended :
1)K
rishna Mohan, M
eera Banerjee : Developing Com
munication Skills,
MacM
illan India Limited.
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 CS 6/1M
CA
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 ex-
pected 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 (sub-class) 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 9
Write a C
++ program to create an abstract class area having an
abstract function get Area w
hich will find an area of derived classes
rectangle and triangle 10 W
rite a C++ program
to create a generic function that swaps the
values of the two variables it is called w
ith”
1 CS 7/ 1M
CA
7 CO
MPU
TER O
RIEN
TED STATISTIC
AL
METH
OD
S - LAB.
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 &
dia-gram
matic representation.
2.Problem
s on measures of C
entral Tendency.3.
Problems on m
easures of disperssion.4.
Problems on m
oments, m
easures of Shewm
en and Kurtosis.
5.C
omputation of correlation co-efficient for bivariate data.
6.Fitting of linear &
non linear regression lines7.
Com
putation of rank correlation co-efficient8.
Problems on tim
e series .
1 CS 8/1M
CA
8C
OM
MU
NIC
ATION
SKILLS LA
BOR
ATORY
Objective :
On com
pletion of this laboratory the candidate should beable to dem
onstrate adequate skills in oral and written com
-m
unication for technical English language, actively partici-pate in group discussions and interview
s and exhibit theevidence of vocabulary building. C
andidates should be as-sessed through continuous m
onitoring 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 ofthe laboratory should not be lim
ited to the same. A
im of the
list is to inform about m
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
1 CS 9/1M
CA
9 CO
MPU
TER LA
BOR
ATOR
Y-I This laboratory is based on the study of follow
ing software
1.The study of W
indows/Linux operating system
s :The topics to be covered include1)
The study of basic comm
ands handling files, directories, systemconfiguration and system
calls2)
Shell programm
ing,
910
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)*****
SEMESTER
: SECO
ND
2 MC
A 1 / 2 C
S 1 D
ATA STRU
CTU
RES &
ALG
OR
ITHM
SUnit-I
Data structures basics, M
athematical/algorithm
ic notations &functions, C
omplexity of algorithm
s, Subalgorithms. String
processing: 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 C
S2 2 / MC
A 2 O
BJECT O
RIEN
TED PR
OG
RA
MM
ING
Unit-I :
Introduction, Software developm
ent, life-cycle approach,Softw
are requirement specifications,
Algorithm
s, VB
.Net projects, D
esigning Objects, classes &
applications, Object relationships,C
lass design examples, C
lasscode in V
B.Net.
Unit-II:
VB
.Net language, C
LR, Variables, expressions, Statem
ents,blocks, structured variables &Enum
erations. Classes, O
bject-orientation & Variables, C
ontrolStructures, Selection Structures, R
epetitions, Subs, functions &Param
eters, Errors & Exception handling, Scope.
Unit-III:
Data &
Object Structures, organizing the D
ata, Arrays, O
therdata Structures, C
ollections,Inheritance in V
B, C
ode inheritance, Interface Inheritance,Inheriting the data structures, V
isualinheritance, Polym
orphism.
Unit-IV:
Winform
applications: Structure of application, Winform
basics,user interface code &
the form designer, Tools for creating a user
interface, dialog boxes & the other user-interface options, O
therform
styles, control collection, delegates and event handlers,Visual inheritance.
Unit-V:
Window
s controls, Accessing controls, C
omm
and controls,Sim
ple input controls, List controls,m
anipulating the controls at runtime, G
raphics in Winform
Programs. O
bject modeling: application structure, real-w
orldsobject m
odeling with object relationships, softw
are patterns.
Unit-V
I:Storing application data, C
omputer files, W
indows registry, File
storage, structured data, Serialization. Databases in V
isualB
asic.Net O
bject-oriented database systems, .N
et support forrelational database system
s, data access in a three-tiered system,
reading & w
riting data.Text Book :A
lisstair McM
onnies “Object-O
riented Programm
ing in Visual
Basic.N
ET” (Pearson Education)
References :
1.H
amilton J.P. : ‘O
OP w
ith Visual Basic.NET” (O
’Reilly Media Inc.)
2.R
eynolds-Haertle R
.A. : “O
OP w
ith Visual B
asic.NET &
Visual
C#.N
ET” (Microsoft Press)
3.M
ichael Halvorson : “M
icrosoft visual Basic.N
ET Step By Step “
(Microsoft Press)
4.Francesco B
alena : “Programm
ing Microsoft V
isual Basic.N
ET”(M
icrosoft Press)
*******2 C
S 3 /2 MC
A 3 SYSTEM
AN
ALY
SIS & D
ESIGN
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.U
NIT II.
Sampling and investigating hard data. Interview
ing. Planning&
conducting interview &
reporting. Joint application design.U
sing questionnaries. Planning designing and administering
the questionnaire.U
NIT III.
Coservation of a decision-m
akers behavior and officeenvironm
ent. Prototyping : User reactions. A
pproaches toprototyping &
developing prototype. Data flow
aproach torequirem
ents. Developing D
FDs. Logical &
Physical DFD
s.Exam
ples of DFD
s.U
NIT IV.
Data dictionary concept. D
ata repository. Creating &
usingdata dictionary. O
verview of process specifications.
Structured English, Decision tables/trees. D
ecision supportsystem
& decision m
aking concepts relevant to DSS. Sem
istructured decisions. M
ultiple-criteria decision-making.
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.U
NIT V
I.O
utput Design O
bjectives. Designing printed output, Screen
output. Input Design objectives. Form
Design. Screen D
esignfor input. Introduction to O
OSA
D. : O
bject-Oriented A
nalysis.O
bject-Oriented D
esign.Text-book :K
enneth E.Kendall &
:“System
Analysis and D
esign” Julie E.Kendall
(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.
2 CS 4/2M
CA
4DATA CO
MM
UNICATION
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.U
nit-II:H
ardware; netw
ork architecture, Hosts, Clients, Circuits, Spe-
cial purpose Comm
unication Devices, FEP, M
ultiplexers, Pro-tocol C
overters, Line adapters.U
nit-III:D
ata transmission : Coding, Transm
ission modes, Band w
idth,M
odulation, Modem
: Types and Standards, PAM
& PC
Mtechniques, C
onnector cables.U
nit-IV:O
SI model, M
AC
protocol; Controlled &
contention-based,Error control in netw
orks, Data link Protocols : asynchro-
nous & synchronous Transm
ission effeciency.U
nit-V:
Netw
ork Layer : Topologies. Netw
ork routing, Netw
ork Stan-dards and netw
ork protocols : TCP/IP, IPX/SPX
, X.25 &
GO
SIPprotocols.
Unit-V
I:LA
Ns : uses and types, LA
N com
ponents. Ethernet : topol-ogy, M
AC
, types, Token rings : topology, MA
C, types, O
thertypes of LA
Ns, M
AP (IEEE 802.4)., A
rcNet, A
pple Talk.LAN
performance im
provement, selecting a LA
N.
Text Book :1.
J.Fitzgerald & A
Denis B
usiness Data C
omm
unication & N
etwork-
ing, (5/e) (John Wiley &
Sons)
References:
1.Schw
eber: Data Com
munication (M
cGraw
Hill)
2.M
iller : Digital &
Data Com
munication (Jaico)
*****
2CS5
BUSIN
ESS CO
MPU
TING
Unit-I
:D
atabase definitions. Various types, Relational D
atabase,O
racle & its recent versions, O
RDBM
S characteristics. Oracle
Architecture, M
emory, Process, Physical and Logical Struc-
tures in Oracle.
1112
Unit-II:
Various Database O
bjects : Table space, Schema, Table, View
s,Sequence, C
lusters, Snapshots, Data access SQ
L Com
mands,
Oracles’ Procedural Extension, O
racle Queries.
Unit-III :
Various Functions In SQL : O
racle Conversion, D
ate, Nu-
meric, and Character Functions, Single and M
ultiple row Func-
tions, Com
plex queries, Outer Joins.
Unit-IV
:Tables &
table-related comm
ands, Privileges, Storage fortables, com
mands for m
odifying, Renam
ing, dropping, alter-ing the table, com
mands for m
odifying the table data.U
nit-V :
PL/SQL : Syntax overview
, block structure, Variables, Pro-gram
flow, Procedures, Functions, triggers, cursors, Pack-
ages, in PL/SQL, Error handling in PL/SQ
L.U
nit-VI :
Database C
onstraints : basics, Creating &
modifying con-
straints, Keys and other constraints, O
racle users, differenttypes of privileges, R
oles, Profiles.
Books :1.
Lave Singh etal Orcle D
evelopers’ Guide (Techm
edia)2.
Oracle Press Introduction to O
racle (TMH
)3.
Oracle U
nleashed (Sams)
2C
S6/2MC
A6
DATA STR
UC
TUR
ES & A
LGO
RITH
MS
LABO
RATO
RYThe sam
ple list of program is given below. This list can be used as guideline
for problem statem
ents but the scope of the laboratory should not be lim-
ited to the same. A
im of the list is to inform
about minim
um 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
lgo-rithm
.2.
Write an application to im
plement A
bstract data type stack3.
Write an program
to evaluate Post fix expression using stack4.
Write a program
to implem
ent Abstract data type queue.
5.W
rite a program to im
plement singly linked list that perform
s variousoperation 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 CS 7 / 2M
CA
7O
BJECT O
RIEN
TED PR
OG
RA
MM
ING
- LAB.
Practical :-M
inimum
ten programm
ing assignments should be com
pleted basedon the above syllabus.
2 CS 8/2M
CA
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.
2CS 9
BUSIN
ESS CO
MPU
TING
LABO
RATO
RYB
ased on above syllabus : Minim
um Tw
elve Lab.Assignm
ents
2 CS 10
PRO
JECT
******
1314
3DIRECTIO
NN
o. 28/2010D
ate : 24 /6/2010Subject :
Examination leading to the Post-G
raduate Diplom
a in Com
puterScience (O
ne Year Course .... C
redit Grade System
)W
hereas the schemes of teaching &
examinations of Post-G
raduateD
iploma in C
omputer Science course has been accepted by the A
cademic
Council vide Item
No. 49 (J) in its m
eeting held on 28-05-2010 as per theCredit G
rade System for its im
plementation from
the Academ
ic Session 2010-2011,
AN
DW
hereas admissions to the I Sem
ester of Post-Graduate D
iploma in
Com
puter Science course are to be made in the A
cademic Session 2010-
2011,A
ND
Whereas the m
atter for admission of the students at the exam
inationsis required to be regulated by an O
rdinance,A
ND
Whereas the schem
es of teaching & exam
inations of I and IISem
esters of Post-Graduate D
iploma in C
omputer Science course are to be
implem
ented 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
egulation islikely to take som
e time,
AN
DW
hereas syllabus for I and II Semesters of Post-G
raduate Diplom
ain C
omputer Science 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 “Examination leading to the Post-G
radu-ate D
iploma in C
omputer Science (O
ne Year Course .... C
redit Grade
System) D
irection, 2010.2.
This Direction shall com
e into force w.e.f. its issuance.3.
Following shall be the Exam
inations leading to the Post - Graduate
Diplom
a in Computer Science nam
ely.
(i)Post G
raduate Diplom
a in ComputerScience, Part-I Exam
ination,and
(ii)Post G
raduate Diplom
a in Com
puter Science, Part-IIExam
ination.4.
Duration of each of the above Parts shall be one Term
with an
examinations at the end of each Term
.5
(i)The exam
inations specified in paragraph 3 above shall beheld tw
ice a year at such places andon such dates as
may be appointed by the U
niversity.(ii)
Main Exam
ination of Part-I shall be held in Winter and
Supplementary Exam
ination in Summ
er.(iii)
Main Exam
ination of Part-II shall be heldin Summ
er andSupplem
entry Examination in W
inter.6.
Subject to his/her compliance w
ith the provisions of this Direction
and other Ordinances in force tim
e to time folow
ing candidates areeligible for adm
ission to the Post-Graduate D
iploma (O
ne Year) inC
omputer Science :-
Graduates of the U
niversity 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 Mathem
atics and Statistics at theH
.S.S.C. X
II th standard of equivalent Examination.
7.For purposes of instruction and exam
inations the students shallstudy sequentially.
8.Subject to his/her com
pliance with the provisions of this D
irectionand other O
rdinances (Pertaining to examination in G
eneral) in forcefrom
time to tim
e, the applicant for admission to exam
ination at theend of the course of study of a particular part shall be eligible toappear at it, if:(i)
He/She satisfied the condition in the table and the Provision
there under :-TA
BLE I
Sr.N
ame of exam
inationThe student should have
No.
completed the term
satisfactorily
12
3
1.P.G. D
iploma in Com
puterPart I
Science Part I2.
P.G. Diplom
a in Computer
Part - IIScience Part II
4
(Note -
Subjects prescribed and numbered in the schem
e 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 com
piled with provisions of O
rdiance pertainingto Exam
ination in general.(iii)
He/She has prosecuted a regular courseof study in
University D
epartment/C
ollege affiliated to the University.
(iv)H
e/She has in the opinion of the Head of theD
epartment/
Principal,shown satisfactory progress in his/her studies.
9.Papers and the Practicals in w
hich an examinee is to exam
ined,m
aximum
marks for these and the m
inimum
pass mark w
hich anexam
inee must obtain in order to pass in the subject and the
examination are detailed in the Exam
ination Scheme.
10.Exam
ination fees for each part of the examination and also the practical
examination shall be as prescribed by the U
niversity for time to tim
e.11.
The computation of Sem
ester Grade Point Average (SG
PA) and
Cum
ulative Grade Point Average (C
GPA
) of an examinee shall be as
given below :-
The marks w
ill be given in all examinations w
hich will include college
assessment m
arks and the total marks for each Theory / Practical
shall be converted into Grades as per Table II.
SGPA
shall be calculated based on Grade Points corresponding to
Grade as given in Table II and the C
redits allotted to respectiveTheory / Practical show
n in the scheme for respective sem
ester.SG
PA shall be com
puted for every semester and C
GPA
shall becom
puted only in VIII sem
ester. The CG
PA of V
III semester shall be
calculated based on SGPA
of VII and SG
PA of V
III semester as per
following com
putation :-SG
PA=
C1 x G
1 + C2 x G
2 + ....... + Cn G
n
C1 + C
2 + ......... + Cn
Where
C1 = C
redit of individual Theory / PractialG
1 = Corresponding G
rade Point obtained in the respectiveTheory / Practical
(SGPA
)I X (Cr) I + (SG
PA) II X
(Cr) IICG
PA=
(Cr) I + (Cr) II
Where
(SGPA
) I=
SGPA
of I Semester
(Cr) I=
Total Credits for I Sem
ester(SG
PA) II
=SG
PA of II Semester
(Cr)II=
Total Credits for II Sem
ester
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 II Sem
ester asa foot note.
TABLE II TH
EORY
Grade
Percentage of Marks
Grade Points
AA
80 ≤ Marks ≤ 100
10
AB
70 ≤ Marks < 80
9
BB60 ≤ M
arks < 708
BC55 ≤ M
arks < 607
CC50 ≤ M
arks < 556
CD45 ≤ M
arks < 505
DD40 ≤ M
arks < 454
FF00 ≤ M
arks < 400
ZZA
bsent in Examination
—
PRA
CTIC
AL
Grade
Percentage of Marks
Grade Points
AA
85 ≤ Marks ≤ 100
10
AB
80 ≤ Marks < 85
9
BB75 ≤ M
arks < 808
BC70 ≤ M
arks < 757
CC65 ≤ M
arks < 706
CD60 ≤ M
arks < 655
DD50 ≤ M
arks < 604
FF00 ≤ M
arks < 500
ZZA
bsent in Examination
—
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 O
rdinance No.18 of 2001 in respect of an O
rdinance toprovide 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, 2001 shallapply to each exam
ination under this Direction.
56
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 othe fees as
may be prescribed.
15.A
s soon as possible after the examination, the Board of Exam
inationsshall publish a result of the exam
inees. The result of the examinations
shall be classified as above and merit list shall be notified as per
Ordiance N
o. 616.
Notw
istanding anything to the contary in this Direction no one
shall be admitted to an exam
ination under this Direction, if he/she
has already passed the same exam
ination or an equivalentexam
ination of any Statutory University.
17.Exam
inees who have passed in all the subject prescribed for Part-I
and Part-II of the examination of the D
iploma course shall be eligible
for award of the Post-G
raduate Diplom
a in Com
puter Science (One
Year).
Sd/-D
r. Kam
al SinghVice-Chancellor
*****
7
8A
PPEND
IX-A
ON
E YEA
R PO
ST GR
AD
UATE D
IPLOM
A CO
UR
SE IN C
OM
PUTER
SCIEN
CE
SEMESTER
PATTERN
CR
EDIT G
RA
DE SY
STEMSEM
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
11C
S1/C
omputer O
rganization4
00
44
380
20100
40_
__
_1M
CA
1
21C
S2/Problem
Solving Using C
++4
00
44
380
20100
40_
__
_1M
CA
2
31C
S3/C
omputer O
riented4
00
44
380
20100
40_
__
_1M
CA
3Statistical M
ethods
41C
S4/Principles of M
anagement
40
04
43
8020
10040
__
__
1MC
A4
51C
S5/C
omm
unication Skills4
00
44
380
20100
40_
__
_1M
CA
5
61C
S6/Problem
Solving Using C
++-Lab.0
02
21
__
__
_25
2550
251M
CA
6
71C
S7/C
omputer O
riented0
02
21
__
__
_25
2550
251M
CA
7Statistical M
ethods-Lab
81C
S8/C
omm
unication Skills-Lab.0
02
21
__
__
_25
2550
251M
CA
8
91C
S8/C
omputer Lab-I
00
44
2_
__
__
5050 100
501M
CA
9
TO
TAL
200
1030
25500
250
TOTA
L : 750
9A
PPEND
IX-A
ON
E YEA
R PO
ST GR
AD
UATE D
IPLOM
A CO
UR
SE IN C
OM
PUTER
SCIEN
CE
SEMESTER
PATTERN
CR
EDIT G
RA
DE SY
STEMSEM
ESTER-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
12C
S1/D
ata Structure & A
lgorithms
40
04
43
8020
10040
__
__
2MC
A1
22C
S2/O
bject Oriented Program
ming
40
04
43
8020
10040
__
__
2MC
A2
32C
S3/System
Analysis &
Design
40
04
43
8020
10040
__
__
2MC
A3
42C
S4/D
ata Com
munication
40
04
43
8020
10040
__
__
2MC
A4
52C
S5B
usiness Com
puting4
00
44
380
20100
40_
__
_
62C
S6/D
ata Structure & A
lgorithms
00
22
1_
__
__
2525
5025
2MC
A6
-Lab
72C
S7/O
bject Oriented Program
ming
00
22
1_
__
__
2525
5025
2MC
A7
-Lab
82C
S8/System
Analysis &
Design
00
22
1_
__
__
2525
5025
2MC
A8
-Lab
92C
S9B
usiness Com
puting--Lab0
02
21
__
__
_25
2550
25
102C
S10Project
00
44 10
__
__
_50
50 10050
TO
TAL
200
1232
34500
300
TOTA
L : 800