Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A - PDF document

Revised Syllabus of B.Sc.(Computer Scien
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 NAAC ‘B+’ Accredition Dr.Babasaheb Ambedkar Marathwada University Aurangabad-431004 SYLLABUS B.Sc.(Computer Science) Three Year Integrated Semester Course Dr. Babasaheb Ambedkar Marathwada University Aurangabad-431004. Tel.No. : 0240-2403400/431, Fax:0240-2403113 Website : www.bamu.net, http://bamua.digitaluniversity.ac.in Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10
 \n\n\r \r\n\n\r



\n
\r
 



 


 
  
 
\n


 \n
\n\n \n



! 

\n
"
\n\n 

 
\n 
\n 
#
 
\r
!
\r
$"  

%\n

\n 

 
\n\r& \n
'

(#


\n
)" \n


 * 
\n
+" 
  
',
! 
\n
"
\n\n 
#
 \n\r 




\n 
 


&
 
 
\r

!
\r-
$"  

%\n

(\n-
 
 -
.\n\n-
 \n-
% \n







 
\n\r& \n
 \n\r 


\n
#
\n



 "
\n\r& \n


#
 * 
\n
+" 
  
',

"
  
 \n\r 
"
\n
%/



 
 + \n0( \n

',
 
 + \n0( \n

',
0
 \n
1
\n

 
 
\r

\r

 
(-
%\n
 
2! 

\n
"
\n\n 

+
#


\n
\n\n 

 
  
#

\n
" \n

\r
 

 \n 
\n 
\n\r\n + 


 
#


\n\r& 

\n\r& \n
 

\n

\n
3 
 
" 


\n


 \n

 
\n

 


4\n-
 

0
 


\n\r& 

\n\r& \n
  
#
\n
(\n-
 
5

 

\n\r& \n



\n

\r
 

 

\n
#


\n
\n\n 

 
#
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 0
1 

 

 
 
  
\n
\r
  



\n
\n 

 
\n

\n
\n\n

\n#
\n  \n \n


  "
\n\r& 
\n
 \n\r 

\n
  



#

\n\n 
 

 
\r\n 
\n\n 



#
 \n\r 


1 
\n






0
 


#


\n
\n
 


\n\r\n6 #
7
0
8\r 

\n \n


 
\n\n
\n

# 
9:
%#
\r 

\n \n


\r

\n



\n

\n  \n \n
\n
\n

\n

\n  \n \n
\n
\n\n

2:
\n \n



;
\n#
\n  \n 

\r
\n
\n\n


\n \n
0
 \n

\n\n


\n\r\n + 
 #
\n  \n \n

\r

\n
\n
 

)" \n
  \n
4
(
\n

  
  

"


\n\n
 \n\n
 
 



2:
  \n
0
3
\n


\n
\n

\r
\n\r 


" \n


=
3
\n
 

 

\n\n
 \n\n


4
(#

\r
 
\r

)" \n
\r\n 


 
\n\r\n
4
.
(#

\r
 
\r

" \n

# \n

\n\r

\n


 \n\r 


\n \n


#


" \n
0 

\r
&#x-2.6;鐶:?
 
 

 
 " \n\n
 \n
@
0




9:?



 
#
0
  
  \n
"

3
\n\n
 \n

 
 
\n  
0 
\n

\r
\n 
 \r


\n\n
 \n


 \n\n\n !"#$ \n\n%\n\r \n \n&&\n&&'$0

\n
" 

\n






\n \n
0
 
 \n\n\r
\n



 " 

+
\n\r\n
\r\n 
-
\r
\n

"
 

\r


 

* 

\n
 -

 
\n
"
\

n 
 \n



\n
n 
 \n



\n 

 
\n
\n 
\r 

0
 
\n
"


 \n

( \n')'
\n\n



9:
\n \n
# 
2:
\n+
*
 
+ 
\n
5\r
"


58
\n\n 

A:
 \n

"
  
 "

\r
\r

 
\n -
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 "\n
\n -
 
\r
"\r

\n



\r
+


\r
"
 
 \n\n
3\n



\n
\n
 
 
\n\r\n



::
\n+


\r


 



 \r 
,'

\n

::
\n+


 
-'



::

\n+

 
 
.'
 


2::
\n+

\n 
  \n


 \n
A:
  
0
\r

\r
 


\r
/'


" 

 #
\r3

"
\n 


\n\r& 
\r
"\r





   
\r3
\n
 

\n\r\n
05\r
\n
\n\r\n\r

 

\n 
* \n

  
 
 \n
\n
\r
"\r

" 
 "  

\n \n
1
 
\n

\n\n
" \n
0
 
\n
\r
 

"
\n
+ \n

"' 0
 


  


\n

 

 . \n\n
20


\r 

 . \n\n
20


\r 

  \n
\n
\r
 
\n
 

3
. 
\n  \n -

3


\r
 


\r\n\n


 
\n\n \n-
\n


\n\n
 
\r
%
\r 

  \n



\n
\n
\r
"
#

 
0  \n
\n
\r
 
\r

" \n)$
\n
0
+


\n
\n
 
  

+

  \n


\n A0 
\n
\r

 3




3
 
\n"
3
0
  


\n\n
\n
\r
 
 �'
+ 
\r


\r 

\n\n
/
 \n


Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 PATTERN OF QUESTION PAPERS A)Internal Class Test : A class tests is to be conducted after completion of 15-20 Lecturers.B)THEORY :- Each theory paper will carry Maximum 30 marks; duration of examination of theory paper will be 1.5 hours. C)PRACTICALS: - Total marks 50 marks Each Practical paper will carry Maximum 50 marks, duration of examination of each practical paper will be 1.5 hours. Internal Distribution of marks for each practical paper will be as follows. Journal/ Record book (certified) 10 marks. Oral/ viva 10 marks. Practical Test 30 marks. D) PROJECT:- Students of semester VI will have to perform ONE project of 150 marks. ( A

group of maximum 3 candidates will allo
group of maximum 3 candidates will allow working on one project work) Internal Distribution of project marks will as follows. Review 1 Report : 25 Review 2 Report : 25 Project work (certified) 25 marks. Project work Presentation. 50marks. Viva/ Oral. 25 marks. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 Dr.Babasaheb Ambedkar Marathwada University, Aurangabad Curriculum Structure and Scheme of Evaluation: B.Sc.(C.S.) Sr. No. Course Code Name of the Subject Scheme of Teaching Scheme of Evaluation(Marks) T hrs/week P hrs/ week Total hrs/ weekClass Tests + Tutorial Univ. Th. Exam. Uni. Pract. Exam. Uni.Exam Duration ( in hrs.)Total Marks I Semester 1 CS301T Computer Fundamentals 3 - 3 10+10 30 - 1.5 50 2 CS302T Digital Electronics 3 - 3 10+10 30 - 1.5 50 3 CS303AT 8085:Microprocessor 3 - 3 10+10 30 - 1.5 50 4 CS304AT Programming in C 3 - 3 10+10 30 - 1.5 50 5 CS305ATP Communication Skill – I 3 - 3 10+10 30 - 1.5 50 6 CS306AT Mathematical Foundation 3 - 3 10+10 30 - 1.5 50 7 CS301P Office Suite - 4 4 - 50 1.5 50 8 CS202P Digital Electronics - 4 4 - 50 1.5 50 9 CS203AP 8085:Microprocessor - 4 4 - 50 1.5 50 10 CS204AP Programming in C - 4 4 - 50 1.5 50 II Semester 1 CS307T Data Structure 3 - 3 10+10 30 - 1.5 50 2 CS308AT Operating System I 3 - 3 10+10 30 - 1.5 50 3 CS303BT 8086:Microprocessor 3 - 3 10+1030- 50 4 CS304BT Adv. Programming in C 3 - 3 10+10 30

- 1.5 50 5 CS305BTP Communication Ski
- 1.5 50 5 CS305BTP Communication Skill - II 3 - 3 10+10 30 - 1.5 50 6 CS306BT Numerical Computation Methods 3 - 3 10+10 30 - 1.5 50 7 CS307P Data Structure & O.S. - 4 4 - 50 1.5 50 8 CS203BP 8086:Microprocessor - 4 4 - 50 1.5 50 9 CS204BP Adv. Programming in C - 4 4 - 50 1.5 50 10 CS206BP Numerical Methods - 4 4 - 50 1.5 50 Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 Dr.Babasaheb Ambedkar Marathwada University, Aurangabad Curriculum Structure and Scheme of Evaluation: B.Sc.(C.S.) Sr. No. Course Code Name of the Subject Scheme of Teaching Scheme of Evaluation(Marks) T hrs/weekP hrs/ weekTotal hrs/ weekClass Test + tutorial University Exam. Uni. Pract. Exam. Uni.Exam Duration ( in hrs.) Total Marks III Semester 1 CS309AT Analysis of Algorithm 3 - 3 10+10 30 - 1.5 50 2 CS308BT Operating System II 3 - 3 10+10 30 - 1.5 50 3 CS303CT Peripheral & Interfacing 3 - 3 10+10 30- 1.5 50 4 CS304CT / CS310AT OOPs using C++/Java – I 3 - 3 10+10 30- 1.5 50 5 CS312AT DBMS – I 3 - 3 10+10 30- 1.5 50 6 CS306CT Statistical Method 3 - 3 10+10 30- 1.5 50 7 CS209P Pr. Based on 309AT - 4 4 - - 50 1.5 50 8 CS203CP Pr. Based on 303CT - 4 4 - 50 1.5 50 9 CS204CP / CS210AP Pr. Based on 304CT/310AT - 4 4 - 50 1.5 50 10 CS212AP Pr. Based on 312AT - 4 4 - 50 1.5 50 IV Semester 1 CS313AT S.E. –I 3 - 3 10+10 30 - 1.5 50 2 CS312BT DBMS – II 3 - 3 10+10

30 - 1.5 50 3 CS314AT DCN – I 3 -
30 - 1.5 50 3 CS314AT DCN – I 3 - 3 10+10 30- 1.5 50 4 CS304DT / CS310BT OOPs using C++/ Java –II 3 - 3 10+10 30- 1.5 50 5* CS315AT Computer Graphics – I 3 - 3 10+10 30- 1.5 50 6* CS303DT PC Hardware 3 - 3 10+10 30- 1.5 50 7* CS316AT Web Fund – I 3 - 3 10+10 30 - 1.5 50 8* CS317T Linux 3 - 3 10+10 30 - 1.5 50 9 CS212BP Pr. Based on 312BT - 4 4 - 50 1.5 50 10 CS204DP/ CS210BP Pr. Based on 304DT/310BT - 4 4 - 50 1.5 50 11 CS215AP/CS203DP/ CS216AP/ CS217P Pr. Based on CS315AT/ CS303DT/ CS 316AT/ CS317T - 4 4 - 50 1.5 50 12 CS215AP/CS203DP/ CS216AP/ CS217P Pr. Based on CS315AT/ CS303DT/ CS 316AT/ CS317T - 4 4 - 50 1.5 50 * Indicate optional paper (any two from Sr.No. 5/6/7/8) Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 Dr.Babasaheb Ambedkar Marathwada University, Aurangabad Curriculum Structure and Scheme of Evaluation: B.Sc.(C.S.) Sr. No. Course Code Name of the Subject Scheme of Teaching Scheme of Evaluation(Marks) T hrs/weekP hrs/ weekTotal hrs/ weekClass Test University Exam. Uni. Pract. Exam. Uni.Exam Duration ( in hrs.)Total Marks SEMESTER V 1 CS313BT S.E – II 3 - 3 10+10 30 - 1.5 50 2 CS318T E-Commerce 3 - 3 10+10 30 - 1.5 50 3 CS314BT DCN-II 3 - 3 10+10 30 - 1.5 50 4 CS304ET GUI-Programing 3 - 3 10+10 30 - 1.5 50 5* CS315BT Computer graphics-II 3 - 3 10+10 30 - 1.5 50 6* CS303ET Embedded-I 3 - 3 10+10 30 - 1.5 50 7* CS

320AT XML 3 - 3 10+10 30 - 1.5 50
320AT XML 3 - 3 10+10 30 - 1.5 50 8* CS321T Dataware Hsg. and DM 3 - 3 10+10 30 - 1.5 50 9 CS213P Pr. Based on 313BT - 4 4 - - 50 1.5 50 10 CS204EP Pr. Based on 304ET - 4 4 - - 50 1.5 50 11 CS215BP/CS203EP/CS220AP/CS221AP Pr. Based on 315BT/303ET/ 320AT/321AT - 4 4 - - 50 1.5 50 12 CS215BP/CS203EP/CS220AP/CS221AP Pr. Based on 315BT/303ET/ 320AT/321AT - 4 4 - - 50 1.5 50 SEMESTER VI 1 CS313CT Soft.Test.and QA 3 3 10+10 30 - 1.5 50 2 CS322T Theory of Computation 3 3 10+10 30 - 1.5 50 3 CS323T Ethics and Cyber law 3 3 10+10 30 - 1.5 50 4 CS304FT Dot Net Archi.and Prog 3 3 10+10 30 - 1.5 50 5* CS315CT Computer animation 3 3 10+10 30 - 1.5 50 6* CS303FT Embedded II 3 3 10+10 30 - 1.5 50 7* CS320BT Web Prog 3 3 10+10 30 - 1.5 50 8* CS314CT Mobile Computing 3 3 10+10 30 - 1.5 50 **CS740P PROJECT WORK - 12 12 150 3 150 10** CS241P SEMINAR - 4 4 50 3 50 * Indicate optional paper (any two from 5/6/7/8) ** Indicates credit for review 1, review 2 and Actual Project Work. *** Indicates credit for review 1 and Actual Seminar presentation. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 B.Sc. (Computer Science) Semester I Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 10



















 \n








































\n

\r
2\n3\

r\n&45\n \n'
 \n
r\n&45\n \n'
 \n\r  \r  \r\r  \r\n\r \r\r \n  \r \r   " 6\n7\n (8))-) 3\r\n&2\n"\n




 \n\n
;
  \n

 \n
 \n

 \n
'*

 


* &! \r3& 



1 
 \n\n
" \n

\n" \n
(# \n
2


4
1 
1 
\n\r\n


" \n

\n" \n
(# \n
AA
A
�

+ 2\n9\n\n#2& 

$  

 \n

4\n

4
\n\n

 \n
1\n\r 
;
. 
 \n
2 2

(8((
)-, 2\n7!!\n


0 \n

.
5 \n
%
5 \n
\n\n \r
5 \n
o!
5 " 
5 \n

2B


\n\n \r -
53 -
5 -
   
;
 


2B

- 2\n\n

% 
 
;
'*
2�


0 \n

% 
.

 
,%
,'%
.,'%
(.,'%
 

1 " \n

41-
1-
!1-
. 
" -
1/1-
0
1" -
10

2�

Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 11. (:4
\n \n



1 " \n


0
\n 
-
'%,-
',
-


1 " \n


0
\n 
-
'%,-
',
-
',-
5
 
-

 \n
�


'
1 " \n

1* \n-
. \n-
51
o.\n
1\n-
. \n



�

)80
C

)-/ ; \n



\n

1 \n

. \n\n
. \n\n
4  \n
,
;

2

0 4\n!\n2 \n


D
' 
\n 

4\n

' 
\n 

2 :


0 \n

' 
\n 


'
%
'
0

'
. \n
 \n
'
o8 3
'
2 :

2\n6\n\n\n \n' 4 \n


0 


 
"\n"-
E
.\r\n \n

24 \n

 \n


/,&-
.!
.\r
-
/
(
A4 \n

.

,&
EF-

.\r\r\r&6\n\n\n \n'  
0

 \n
E
\n-
$
.\r-) 
(
2 
4 













,-
.
.\r
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 12



















 \n








































\n

\r

!&&\n  
 \n
 \n\r\r \r \r \r \n\r  \r \r \r \n\n \r\n\r  \r \r\n \r

\r\n\r \r\r
\r\n\r \r\r\r  " 6\n7\n ($()-) \n"\n\r \n  

1 
8\r 
\n 

;

8\r 
\n 



1 


" \n1\r G\r\r
 






1 
" \n




 


-
\n\r-

;
"\n



! # 
\r 
\n\n 
-
! # 

\r-
\r

! # -
! # 

 
" \n



! # 
 
-
\n\r-

;
"\n





\n\r
\n
H
  -
2H\n
  
 


* &\n&!\n\r7! 9\n A

.\n \n

 
 \r



0  \n

 
 \r
  
-
" -

81-
',-
\n\n" -1\n\r" -\r\n
\n
-
1
H\n
  \n



, 
 
# \n\n\n



5
$ \n

81-
',-
8'0-
(#G',-
(#G8',



881
\n
)" \n
\r
\r3



5
\n

 
# \n\n\n
 
# \n\n\n


\n


(8(()-+ =\n %\n 


-
% \n

%# \n



EG%-
EG

2
"\r \n



EG

A
"\r \n



EG

�
"\r \n


, 2&\r \n 7! 2  9


!
 
;
4
 






!
 
;
4
 




 
 



!
\r-
4
\r



 \r

2H\n
  
\n\n 



1

1 
  



2

�
  # 



�




 # 


Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 13(8((()-- 3&3& =



,
44



3 
,
44-
1
44



0 -
 \n 

 



FE
44
-
0
44

-
,





%\n 
\n"
44


. 2\n I



\n\n

 




%\n
 
-
%'1G 2
 



\n
 

\n
\n 
;
\n
 
 



1
 



,
 



F\n
 


/ " 6\n!\n B

-
 
 \n 



 G


\n 
G
 G
 G



. G
\n G-
 G
 G


2\n6\n\n\n \n' 
1
( \n

%G \n
C
,E$
-
1
,
.\r
\r\r&6\n\n\n \n' 
1
( \n

5
1 \n
C
8$.-
0 "
.\r
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 14



















 \n








































\n

\r\r
0�0-'

  \n45\n \n'
\r 
  \n45\n \n'
\r  !\n\r\r \n"  \r    
" 6\n7\n (8()-)  \n?  \n\r\n&&!!\n

% \n\n\n


% \n\n
\n
\n 

 
 \n


4

 \n



 \n


*&\r!2 \n  \n2A

-



\r


% -
-

 " \n


 
 \n\n



+0�0-  \n2�
4  \n

 
I:I
 \n\n


.



\n

I:I


I:I
.)
 


4\n
 
\r3\n


($((
)-,(\r 0�0-\n&7!!\n;!! 

0
I:I

 


\n
\n\n


\n

1
\n


!


\n\n \r

# 
\n
\n


-0�0-( "\n$(
29
 \n\n
% \n


\n\n

\n
\n 


1
0\n 


\n\n


.
# \n


\n 



.0�0-( "\n$((
29
 
\n\n



.
# \n




5
\n



.
# \n




Revised Sy

llabus of B.Sc.(Computer Science),Dr.B.A
llabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 15(8(((
)-/0�0-( "\n$(((29



F





55





,(0


02 \n7!29
4


.\n
\n


(# \n


3

%




2\n6\n\n\n \n' % \n\n\n

  -


\n

I:IC






,$3
2IG

% \n\n\n
C




/F/\r -
.\r
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 16



















 \n








































\n

\r
;!!245\n \n'


# \r    \r\r\r\n$\r\r  \r\r\r%\r\r\r & \r'\r  \r  \r\n  # \r\r \r  \r \r" 6\n7\n (8()-)(\r 2 -
 -


'" " 


-
!\n


 -

\n

 
5 -
4  \n



* &\n\n#4\n22-A-



 
\n -

03 -
  
;
E \n-
/\r \n

\n

\n
 \n
  
\n-



\n-
 




\n-
 
\n-
\n
\n\n


' \n
 -
, -
5-
)
 \n
  
;
   


\n\n 


 








.   
;
\n\n" 

' \n


+
\n22-
 -
9

1
0 \n
\r  \n
1 
;
*



0
 
-
\n-
\n 
;
\n 


(8(()-,2;!#(:4\n\n2�-
2A-





.-

;
(# 






'
-
4 
'

\r(\r -
(\n
\n + 
 \n



5\r
\n
$  
;
%\n


-2&\r(\n\n"\n\n'2-
9-
A-
&#x-2.6;錓


-
 \n 
-
G \n -
\n

 


G\n
\n  


0

# \n\n
J

 





&
-





\n
;\r \r
\n  -

 \n  


Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 17(8(((
)-.'2=-
2I-
I-
A

-
1 

*
 \n\n

  \n-
% 
  \n 





'
 \n

 \n

\n-
 
-


\n



2\n6\n\n\n \n' 5 
\n




K.
E 3


6\r\r


\r7

2.




(

\r7

2.




(
\r\n


60

7
A.





$  





6\nL
  \n7

\r\r&6\n\n\n \n' 

MN






%\n
E 
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 18



















 \n








































\n

\r
2 "&&45\n \n'

To equip students of computer science with effective speaking and listening skills in English To help them develop their soft skills and people skills, which will make the transition from college to workplace smoother and help them to excel in their jobs. & to enhance students’ performance at Placement Interviews, Group Discussions and other recruitment exercises. " 6\n7\n (8()-) 2 \n2  
\r \n




. \n\n




4 \r3


* 45\n \n2 O
)



1



!*



+ \n \r2  A
/ \r
-
'
-
D 


(8(()-, @\n2 
.
3\n-
\n-
\r\r "\n


$
.\n

 -
 \n \n-
"\r
\r-
 

\n  
 -
\n*-
\n










 2

5




 2

5

\r\n \n\n



- 4&2 
  \n

. \n 

2B

1 \n
A:

(8(((AEnglish Language Lab ))-. Listening Comprehension


Listening and typing – Listening and sequencing of sentences –

Filling in the blanks – Listening and answering the questions

/ Reading Comprehension and Vocabulary
Filling in the blanks - Cloze Exercises – Vocabulary building – Reading and answering questions.

0 Speaking
Phonetics: Intonation – Ear Training – Correct Pronunciation – Sound recognition exercises -Common Errors in English Conversations: Face to Face Conversation -Telephone conversation– Role play activities (Students take on roles and engage in conversation)

Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 19 2\n)\n \n\n

-


,
;
%,
!
.\r*
3

( "
%  

1&
$ 3
("  \n
.\r
!\n A1 " 

3

E\n
%-
% 
 &
%%Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 20



 \n








 \n








































\n

\r
 \n &3\r45\n \n'

%
\r& "

\n
\n
\n


 
 \n

 + \n

"
\n


\n


0 
" 6\n7\n (8()-) "\n \n  -2

 
\n
 -
4
\n -

\n -
 
 -
(
\n -
\r\n -
. 
\r\n -
)" \n
\n -
. 
\n -
/ 




2"\n
)

\n \n-
 \n 

 \n-
  


\n -
(+


\n \n-
1\n&
\n \n-
1  


\n \n-
 
1   -
 \n
.P
#


\n
/ G

\n
# \n



6&\n"\n \n




&!\n ;\n\n"\n4\n
  



"
5\n-
\n\n"
5\n-
1\n\r"
5\n-
  
5\n-
.  \n

 -
.  \n

)" \n
\n -
.  \n

(
\n -
.

\n

(#\n


(8(()-2 ;\n\r2

A-2A

;\n
0
%
.

-

% \n



2
0  \n

(# \n




;!\n &\n; &

-
(# \n




;&

 \n-
(" \n-
\n\n
.\r\r \n

(" \n-
(+
53 


' \n


(8((()-

' \n


(8((()-A 6\n&
\r3 
2�
(\r 

, -
0\r
4-
$
4-
0 
, -
Q 
, 




;\n\n6\n&
,  #"
, -
 
, -
\n 
, -
0\n"
, -
0\n"
\n 


� &\n&!\n

2 2

7 \n'
-
\r \n
-

.  \n

5 \n-
1\n\r"

  
5 \n



; &\n
&

2\n6\n\n\n \n'6 7
M1\n 
% 
 \nN
\r
 
E-
,\r 

\n\r-

 
,\n\n-
. \n
(
\n

627
M(  \n

1\n 
% \nN
\r
5
5-
0
%$G!

6A7
M1\n 
% \nN
\r
1
 \r3
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 21



















 \n








































\n

\r
4 \n745\n \n'0

\n 
\n


\n

\n \n
\n
\r
\r



 $) *\r"$ \r\r  \r\r \r\r& \r# \r 

9(4\n!"\n'%\n
. -
-
5-
-
(#
1  \n-
, \n*-
%"-
%*-
\n

\n

\n-
*




\n-
*


\n-

5
\n-
1  -
, 
 \n-
%
1  \n-
 

 \n-
)\n
 \n\n \n

@\n\n'
\n
\n-
\n
-
\r3-
 -


" \n-
\n-
\n" -
\n"
\n-
"




D \r-
-
 

!
. -
!
)\n
D \r
),5\n-



),5-
% \r \n
D \r\n \n




\n " -
"\n !' 
 


 \r@\r; \n!&
% \n-

 \n-
0\r\n-
\n*
\r\n-
 

 
 \n-
"
 \n-
, 
 \n-
D3


 \n-
\n

 
P
@!@ \n0

\n 
 #-
  
 #-
1  
 #-
)-
4
\r-
4
. -

4
.\n

.
\r \n-
%"-
-

\n
 #-
0
\r-
\n-
1
\nP

"&\n


\n -


\n


\n

\r#-
 

 
\n \n


 -
 

\n
\n


\n

\r#-
%

 

\n -
1  

\n P
7

  

\r  
\n\n-
8 \n 
\n\n-
4
\n\n
&\n
\n 
0\r
\r-
1

\r -
\n 
\n

\n-
%"

 \n*

\r -
0\r \n

 \n
\r-
0\r
  \n

9  


-





 -
(

-
 \nP

"\n&&!\r9

 -



"\n&&!\r9

 -
 


 3-
\n-
0 \n\nP
;!\n3!
.
\n-
.
\n*

 -
!  \n

 \n-
.

\r \n-
.
 " 


"\n\r \n\n 
 
  \n-


 
3\n \n-
0
\n
\r
G
 -

\n-

\n"-


 P
\r!@ \n\n-
%"

 \n-

3\n \n-

\n-


\n-
, \n*
\n

\n-
  
 \n-
%"


 \n--
4 *
 \nP
3!2\n&&'
4
\r-
4
 \n

\r#-
1 \n

 \nP
3&\r3 '4\n-
53
3\n \n-
, " -

\r\n -


# 
   -
\n
\n-
4
D*-
\n-
"!\r3&&!'
\n
\n 

 \n 
\n\n-
 #
\n\n-
P
 
 #

\r \n

-

\nP
$\nP


P





 P
(

\nP
 \nP
2 '
D*P
, \n*

P
%"

-


\rP
;!\n;\n\n\r;!'.
\r 3\n-
.
 -
%\n-
!  \n-

 \n-



\r \n-
.
. " -
.P
E \r
\n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 22;\n\n&
 
D*-
 

 \n 


  -
 

\r3
 \n -
'

 

#\n
 \n -
5
 

#\n
 \n -
5-
. \n 
 
 
-
/ \n-
D3

 \n
\n 

 
\n -


 \n
  -

\n
\n-
,  
\n \n-
!
\n \n-
 

\n
\n
\n-
(

\n
\n
\n


 
, \n*

 #
\r#-
0 #
\r#
  \n-
1  

 #
\r#-
  
\n\n-
8\r  
\n\n-

 \n-
/ 


D3

0 #


 #-
(
\n-
4
 #-
, 
\n-
5
\n-

\n
 
 3



;
3

\n  \n-
3\n-
$\n-


-





 -
(

-
 \n-
D


( \n

\r\n-

-

 " -

\n\n-

\n
\n-
%\n 
 \n-

\n -
!  

 -

\r \n-
1



"

.-
"
\n

 \r
 -
.
\n -
.(\n!!;!
D-
\n \n 

. \n 
\n' \n\n  &\n \r \n\r! \n\n \n $4 \n4\n4 \nRevised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 23



















 \n








































\n



!&&\n  7Objective:
$\r&\r  \n\r\r \r \r 

$\r&\r \r
$\r&\r \r\r\n\r \r\r\r  \r \n0
5\r
3

"

\r
  


\n  \n 
\n\n




I
#  \n


" 
\n
\r  \n\r\n\n\r \n)

0 \n

 \n
\n \n
1


  \n-
,'\n


$  \n
C
 \n  


;
1
" \n-
 \n  

 + 
*


 \n
 

 \n

 \n\n\n-
\n-
\n-
 \n-
5(1\n
;
\n\n\n
+

5
$ \n




\r

\r\n
 \n-
 *

 
\n
,

!
 

4
 
-

!
\r

4
\r

.

  


AI
  -
/

�G

9
\r
  
0

1

=G\n  
  
1

$  

 
# \n\n


 # 
)�

3 
FE
4
4
))

�G\r

 
)*

. G-
\n G-
�G\r
\n
 \n Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 24



















 \n








































\n

\r
7'0�0-'  \n( '
 
#  \n


\n
" 
\r 


\r
  


I:I
% \n\n
E




\n\r


IG\r
\r \n


\n\r


IG\r
\r \n

\n
\r\n 

  
 \n\n
 \n

I:I
2

\n\r


9G\r
\r \n
)\n
2L\n
  
 -
\n
\n

 \n\n
\r \n

\n  
 
\n
A%


IG\r
\r \n
\n

 

\n \n\n"



;

&#x-2.6;錓1"\n


IG\r
\r \n
\n

 

\n \n\n"
\n\r

\n
;
\n\r
3
\n 

\r3
#


\r \n
94

\n \n

 \n
  


\r3


=

  \n


\r3



\n 

 \n 
 
I$  
 \n

  

 "\n
\n
 
\n\r \n

B \n  

 
 

,'
\n
'1


I:I
:.



4\n

8\r 
.

4


2.




  \n
A.

, " \n


  \n




















 \n








































\n


7';!!2\r\n\n\r \n)4
 -
.   

0
;
,  
*4
#
\n
A
\r \n
+.

 \n 
\n
,.


#
-.

 3
.
8\r -
.
 " \n


..


\n
8\r 
/.



4\r
  \n
0 



 



10\n\n


 



10\n\n

 \n
)�%

 \n
))

\n
\r\r\r
\n
 +
)*.


\n'

 
"


L\n
  \n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 25B.Sc. (Computer Science) Semester II Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 26



















 \n\n








































\n

\r
(\r 
" \n45\n \n'
$ \r \r \r  $\r\r \r'\r   \r \r" \r\r \r \r  \r\r     \r \r \n  \r\r\r\r\r \r" 6\n7\n (8()-  (\r 
" \n'





\n
0 

1
 -
4 \n-
, \n-
4 \n-
(-
\r \n


1
'*

1



* 
,  \n 

5 
\n


0" \n-
\n 

1  \n



;
 
\n


% \n
\n

21
;
%G1
 


, 
, 
 \n-
,  \n 

% 



(

8((
)-+ 7\n\r7

8((
)-+ 7\n\r7
 

53 
5\n


,  \n 

3 
5\n

 


0" \n

3 
\n


 

3 
\n

\n 

\n 


\n 
;
1  

53 
5\n


!  
53 
5\n
;
0

5\n


(8(((
)-, " ?B\n\n?6\n 
3
' 
-

,  \n 

3-
3 
  \n 

\n3-
 
(# \n\n
.'5!
;
.'04R-



\n3\n
Q3\n-
, \n



Q  
,  \n 

+  \n
;
3


0 \n

Q  \n

1 + \n
;
.
Q  \n


2\n6\n\n\n \n')1
 \n


 
5\n*-
0
%G
!
.\r

Advance Reference: 1.Fundamentals of Data structures, by Horowitz and Sahani (Galgotia publications). 2.An introduction to data structures and application, by Jean Paul Tremblay & Pal G. Sorenson (McGraw Hill). +1
 \n-
\r
0 \r-
.!

Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 27



















 \n\n








































\n

\r
4\n!"\n45\n \n'0

\n \n

\r\n

 \r \r\r \r  +  \n   \r,\r'-*,\r\r  \r"

6\n7\n (8(
6\n7\n (8()-) (\r "\n'"\n'

1 -
\n\n

\n -
 
\n\n 

\n


 

\n\n 
\n P
* 4\n!"\n3\r\n&2
4\n!"\n
'
\n

 \n
 -


'-
("

'-
'
\n-
 \n\n

 
'


\n4"'
(
\n\n \n-
\n
\r
\n\n \n-
G 
\r
\n\n \n-
0
\n
\n\n -
. \n
 
\n\n \n-
. 
\n\n \n-
1\n\r 
\n\n \n-
, 

\n\n \n
4"" \n'
 \n

'
. \n\n
  -
% 
  -

  -
4
  -
'
  
)80
C

)-+ ; \n!\n\n 2
2 \n; \n
. \n\n
 -
' 

. \n\n \n-
 

2;" \n\r&!
0 \n

  \n-
 

\n -
 
\n

; \n" ='
8 

\n*-

 -
!
*-
  \n-
%\n-
.\r 

\n*


\n\r& ' 

1 3-
1 3
% -
% \n

!
1 3
)80
C

)-, "!\n!\n\n A\n!\n\n
 \n\n
-
5
/\n
.\n
 \n\n
\n -
% 
-
.-
  -
  



 
. 




C&\n'1 
.



C&\n'1 
.-
.
   
\n
44'-
'-
5,)-
/
% 

\nR
3&\n"\n(\n \n
4 \n-
4
 \n\n-
1 
 -
. 


  

4
\n 

% \n-
4
\n
%  


Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 282\n6\n\n\n \n' M' 
\n N-

,
;

%3
-
%%
.\r

2M' 
\n N-


(%3-
F
F1"
\r\r&6\n\n\n \n' ' 
\n 
 \nG

\r **
;
.
$"-
\n
C

D \n 
.\r\n

Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 29



















 \n\n








































\n

\r\r

0�0.'  \n45\n \n',  \r \n  \r \r\r" \r\r\r \r   .,/ +$ \n\n \r  \r  ." 6\n7\n (8()-)) (\r   \n\r  \n):)!\n
\r3


% \n\n
\r\n 
 \n
 
\n\n 


 

\n


** 0�0.D\r\n\n  

% 
\n

 

I:I9
 
 




I:I9
 
 





I:I9

.

(8(()-++ \r\r\n!\r\n A
1
 \n\n
 \n


.
 
 \n\n
 \n


3
 
 \n\n
 \n


,,
\n\n( A(\n&\n\r 0�0.&E �
%'/
 "\n 
%
 -
G -
%'1
 -
 \n\n 
\n\n -,%
 
 \n\n-\n 



.)!.'.-
*
\n3


%\n  \n

\n 
\n\n
R!$-
5!4
;
!4


(8((()---  \n  
o -
\n\r

\n



o %

"\n


o 1


 


.. 7!  
o \n

\n\n


o 




// ;! &( 
o 0
F)%.




o 5''.


o 55
;
,(0


2\n6\n\n\n \n')0
 
% \n\n\n
  -


 
C




 *% \n\n\n

 

1\n
!Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 30



















 \n\n








































\n

\r

\r \n;!!245\n \n
 
3

\n
 

\n 

\n
\n
\r
\r

5 
\n

\n
\n
\r
\r

5 
\n
"
  \n


 
2D
\n
\n
 \n-


A

\n
\n


" 6\n\n\n \n7\n \n(8()-)3 2B-
-
A

-
 \n

\n
1 
\n-
 \n-
4
 -

  \n


  \n-

-
, 

 \n\n-

\r
" -
, \n


*" \n#2 :-
 :-


 
-
1 

*
\n -
 \n\n
\n
 \r \n-

8 \n 
\n \n-
\n

\n -

\n  


)\n
1 -
1  
\r  
\n




($(()-+;\n'2 -


-
% 
*
1 

*

 \n
0
 
 
S

;-
1 G   -
. 
# \n\n

 
 -
. 

 


,"!\n2&#73 '2


\n\n \n-
 -
"\n\r

 

"\r -
\r3


\n -
-
# -
\n

 \n 
\n
\n\n \n

"! \r&! 
\n-
\n-
\n-

\n -

\n-
\n-
 \n-
\n
 \n \r& 
-
-
-
-
-
-
-- #-
\r\n-

 

-
 
-;\n \n
-
 
-;\n \n
\n \n'2 �-
=

4
\n


 
 " \n-
%
\n\r\n-
T  -
T-
T -
T \n -
T -
T -



Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 31. \n&&\n3\n\n'2G-
 -


\n
' \n
-
%\n3-
 
  \n 

-

 \n-
(  

 \n-
0
\n


($((()-/3&\nD\r&!2 2-
 2- A

3&\n \r&!
-
' 
;
\n

 -
'
 \n

 \n-

 #

\r
 \n-

 -


4

-


\n
 

 

D

 
 \n

\r
 -
 -


  

 

 -
,
 \n\n
\n
\n 3-
 -
\n-
 " -
  
2\r&\n!\n
\n



"


09  2'�




  
-
1
\r& 

-
5 -
 -
,  -
(\n -

 
;
\r3
\n-
4
\r& 
\r
-
 ##

2\n6\n\n\n \n' 
5 
\n

\n




K.
E 3
6\r\r
\r7

2
.






(
\n
60

7
A
.





$  


6\n
  \n7

�
$

\n
) 





K
E 3

\r\r
\n
) 





K
E 3

\r\r&6\n\n\n \n' 


MN








%\n
E 
2
0 \n

3\n








KE 3

Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 32



















 \n\n








































\n

\r

2 "&&$((45\n \n'0

"
\n

\n G\n\n \n\n
"\n
 \n


\n3\n
\n
 
\n

"
\n -
 -
-

\n 3

 \n 
\n3\n

 
" 6\n7\n (8()-) 2  \n\r2
D 
 


5  \n-
8 \n-
% \n-
%-
5  -
\n
;
 \n-
F\r



/\n
% 


\n
 \n -
. \n
;
.\n-
.\n \n
;
" \n  


8G/ \r
% 




* @\n2 '6\n2I
0 \n

, -
 \n\n

$
, 
-
(\n\n 
, +\n \n

$
, GD-
.

, -
'
\n\n \n

\n\n-
D

, \n



(8(()-+ 92  I
.\r 

$
G
% 
G
 \n

 -
" \n
;
1\n" \n

% -
G
. 

% 
C



% 
C
, \n\n\r



\n



, (\n\n
\n



, (\n\n B
.\n -
0 \n

 " \n
C
-
\n-
#-
   



( 

\n  
 " 

 L\n
 -
Q \n

\n3 

 " -


 "  -
 "  L\n
 


(8((()-5. Listening Comprehension Cassettes: “Tiger’s Eye” Series.( vol. 1 & 2) , Twist in the Tail” The Listening drill is to be given and question should be framed.


. Reading Comprehension and Vocabulary
Reading with proper pronunciation and ideal reading is to be recorded.


/ Speaking:
CIEFL’ Spoken English exercises part one and two. Drilling : Proper Pronunciation of word and sentences

Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 332\n)\n \n\n
-

,
;
%,
!
.\r0 
(*
3

( "
%  

1&
$ 3
("  \n
.\r
!\n 8



0  
\n
 \n
"\n


  
 \n
2

4
, 



 \n
(((
 
4
 \nU\n\r\n\r  \n\n \n
-
 

\nU\nU\n\
\nU\nU\n\n\r\n&\n\n0,8GF'),Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 34



















 \n\n








































\n

\r

\n &2&\n \r
" 6\n7\n (8()-)2& & 


(
-
\r\n -
.   -
, "
(






,

(



0
(-
.
(


* \n\r
\n\nA2

1 \n-
%#
' \n



1  

+
%#-




&

%#-
" \n

%#-
,3

%#


+\n &"& \n\r\n&% 2
 

 "
% \n-
 
% 


$ \n\n


\n 
% 


4\n
.\n
% 


8 G,\n
% 


(8(()-,&\n \r"&!"&\n% A


%#
8

\n 

(+\n


$\n\n
(
% 



%#
" \n
% 


-(\n& 9


.
 




8 G$ 
4
1  
 
4


8 G$ 
3
1  
 
4


(8((()-.(\n&$

((

 
1  
4
((

 
1  
4



8 L\n
" 
1  
 


5 L\n
 


/7\n"%\n2\n3! =
 \n
4

 

 \n
4

5 \n
+
4


5 
,  \n\n


.
,  \n\n



2\n6\n\n\n \n' 
M8 

% \nN
G
1
..-
8\n
.\r
!\n
\r \n6\n\n\n \n' 
8 
 \n
G-
,. G%$
!
2
8 
 \nG(\n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 35



















 \n\n








































\n

\r
7'
" \n#4\n!"\n!\n'@\n \n;!!2A& &\nE'
" \n'  D


\n
1/F-E

 \n

\n"
  
8V :

   \n
  


8
\n


\r 
2 D



\n

\r 


 




A D



 \n
\n
D',1

D',12

 
  \n

 



 #
\r
2
� D

\n

" \n


 
\n


 D

\n

\n 

  


 
\n


9   
5 

\r
\n 


\n

=   
\r\r
\n


\n

I D

\

\n

I D

\n

" \n


 


3 
\n
B D

\n

\n


 
\n

\n3\n
: D

\n

\n 

  


 


+  \n
4\n!"\n')"\r:72\r2D



  

44
 
\n
AD



  

F4
 
\n
�D



  

.
 
\n
D



  

,
,\r
 
\n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 36



















 \n\n








































\n



7'0�0.'  \n
 
#  \n


\n
" 
\r 


\n\r


IG\r
\r \n

\n
\r\n 

  
 \n\n
 \n

I:I9
2

\n\r


9G\r
\r \n
)\n
2L\n
  
 -
\n
\n

 \n\n
\r \n

\n  
 
\n
A%


IG\r
\r \n
\n

 

\n \n\n"



;

�1"\n


IG\r
\r \n
\n

 

\n \n\n"
\n\r

\n
;
\n\r
3
\n 

\r3
#


\r \n
94

\n \n

 \n
 




\r3


=





\r3


=

  \n


\r3



\n 

 \n 
 
I$  
 \n

  

 "\n
\n
 
\n\r \n

 \n  

 
 

,'
\n
'1


I:I9
B.



4\n

8\r 
:.

4


.




  \n
2.

, " \n


  \n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 37



















 \n\n








































\n



7'\r \n;!!2 

\r \n
\r
\n

\r
   

2.

\n\n



A.

\n\n
\n
 


�



\n
-
 -
 -
\n
 -
 " \n
.

 
 #
 
9.

 
\r


=4



I.



 

\r



B.

  

 

\r


:.



.


\n\r\n

2.


" \n

A.


\n
 \n

 -
3-
-

\n
\n
\n
&#x-2.6;鐶.
\n


 \n
.

 \n

\n
\n\n
9.

\n
 \n




















 \n\n












 \n\n








































\n


(&\n\n\n &2&\n \r!2)
.



  \n 
-
" \n

%#
* .



  \n 
-
\n 
% 
+ .



  \n 
-
4\n
.\n
% 
, .



  \n 
-
8 G,\n
% 
- .



  \n 
-
$\n\n
(
% 

. .



  \n 
-
%#
" \n
% 
/ .



  \n 
-
8 G$ 
4
1  
 
4
0 .



  \n 
-
8 G$ 
3
1  
 
4
1 .



  \n 
-
 
1  
4

)� .



  \n 
-
8 L\n
" 
1  
 
)) .



  \n 
-
5 L\n
 
)* .



  \n 
-

 


Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 38B.Sc. (Computer Science) Semester III Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 392\n' " A2"E Sem:III D:\n\n' + 2\r\n' 2"+�1 ;\n$\n%\n' &4&!

 " 
\n&
 " 
\n&7\n Unit I Binary Trees: Representing Binary, Trees in Memory, Traversing Binary Trees, Traversal Algorithms using Stacks, Header Nodes; Threads, Binary Search Trees Searching and Inserting in Binary Search Trees, Deleting in Binary Search Tree, AVL Search Trees, Insertion in an AVL Search Tree, Deletion in an AVL Search Tree, -way Search Trees, Searching, Insertion and Deletion in an -way Search Tree, B Trees, Searching, Insertion and Deletion in a B-tree, Heap; Heapsort Path Lengths; Huffman’s Algorithm. )-Unit II Graph Theory: Terminology, Sequential Representation of Graphs; Adjacency matrix, Path Matrix, Warshall’s Algorithm, Shortest Paths, Linked Representation of a Graph, Operations on Graphs, Traversing a Graph, Posets; Topological Sorting. )-Unit III Searching & Sorting: Introduction, Sorting, Insertion sort, Selection sort, Merging, Merge-Sort, Radix Sort, Searching and Data Modification, Hashing. )-
Assignment: Question to be Solved from supplementary problems from the book recommended above are:7.1 , 7.2, 7.3, 7.4, 7.9, 8.1, 8.5, 8.6.2\n6\n\n\n \n')1
 \n


 
5\n*-
0
%G
!
.\r

\r \n6\n\n\n \n')4 \n

1
\n \n-
\r
!*


$
\r\n
*



\n \n

-
\r
F 
.
0 \r
;
.
$
 \n
%$
!
1


 \n-
\r
0 \r-
.!Revised
 \n-
\r
0 \r-
.!Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 402\n' " A2"E Sem:III D:\n\n' + 2\r\n' CS308BT ;\n$\n%\n' Operating Systems II" 
\n&7\n Unit I (:4"\n'
\n 
 \n

'
1 " \n
-
'
!
-

'
   



1\n3
 -
1\n3
 
-
1\n3
%  Device Management

1  
1 " \n-
\n 
 " \n

"
 " \n
$  * 
\n  \n)-Unit II Device Characteristics 

'
 " \n

 " \n
1 "
\n
2 \n(:4  &&\n'
\n  


/
1 " \n)-Unit III Information Management 

4
\n\n 
\r

\n\n 
 \n\n

" 
5

\n

\n\n 
Case study%
\n\n 

% 
-
 \n\n-
1 "


%   )-!\nG2



M' 
\n N-


(%3-
F
F1"
G

M' 
\n N-


(%3-
F
F1"
G=

M' 
\n N-


(%3-
F
F1"
9G

M' 
\n N-


(%3-
F
F1"
9G

M' 
\n N-


(%3-
F
F1"
9GB

M' 
\n N-


(%3-
F
F1"
. 

\n
 




\n
\n
" 


\n\r


\n
\n
" 


\n\r\n Core Reference: 1.“Operating System”, By S.R.Sathe & Anil S.Mokhade , MacMillan Publication. 2.“Operating System”, By Stuart E.Madnick, John J.Donovan. Books Recommended: Operating System Concepts- A. Silberzchaz & P.B. Galvin, Addison – Wesley Publishing Company. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 412\n'" A2"E"\n'(((D:\n\n'+2\r\n'2"+�+2;\n$\n%\n' ;\n \n&\r(\n !Sr.No. Topics in Details 7\n Unit I8086 Hardware Specification Power supply requirements, DC characteristics, 8086 Pin-out: minimum mode pins and maximum mode pins., 8284A Clock generator: pin-out, Internal Block diagram and it’s operation. (includes Ready and wait state operation), Bus buffering and latching: Demultiplexing of buses, 8086 demultiplexing, fully buffered 8086. Bus Timing: basic bus operation, Read bus cycle, write bus cycle. )-Unit II Memory Interfacing Memory Pin Connections: Address Connections, Data connections, selection connections and Control connections. Address Decoding : Why Address decoding, Simple NAND Gate Decoder, 3:8 Line Decoder, PLD Programmable Decoder. 8086 Memory Interface(16-bit) : 16-Bit Bus Control, separate bank Decoder. 80386 and 80486 Memory Interface: Memory Banks, 32-Bit Memory Interface. Dynamic RAM: Introduction, EDO M

emory, SDRAM, DDR, DRAM Controllers)-
emory, SDRAM, DDR, DRAM Controllers)-Unit III I/O Interfacing: Introduction to I/O Interface: I/O Instructions, Isolated I/O, Memory Mapped I/O. Basic Input Interface and Basic Output Interface, Handshaking. I/O Port Address Decoding: 8-Bit and 16-Bit 8255 PPI : Basic Description of the 8255a, Programming the 8255. 8254 Programmable Interval Timer: Function Description,Pin-out.. )-2\n6\n\n\n \n'1.The Intel Microprocessors By Barry B. Brey, PHI Publishers*% \n\n\n

 

1\n
!Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 422\n' " A2"E "\n\n\n' ((( D:\n\n' + 2\r\n' 2"+�,2 ;\n$\n%\n' 45\n 4\n\n\r;!!!2FF$(" 
\n&7\n ()-)Introduction of OOPProcedural Vs Object Oriented Programming, Basic concepts of Object Oriented Programming, Class, Object, Data Abstraction, Encapsulation, Inheritance, Polymorphism, Dynamic Binding, Message Passing. Benefits and applications of OOP, History and overview of C++, C++ program structure. Reference variables, Scope resolution operator, Member de-referencing operators, new and delete, cin and cout, The endl and setw manipulator *Functions in C++:Function prototype, Call by reference (using reference variable), Return by reference, Inline f

unction, Default arguments, Const argume
unction, Default arguments, Const arguments. (( )-)Function overloading: Different numbers and different kinds of arguments, *Objects and Classes: Specifying a class, private and public, Defining member functions, Nesting of member function, Object as data types, Memory allocation for objects, static data members and member functions. Array of objects, Objects as function argument, returning objects, Friend function and its characteristics.((( )-)Constructors and Destructors: Introduction, default and parameterized constructors, Multiple constructors in a class, Copy Constructor, Destructors*Operator Overloading: Overloading unary operators, Rules for operator overloading, Overloading without friend function and using friend function, Overloading binary operators such as arithmetic and relational operators, Concatenating Strings, Comparison operators. Reference Books: 1.Object Oriented Programming with C++ E. Balagurusamy, Tata McGraw-Hill Publishing 2.Object Oriented Programming In C + + Robert Lafore, Galgotia 3..Let us C++ Yeshwant Kanetkar; bpb publication Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 432\n' " A2"E "\n\n\n' ((( D:\n\n' + 2\r\n' 2"+)� ;\n\n%\n' 45\n 4\n\n\r;!!!G8("

 
\n&7\n (
 
\n&7\n (()-)Object oriented paradigmBasic concepts of Object oriented programming: class & object, data abstraction and encapsulation, inheritance, polymorphism, dynamic binding, message communication. Benefits and applications of OOP. History and features of Java. Java Vs. C++. Java and Internet, Java and www. Java environment. Structure of java program, symbolic constants. Data types of java in brief.*?2&\n\r45\n Declaration and initialization, one and multidimensional arrays Defining a class, adding variables and methods, creating objects, static fields and static methods. Method overloading, Constructors: types and multiple constructors in class. Command line arguments. ((( )-)Inheritance Super and sub class, defining a subclass. Single inheritance, multilevel inheritance and hierarchical inheritance. Subclass constructors. super keyword, Visibility controls, Method overriding, Dynamic method dispatch, Abstract methods and class. *Interfaces & String Class Defining interfaces, implementing interfaces, extending interfaces, accessing interface variables.String class and its methods, Vectors (((( )-)PackagesIntroduction, Java API packages, Naming conventions, creating and accessing user defined package, using a package, adding a class to a package, importing classes from package.*Exception handling a

nd Multithreading Exceptions, synt
nd Multithreading Exceptions, syntax of exception handling code, multiple catch statements, throw: throwing own exceptions, throws and finallyIntroduction to multithreading, creating threads by extending the Thread class and by implementing Runnable interface, implementing the run() method, Life cycle of a thread, Thread methods and thread priority. Reference Books: 1.Prgramming with JAVA: E. Balagurusamy, Tata Mc-Graw Publishing Company Ltd. 2. The Complete Reference J2SE: Herbert Schildt, Tata Mc-Graw Publishing Company Ltd. 3. Core Java-2 Vol-I & Vol-II - Cray S. Horstmann, Gray Corneel; Pearson Education, Low Price edition Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 442\n' " A2"E "\n\n\n' ((( D:\n\n' + 2\r\n' 2"+)* ;\n\n%\n' - 
\n!\n\n"\n" 
\n&7\n 8()-)(\r  2 \n
"'1\r\n
\n 
-.\n

1\r\n
\n 
1\r\n
 

AG5 " 
  -
1\r\n
)\n \n
;
\n\n
, \n\n\r \n-
4
 \n

1\r\n
\n\n 


;
Q 
. \n\n-
0\n
%  
$((
)-*
\r\n&!#
\n!'0

1
% 

, 
1
% -
(G,
1
% -
'\r& 
\n 
1
% 
 G 
1


% -
! 
;
8 3
1
%

% -
! 
;
8 3
1
% 
(G,
1
% 
(-
(
\n -
(
 \n-
\r \n-
0 \n

\r \n-
(G,

%
 \n
-
1
\n\n
\n\n

 
\n\n

;
-
1\r\n
1 \n

'" " 

1 \n
. \n\n-
1 \n
.\n -
8* 84-284-A
84
$(((
)-+6\n&&
\r\n&\n

-1\r\n
 
- 
, \n-
(4\n
, \n, 
 \r

)
-
 \n 
-
1   -
 \n
.-
  
-
.& -
F

8
;
' 
F-

1"\n6\n\n\n \n')
\n"\n  \n'E-
\r \n*
-
4
(*(\r 
\n"\n'
1 \n-
, "\n 
( Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 452\n' " A2"E "\n\n\n' ((( D:\n\n' + 2\r\n' 2"+�.2 ;\n\n%\n' - " &\n \r" 
\n&7\n 8()-)(\r \r   \n" 1 

\n\n-




\n\n
.

 
-
0 \n



+" -
+" -
\n  -

\n-
\n\nG\n -

\n  \n-
 -
\n-
 

$
 \n 
!\n-
 + 


-
 + 
" \n
1

-
 + 
" \n
1
 \n 

\n-
.
-
\n 

\n\n


1\n 

\n
 + 
\n\r\n-
\n"

#\n"
 \n

\n\n-
 "

"
 + 
\n\r\n
$((
)-*\n\n2\n&\n\r\n  

 
  
4


)

 
 
%
\n

  
% \n

  \n

%-% 


 + 

G + 



 -
% \n

  \n

 
% 



 + 

G + 
-
% \n
;
  \n

 
$  
 
$%


$
%
-% \n
  \n

\n

$%!
% 

!
%



 + -
G + 
-
 \n-
  \n
$(((
)-+\n\n
\n1\n \n

 \n \n

1\n \n
-
,
 \n

\r \n


Q
1 "
 \n

\r \n
% 
1 "
 \n

\r \n

1 "
 \n

\r \n
/ -
  



/ 
6\n\n\n \n')2\n6\n\n\n \n')"29\rCHH Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 462\n' " A2"E "\n\n\n' ((( D:\n\n'

, 2\r\n' 2"*�1;
, 2\r\n' 2"*�1; ;\n$\n%\n' &&! 7.1 Write a program which prints the nodes of T in (a) preorder (b) inorder (c) postorder. 7.2 Write a program which prints the terminal nodes of T in (a) preorder (b) inorder (c) postorder. (note: all three lists should be the same). 7.4 Translate heapsort into a subprogram HEAPSORT (A, N) which sorts the array A with N elements. Test the program using 44,33,11,55,77,90,40,60,99,22,88,66 7.5 Write a program which prints the list of employee records in alphabetical order (Hint: print the records in inorder) 9.1 Write a subprogram RANDOM (DATA, N, K) which assigns N random integers between 1 and K to the array DATA 9.2 Translate insertion sort into a subprogram INSERTSORT (A, N) which sorts the array A with N elements. Test the program using: (a) 44,33,11,55,77,90,40,60,99,22,88,66 9.8 Translate selection sort into a subprogram SELECTSORT (A, N) which sorts the array with N elements. Test the program using: (a) 44,33,11,55,77,90,40,60,99,22,88,662\n' " A2"E "\n\n\n' (((  2\r\n' 2"*�+2; ;\n$\n%\n' ;\n \n&\r(\n !;  &1.To Study different operating modes of 8255A PPI (setting Control Word Register). 2.Set data on various memory locations and see contents of various memory locations. 3.Program to interface 8-bit LED panel to 8086 Microprocessor

and glow as per the data input through a
and glow as per the data input through a Memory Location 4.Program to interface 8-switches to 8086 Microprocessor, store the state of the switches. 5.Program to show the states of switches on LED Panel6.Program to interface 7 segment display without multiplexing. 7.Program to interface 7 segment display with multiplexing. 8.Interfacing DAC to 8086, to generate wave forms. 9.Interfacing ADC to 8086, to read digital values from ADC . 10.Program to interfacing Stepper motor. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 472\n' " A2"E "\n\n\n' (((  2\r\n' CS204CP ;\n$\n%\n' OOP using C++1.Program using reference variable. 2.Program for inline function. 3.Program to demonstrate default argument 4.Program for function overloading. 5.Object oriented program to demonstrate class & object and member functions.. 6.Object oriented program for returning object from function. 7.Object oriented program to illustrate the use of static data members and static member function 8.Object oriented program for friend function. 9.Object oriented program for constructor 10.Object oriented program for multiple constructors in a class. 11.Object oriented program to demonstrate the use of destructor 12.Object oriented program for unary operator overloading. 13.Object oriented program for arithmetic operator overloading 14.Object oriented program for relational operator o

verloading. 2\n' " A2"E
verloading. 2\n' " A2"E "\n\n\n' (((  2\r\n' CS210AP ;\n$\n%\n' OOP Using Java - I1.Program for one dimensional array. (sum and average of elements/finding maximum 10number from array) 2.Program for static fields and static methods. 3.Program for method overloading 4.Program using constructor 5.Program to demonstrate the use of command line argument. 6.Program for single inheritance. 7.Program for multilevel inheritance. 8.Program to demonstrate the subclass constructor (use of super keyword) 9.Program for method overriding 10.Program for abstract class and methods. 11.Program for implementing interfaces. 12.Program for creating and importing user defined packages. 13.Program for exception handling. (try/catch block) 14.Program using throw and throws clause. 15.Program for create thread using extends Thread and implements Runnable. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 482\n' " A2"E "\n\n\n' ((( 2\r\n' 2"*)*; ;\n\n%\n' - DBMS Lab 1.Student should select any five applications and as per the guidance of the concerned teacher should prepare the E-R diagram for the applications. 2.Student should make the necessary Relational databases using the normalization for any two applications. Also they should solve at least twenty Queries using relational algebra based on relation

s drawn by them. Revised Syllabus of B
s drawn by them. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 49B.Sc. (Computer Science) Semester IV Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 502\n' " A2"E"\n\n\n' (C D:\n\n' + 2\r\n' CS313AT ;\n\n%\n' 312AT Software Engineering I " 
\n&7\n Unit I Introduction to software engineering, Software Development Life Cycle, Requirements Analysis, Software Design, Coding, Testing, Maintenance. 15 Unit IISoftware Requirement Specification, Waterfall Model, Prototyping Model, Iterative Enhancement Model, Spiral Model, Role of Management in Software Development, Role of Metrics and Measurement, Problem Analysis, Requirement Specification, Validation, Metrics, Monitoring and Control15 Unit IIISystem Design, Problem Partitioning, Abstraction, Top-down and bottom-up design, Structured Approach, Functional v/s Object-Oriented Approach, Design specification & verification, metrics, Monitoring & Control15Core Reference: 1. Roger S. Pressman - Software Engineering A Practitioner's Approach - thedition, McGraw
 \n
\r\r\n

\n
 \n 


\n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 512\n' " A2"E"\n\n\n' (C D:\n\n' 

+ 2\r\n' 2"+)*
+ 2\r\n' 2"+)* ;\n\n%\n' 312AT \r \n
\n!\n\n"\n" 
\n&7\n 8()-)" \n\rB\n7!!\n) "B7' \n\n

Q5-
"

Q5-
Q5

 \n

 \n
0 \n

Q5
\n
Q5
 \n

 
    
0\r \n-
" \n

 # \n
Q  \n

\n\r
+  \n
 
\n
\n -


  
 \n
F\n-
)\n-
 \n -
%\n-
\n\n

Q5$((
)-* !\n\n' ; \n!0\n
 -
0\n
 -
  



\r-
 
(# \n-
 *\r-
, " \r-
  

\n-
0 \n

 *-
2 \n 2&\n %\n

3G\n 
.\n
0 \nG\n 
.\n
1 3
!
$(((
)-+
\n"\n \n \n#
"!\n
\n"\n \n \n * 

 G " 
  -
 " 
\n 
  -
. 
\n -
1\n\r 
\n \n-
8 3
0 \n

"!\n''" " 

.\n

% -
% 
1\n3-
,1-
0 
 -


 \n\n-

6\n\n\n \n')
\n"\n  \n'E-
\r \n*
-
4
(*(\r 
\n"\n'
1 \n

-
, "\n 
( Revised Syllabu
-
, "\n 
( Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 522\n' " A2"E"\n\n\n' (C D:\n\n' + 2\r\n' 2"+), ;\n\n%\n' 
2 \r\n!$(" 
\n&7\n ($()-)Introduction Communication System, Components of communication system, Computer network Advantages and applications of computer n/w. point-to-point and multipoint line configuration, LAN, MAN and WAN. Analog and Digital signals, Data Transmission: Parallel and Serial, Synchronous and Asynchronous transmission, Transmission Mode: Simplex, half-duplex and full-duplex.*Network TopologiesMesh, Star, Tree, Bus and Ring and Hybrid Topology (Advantages and disadvantages of each)($(()-)Transmission mediaGuided and unguided media, Twisted-pair, UTP and STP cable, coaxial cable, Optical Fiber cable, Radio waves, Microwaves, Satellite Communication (Transmission characteristics and advantages of each type*ModulationConcept of modulation and demodulation, Digital-to-analog conversion, Amplitude Shift Keying (ASK)/AM, Frequency Shift Keying (FSK)/FM, Phase Shift keying (PSK)/PM. Quadrature PSK, differential PSK.UNIT-III )-)Multi channel Data CommunicationChannels and Concept of multi channeling, Baseband and Broadband, Multiplexin

g: FDM and TDM (Synchronous and asynchro
g: FDM and TDM (Synchronous and asynchronous TDM), *Data Networks and Protocols Switching, Circuit Switching, Packet Switching and Message Switching. Network Protocol: syntax, semantics and timings, The OSI model, 7-layers of n/w model., Functions of each layer Reference Books: 1. Introduction to Digital and Data Communications, Michal A Miller, JAICO, publishing. 2. Data Communication and Networking: C.S.V. Murthy, Himalaya Publishing House 3. Data Communication and Networking :: Behrouz A. Forouzan; Mc-Graw Hill Pub. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 532\n' " A2"E"\n\n\n' (C D:\n\n' + 2\r\n' 2"+�,
 ;\n$\n%\n' 304CT 45\n 4\n\n\r;!!!2FF$((" 
\n&7\n ()-)Inheritance:Derived and base class, Specifying the derived class, Accessing base class members, public and private Inheritance, Single Inheritance, The protected access specifier, Derived class constructors, Multilevel and Hierarchical Inheritance, Multiple Inheritance, Ambiguity in multiple Inheritance, virtual base classes, Abstract base classes. *Virtual function & PolymorphismIntroduction, Pointer to object, Pointer to derived class, Overriding member functions, Virtual function, Rules for virtual functions, Pure virtual function.(((

)-)Streams The Stream class
)-)Streams The Stream class hierarchy, Stream Classes and header files, Unformatted and formatted I/O operation, Managing output with manipulators*Working with Files  Introduction, Classes for file Stream Operation, Opening & closing files, Detection of end of file, file modes, File pointer & manipulator, Sequential input & output operations, Updating a file: Random access, Writing an object to disk, Reading an object from disk, Binary Vs. Character files, The Fstream class, File pointers, Specifying the position, Specifying the offset The tellg() function, Disk I/O with member functions. (((( )-)Templates Introduction, Class templates, class templates with multiple parameters, function templates, function templates with multiple parameters, Overloading of template functions, member function templates. Introduction to Standard Template Library- STL Components of STL, Containers, Algorithms, Iterators, Applications of Container Classes.*Exception handling  Exception Handling Mechanism, The try block, the catch exception handler The throw statement The try/throw/catch sequence Exception Specifying exceptions. Reference Books: 1. Object oriented Programming with C++ - E. Balagurusamy; Tata Mc-Graw Hill Pub. 2. Object oriented Programming in C++ - Robert Lafore, Galgotia Pub. 3..Let us C++ Yeshwant Kanetkar; bpb publication Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w

.e.f.: 2009-10 542\n' " A2"
.e.f.: 2009-10 542\n' " A2"E"\n\n\n' (C D:\n\n' + 2\r\n' 2"+)� ;\n\n%\n' 310AT 45\n 4\n\n\r;!!!G8((" 
\n&7\n ((),)Input/OutputIntroduction, Byte Stream and Character stream classes, Methods of InputStream and OutputStream classes, Constructors and methods of FileInputStream and FileOutputStream classs, Methods of DataInputStream and DataOutputStream class. Reading input (numeric, character and string data) from console/keyboard. Handling primitive data types. Character Stream Classes. Reader and Writer class, File class.(in brief)*Applet Programming Types of applets, Developing and testing applets, Life cycle of applet, creating executable applet. APPLET&#x-7.0;鄘 tag and its attributes. Passing parameters to applet. ((( ),)Event Handling Event handling mechanism, Java’s event delegation model: event sources and event listener,. Event classes, Event Listener Interfaces, Adapter classes. *AWT & Graphics AWT Classes, Windows fundamentals, Frame Windows, Creating windowed program, displaying information within a window. Drawing method of the Graphics class such as drawLine(), drawRect() drawOval(), drawArc(), fillRect(), fillOval(), fillArc(), getColor(), setColor(), getFont(), setFont(), Managing text output using FontMetrics

(((( )/)AWT Controls A
(((( )/)AWT Controls AWT Controls: Control fundamentals: Adding and removing controls, responding a controls, Labels, Button, ChechBox & ChechboxGroup, Choice, Lists, TextField, TextArea. Layout Managers*Network Programming Networking basics, Socket Overview, Client/Server, Internet addressing, Domain Naming Service (DNS). Methods of InetAddress class. Socket and ServerSocket class, URL class. Datagrams: DatagramPacket and DatagramSocket class.Reference Books: 1.Prgramming with JAVA: E. Balagurusamy, Tata Mc-Graw Publishing Company Ltd. 2.The Complete Reference J2SE: Herbert Schildt, Tata Mc-Graw Publishing Company Ltd. 3.Core Java-2 Vol-I & Vol-II - Cray S. Horstmann, Gray Corneel; Pearson Education, Low Price edition Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 552\n' " A2"E"\n\n\n' (C D:\n\n' + 2\r\n' 2"+)- ;\n\n%\n' - 2\n9  $(" 
\n&7\n $()-)(\r  
$\n

'" " 

1\n
1 " \n

,0
-
4
 
1\n-
51
'" " 


 " \n

 "
\n
+\n







 \n

+\n



 
. \n
 

 "
\n
\n\n 
1 \n
\n

\n
\n




 
5 " 
.
5
$(

 
5 " 
.
5
$(()-**$
,  \n 

\n
0\n
;
%\n
,  \n 
0\n

.
0\n


5
%
0\n-
,-,  --\r 
0\n
$((()-+2\n#2&!5
1
\n
11- \n  \n
-
$  


21

-
%G
\rG"\n
\n
6\n\n\n \n'); \n\r&&\n\n2\n9  '14, \n
* \n &&\n\n2\n9  '14, \n

F\n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 562\n' " A2"E "\n\n\n' (C D:\n\n' + 2\r\n' 2"+�+
 ;\n\n%\n' - ;2D\r\n" 
\n&7\n $()\r\n\r!\r@! ;\n&2\n) \n
!
.\n
D3
0
4
%
4\n


.
!
 \n
!
.\n
D3
D3

.\n
.
D3\n \n

0\n
. " "
% 
(" 

 
 \n
( 


. $(( \n\r#2\n&; \n! 
% \r\n
0 \n

% \r\n
% \r
4
4\n
% 

 \n

 
. \n\n

)
.)

. \n\n
3 


)
.)

. \n\n
3 

-
% \r
\n \n-
\n \n-
(#\n
\n-
% 
\n-
 \n-
'
-
%'
 -
F \n

1.
 \n-
4 -

%  )-$(((\r\n\r!"\n6\n \n% 

 \n
'
'
 \n\n \n
 
, + \n\n
1%
 \n
% 
 \n\n \n
D3

(#\n
\n
.\r
\n \n
(#
5
 \n
. 
 \n-
1\n\n-
E \r\n

.
1 " \n-
 
 \n-
)
5
 \n )-2\n6\n\n\n \n' D 
.\n
.
!
(\n\n \n
.& 
%
\r
$-
1"
P
$\n -
,-
5\r 
53 -
D\n
P
.-
,\n\n 

3 \n\n\n
\n \nB=I:�=: � =: TR2$/\r4\nR $)/W$/.A\r$3.03A'1:8*#%0Q#%0"8*X
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 572\n' " A2"E "\n\n\n' (C D:\n\n' + 2\r\n' 2"+). ;\n\n%\n' - @\n3\r\n&$(" 
\n&7\n $(   \n  -
  
1\n


 \r-
.\n
 -
'" " 

0..-
0  
Web page, Web site , web browser , D \r
\n " 
- \r
 

\r  
\r\n 

 \r
\n " 
D \r
\n
  )-$(

((\r D7

((\r D7

!0%5

!0%5
 
\n-0 #

-

\r 3-
 \n
-

 \n0 #
\n \n
-
\n-
  
5\n\n
 \n

\n\n
"*
  -
  -
 
\n\n

\n
 -
\r3-
\r -
\n


 
\r \n0\r \n

 


\n 
\r \n

\r 

53
 \n
53\n

(# 
 
    \n-
 
 
    \n


 \n
 \n 


)-$(((Introduction to DHTML'" " 


!0%5
\n

 \n-

-
-\r3-
0 #-
\r 


&"\n
D3

&"
\n
\n
\n \n



\n
-(" 

1 \n
3
\n  \n-
\n
G
\n-
\n 
  
\n)-2\n6\n\n\n \n' D \r
(\r 
 

1 "  
)\n
!0%5-
1!0%5-
F"\r
G"
\n\n

* 
   
!0%5Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 582\n' " A2"E "\n\n\n' (C D:\n\n' + 2\r\n' 2"+)/ ;\n\n%\n' - 7" 
\n&7\n $((\r 7')-)D
\n
5#-
5#L\n
;
)#
-
4  \n

5#-
"

5#-
' 



.\n

5

#
-/ \n

5#-
D
\n
, 
!
5
#
-/ \n

5#-
D
\n
, 
!
5#-
D
, 
!
5#

$ 
 

1 \n3

5


, 
!
5#-
$ 
\n 

1 \n3-
)\n
$8'%(

E1(
1 \n3
(" 
$((!7')-*5#
\n

) \n
, 

5#
 -
)\n

\n 
-
D3


, 
!
5#

\n -
)\n
/
 #

 \n\n

,

,
R
D\n
-




 -
\n





-
\n



0 
D-
,
 
R

0\n

\n

  

D \r
) \n
  
\n-
\r\n

 \r-

"
G\n
$(((\r!7')-+) \n
\n 
\n

)\n

,
-
 

 
)\n -
,

5#
\n 
\n-

! -
%
4
\n 

1\n3
 -
%

\n\n \n
 
)\n 
-
 
\n 
 \n-
 
\r
 \n3\n-
1  
\n 
\n
 


58

 

  \n\n
58
 


  
6\n\n\n \n'012 %\r#34\n
\n 
8 \n-
D 
  
.\r5%\r\r12 %\r#6
%-
'L, 
% 
.\r3.
 %
D \nP
%\n
E
1  
'L, 
% 
.\rNote : Red Hat linux new version is known as Fedora. Curr

ently Fedora 14 version is available and
ently Fedora 14 version is available and can be easily download from internet.Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 592\n' " A2"E"\n\n\n' (C 2\r\n' 2"*)*; ;\n\n%\n' CS312AT 
"8((7The Queries to be implemented based on Previous Semester Study of DBMS by using SQL. 1.Write the queries for Data Definition and Data Manipulation language. 2.Write SQL queries using Logical operators (=,,.92;祠,etc.). 3.Write SQL queries using SQL operators (Between…. AND, IN(List), Like, ISNULL and also with negating expressions ). 4.Write SQL query using character, number, date. 5.Write SQL query using group functions. 6.Write SQL queries for Relational Algebra (UNION, INTERSECT, and MINUS, etc.). 7.Write SQL queries for extracting data from more than one table (Equi-Join, Non-Equi-Join , Outer Join) 8.Write SQL queries for sub queries , nested queries.9.Write programs by the use of PL/SQL. 10.Concepts for ROLL BACK, COMMIT & CHECK POINTS. Students are advised to use Oracle/MySql version or other latest version for above listed experiments. However depending upon the availability of software’s, students may use SQL SERVER. Mini Project may also be planned & carried out throughout the semester to understand the important various concepts of Database.2\n' " A2"E"\n\n\n' (C 2\r\n' CS204D

P ;\n\n%\n' CS304DT 
P ;\n\n%\n' CS304DT OOP using C++-II1. Object oriented program for single inheritance 2. Object oriented program for hierarchical inheritance 3. Object oriented program for derived class constructors. 4. Object oriented program for multiple inheritance5. Object oriented program for virtual base class. 6. Object oriented program for virtual function. 7. Object oriented program for reading the contents of text file 8. Object oriented program to write text onto file.9. Object oriented program to writing object onto file. 10. Object oriented program for reading object from file. 11. Object oriented program using I/O on random access file 12. Object oriented program to demonstrate the function template 13. Object oriented program to demonstrate the class template 14. Object oriented program for exception handling using try/catch clause. 15. Object oriented program to demonstrate the use of throw clause. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 602\n' " A2"E "\n\n\n' (C 2\r\n' CS210BP ;\n\n%\n' CS310BT OOP Using Java – II1. Program to read the contents from file. 2. Program to write characters in file. 3. File copy program 4. Program to accept the input from keyboard (numeric and non-numeric data) & display on the screen. 5. Program for applet creation. 6. Banner applet program 7. Program to demonstrate the parameter pass

ing in applet 8. Program to draw simple
ing in applet 8. Program to draw simple shapes (use of colors/fonts) using Graphics class methods 9. Program to create window (use of Window class methods) 10. Program to draw Frame 11. Program for event handling (3 to 4 event handlers) 12. Program to create form using AWT controls. 13. Program using InetAddress and URL class 14. Program using Socket and ServerSocket class 15. Program using: DatagramPacket and DatagramSocket class. . 2\n' " A2"E "\n\n\n' (C 2\r\n' 2"*)-; ;\n\n%\n' - 2\n9  '7!2:2FF:G: \n ! &\n\n&!!&!!\n&\n\n \n! \n&&!2\n9  2 \n' ,  \n 

\n
-
0\n
;
%\n
,  \n 
20\n

.
A0\n


5
�%
0\n
,

5
9,  

5
=

5
I\r 
0\n
B5
1
\n
:11
 \n  \n

2
$  
A

21


&#x-5.3;ॠ%G
\rG"\n
\nRevised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 612\n' " A2"E "\n\n\n' (C 2\r\n' 2"*�+; ;\n\n%\n' - PC Hardware Practical 5 Practical Each based on Unit 1, Unit 2 and Unit 3. 2\n' " A2"E"\n\n\n

' (C 2\r\n' 2"*).;
' (C 2\r\n' 2"*).; ;\n\n%\n' @\n3\r\n&$(;  &1.Design a web page which gives information of your college and course. (Use various effects like alignment font heading etc). 2.Design a web page using 3 image files give various effects on each. 3.. to 14 3.Create a web page giving following details of students using table and use a.cell padding to present following data with clarity. b.Roll number, Name, Date of birth, Blood group, Mobile, E-mail address c.Give proper title to the data and the web page 4.Design a web page which give links to various mailing sites(viz. Gmail, a.Yahoo, Rediff etc.) 5.Refer hand on exercise of reference book page no. 155 6.Refer hand on exercise 1 of reference book page no. 182 7.Refer hand on exercise 2 of reference book page no. 182 8.Refer hand on exercise 1,2,3 of reference book page no. 335 9.Refer hand on exercise 1 of reference book page no. 537 Refer hand on exercise 2 of reference book page no. 538S
6\n\n\n \n

D \r
(\r 
 

1 "  
)\n
!0%5-
1!0%5-
F"\r
G"
\n\n2\n' " A2"E "\n\n\n' (C 2\r\n' 2"*)/; ;\n\n%\n' - LINUX Practical 10 Practical Each based on Unit 1, Unit 2 and Unit 3. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 62B.Sc. (Computer Science) Se

mester V Revised Syllabus of B.Sc.(Co
mester V Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 632\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"+)+ ;\n\n%\n' "\n!\n\n!((" 
\n&7\n $(Coding, Top-down & Bottom-up, Structured Programming, Information Hiding, Programming Style, Internal Documentation, Verification, Metrics, monitoring & control )-$((Testing, Levels of Testing- Functional Testing, Structural Testing, Test Plan, Test Cases Specification, Reliability assessment)-$(((Software Project Management,Cost Estimation , Project Scheduling, Software Configuration Management, Quality Assurance, Project Monitoring, Risk Management )-\n'\n
 \n

\n\n
\r\r\n
!
\n"
#$\n
%


 \n
\r\r\n

\n
 \n 


\n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 642\n' " A2"E"\n\n\n' C 2\r\n' 2"+)0 $2\n \n" 
\n&$(Introduction, IT and business, E-commerce: ConceptsElectronic Communication, PCs and Networking, E-mail, Internet and intranets. EDI to E-commerce, EDI, UN/EDIFACT $((Concerns for E-commerce Growth, Internet bandwidth, Technical issues, Security issues. Indi

a E-commerce Readiness, Legal issues, Ge
a E-commerce Readiness, Legal issues, Getting started. Security Technologies: Cryptography, Public Key Algorithms, Private Key Algorithms, Hashing techniques, Certification and key Distribution, Cryptographic $(((Applications, Encryption, Digital Signature Protocols for Transactions. SSL-Secure Socket Layer, SET-Secure Electronic Transaction, Credit Card Business Electronic Commerce providers. CyberCash, Digicash, VeriSign Software Package: PGP e-mail encryption software \n' \n
\r




\r






!\n" #
$
6\n\n\n \n')
 \n
% &

\n\r

'((\n
)
*\r&
!\n" #
$
+ 2.
%\n &
\n \n
'\r\n

+ 
%&
%\n &
%(
, 
!"
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 652\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"+), ;\n\n%\n' Data communication Networks –II" 
\n&7\n $(Data Link Layer: Data Link Layer Design Issues, Error Detection and Correction, Elementary Data Link protocols, Sliding Window Protocols, Protocol Performance, Protocol Specification and verification Network Layer : Network Layer Design Issues, Routing Algorithms, Congestion Control Algorithms, Internetworking. )-

$((Transport layer: Transport layer
$((Transport layer: Transport layer design issues, Connection management, A Simple transport on Top of X.25. Session Layer: Session layer design issues, Remote procedure call )-$(((Presentation layer: Presentation layer design issues, Abstract syntax notation1(ASN.1), Data compression techniques, Cryptography. Application Layer: \r\r
&\n
 
'
(
)\n\n


" "
\n
"
*\n'
)\n"\n'1.Computer Networks by A.S Tannenbaum. 2.Data Communication and Networking :: Behrouz A. Forouzan; Mc-Graw Hill Pub. 3. Introduction to Digital and Data Communications, Michal A Miller, JAICO, publishing. 4. Data Communication and Networking: C.S.V. Murthy, Himalaya Publishing House Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 662\n' " A2"E C D:\n\n' + 2\r\n' 2"+�, ;\n\n%\n' 9($;!!" 
\n&7\n $(Introduction: Introduction to .NET and .NET Framework, Difference between CUI & GUI, Event Driven Programming, the VB IDE, Operators, Conditional statements and looping statements. Sub Procedure, functions and exception handling )-$((Windows Forms : General Properties, Events handling events like mouse, keyboard, Types of forms MDI, adding removing controls at run time Controls : The control

class, Text Box, Rich Text Box, Label, B
class, Text Box, Rich Text Box, Label, Buttons, Checkbox, Radio Button, Panels, Group Boxes, List Box, Combo Box, Picture Box, Scroll Bars, Splitters, Track Bars, Pickers, Timer. )-$(((Object-Oriented Programming : Class and Object, Class Vs. Object Members, Creating Classes, Objects, Structures, Modules, Constructors, Data Members, Methods, Properties, Event )-\n'1.“Visual Basic .NET Programming Black Book” by Steven Holzner, Dreamtech Press 2.Mastering in Visual Basic .NET” by Evangelos Petroutsos, Sybex Publication. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 672\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"+)- ;\n\n%\n' - 2\n9  ((" 
\n&7\n $()-)+$
  
2 
A,
�,  
0\n
9%
0\n
*;5\n   . \n "
.& 
2. 
.& 
A0 \n

. 
;
. \n "
.& 
�/\n
.\n
$(()-*2\n  "
,  \n 
2,  \n 

. 
;
8G. 
" \n
A. 
,  \n 


;
(\n
� * 
" \n
$((()-+2  \n9\n\n#2&\r\n&  


$  

20 \n


$  

20 \n

 
$  


3
% 
\r\r\n
% 

% 
A
.
\n \n
�
%
(#  \n

 \n
,$-
%K

!/
6\n\n\n \n'1.; \n\r&&\n\n2\n9  '14, \n2. \n &&\n\n2\n9  '14, \n

F\n3.2\n9  
.$\n 


(-
0 
.\r\n
. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 682\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"+�+ ;\n\n%\n' - Embedded System- I " 
\n&7\n $()-)Introduction to Microcontrollers  Introduction, Microcontrollers and microprocessors, history of microcontrollers, embedded versus external memory devices, 8-bit and 16-bit microcontrollers, CISC and RISC -processors, Harvard and Von Neumann architecture, commercial microcontroller devices * 8051 Microcontroller Introduction, MCS-51 architecture, registers in MCS_5 pin description, 8051 connections, 8051 parallel I/o ports, Memory organization, Interrupts, interrupts in MCS-51, timers and counters, serial communication. $(()-MCS 8051 addressing modes, MCS $((()-+Applications of MCS-51 Overview of 89CXX and 89C20

XX Atmel microcontrollers, pin descripti
XX Atmel microcontrollers, pin description of 89C51 and 89C2051, using flash memory, square wave generation, rectangular wave generation, pulse generation, stair case ramp generation, sine wave generation, pulse width measurement, frequency counter. Text Book : 1.Microcontrollers : Theory and Applications - Ajay Deshmukh -TMH Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 692\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"+*� ;\n\n%\n' - eXtended Markup Language" 
\n&7\n $()-Introduction to XML, XML Syntax, the state of XML, XML data modeling, DTD : document structure, elements of DTD, attributes of DTD, XML Schema: Schema Elements, data types, Element Type element, group element, attribute type, Schema data types, Converting DTD to Schemas $(( )-Formatting XML Document: style sheet basics, Understanding XSL, Understanding CSS, Comparing XSL and CSS. CSS: Introduction, CSS style properties, Creating CSS style sheet. XSL : Processing an XSL style sheet, architecture of XSL, XSL templates and patterns $((()-Introduction to AJAX, Java script for AJAX, AJAX Frame Work, ASP.NET and AJAX 6\n\n\n \n'1.“XML Unleashed” by Michael Morrison, Techmedia Publication. 2.“AJAX Black Book” by KOGENT SOLUTION Revised Syllabus of B.Sc.

(Computer Science),Dr.B.A.M.U.,A’bad’ w
(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 702\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"+*) ;\n\n%\n' +)* 
@\n !#
!" 
\n&7\n $()-)(\r '
!5\n *
!'


-
D
\n
1
%J-
1 -
1%
/\n
1
%-
1%
0 + \n-
\n\n \n

  \n

1%-
1%

 \n-
1%
\nG\n
 \n$(()-+
@\n !'
-
D
\n
1
D \nJ-




1 -
% \n
1
% -
'5.
' -
D \n
 -
1
D \n
  -
D \n
 " -
% -
'5.
( -
1
D \n
3 
. \n\n-
1
D \n
)\n 
$(((+& '@\n!)--
D \r
%-
D \r
 
%-
D \r

%
.
,3-

8 3-
0\n" \n

\n
53\n-
,   
8 \n

 #
8 \n-

D \r
)\n

6\n\n\n \n'1.
!\n %\n'
E
.&
-2.
!(\r \r\r '% 
!
13.
\n!\n\n"\n' \nRevised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 712\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\

n' 2"*)+; ;\n\n%
n' 2"*)+; ;\n\n%\n' +)+ ;  &\n\r2"+)+A"E\n

\r\n 

0 
\n
2\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"*�,; ;\n\n%\n' ;  &\n\r+�,A9(;!E)�;  &6\n&\n\r9(;!!2\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"*)- ;\n\n%\n' ;  &\n\r+)-A29E)�;  &6\n&\n\r2\n!  ((2\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"*�+; ;\n\n%\n' ;  &\n\r+�+A\n\r\r\n\rE)�;  &6\n&\n\r\n\r\r\n\r 2\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"**�; ;\n\n%\n' ;  &\n\r+*�AI7E)�;  &6\n&\n\rI7;!! 2\n' " A2"E"\n\n\n' C D:\n\n' + 2\r\n' 2"**); ;\n\n%\n' ;  &\n\r+*))�;  &6\n&\n\r
#
@
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-1

0 72B.Sc. (Computer Science) Semester
0 72B.Sc. (Computer Science) Semester VI Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 732\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+)+2 ;\n\n%\n' "\n\n!\rB& \n" 
\n&7\n $()-)  \n
\n
+'&
!

 
,\n

,
-,

'

 
)
,

,
'\n

\n"
\n
)
.

/$(()-* \n
\r\n

.\r

0
)


0
)
1&"
0
)

2'

.\n
(
) 
2,\n,

1&"
1
(
) 
1
(
$\n\r
1
(
)\n"
1
(
)
.\n\n
."\r\n

1
(
)

.\n\n
(-


)

.\n\n
."\r\n

)
)3'

$((()-+ 
\n
\r\n

.\r

 \n
) 
1\n
)&\r

\n

\n
\n\n\n
)

\n
&"
 \n
&"
)
. \n4
5
)
('&
)
!-'
)
\n\r\n-&
)
\n\n"
)
!-&
)

1'"
)
\n'1.6,
"
\n
\n
)
6/"
\n\n&
/&2.6\n
)

+'&
'\n

4
)\n&

\n7
 \n

4
)\n&

\n7
 \n

0,\n&

/\n
&'
)\n\r&
/&

8 

6\n
)


.\n"9
\r\r\n7
'
.
\n 
.!.
\n
::;

6)
\n

.\n,
1\n'7
!
'\n
1

6\n
) 7
\n,
1

$\r"&
!"

\n
'
=
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 742\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+** ;\n\n%\n'  \n2" 
\n&7\n $()-! '\n
�\r\n
(

\n '\n
�\r\n
\r'"\r
""
\n
\n '\n

\r\r

\r'"\r
""
'\n
\r\n\r\n

\n '\n

\n '\n


\n""\n
&\r

\n""\n
?&\r

&\r

&\r

&\r
@

$(( )-
\n
'
\n\r
\n
""
'

'"

\n
&"
\r-&

\n 
(
1(
3',

1(

(
"&
"\n
"
""A

'"
\r\r$((( )-(\n"
B ' 
."&


 ' 
 ' 
\n
\n

'"Reference Books 1.J E Hopcroft, R Motwani and J D Ullman, Introduction to Automata theory, Languages and Com

putation, Pearson Education Asia, 2003.
putation, Pearson Education Asia, 2003. 2.Daniel A Cohen, Introduction to Computer Theory, Hardcover (1990) by. John Wiley & Sons 3.K. L P Mishra, N Chandrashekharan, Theory of Computer Science, PHI 2001 4.Martin John C, Introduction to Language ad Theory of computations (TMH) 2004. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 752\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+*+ ;\n\n%\n'   \r2\n7" 
\n&7\n $()-Basic Concepts of Technology and Law , Understanding the Technology of Internet, Scope of Cyber Laws , Cyber Jurisprudence $(()-Law of Digital Contracts The Essence of Digital Contracts The System of Digital Signatures The Role and Function of Certifying Authorities The Science of Cryptography E-Governance Cyber Crimes and Cyber Laws.$((()-Information Technology Act 2000 Cyber Law Issues in E-Business Management Major issues in Cyber Evidence Management Cyber Law Compliancy Audit, The Ethics of Computer
 \n'1. Godbole,“ Information Systems Security”, Willey 2. Merkov, Breithaupt,“ Information Security”, Pearson Education 3. Yadav, “Foundations of Information Technology”, New Age, Delhi 4. Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata McGraw Hill 5. Sood,“Cyber Laws Sim

plified”, Mc Graw Hill 6. Furnell, “Comp
plified”, Mc Graw Hill 6. Furnell, “Computer Insecurity”, Springer Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 762\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+�,3 ;\n\n%\n' VB.Net & Architecture and Programming " 
\n&7\n $()-Application Architecture for .NET : Distributed Application Designing Designing the components of an Application or Service: General designing recommendation for Application and services $(()-ADO.NET: Overview of ADO.NET object, architecture of ADO.NET, structure of DataSet creating DataSet, data binding, DataAdapter objects, Command objects, DataReader objects, binding data to various controls, simple data binding and complex data binding. $((()-Graphics : Using Graphics Class, using Pen class, using Brush class, File Handling :Using FileStream Class, FileMode Enumeration, FileAccess Enumeration, FileShare Enumeration, StreamWriter Class, StreamReader Class, BinaryWriter Class, BinaryReader Class, File and Directory Class. \n'1.Visual Basic .NET Programming Black Book” by Steven Holzner, Dreamtech Press 2.“Mastering in Visual Basic .NET” by Evangelos Petroutsos, Sybex Publication. Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 7

72\n' " A2"E"
72\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+)-2 ;\n\n%\n' Computer Animation "7\n $()-) 3\r\n&What is mean by Animation – Why we need Animation – History of Animation – Uses of Animation – Design step of Animation- Types of Animation – Principles of Animation – Some Techniques of Animation – Animation on the WEB – 3D Animation – Special Effects -Creating Animation. $(()-2. Introduction to anima8or software: 1. Basics, 2. Object Editor - Basics and Object/Edit Mode, 3. Object Editor - Object/Point Mode, 4. Figure Editor $((()-5. Sequence Editor, 6. Scene Editor, 7. Animation, 8. Materials, 9. Scripts.\n')PRINCIPLES OF MULTIMEDIA – Ranjan Parekh, 2007, TMH.2.&0"\n'3\n\n\r&\r&#"\n \n\n\n'\r4CC"8\n"C"C�"
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 782\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+�+3 ;\n\n%\n' Embedded System II " 
\n&7\n $()- PIC Microcontrollers PIC microcontroller overview and features, PIC 16C6X/7x: ALU, CPU registers, pin diagram, PI

C reset actions, PIC oscillator connecti
C reset actions, PIC oscillator connections, PIC memory organization. $(()-Instructions and Interfacing PIC 16C6X/7X instructions, Addressing modes, I/O ports LED, push buttons, relays and latch connections.$((()-Interfacing and Industrial applications of Microcontroller Keyboard interfacing, interfacing of 7 segment display, LCD interfacing, ADC and DAC interfacing. Text Book : 1.Microcontrollers : Theory and Applications - Ajay Deshmukh -TMH Reference Books : 2.The 8051 Microcontroller and Embedded systems- M. A. Mazadi, J. G. Mazadi & R. D. McKinlay pearson PHI. 3.The 8051 Microcontroller - K. J. Ayala - ThomsonRevised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 792\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+*� ;\n\n%\n' Web Programming " 
\n&7\n $()-Introduction to PHP, PHP Language Basics, The building Block of PHP $(()-Decision and loops, Arrays in PHP, Objects in PHP, functions in PHP types of functions$((()-Working with String, Date and Time, handling Forms (HTML). Reference Books: 65$$
%
;7
-&
#))
12DB
/!2E
\r'-
6%
#&+B

\r


27
-&
'
.
#
#
\n
Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.:

2009-10 802\n' " A2"E
2009-10 802\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"+),2 ;\n\n%\n' - &\n !" 
\n&7\n $()-)Introduction to Mobile Computing: Mobile devices, wired network, Wireless Networks, Ad-Hoc Networks, limitations of mobile environment, Mobile Application $(()-Radio communication: Basics, Radio frequency bands, propagation mechanism, Data communication using switching modes (circuit, packet switching), modulation (Analog – Amplitude, Frequency, Phase, Digital Modulation-PCM), Cellular networks, Advantages of Cellular network, Handoff.$((()-Wireless Communication: Wireless LAN, MAC Structure, Mobile IP, Mobile Agents, Advantages of Mobile Agents, GSM, Technical Details of GSM, GSM Cells, GSM Network Structure, Components and Functions6\n\n\n \n'1.Asoke K Talukder, Roopa Yavagal, Mobile Computing, TMH, 2006 Revised Syllabus of B.Sc.(Computer Science),Dr.B.A.M.U.,A’bad’ w.e.f.: 2009-10 812\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"/,�; ;\n\n%\n' - ;5\n @6\n\n$(6\n\n8((3& 2\n' " A2"E"\n\n\n' C( D:\n\n' + 2\r\n' 2"*),; ;\n\n%\n' - "\n6\n