...

ffi ; Ilf CALICUT

by user

on
Category: Documents
4

views

Report

Comments

Transcript

ffi ; Ilf CALICUT
I
rej*HSE{FGr**t+#
UNIVERSITY OF CALICUT
Bachelor of' Comp.uter Applications
( BC,\)
(3 Year tull time Degl..
Crr.r.i
Ilf ;Jiil;tJ:r|i',U,'ir;;
l.
"'o'nts
to achieve technicar expertise
in rhr. rrcrd or cromrrrer appricarr,rrr
Job potential:
iliff
!.
,
ffi ; [ilL ll.3'l',,:, Jlf .:rr ;lJ[,::
o
li,
r
p
rog ra m m e rs,p rosra nl n,
e ass, s ra n rs i,s
Self Emptoyment:-
irtttl,il?j?ollt
..
job opportunities thev
mav be abre ro pursue a career
by ser-u,molo,,-mcnr r,
Higher Studies:-
3:il;r11'JflTrcan
,EI,IGIBILITY:-
continue the course of srudv
bv seeking admission to Ml.c.A
course or vr.Sc
Eligibility for admission to
this course
procedure followed will
be ,r.,ui roirJ*irsionlo
P,\TTERN OF THE COURSE:
rhe pattem of this course
Part I English
-
Ill
will
be a pass in the l0 + 2 level
or equivalenr. Ihe
Science) non_semesrer parrern.
B.S.t;*puter
shall be similar to the existin-e
B.Com. Dattern with trre tbil.,"vrns
ciescrrnlroii
Same as lor the existing
B.Corn. course.
;;lli:ilTiiJ;ljil:Jrige:Part
n
Same as ror the existin-c
B Com course (part r &
rr ,viil be conrprcrcrr
Nlain subject: Compurer
Applicarion:_
Course Details:The syllabus for the main
subjects
period of 3 years.
will have ll theory papers. 4 practicar
and r
pro.iecr soreacr
o'c!.
ir
Project:pplication
durin*c the coursc ot-stud,;.
t to the course of study and tlmish-o Thev rlso
,orI. ,.our,
and tour reporr shail be cone arong
',r:iiiii. il,,,i
ATION
_ t-
,
\,
Practical:
Experiments
Record
-10 iv-larks
lOVIarks
I0 Nlarks
Vil'a
Total
2.
Projects:
60 NIarks
Project work
Documentation
Viva
Total report
40 Vlarks
20 Marks
l0 lvlarks
l0 Marks
80 Nlarks
Total
syllabus
Year
Exam
First
I Year
omputer
Fundamentals
ming in basic
and
Marks
T
iP
ProgramSO
rscrete lvlathematics
numerical
80
+I
.qc
i60
econd
6()
ting Systems
mming & Data Structure
Year
SO
SU
:er oriented statisti
SO
ics & Microprocessors IT-T
ticals-CProet mmi
digital Electronics &
, Visual Foxpro
ect Oriented Introductions to tnternet.
Thi
Year
HTML,
8C
60
S(l
Java
ta Cornmunicaiion
80
,k
omputer Net-
80
,I
i
80
60,00
is0
PAPER
T.I
COMPUTER FLINDAMENTALS & PROGRAMMING
(as in B.Sc. Computer Science. (Non-semester))
IN
BASIC
PART A
UNIT I:
Charactenstics of computers - evolution oIcomputers compLlter generations algorithms srmple
model of computer - problem solving using compurers inpuvourput units storage unit
-A LU control unit.
T,NIT 2:
lllio]ll_number systems:- binary, octal
and hexadecimal - conversion from one system to another
BCD. EBCDIC, ASCII. collating sequence. Computer Arithmetic _ Binary addition, subtraction.
multiplication, division.
-
-J-
t
A
--_--l
-____{
\,
t)
lf
ri
.-
{ ''*2
,'
UNIT 3:'
'Primary storage:- storage capacity, ROM, RA*M PROM AND EPROM, cache memory, registers.
Secondary storage devices:- sequential access, direct access, punched paper tape, tape cassettes.,
magnetic disk, floppy disk, winchester disk, magnetic dnrm, mass storage, optical disk, magnet:ic bubble
memory, charge coupled devices.
LINIr
$:
Input and output devices:- punched hole devices - magnetic media
scanners - offline data entry devices - other devrces.
- printers - keyboard
devices
-
TINIT 5:
Computer software - relation between hardware and software - types of software - firmware
flowchans - decision tables - pseudocode - machine language - assembly language - high level
language - compilers-interpreters-characteristics of a good language - subroutines.
-
Text Book:
"Computer Fundamentals"
-
P.K. Sinha (BPB Publications)
Reference Book
"Fundamentals of Computers"
-
V.Rajaraman (Prentice Hall of India .)
PART B
Unit l:
Introduction to BASIC - constants and variables - LET, INPUT, READ, DATA, RESTORE statements
- Expressions - operators. Printer Controls:- PR[{T, COMMA, SEMICOLON, TAI}. PRINT USING.
a
Unit
2:
Branching and looping - COTO, IF..THEN, ON..GOTO, FOR..NEXT, STOP statements.
Subscripted variables - single subscripted variabies, DIM statement, searching and sorting.
Unit
3:
Double subscripted variables, matrix algebra
and special matrix operations.
-
reading, printing, addition, subtraction, multiplication
Unit 4:
Functions and Subroutines:- user defined functions, DEF Statement, subroutines - GOSUB statement,
named subroutines with arguments, string manipulation - string functions - CHRs, SPACEs, STRs,
ASC, VAL, LEN, LEFTs, RIGHTs, MIDS, functions, sorting of strings.
Unit 5:
File management in BASIC - sequential data files, random data ftles, program design, efficiency and
testing.
Text book
"Programming in Basic"
- E. Balagurusamy
(3'd
edition) (Tata McGraw
- Hill
, New Delhi)
Refelence*B-oek;
"Programming with Basic"
- Byson
S. Gottfried (Schaum's outline series)
-3-
lt
\
cAL METH.DS
)1
\
panA
l.
tes and quantifiers _ Logical
operators _ Logical
)
s
-
s
with constant coefficients _ solution
by the
relations ( l0 hours)
tions:
functions. (5 hours)
_ permutations and
combinations _ decision
3.
4.
5.
6.
ps
-
sub groups _ Rings and fields. (3
hrs)
part B
I
2.
3'
4'
.
arithmetic
tra
i.fr.
simultan."*l
eli
Floating points
Roots of algebraic and
method - Method of
Solution of
method -Gauss-Jordan
Interporation and
tmerical instability (4 hours.)
tental search method gisection
t' (10 hrs')
cramer's rule - Gauss etimination
"ppro*ii
ff,t*S;lt-iiH:ldirrerence
- Hermite interpolation _ Least
:
method,Eurer'smethod-iffi idfff
Reference
Books: I
2'
3.
4.
5.
6.
7.
8.
g.
I
t'x#J::ri:x'--:ffj:;[t1.j[:t.,I?j::J."*
"Elements-of Discrete Mathemati.r"_g. L. Liu ( McGraw Hill.)
"Discrete Mathemati."in
coiputer Scienc.,, - D.F. stanat, D.F. Mc
Allister ( prentice Hall.)
..Dis
plications to Computer Science,,
,.Disc
mputer Science,, _
B.
..App
putation,,, James M.L.,
..App
rnahan, H.A. Luther, Hames
J.p.
K
C.M.
O.
"Nu
of In
"Nu
lvadori and Baron (prentice Hall
grneerlpg Computation.,,
M.K.
"Num
(transl
publis
leY Eastern)
hysicists",Rudolf zurmal
an and K. Venkatesan (Allied
-\f,
tl\
f
f
-rIL
\
eapetttt Operating System
I
lntsoduction to OS ( 8 Hrs )
Evolutlon of OS - Serial processing, Batch pmcessing, multi programming. Tvoes o/ OS;Batclt OS, multiprogramming OS, network OS distributed OS. OS Sfrucfr/re:- Layered
$ructure approach, kemel approach, virtual machine and client seruer model. Future OS
trends.
2 Process managcment ( '14 Hrs.)
Process concept - Process scheduling - Types of schedulers, scfreduling and performance
criteria, scheduling algorithms, lnter procass communicetion and synctrnonization besic
concepts. Concunency inter-process communicstion and synchronizauon, mutual exclusion
semaphores hardware support for mutuel exclusion mecipnism for struciured form of inter-
process communication and synchronisation. Dead locks:- system model dead lock
characlerisation and modeling,
3
Mcmory maneg€ment ( 12 Hrs)
Single prooass Monitor - Multiprogramming with lixed partitions - Multiprogramming with
Dynamic Partitions - Paging Address mapping in a paging system - Hardware support for
paging - Address translation by .associative memory Sharing and protedion in a paging
systern - Segmentation - Address mapplng in a segmented system - lmplementatlon of
segment tables - Sharing and pmtection in a segment system - Mrtual Memory - Advantages
of Virtuel memory - Demand Paging Mrtual memory management policies
1
File Management( 12 Hrs)
File Concept - Directodes - Usk Organisation - Disk Space Management Methods - Linked
Non
Contiguous
List - Blt map - Disk Allocation Methods - Contiguous Allocation Allocation - Disk Sclreduling first-Come-First-served Scheduling - Shortest-Seek-Time-First
Scheduling - Scan Sctreduling - File Protection - Pass,vords - Access Lists - Access Groups
Text lor Cudy
t Oporelllp.!Bt.m - Andrew
2 Opereting system
-
S.Tanonbrum. Prcntlce hall ol lndia
C.Ritchie
UNIX
(15
Hrs.)
Unir Fundamentats
Basic features of Unix - Unix structure-Formet of Unix command, Basic Unix
6
commands
Listing of files, managing disk - Users, ownership end permlssion, Crcating mwing, remwing
and deleting of files and direciories fillers and piping, wild cads and regular expressions M
Editor- General charaderistics, creating, moring, copying, searching and changing of text.
lnter user communications. Online and Offiine communicstion.
6
Shel)Programming ( 10 Hrs)
Programming in Boume and C shell. \Mld cerds, Simple shell programs varlable
programming construcls and interaction shell scrlpts.
Trrt booka
Oailn o(thc
Unlx op.r.0ng cyltom Maurbc J.
B*h
Prcntice Hall of lndla.
Windows
T
lntroduction to wlndows (10 Hrs)
Windoua fundamentels, file managers, program manage6, acoessories, icon creation, windorc
installation, control panel.
-b-
P-r
l.
2.
3.
4.
5.
6.
7.
8.
9.
10.
I l.
t2.
13.
14.
15.
16.
17.
18.
19.
20.
21.
- (PRACTTCALS)
COIVIPUTER ORIENTED NUMEzuCAL METHODS
Bisection method: for determining the real roots of an algebraic or transcendental equatiin
f(x)=g
Regula-falsi method: an iteration method fordetermining the exact results of first degree
equation.
Newton-Raphson method: for evaluating real roots of an algebraic transcendental equation of
degree higher than four.
Muller method: an iteration method for determining the roots of a second degree equation.
Guass elimination method: a direct method for finding the solution of a systJnr of linear
algebraic equations.
Gauss seidal iteration method: a direct method for finding the solution of system of linear
algebraic equation.
Gauss seidal iteration method: an iteration method for the solution of a system of equations.
Lagrange interpolation: evaluating a function at a particular point.
Newton' s i nterpolati on with direct di fferences.
Gregory Newton interpolation evaluating a function at a particular point. Stirling interpolation:
evaluating a function at a point.
Trapezoidal rul
Simpson's rule
Gauss legendre
tion based on undetermined coefficient.
Taylor series method for the solution of ordinary differential equation.
Euler method for the solution of ODE.
Modified Euler method for the solution of ODE.
Runge-kutta method of order 2 for ODE.
Runge-kutta merhod of order 3 for ODE.
Finite difference method solving two-dimensional Laplace equation.
Finite difference method for solving heat equation.
Finite dilference method for solving wave equation.
-9-
papeiliV programming
And
oJ" rr-ctures
Through C
nC(30Hrs.)
Hrs)
ll of tndir,
t$9.
rn lntcmaUonel editiong,
-1-
le.
;-- -{r
-\
-t
\('
-..
Ivlodule
'.
F
-1- Y
T -V Computer oriented gtatistical methods
I
aad eecondary da$ Ccoilu aod oaryle surveyr-tvldhods
curves',Cumrrlative
of ssnpliD& Preparatioo of freqgency-distsibution' Freqgeacy
Colletim of datr-Primary
lvtrodule
tr
Modc,.Geometric
Basic stBtistics: lvleasure8 of ceatral teodenciea- Meao' IvlDdistr'
ofdirpersim'Range,Quartilcdeviatioo'l'orT0z
aeviatioo' Mments, Ske*uess 8Dd Kurtosis'
ll4IL8.l
lvtodule
Itr
Cunre 6Eing Principte of least Equ8rcs'
(Biveriate .""" *tV), Peasoa's coetficient
Regression aoalysis.
[lo Hrs']
IUodub fV
Probebility theuy :Randm e:rpcrimc'at
thoorce'
aod cmditimal
eveatr.
lvlodulo
V
RsDdm \rarisb
variables - d€os
case. Bivariets
expecratio'
coditio"81 digtsih*ions, indepeodence of two variables. lhtb€ilDstical
gcoerating fimctiq
elemeotary p.potio, t"t" ioa ccotsgl mo'ocnb, momcot
E:rpooential Betq
ctaoderd [email protected] ' BinoEial' Poiss< Normal' Uniforu'
[15 Hrs']
Gaooa, wBibull aDd togncoAt.
-8 l!
'r
ldodule
7
W
ll5 Hrs.l
It'todrrle
WI
[10 [Ins.]
Refereoqes:
,Lffi"H;,uit'afrli
2' FraDd
Introd,ction !o tdarematicar
sratistics, Nerryorrc,
J'E wapole R'8,lvlathcoaticat
'
iffi';dt*
,r.'
starigtics, hreotice
Hall of India*/t Ltd.
Plobaulity aDd cratidics
for F.si.eem, heotice-tlall
of
1'I'vin R'L, Statigticr frlr&oageoeo!
preotice
ffu[t ef rrrrin, p..n Ltd.
-q -
-r-
vt
l-
Paper_FVl
\
\
- Di gltal El ectronics And M icroprocessons
Loglc Grtes (3 Hrs. )
basic gates AND, OR, NOT - unlversal gates NOR and NANO
specialgates D(-OR end EX-NOR - symbols, truth tables
Positive and negative logic
Chrflcr
I
-
-
Modm Digltrl Elcctronhc by R.P Jdn
3 ol Dlgiltel Computcn Elccfonbr by Mrlvino & Brown
of
Oulrr 2 t
Boohan AlgeUra And Combinational Logic ( 13 Hrs. )
Boolean axioms, D 'Morgan's theorem: silatement, verificetlon end appliceUons - simple
comUnetional loglc lmplementalions - Kamaugh Mappings up to four varleUes (SOP end
POS) - onos compliment - half adder - full adder - interpretation of full edder as a suHrador
any logic gate can be
- universal gat€s (NOR and MND) lts importanca - Prwe that
(map
entered variable)
MEP
knplenrented by use of universalgatesonly. lntrodudion to
Cheptr5 olllodorn OCbl El*bonicr by R.P Jrh
ChrptorS ol Diflrl Compuirn Ehclrorilc. by Melvlno t Brown
Scquential Logic ( 5 Hrs. )
Oi,fferent flipllops such as RS, clocked RS, .J-K (race around condition) Master slave J-K,
type and T{ype flpflops - D type as a delay element.
Chrflrr 7 otModom Ugit l Ehctror{c. by R.P Jrin
Chrflrr 7 Olglt l Computoo ELcltonic. by I'lllvlno
D
& Erown
Counbns And thltr RcalsGrr (10 Hrs.)
Asynchronous counter ald synchronous @unterc(up and dotvn) Modulo 'N' Counter
conosd of counters as fraquency dlvlders - BCD countsrs - types of shift regisilers - SI-SO,
SI-PO, PI-PO, PI-SO shifr registers - shill lefl and shifr right registers.
ApplicaUons: ring counter and Johnson's @unter - multlple cycle delay element.
-
CtlrpicrS ol Modm DlgttC Elcctronhr by R.P Jeln
Clrflor
I d Oglrl Corpltcn
Electronicr by tttcMno
t
Brown
Detr Routng Elemrntr ( 5 Hrs. )
Muttiplexer
Chlpt.r6
-
demultidorers
-
decorder
of Modcm Dlgthl Ebctonice by R.P
-
encorder
-
tristate buffer- prlority encoder
Jah
Microproccrorr ( 2 HRS.)
Wtrat ls e microprocsssor- welutlon of mlcrogoc€ssor
Chrpir t'l
ol ldcroprocaorArchilectrrc, Prognmmlng md Appllc.tlonr by Ramcclr.S.Gronkrr
Chrptrr t.3, 1.5 & 1.6 d ldroducdon to tvtlcropanson by Adlhp.P.Mathur
Microproce3ror Archtbcture
(1
6 Hrs.)
(ll Memory cr:crlntsatbn:- Types of memories (RAM, EPROM, ROM, PROir, DRAlvQ baslc
conoapt of memory organisation (Number ls address lines requlred, onangement of memory
cells, control llnes momory extoruiion) Concept of control lines such as read/write chip
cnable - register to register trensfer vie data bus.
Chqtor a o, htodudlon to
l{croprccscr
by
Adlhyr.P.Mrthrr
(lii /yfthmetb aN Looie llnit ALUI :- Funclion of ALU -details, Design of a srnall ALU - An
ALU wfilch performs four basic (4 Bit) operations (ADD, SUBT, OR, AND) - need for
indrudion decorder- integration of lD with ALU -to form a ALU with controlsignals
Chrplcr lO, I l, 12 ot Obf.l Compdon Elctorio by Mdvlno t Erown
-1o
-
P-II
l.
PRACTICALS
- C PROGR.\y:r"IING
1\
Currenov notes rn (hc denominations o[ Rs 500.100.-50.20,10.5,2 and
FLs.I u'e avulablc. Given an amount o[ Rs. lLequcstcd to flrnd the no o[
clrrcncy notcs of clrr:h c,tlcgory to form thc iunount scl tltat minimum
no.of each category is uscd.
2. The length o[ the
hypotcnuse
o[ a
tngle in degrees betwecn the base
nght angle tnangle are grven ,Compute alea
ba.se nnd the
and
and
penmeter.
3. The distance between 2 stahons (in iCvls) nnd the dcpartr.ue time (in
hrs,min,sec) from firut station and avg spccd tr[ thc tra.in arc given
Itcquested to find
tlc timc of rrrrivrrl rtt sc(:otttl
slitlittn
4. Thc x-y co-ordinates of a point are given. Check weather the point is at
thc origin, on x <lr y axis or firut, soqrnd. third, or f<rurfi qurxlrant with
appropriate messages.
5. Rcquested t,9 find t}c gross and net p51y of an employee from the
l'ollowing data . grvcn hruic pay .DA and grulo of tJre ernployee and
status ('f/P - tcmporar.v or pcrmancnt). tlRA 20 % o[ bnsio pnv
c.A: 400 (A) , 300 (B) , 20() (c) and I00 (D) L)(.ductr<-rns to bc mule are
P.F for perrnancnt cmployccs is I0 o/o of ha-sic pay and income tar< et
(2") (;P <
2000 'and > - 1500(25 o/r)
l'ollowing ratcs. (;l) > " 20Oo (30
,
and GP < 1500 (l{il)
6. Write tr program to generatc and pnnt tirst n terms ot'Fibona,oct scrics.
'1, Wnte e progrzun to check a gtven yenr is leap yenr or not?
tind the roverse of r number and hencc chcck whether
it is a palindrome or no( '?
tt. Write a, progrun
t<l
9. Wnte I program to ftnd the roots of'quadratic
cquacron
program to pnnt all no s between I and m&xint having thc
property that sum ot'cubes oIits indrvrdual ttigit.s equals thc: number and
tind the total count of such no.s.
l0.Write
I
.-
a
I.Write I
progrnm
to rcod rrnd revcrre ul
Also sort the arrny,
F3t'
lt
integcr
Rrroy.
I2.Write a program fbr a mEIc square of orcler n is a number array marle
up
of
numbers from
I
to
n'.
The numbers in the square are arranged in such a way that eactr of the
rows and columns and two main cLiagonals arlcl up'to a constant figure
called magc constant.
l3.Write a program to evaluale thc sum .=l +X! -Xt+Xn
l4.write
I program
to generate a tehte
of
range 0 to Pi.
-Xt..
...
f.
sIN , cos and TAN firnctions
Is'Write s Program lo create a lile that stores seat numbers ,narne and marks
of tfuee subjects (marhs. physics, chemistr"y)of tor studcnts and read the
natne and total mark of each stude,nt. Writ€ function to append the file.
l6.Write a program to shorten a full nune.
I
T.write
program to find the surn of ttre
X-X1U+X' Bt -* I q+Xs t St -f
for values x:l to 5 in steps 0.2.
t6
t..
.
series
.
I8.write I prograrn to tabulate the following function for
to I0, a:|.2, b:l.5, P(h,k): e-..e-ba-br/(m!kl).
I9. writc aprogmm to tanslale binary numbers
into
m:l
to 5 and
k:l
decimal numbers
20. write a program to translate decimal numhers into binary numbcrs
21. Five test of ma:r. 20 marks each are conducted tbr a subject. prcpare
a
progrun that input dre marks in every subject and prepare the total'score
and grade. If total score is >=95 grade is excelleni ittotat
score is >-j0
and < 95 then gade is very gooJ. Lf total marks is >-=EOand <90
then
grade is good. <80but >:70 then 'Tair", <70but >==50 then ..poor',
and
<50 then fail.
ZZ'wite
I
prograrn to pnnt the number of lines (max 9) as shown. The
number to be entcred from the terminaJ.
Eg, 3
I
))
23-write
I
33
3
program to print lcm , rcd, gcd of trvo grven integers.
tL
W
t\
Ft{
'-:l:f;:'r:ffifiJ$t
all the hrthagorean rrprets wrth
in a given ranse
25'Given an iuray namecr A with
fl:e foilowing cremcnts
3 -5 I 3 7-o -t5 3 _1
\vrirc ir progrdm ro shill aJI -r"
',i i,ie ,so th:rt resultant
iurav may
norl
-9
th"left and the *ve nos to the
look tike
-s_t5_7_8313703
25'
\\rrite a progrun
to
convert hexadecimar numhers
equivalent. Use a firnction
27.WntE
I
program to
28'$/nte a progrun
trc
to
evaluate it.
b
its
decimal
multiply 2 matrices
trursrate numbers into worcrs
urilize a data file (felephone ,liory
)
hc,ne numbers. Include'a provision
=lelete a particular record
*Change
o
in a particular rccorcl
,y a panicular record
#,x1:?iJ,,r<rer
rng
man playing
3
1
. '',r,ti.ir .r ;l
;
i. n
J-Un to prepare the invo
r3
$;-llahus
for Practicel
P-III
DIG
l.
2.
3.
4.
5.
6.
7.
8.
9.
IT.\L ELE(:TRONICS
Verification of tlre truth table of the basic [ogic gates.{\D, ()R. & N(-iT (Lise 7-l
series It-s)
Verit-rcation of the u-uth table ofthe LTniv*rsal gares i.i.+.r*-D &NOR (Use 7.1
series I()s)
Verilication of the h'rrth iable ofthe lo,gic cates EX-()R ,t EX-NOR (l)se 7l series
Ics)
Construction of a flalt'Adder and verilication of its truth table (U>-e ]1 series Ics)
Constnrction of aFull .{dder and veritication of its truth table (Use 7-l series lcs)
Design and set-up a circuit tbr I to 4 Demultiplexer usirrg loq,ic _cales
Study' of the r'uth table for D and Jk flip flops
Desi-qn and set-rqr a ring counter and displa;- the outprrt rrsine LELl
Consfuction 'and studv of tr BtlD couoter with seven S,.'ErDent display decodet counter
WriF
JIIICROPROCESIiORS
tbllowing problems and test the same in
a-ssenrbly lan-errage pro(trams for the
8 0 8 5 rv-[i crop ro c e s sor sy- ste m.
1. Test 0i I condition tbr ra bit in a given daia
2. Addition olnetwork bytes of pure binary numbers
3. Addition of multiple byte binary numbers
1 BCD addition tbr multi digits
5. Sorting a block ot'data
6. Ivlultiplication of two nurntrers (a) 8 bit x 8 bit (tr) 16 0r, * 16 Lrir
7, Division of &vo numbers (a) E bit i 8 bir (bi t0 brt i 16 bir
8, Rolling and tlashing tlisplay
9. Generation ot'square rvave of specified frequency usinc (a) 33.5.-1 1bi 825J
10. Writing a calculator procrarn lbr a keyboard intert'ace unit irrterliri;ed tlu'ough 82-i-;
.furd demonsfaling the action
Outputablockof datato a8 bit D/A converter ini*rflacecl to 8l5i and observiris li,e
output voltage wave tbrm-"
12. Setting up an A,/D interface unit and determiue the input ala.iog voltage
ll.
tr{
T-VTI
ModulG
DBMS, VISUAL
FOXPRO
I
Inhodudim
- Ba.cic Cmceptr rDd Tcrnholory
Organizatim Toctrni qu u
Moduh
Coqerieo
;'tli :( ' 4 :"
i ., lt[odnlc III
..:i.-!.1
'j- .,'
)
Dda
N,Iodcls
-
Reviar of Filc
( l0 Horn)
tr
Hicnrchicd lvtrodel Reratimal
.,;
-
Model
Netwo*
Model
Ba.sic Coaceptr
(Is Holn)
..L,
..,:
Ianinraim
b
RDBrrs
scllcmea
-
Fuoetimd DGrindcoci'
-
Noroel
Faor for Rcletioel
(15 Houn)
Modr& fV
kotecting Detabare egainrt Eicttsc
aDd
Crsrhcs
- Itrt€grity -
socurity
- lv{aoagmt of Deadlockr
(15 Houn)
ModuL V
Cmcurnol Operatimr m tbo DEtahso
- A Modol with REd rDd wrilo
-
Lo.b
Basic Corc€ds
-
A slnplo Tranractim Modol
(15 Ho.rs)
Moduh VI
berc Creatioo
-
-
Appeod Vicry - Edit
aDd Utilitiec
Sorting
labols - SQL -SQL Cmnands - Creatc
TmLg - aucry By Eunple (25 Houn
)
Iv1emo
field
-
Rofsw
l.
2.
3.
1.
Delrbasc MaDagmot [email protected]
A.o Introdrrctim to Databaso Syrtcrms
Databerc Syer""n Cooccptt
Foxpro 2.5 for Windowu prog;ranmrg
Gli&
t{
-
Abo & Ullmaa
C. J. Date
Silberscbatz, Kort\ Sudenben
Micba€l Ant,ooor,vich
-
T-vrrr oBJtrcfoRiestlo
TNTRoDUCTToN To
JAVA HTML AND TNTBNNET
Module I
Introduction to Internet - Evolution - Services available in Intemet Email - FTP - Telnet -World Wide Web - Browsers - Gopher Search Engines
Search tools.
[5Hrs.]
Module II
Internet - TCP/IP - Different layers of
Underlying Technologies
TCP/IP - IP Addresses - DNS - Web Servers and Clients - Management of IP
[0 Hrs.]
Addresses.
of
Module III
Various
Internet Security - Threats and Crimes - Cryptography
Algorithms Basics DES Public Key Encryption Commercially
available
Encryption Programs - PGP - Advantages and Disadvantages. Il5Hrs.]
-
-
Module IV
-
-
-
- Mail Servers -
Components of an Email Management
System - Sending an Email - Email message format - Email Gateways
Email Privacy - Commercially available Email Clients - Outlook Express
Pine - Eudora.
[0 Hrs.]
Email
Module V
HTTP
AudioA/ideo
- HTML - HTML Tags - Detailed review - Image formats in Internet - XML - DHTML - Commercial Web
Development Tools - Dream Viewer - MS Front Page - Cold Fusion.
[5
Hrs.]
Module VI
Java- Object Oriented Programming in Java - Java Virtual
Machine - Java and other Object Oriented Programming Languages '
comparison - Java Classes - Inheritance - Interfaces - AwT - JDBC Exception
Handling.
[lo Hrs.]
Module VII
Internet Programming and Java - Java Applets ' Servelets Security and Applets - Socket Programming - Threads - Other Technologies
- ACTIVEX Controls - ASP - Various Scripting Languages and their uses [5 Hrs.]
Basics - Java Script - VB Script - PERL.
References:
l. The Internet Complete Reference - Taia McGrawhill Edition ' Harley
Hahn.
lava -
Laurance Vanhelsuwe. Ivan Philips. Goang Tay Hsu'
Krishna Sankar, Eric Ries, Tim Rohaly, John Zukowski.
3. Java Workshop programming - Steven Holzner.
4. Computer Networks- Andrew S Tannenbaum
2. Mastering
It
\/
PaperD(
COMPUTER GRAPHICS
Graphic devicos (15 Hrs)
Disdav. Svg(qm$:- Raster Scan displays [refresh CRT, Grey shedes, look up tebles,
intedacingl Colour monitors [RGB, Shadow masks, Look up teblesl Flat panel dlsplays
[Plavne penels, Liquid Crystal dlsplayslVGA, SVC'A resoluUons.
lnod Devkmg- Digltidng Tablets [Elodrornagnetic, Eledrical, Accuasitic typosl - Mouse
[Meclranical and Opfical track ball, Data Gloves, Light p€nJ Touch penels [Of,ical,
Cepacitive, Conlc typesl lmage Scanners Fypos, Tyfical rssolutions, Slzes, Stnput formats
wailabel
Drawing Geometry ( 20 Hrs)
Mathematlcs for Comoutor Graohbs:- Poler coordinates ln :<y plane, Veclors [Scalar product,
cross producll, Matrlces [Scalar multifliceUon, Matrix addition and multlplicstion, Metrlx
inversel, LIne drawing ancl 2D Trensformation, A slmple Line Drawing Algorlthm, Use of
Homogenous Coodinate Systems. Translation, scaling, rotation, minor refledion, Ro(ation
about an arbitrary point, Zooming and panning, Rubber Band methods, Dragglng, Peramctric
Representatlon of a line segment.
Conlcs rnd Curvcr ( 5 Hrs)
Bresenhem's Clrcle Drawlng Algorflhm, Generatim o( Elllpees through transformation on
Circles, CondiUon for smoothly joining curve segments
Gnphic Operetions ( 10 Hrs)
Clipping - Windowport and Vlewport, Elimlnetlon of tdelly vlsiHe and totally lnvlCble llnes
with respect to a redangular window using lina end point codes, ExCiclt line clipflng
Algorithm, Mid pint sufdivision Algortthm - FiUlng - Stack basod and Queue bes6d Seed
Fill Algorithms, Scan Linc Seed FillAlgorithm, Generetlon of Bar cherts, Pie charts, Characier
Generation
3D Graphlcs ( 20 Hrs)
-
Transformations
Rlght handed Coordinate System with Verticel Y-axls - Transformation
Matrices for translation, scaling, rotaUon arcund o<is - Parallel Pmjection
Multl vlews
front, top and slde vlervs Oblique vielv ProJedlon on }0f Plane with rays elong a glven
diredion - Prospedive projectlon
TransformaUon Matrix to yleld one Vanlshing Point
Perspedive vlew with View polnt lying on Z axis - EfrBcf of translating the o$ect- Comprting
the vanishing point - Numerical examples - Hidden surfac€ remorel - Back Face remorsl -
-
-
-
-
-
Floatlng Horizon technique
0
Animetion(5Hrs)
Tweeklng
7
- Morphlng - Graphic Standards
MulUmedla ( 15 Hrs )
Concepts
of
Hyp€rto)dfl-lypermectia Multimedla
appllcations
Educetion, Vrdeo
conferendng, Training, Entertainment, Eledronic encyclopedias - Multimedia Hsrdwarg - CD
ROM. Audlo Speaker, Sound Card, Mdeo Cameras. Scanners, MlDl lmages bitmaps,
windows peint brush Languages of souM, Dlgital sound, Playing MlDl files, Generating
sound, Cunently Available Multmedle softrare.
-
-
Book
I
la
Slu<ly
Proccdurtl rlcmcntr ot corputor grrphbr by D.F Rogcr - Mcgnwt{lll
2 lldhcmr0ctl chmontr to. computlr grlphlco by Rogcrr li Ademr - llcgnerrvHlll
3 Prhclplc o( intcnctlvc computcr gnphlct by Robat. F. Sprodl - McgrrwHf,
rl
r
\
PAPER
TX-DATA COMMLNICATION &
COMPUTER NETWORKS
Part A
- Bandwidth
Noise impairments -
Concepts of communication and communication channels
l.
consideration
duplexity.
)
-
Analog & digital communication
-
RZ, NRZ. Broadband transmission
QPSK, QAM. Multiplexing - FDM. TDM.
Baseband transmission
-
-
FSK, PSK,
Sampling theorem - Quantization and coding - PCM and DPCM
techniques:- Serial
Quantizalion noise - CODEC. Data communication
and parallel communication - asynchronous & synchronous
communication.
3.
Communication system interfaces and standard:- RS-232 standard
standard. communication equipments:- Modem - multiplexers concentrators.
4.
- X'21
fiber,
Data communication media:- Twisted pair, coaxial cable, optical
waveguides, communication satellites. Enor detection and correction paritf, CRC, Backward and forward error correction - Data compresslon:
Huffman coding - Data securitY.
5.
Text Book:
"Data Communications"
- William L. Schweber (McGraw Hill)
Relerence Books:
l.
2.
..Data
& computer communications"
- william
Stallings (Maxwell
Macmillian)
"Local Area Networks"- Keizer
Part B
1.
2.
of networks (LAN'
computer Networks:- uses - topology - various types
WRN, MAN) architecture - ISO-OSI reference model'
Physicallayer:-Basisofdatacommunication-analog&digital
handling - ISDN'
transmission - FDM & TDM - Switching - Terminal
_
simplex and sliding
Data link layer:. Error detection and conection
(802.3,
*indo* proiocols - LAN protocols - IEEE 802 STANDARD
802.4, 802.5).
3.
4.
centralized. isolated) Network layer:- Routing algorithms (distributed,
Atoha protocols
congestion control utgo;th;t - lntemetworking layer - Connection
satellite networks - picket radio networks. Transport
crash recovery'
management - Flow control & buffering -multiplexing -
-
layer:- Remote procedure call - client seryer model - orphans'
crystograph'
Presentation layer:- Data compression techniques -
Session
t(
\'\
5.
Application layer: FTAM. E-mail, Virtual terminal, JTM, Teletext and
VideoText.
Text Book:
"Computer Networks" (2nd edition) Andrew S. Tanenbaum
Reference Books:
l.
)
" computer Networks
and Distributed Processing Software",James Martin
(Prentice Hall of India Pvt Ltd.)
"Design And Analysis Of Computer Communication Networks" - Ahuja
(McGraw Hill)
t1
<l
L
-o'l-
f"
PAPER{XI Accountrncy lnd
\
OR
I
It4odule (10)
Principles of accoroting Assets
-
Cuneot ascets, Fixed sssets . Liabilities- curreot .
liabilities .Orvnen equity- hlding eccount -accormting. records aad
liebilities, other
cystElms . Contol accounts and suboidiary ledgers -limitatims.
II
(10)
AsssG and rvorking capital F'ixed assets aod depreciatioa
assets acqrdsition
diepooal, replacemcat depreciation
iDtangible asc€ils- inventory methods- source of
urc*ing capltal frDdr, cash flov.
Ivtodulo
-
-
-
ldodute Itr (10)
Intcrpeting accouots aod financial ststco€ots : Use of ratios
accounts aod finincial stat€mcot! /imitatims -othcr methods.
-
in int€rprcting hadirg
Ivlodule fV (10)
Standards for cmtrol : Variable ccxrl I Fixd coet -+ogt-volume -profit aoalyrir - hEak
o\r€o -Earginal aDd full costing cmtsib,utim - staDdard coeting - analyrir of rlrrriaaceaod dgorithrns.
coputer
lvlodtIe V (10)
BudgetiDg / fcecastiog : Characteristic of budgets - &finitim
ptparation foreasting lmg term /shtrt Erm Fject appraisal Methods of capital
inveghcot Decisim mrlring.
Ivlodule
LiHr
VI (12)
, simplex
metho4 dual sirylex mctho4 Eaosportetim aod
tsaaschipment problomr, ascignmmt problemr, travolling ules
the6y.
"trt'
problomr. Gamo
I\,lodulc V (10)
Nctrvo* aoalyair, CPM & PERT :Networt minimi-qtim, Shortegt route pobleo,
maximal-flow problem,
pject
scheduling, critical path caloilatioDs, PERT calotl8tiqu.
lviodulc YI (10)
Soqueocing modolc: poceseing of n joba tbrough two machines, n jobo thugb 3
monhincs, two joba thougb 6 paahirres.
Replaceoeot modcb: Replaccmeot policies for equipment u/hich deteriuate with tino ,
Replaccmcot of itcms failiry comploxity.
lvlodule Vtr(8)
Inrrrniory models: De&rministic inventory modeh, infinitc dclivc'ry dab with bsck Do
orrders jDfraite &linery dste with bsck oders, 6nite delivery &te with no back orders,
finite delivery date with back orders.
{^
ilr!
r/
(
P
- IV
PRACTICAL
- clt+
PIU)GRAIVIIvIING
l.
a)
b)
1
\\.ri!e a progrsm i.o input an uount of mcurey' its a rv'htrle uunrt'er
zurci displa_v the
minimum number of tift1', twentl'. ien- live ancl two rupee notes
that make urr this
Write. ir prog;tuu to generate N prime numtrers,
\rrrite a progr.lrn ic generate N Strange numhers.
arnouut.
i.
\\tite a prLrgrarr Io i11rrt a deciuul
and hexadecirual.
uuurber.rurtl rlispilay the equivalent numbers in rrc:ral
4.
wite
a progrrun to convert
5.
write
a program
6.
write a progrrm to maintain book shop inventc.ry using srnrctures.
7.
Write a program lhat uses an overlr-',aded
opcrator should allow sl f = s2
8.
Imagine a publishing company tlrai markets boih b,roks and audio cassefre versions
of its,:
works- Cre.rte a clncs publication that stores the title and price of a publication.
From i
this class derive 2 cltsses: book. which a,Jds a pog"
iape which adds a playrrg
time in minutes. Each of these clesses shouli fruu"o*,iand
u ge date 0 *d putdate(). Write a
prograrn to t.est the br:ok and tape clruses by crearing instances of them.
r.L\
positive integer nunrber rnto *.ords.
convert Ronun numerals rnto dc'cismis.
* = operator tbr the rtring
concatenation. This
i
9.
Write a progriun to copy a sting using pointers.
10.
Write a proersrD to create a linked list.
I
l.
write
a prograrn to perfbrm line drarvjng using Bresenharn's algoritfun.
t2.
Write a progtram to perform Clircle drawrng.
13.
Write a program to pertbrm 2-D transtbrmatious
14.
Write a program to draw tbur quadrant graphs.
I
Program to drau'circle ihnt uses a class ball uhich stores ihe crrordinares critfie certer
r.f
the circie.
_s.
a{
\
t.il. 1v'1.
(
')\
- Il'y Ci: t, J- tCUr
l.b str.:c
t
)
3;:chel-rr of Ccnputr:r r.1 llicitirns
tiii:?,,.rs c f Fapi r vr .-' i t.i.i.y on, (lC,i ) .- m.(' if ic at ic n in thc
q(r-;isstan ._n',al:cs _. Crct-:-s isiu,icl l.rac:t:-caIs) -.,c f lCCC
.
i'.c .t-AIrl.J
T -. - -'
irt
J( :
CLll..,r.l ,.il' ;Ci.J,Lr,IC EilJ:Cii I
Iiz,<))t"/2(( ( .
i. .tL.c Cal icut Un ivcrsrty
r C.
2t)
.,;,
,2(a.l
(.j.1,:c. 5. j_c.2C(c.
1. l.:inut,;s
:.ra.lr;r.( r,._iJ)i2/,:3/97
Z.
: f rr:_t:n,_ cf B,_-aIC cf S+uur it s In
/ r t _:
';! . ).2.2444
_ Sc i,--oC,: h lc ( n
.
3.
l,inr-rt-s r f 1_ -L:r,- cf -fai.r ]ty
:..- Sci:ni i-, 1 ,r.
2( .2.2C( j .
1,. i:inut.'s cf r:n,;,.rn,_ cf
r..C. h:Lc .n _.3.21 (i.
fI
(2)
(
l!r- |I
i
-
r
t.
Thi- Fac u.J.ty . f :c r(- n(:i at i Ls n.: -L
.rt-r-r.av.( th, i,-nu1: s:.t B,-arc ,_i inr hc 1
Sir,-i.,a.
Thc r'rc j(( ii )c (,,:,.:nc:l_ ;.,i its rr_t: iir.r,,
,.
-)
al)rr.v,.( th,
i;!:l:I.cf
(.,)
r:inu-l_
s,-:.
n(,
,. i
.,,.n(
i-rc_J_<
.f Jiu.-:i.,
,-.Ls: th.--r:nlnJi,,
E,_,,,rc:
n
t
n
2c .2 .2.cc.r
3._..2r.C-L
prcvcc, by
, 9s_af
Faculr.y cf
f
Sanct j n ii,-s b,^ fl ilc,..:.crci f .r thr
ii;:p 1r=mr n-"i+" i- n cf
if ic. at j,- rr i-r: th . f .,i - r -V i .- f i., -LLcl
anr
Ili:t,.J'r( c.. s!. rs rnr its f r..lti.-.ii '.- tI -"'El..Ltr.nics
2(f C c( ;,: i.5c L, n : n\ -rr. s
-uf . (-C Ul:S. V, C f
rncd
(5)
i-L
-:
O::ocrs arc sr.,ti . ec..l rc :nq J.y.
.,i
t:, ili:.:i:lr]rrroous r.f pa1-cr. Vr cf !c;, ls
r I t -1
r-t
u r I t..
E,
I \.j--
t
'_
l;_(
a,_, (_n(,.(
r\
-J.!rI.. i.
-Ijll-.
1a
The Fr inc
c'ry tr:
:-p
aIs c f Cr.lf i. !: s of f i r in< l;L.. C,_ u. s,- s
Ccntrc 1le-,r
cf ,-,-.:":_n_ti. ns/Univc: sity In..i irat--n
jty L rbr..;y2;i. ct< f iIr- an(
Centrc, s,/Un ivers
-lL
C::cir
,"r :./22.€,.
Ciji ICI r
.
I Y.
.,
!
,
v
t
,t)
'
Drcrr^r*r.""iffi":ffiilEopBocxsso.s
,1_,_oO: rrrry-dadccs_Drsic
idcas-plD
c:a-oplc wi& softwa.e
toot.rtrty-T
PART 2.MICROPROCLSSOR
7
SYSIB,{ DESIGJ
MICROPROCESSOR SYSTEM I"AB
intsoduction to
Dos
aad itg DEBUG progrutr comnasds-sddisg aad
modising
the
codenb of thc mcmory-asseobling g0g6 instuctions with thc
e,ssErvmm comnardexecrtiog t086 instsuctioo and prograpd wi6 TRACE aod
GO comnaad
.assembly laagrrage progrs.m development ruing
IBM macro essembter-creaing
assembler 8ource file-eseembling source progrutr with
ild.{sM-typical progranming
en^ryles
strdy of typical l6 bit tsainer kit and its operation
concept of interfacing ths
l6 bit
tsainer kit with IBI\4PC and dowuloading the prograru
developed h IBIU/PC ruing lvf,A.SM
fhmiliryi2ll6o of using in cirorit emulator for g0g6/g0gg based
systems
6.
faoiliarizatioo of using
a
logic rrralyzcr for trouble shooting microprocessor
systerDg
(minimum of 30 asaignurenE
r
tom this section)
based
)n
o(
DIGITAL ELECTRONICS LABORATARY
IRA}IEB, CTIAfu\CTAIIISTICS AND SPECIFICATIONS
OF
TTL A}ID MOS GATES
OFIIALF ADDM, A}ID zuLL ADDB. USING NA}ID GA]ES
z.
DESIGN
3.
SET UP R.S
1.
CODE CON\TB,TB,3.BINARY TO GRAT A}ID GRAY TO BINARY I-ISING MODE CONTROL
t.
ASI}ICI{RONOUS UPIDOWN COUNTB,S UIIING JK FLIP.FLOP
6.
DESIGN A}ID
1
STUD T OF SHIFT REGISTR.S A}IDDESIGN OF JOHNSON A].ID RING COUNTERUSING IT
8.
BINAR T ADD
9.
STUDY OF rC COUNTES 149O,1492J493 Al.rD74ty2
10.
A.9TA3LE AI.ID MONOSTABLEMI,]LTI VIBRATORS UI'ING GATES-USING JJJ IC
I
l.
&'.K
FLIP.FLOP USING NAND GATES
REALEAIION OF SEQUBICE GE}IR.A,TORS
IIION AIID
SUBTRACTIO N(a) I' S COMPLB,fE ITO)2' S COIT IPLB,IE IT
ADC USING DUAL SLOPEMETHOD
t2
STUDY OFMID( &DEV{IIX
l3
ROM &RAI\.{ CHPS.\E-EICAIION OF ME1y{ORIES
-1
v
Fly UP