tag:blogger.com,1999:blog-64150446356891917982023-11-16T05:13:28.216-08:00Syllabus of Computer Science & EngineeringGKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.comBlogger82125tag:blogger.com,1999:blog-6415044635689191798.post-71829264422640039462012-11-02T10:23:00.000-07:002012-11-03T21:28:36.868-07:00Anna University Exam Time Table for Civil Engg Nov Dec 2012 – Reg 2008,2009,2012<h2>
Anna University Exam Time Table for Civil Engg Nov Dec 2012 – Reg 2008,2009,2012</h2>
<div style="text-align: center;">
ANNA UNIVERSITY , CHENNAI - 600 025
TIME TABLE - B.E/B.Tech(R-2008). /B.Arch.(R-2009) DEGREE EXAMINATIONS -Nov/Dec - 2012 Dated: 05-OCT-12
For candidates admitted in Anna University, Chennai in 2008 , 2009 & 2012,erstwhile
Anna University of Technology, Chennai in 2010 and all erstwhile Anna Universities of Technology in 2011 </div>
<br />
<table cellpadding="0" cellspacing="0" class="t1"><tbody>
<tr><td class="tr5 td49" colspan="2"><div class="p1 ft8">
Semester Subject Name</div>
</td>
<td class="tr5 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr5 td7"><div class="p6 ft8">
Subject</div>
</td>
<td class="tr5 td10"><div class="p1 ft8">
Exam Date</div>
</td>
<td class="tr5 td11"><div class="p14 ft8">
Day</div>
</td>
<td class="tr5 td9"><div class="p7 ft8">
Sessio</div>
</td>
</tr>
<tr>
<td class="tr5 td2"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr5 td47"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr5 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr5 td7"><div class="p6 ft8">
Code</div>
</td>
<td class="tr5 td10"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr5 td11"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr5 td9"><div class="p7 ft8">
n</div>
</td>
</tr>
<tr>
<td class="tr6 td2"><div class="p8 ft9">
02</div>
</td>
<td class="tr6 td47"><div class="p9 ft10">
Mathematics II</div>
</td>
<td class="tr6 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr6 td13" colspan="2"><div class="p1 ft9">
MA2161 <nobr>19-DEC-12</nobr></div>
</td>
<td class="tr6 td11"><div class="p1 ft10">
Wednesday</div>
</td>
<td class="tr6 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
02</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Engineering Physics II</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
PH2161</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>20-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
02</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Technical English II</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
HS2161</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>22-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Saturday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
02</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Engineering Chemistry II</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CY2161</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>27-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
02</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Engineeering Mechanics</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td13" colspan="2"><div class="p1 ft9">
ME2151 <nobr>28-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
02</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Basic Electrical and Electronics Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
GE2151</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>29-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Saturday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
03</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
<nobr>Surveying-I</nobr></div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2204</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>19-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Monday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
03</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Mechanics of Solids</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2201</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>22-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
03</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Environmental Science and Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
GE2021</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>26-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Monday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
03</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Construction Techniques, Equipment and Practice</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2203</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>29-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
03</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Applied Geology</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
AG2211</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>04-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
03</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Transforms and Partial Differential Equations</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td13" colspan="2"><div class="p1 ft9">
MA2211 <nobr>07-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
03</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Mechanics of Fluids</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2202</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>11-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
04</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Numerical Methods</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td13" colspan="2"><div class="p1 ft9">
MA2264 <nobr>13-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
04</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Highway Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2255</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>19-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Wednesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
04</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Soil Mechanics</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2251</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>20-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
04</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Strength of Materials</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2252</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>21-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
04</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Applied Hydraulic Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2253</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>22-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Saturday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
04</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
<nobr>Surveying-II</nobr></div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2254</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>27-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
05</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Irrigation Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2301</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>17-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Saturday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
05</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Railways, Airports and Harbour Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2303</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>21-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Wednesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
05</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Structural Analysis I</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2302</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>28-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Wednesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
05</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Environmental <nobr>Engineering-I</nobr></div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2304</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>03-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Monday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
05</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Foundation Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2305</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>06-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
05</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Design of RC Elements</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2306</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>10-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Monday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Principles of Management</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
MG2351</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>27-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Design of Steel Structures</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2352</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>05-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Wednesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Construction Planning and Scheduling</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2353</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>06-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Thursday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Structural Analysis - II</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2351</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>07-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Environmental Engineering - II</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2354</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>11-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Professional Ethics in Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
GE2025</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>12-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Wednesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Total Quality Management</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
GE2022</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>14-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Architecture</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2025</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>18-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Hydrology</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2021</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>18-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Cartography</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2022</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>18-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
06</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Remote Sensing Techniques and GIS</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2024</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>18-DEC-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
AN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td14" colspan="2"><div class="p9 ft10">
Design of Reinforced Concrete and Brick Masonry Structures</div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2401</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>16-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Estimation and Quantity Surveying</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2402</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>20-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Tuesday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Basics of Dynamics and Aseismic Design</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2403</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>23-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Water Resources Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2031</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>30-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Contract Laws and Regulations</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
GE2073</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>30-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Pavement Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2032</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>30-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Ground Water Engineering</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2028</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>30-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft9">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft10">
Coastal Zone Management</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft9">
CE2030</div>
</td>
<td class="tr3 td10"><div class="p1 ft9">
<nobr>30-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft10">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft9">
FN</div>
</td>
</tr>
<tr>
<td class="tr3 td2"><div class="p8 ft12">
07</div>
</td>
<td class="tr3 td47"><div class="p9 ft13">
Management of Irrigation Systems</div>
</td>
<td class="tr3 td50"><div class="p1 ft18">
<br /></div>
</td>
<td class="tr3 td7"><div class="p24 ft12">
CE2029</div>
</td>
<td class="tr3 td10"><div class="p1 ft12">
<nobr>30-NOV-12</nobr></div>
</td>
<td class="tr3 td11"><div class="p1 ft13">
Friday</div>
</td>
<td class="tr3 td9"><div class="p10 ft12">
FN</div>
</td></tr>
</tbody></table>
GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-84397397551214045852012-07-09T10:21:00.003-07:002012-07-09T10:21:49.651-07:00CS1016 GRAPH THEORY<div style="color: blue;">
<b><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 <br />
B.E. COMPUTER SCIENCE AND ENGINEERING<br />
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING</b></b> </div>
<div style="color: blue;">
<b><b>CS1016 GRAPH THEORY 3 0 0 100</b></b></div>
<b style="color: blue;">AIM </b><br />
To provide fundamental ideas on graph theory required for the study of Computer Science.<br />
<b style="color: blue;">OBJECTIVES </b><br />
• Understand basic notions of Graph Theory<br />
• Knowing Fundamental Theorems in Graph Theory<br />
• Study of algorithmic Graph Theory<br />
<a name='more'></a><br />
UNIT I 9<br />
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits – Connectedness – Components – Euler Graphs – Hamiltonian Paths and Circuits – Trees – Properties of trees – Distance and Centers in Tree – Rooted and Binary Trees.<br />
UNIT II 9<br />
Spanning trees – Fundamental Circuits –Spanning Trees in a Weighted Graph – Cut Sets – Properties of Cut Set – All Cut Sets – Fundamental Circuits and Cut Sets – Connectivity and Separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and Geometric Graphs – Planer Graphs – Different Representation of a Planer Graph.<br />
UNIT III 9<br />
Incidence matrix – Submatrices – Circuit Matrix – Path Matrix – Adjacency Matrix – Chromatic Number – Chromatic partitioning – Chromatic polynomial - Matching - Covering – Four Color Problem – Directed Graphs – Types of Directed Graphs – Digraphs and Binary Relations – Directed Paths and Connectedness – Euler Graphs – Adjacency Matrix of a Digraph.<br />
UNIT IV 9<br />
Algorithms: Connectedness and Components – Spanning tree – Finding all Spanning Trees of a Graph –Set of Fundamental Circuits – Cut Vertices and Separability – Directed Circuits.<br />
UNIT V 9<br />
Algorithms: Shortest Path Algorithm – DFS – Planarity Testing – Isomorphism <br />
TOTAL : 45<br />
TEXT BOOK<br />
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, PHI, 2003.<br />
REFERENCE<br />
1. R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson Education, 2003.GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-76013914817457512242012-07-09T10:21:00.002-07:002012-07-09T10:21:29.796-07:00CS1202 DIGITAL PRINCIPLES AND SYSTEM DESIGN<div style="color: blue;">
<b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER III</b></div>
<div style="color: blue;">
<b>CS1202 DIGITAL PRINCIPLES AND SYSTEM DESIGN 3 1 0 100</b></div>
<b style="color: blue;">AIM</b><br />
To provide an in-depth knowledge of the design of digital circuits and the use of Hardware Description Language in digital system design.<br />
<b style="color: blue;">OBJECTIVES</b><br />
• To understand different methods used for the simplification of Boolean functions<br />
• To design and implement combinational circuits<br />
• To design and implement synchronous sequential circuits<br />
• To design and implement asynchronous sequential circuits<br />
• To study the fundamentals of VHDL / Verilog HDL<br />
UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 8<br />
Review of binary number systems - Binary arithmetic – Binary codes – Boolean algebra and theorems - Boolean functions – Simplifications of Boolean functions using Karnaugh map and tabulation methods – Logic gates<br />
UNIT II COMBINATIONAL LOGIC 9<br />
Combinational circuits – Analysis and design procedures - Circuits for arithmetic operations - Code conversion – Introduction to Hardware Description Language (HDL)<br />
UNIT III DESIGN WITH MSI DEVICES 8<br />
Decoders and encoders - Multiplexers and demultiplexers - Memory and programmable logic - HDL for combinational circuits<br />
UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC 10<br />
Sequential circuits – Flip flops – Analysis and design procedures - State reduction and state assignment - Shift registers – Counters - HDL for sequential logic circuits, Shift registers and counters.<br />
UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC 10<br />
Analysis and design of asynchronous sequential circuits - Reduction of state and flow tables – Race-free state assignment – Hazards.<br />
TUTORIAL 15<br />
TOTAL : 60<br />
TEXT BOOKS<br />
1. M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, 2002.<br />
REFERENCES<br />
1. Charles H.Roth, Jr. “Fundamentals of Logic Design”, 4th Edition, Jaico Publishing House, 2000.<br />
2. Donald D.Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2003.GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-12161810747917833372012-07-09T10:21:00.001-07:002012-07-09T10:21:20.208-07:00CS1205 OBJECT ORIENTED PROGRAMMING LAB EXPERIMENTS<div style="color: blue;">
<b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER III</b></div>
<div style="color: blue;">
<b>CS1205 OBJECT ORIENTED PROGRAMMING LAB EXPERIMENTS 0 0 3 100</b></div>
<b style="color: blue;">C++</b><br />
1. Programs Using Functions<br />
- Functions with default arguments<br />
- Implementation of Call by Value, Call by Address and Call by Reference<br />
2. Simple Classes for understanding objects, member functions and Constructors<br />
- Classes with primitive data members<br />
- Classes with arrays as data members<br />
- Classes with pointers as data members – String Class<br />
- Classes with constant data members<br />
- Classes with static member functions<br />
3. Compile time Polymorphism <br />
- Operator Overloading including Unary and Binary Operators.<br />
- Function Overloading<br />
4. Runtime Polymorphism <br />
- Inheritance<br />
- Virtual functions<br />
- Virtual Base Classes<br />
- Templates<br />
5. File Handling<br />
- Sequential access<br />
- Random access<br />
JAVA<br />
6. Simple Java applications <br />
- for understanding reference to an instance of a class (object), methods<br />
- Handling Strings in Java<br />
7. Simple Package creation.<br />
- Developing user defined packages in Java<br />
8. Interfaces<br />
- Developing user-defined interfaces and implementation<br />
- Use of predefined interfaces<br />
9. Threading<br />
- Creation of thread in Java applications<br />
- Multithreading<br />
10. Exception Handling Mechanism in Java<br />
- Handling pre-defined exceptions<br />
- Handling user-defined exceptionsGKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-25729389075074912482012-07-09T10:19:00.001-07:002012-07-09T10:19:24.275-07:00Anna university May/June 2012 Results for 2nd 4th 6th 8th semester | annauniv.edu<div style="font-family: "Trebuchet MS",sans-serif; text-align: justify;">
<span style="font-size: small;">Anna university Result May/June 2012 Result for 2nd 4th 6th 8th semester | anna university may/june 2012 results | annauniv.edu<br /><br />About
- Anna University (AU) was established on 4th September 1978 in Tamil
Nadu, India. Anna University offers higher education in Technology,
Engineering and Applied Sciences. The University is spitted over six
universities. They are<br />1) Anna University, Chennai.<br />2) Anna University, Tiruchirappalli.<br />3) Anna University, Tirunelveli.<br />4) Anna University, Coimbatore.<br />5) Anna University, Madurai.<br /><br />The Anna University also facilitates training between academic and industrial communities.<br /><br />In
December 2001, The Anna University was converted into an affiliating
university, with almost all engineering colleges in the state under its
fold with almost about 250 engineering colleges in Tamil Nadu.<br />Anna university has conducted the exam on April May 2012 and you get the exam time table from the below link <br /><br /><a class="bbc_link" href="http://www.annauniv.edu/pdf/affsch2012.pdf" target="_blank">CLICK HERE TO DOWNLOAD THIS</a><br /><br />Anna University May/June 2012 Exam Results<br />The
results of the Even semester of the Anna University, which were held in
the month of April/May (2012)this year, were declared on soon. The
result for all the Undergraduates and Post graduate courses were
declared together. The results are made available on the official
website of the Anna University which is <a class="bbc_link" href="http://www.annauniv.edu/" target="_blank">www.annauniv.edu</a><br />ANNA
UNIVERSITY 4TH 6TH 8TH SEMESTER APRIL/MAY 2012 RESULTS | ANNA
UNIVERSITY APRIL/MAY 2012 EXAM RESULTS FOR 4TH 6TH 8TH SEMESTER |<br /><br /><br />Link Coming Soon<br />Server 1: Click Here<br />Server 2: Click Here<br />Server 3: Click Here<br /><br />Keywords<br />Anna university Result May/June 2012 Result 2nd 4th 6th 8th semester <br />When anna university examination may/june 2012 ends only one question raises in students mind RESULT RESULT RESULT.<br />when is the Anna university result ?<br />When is the result to be announce ?<br />when Anna university result date announce ?<br />when Anna university result publish ?</span></div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-64579148249495479842010-12-30T23:17:00.000-08:002010-12-30T23:17:04.227-08:00CS 1004 – DATA WARE HOUSING AND MINING Question paper<div style="text-align: center;"><b style="color: blue;">2010 Anna University Chennai B.E Computer Science BE/B.Tech DEGREE EXAMINATION APRIL/MAY 2010 SIXTH SEMESTER COMPUTER SCIENCE AND ENGINEERING CS 1004 – DATA WARE HOUSING AND MINING Question paper</b></div><div style="text-align: justify;"><br />
BE/B.Tech DEGREE EXAMINATION APRIL/MAY 2010<br />
SIXTH SEMESTER<br />
COMPUTER SCIENCE AND ENGINEERING<br />
CS 1004 – DATA WARE HOUSING AND MINING<br />
(REGULATION 2004)</div><a name='more'></a><br />
<b style="color: blue;">TIME: THREE HOURS MAXIMUM MARKS :100 MARKS</b><br />
<br />
<b style="color: blue;">Answer all the question PART –A(10*2=20)</b><br />
<br />
1.What are the characteristics of data warehouse?<br />
2.Define data model.<br />
3.What are the various forms of the data processing?<br />
4.State the significance of hierarchy of data.<br />
5.what are the interestingness measures of association rule mining?<br />
6.Define multi level association rule.<br />
7.What are the factors to be considered, When comparing classification methods?<br />
8.Mention the various types of data available in data mining.<br />
9.Define spatial database.<br />
10.List the some applications of data mining.<br />
<b style="color: blue;"><br />
PART –B (5x16=80 marks)</b><br />
<br />
11 (a) Explain Data ware house architecture and operational data stores with neat diagram.[Marks 16]<br />
or<br />
(b) Discuss the nine decisions in the design of data warehouse in detail. [Marks 16]<br />
<br />
12 (a) Discus the five primitives for specifying task. [Marks 16]<br />
or<br />
(b) Discuss the importance of establishing a standardized data mining query language .What are the potential benefits and challenges involved in such a task? [Marks 16]<br />
<br />
13 (a) Discuss the single dimensional boolean association rule mining for transaction database.[Marks 16]<br />
or<br />
(b) With an example discuss multilevel association rule. [Marks 16]<br />
<br />
14 (a) Briefly discuss the major steps involved in the induction of decision trees using the ID# algorithm. [Marks 16]<br />
or<br />
(b) What is clustering?How does it differ from classification?Describe the following approaches to clustering methods,partitioning methods and hierarchical methods.Give an example for each [Marks 2+2+4+4+4=16]<br />
<br />
15 (a) Describe the applications and trends in data mining in detail. [Marks 16]<br />
or<br />
(b) Write short notes on:<br />
(i) Data mining for retail industry [Marks 8]<br />
(ii) Visual and audio data mining [Marks 8]GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-86843670036877824622010-12-30T23:15:00.001-08:002010-12-30T23:15:48.538-08:00CS 1351 – ARTIFICIAL INTELLIGENCE (Common to B.E (part –time) fifth semester regulation 2005) Question paper<div style="text-align: center;"><b style="color: blue;">2010 Anna University Chennai B.E Computer Science B.E/B.TECH DEGREE EXAMINATION, APRIL/MAY 2010 Sixth semester (Regulation 2004) Computer science and engineering CS 1351 – ARTIFICIAL INTELLIGENCE (Common to B.E (part –time) fifth semester regulation 2005) Question paper</b></div><div style="text-align: justify;"></div><a name='more'></a><br />
B.E/B.TECH DEGREE EXAMINATION, MAY/JUNE 2010<br />
Sixth semester (Regulation 2004)<br />
Computer science and engineering<br />
CS 1351 – ARTIFICIAL INTELLIGENCE<br />
(Common to B.E (part –time) fifth semester regulation 2005)<br />
Time: three hours maximum: 100 marks<br />
<br />
Answer ALL questions<br />
PART A- (10 x 2 = 20 marks)<br />
<br />
1. Define ideal rational agent.<br />
2. How will you measure the problem-solving performance?<br />
3. State the reasons when the hill climbing often gets stuck.<br />
4. What is constraint Satisfaction problem?<br />
5. Differentiate between prepositional versus first-order logic.<br />
6. Define ontological engineering.<br />
7. What is explanation-based engineering?<br />
8. State the advantages of inductive logic programming.<br />
9. Give the component steps of communication.<br />
10.What are machine translation system?<br />
<br />
PART B – (5 x 16 = 80 marks)<br />
<br />
11 (a) Explain the structure of agents with suitable diagram. [Marks 16]<br />
or<br />
(b) Explain the following uninformed search strategies.<br />
(i) Iterative deepening depth-first search.[Marks 8]<br />
(ii)Bidirectional search. [Marks 8]<br />
<br />
12 (a) Explain the A* search and give the proof of optimality of A*. [Marks 16].<br />
or<br />
(b) Describe Min-Max Algorithm and Alpha-Beta pruning. [Marks 16]<br />
<br />
13 (a) (i) Describe the general process of knowledge engineering. [Marks 8]<br />
(ii)Discuss the syntax and semantics of first-order-logic. [Marks 8]<br />
or<br />
(b) Describe the forward chaining and backward chaining algorithm with suitable example. [Marks 16]<br />
<br />
14 (a) (i) Describe the decision tree learning algorithm. [Marks 8]<br />
(ii)Explain the relevance-based learning. [Marks 8]<br />
or<br />
(b) Discuss active and passive reinforcement learning with suitable examples. [Marks 16]<br />
<br />
15 (a) (i) Describe the semantic interpretation. [Marks 8]<br />
(ii)Illustrate the grammar induction with suitable example. [Marks 8]<br />
or<br />
(b) Discuss on information retrieval systems and information extraction systems. [Marks 8+8]GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-89543149629780583202010-09-16T19:14:00.000-07:002010-09-16T19:14:16.325-07:00MA1251 NUMERICAL METHODS<div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER</b></div><div style="color: blue;"> </div><div style="text-align: justify;"><b style="color: blue;">MA1251 NUMERICAL METHODS 3 1 0 100</b> <br />
AIM<br />
With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically.<br />
<br />
UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3 <br />
Linear interpolation methods (method of false position) – Newton’s method – Statement of Fixed Point Theorem – Fixed point iteration: x=g(x) method – Solution of linear system by Gaussian elimination and Gauss-Jordon methods- Iterative methods: Gauss Jacobi and Gauss-Seidel methods- Inverse of a matrix by Gauss Jordon method – Eigenvalue of a matrix by power method. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II INTERPOLATION AND APPROXIMATION 9+ 3<br />
Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s forward and backward difference formulas.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION 9+ 3</div><div style="text-align: justify;"> </div><div style="text-align: justify;">Derivatives from difference tables – Divided differences and finite differences –Numerical integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpson’s rules. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS 9+ 3<br />
Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne’s and Adam’s predictor and corrector methods.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS 9+ 3<br />
Finite difference solution of second order ordinary differential equation – Finite difference solution of one dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two dimensional Laplace and Poisson equations.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">TUTORIAL 15<br />
<br />
TOTAL : 60<br />
TEXT BOOKS<br />
1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson Education Asia, New Delhi, 2002.<br />
2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub.Co.Ltd, New Delhi, 1999.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES <br />
1. Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co. Ltd., New Delhi, 2003.<br />
2. Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt. Ltd., Singapore, 2002.</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-54248029064059847092010-09-16T19:13:00.001-07:002010-09-16T19:13:38.145-07:00CS1356 COMPILER DESIGN LAB<div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER </b></div><div style="color: blue;"> </div><div style="text-align: justify;"><b><span style="color: blue;">CS1356 COMPILER DESIGN LAB 0 0 3 100</span></b></div><a name='more'></a><br />
1 & 2 Implement a lexical analyzer in “C”.<br />
3. Use LEX tool to implement a lexical analyzer.<br />
4. Implement a recursive descent parser for an expression grammar that generates arithmetic expressions with digits, + and *. <br />
5. Use YACC and LEX to implement a parser for the same grammar as given in problem <br />
6. Write semantic rules to the YACC program in problem 5 and implement a calculator that takes an expression with digits, + and * and computes and prints its value.<br />
7 & 8. Implement the front end of a compiler that generates the three address code for a simple language with: one data type integer, arithmetic operators, relational operators, variable declaration statement, one conditional construct, one iterative construct and assignment statement.<br />
9 &10. Implement the back end of the compiler which takes the three address code generated in problems 7 and 8, and produces the 8086 assembly language instructions that can be assembled and run using a 8086 assembler. The target assembly instructions can be simple move, add, sub, jump. Also simple addressing modes are used.GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-78202165323149707262010-09-16T19:12:00.004-07:002010-09-16T19:12:52.110-07:00CS1355 GRAPHICS AND MULTIMEDIA LAB<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER </b></div><div style="color: blue;"> </div><div style="color: blue; text-align: justify;"><b>CS1355 GRAPHICS AND MULTIMEDIA LAB 0 0 3 100 </b></div><div style="text-align: justify;"> </div><div style="text-align: justify;">1. To implement Bresenham’s algorithms for line, circle and ellipse drawing<br />
2. To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.<br />
3. To implement Cohen-Sutherland 2D clipping and window-viewport mapping<br />
4. To perform 3D Transformations such as translation, rotation and scaling. <br />
5. To visualize projections of 3D images.<br />
6. To convert between color models.<br />
7. To implement text compression algorithm<br />
8. To implement image compression algorithm<br />
9. To perform animation using any Animation software<br />
10. To perform basic operations on image using any image editing software </div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-61870697159391927192010-09-16T19:12:00.002-07:002010-09-16T19:12:29.455-07:00CS1354 GRAPHICS AND MULTIMEDIA<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER</b></div><div style="color: blue;"> </div><div style="color: blue; text-align: justify;"><b>CS1354 GRAPHICS AND MULTIMEDIA 3 0 0 100 </b></div><div style="color: blue; text-align: justify;"> </div><div style="text-align: justify;"><b style="color: blue;">AIM</b><br />
To impart the fundamental concepts of Computer Graphics and Multimedia.</div><div style="text-align: justify;"> </div><div style="text-align: justify;"><b style="color: blue;">OBJECTIVES</b><br />
• To study the graphics techniques and algorithms.<br />
• To study the multimedia concepts and various I/O technologies.<br />
• To enable the students to develop their creativity</div><a name='more'></a><br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I OUTPUT PRIMITIVES 9<br />
Introduction - Line - Curve and Ellipse Drawing Algorithms – Attributes – Two-Dimensional Geometric Transformations – Two-Dimensional Clipping and Viewing.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II THREE-DIMENSIONAL CONCEPTS 9<br />
Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling Transformations – Three-Dimensional Viewing – Color models – Animation.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III MULTIMEDIA SYSTEMS DESIGN 9<br />
An Introduction – Multimedia applications – Multimedia System Architecture – Evolving technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data interface standards – Multimedia Databases.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV MULTIMEDIA FILE HANDLING 9<br />
Compression & Decompression – Data & File Format standards – Multimedia I/O technologies - Digital voice and audio – Video image and animation – Full motion video – Storage and retrieval Technologies. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V HYPERMEDIA 9<br />
Multimedia Authoring & User Interface – Hypermedia messaging - Mobile Messaging – Hypermedia message component – Creating Hypermedia message – Integrated multimedia message standards – Integrated Document management – Distributed Multimedia Systems.<br />
<br />
TOTAL : 45<br />
TEXT BOOKS<br />
1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson Education, 2003.<br />
(UNIT I : Chapters 1 to 6; UNIT 2: Chapter 9 – 12, 15, 16)<br />
2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003. <br />
(UNIT 3 to 5)<br />
REFERENCES<br />
1. Judith Jeffcoate, “Multimedia in practice technology and Applications”, PHI, 1998.<br />
2. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson Education, second edition 2003.<br />
</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-77482246532316357612010-09-16T19:12:00.000-07:002010-09-16T19:12:04.024-07:00CS1353 SOFTWARE ENGINEERING<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER</b></div><div style="color: blue;"> </div><div style="color: blue; text-align: justify;"><b>CS1353 SOFTWARE ENGINEERING 3 0 0 100</b></div><div style="text-align: justify;"> </div><div style="text-align: justify;">AIM<br />
To introduce the methodologies involved in the development and maintenance of software (i.e) over its entire life cycle.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">OBJECTIVE<br />
To be aware of <br />
• Different life cycle models<br />
• Requirement dictation process<br />
• Analysis modeling and specification<br />
• Architectural and detailed design methods<br />
• Implementation and testing strategies <br />
• Verification and validation techniques<br />
• Project planning and management<br />
• Use of CASE tools </div><a name='more'></a><br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I SOFTWARE PROCESS 9<br />
Introduction –S/W Engineering Paradigm – life cycle models (water fall, incremental, spiral, WINWIN spiral, evolutionary, prototyping, object oriented) - system engineering – computer based system – verification – validation – life cycle process – development process –system engineering hierarchy. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II SOFTWARE REQUIREMENTS 9<br />
Functional and non-functional - user – system –requirement engineering process – feasibility studies – requirements – elicitation – validation and management – software prototyping – prototyping in the software process – rapid prototyping techniques – user interface prototyping -S/W document. Analysis and modeling – data, functional and behavioral models – structured analysis and data dictionary.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III DESIGN CONCEPTS AND PRINCIPLES 9<br />
Design process and concepts – modular design – design heuristic – design model and document. Architectural design – software architecture – data design – architectural design – transform and transaction mapping – user interface design – user interface design principles. Real time systems - Real time software design – system design – real time executives – data acquisition system - monitoring and control system. SCM – Need for SCM – Version control – Introduction to SCM process – Software configuration items. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV TESTING 9<br />
Taxonomy of software testing – levels – test activities – types of s/w test – black box testing – testing boundary conditions – structural testing – test coverage criteria based on data flow mechanisms – regression testing – testing in the large. S/W testing strategies – strategic approach and issues - unit testing – integration testing – validation testing – system testing and debugging.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V SOFTWARE PROJECT MANAGEMENT 9 <br />
Measures and measurements – S/W complexity and science measure – size measure – data and logic structure measure – information flow measure. Software cost estimation – function point models – COCOMO model- Delphi method.- Defining a Task Network – Scheduling – Earned Value Analysis – Error Tracking - Software changes – program evolution dynamics – software maintenance – Architectural evolution. Taxonomy of CASE tools.<br />
<br />
TOTAL : 45<br />
TEXT BOOK<br />
1. Roger S.Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill International Edition, 5th edition, 2001.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES<br />
1. Ian Sommerville, Software engineering, Pearson education Asia, 6th edition, 2000.<br />
2. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997.<br />
3. James F Peters and Witold Pedryez, “Software Engineering – An Engineering Approach”, John Wiley and Sons, New Delhi, 2000.<br />
4. Ali Behforooz and Frederick J Hudson, “Software Engineering Fundamentals”, Oxford University Press, New Delhi, 1996.<br />
</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-61020048975057374392010-09-16T19:11:00.001-07:002010-09-16T19:11:24.434-07:00CS1352 PRINCIPLES OF COMPILER DESIGN<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER</b></div><div style="color: blue;"> </div><div style="color: blue; text-align: justify;"><b>CS1352 PRINCIPLES OF COMPILER DESIGN 3 1 0 100</b></div><div style="color: blue; text-align: justify;"> </div><div style="text-align: justify;"><b><span style="color: blue;">AIM</span></b><br />
At the end of the course the student will be able to design and implement a simple compiler.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">OBJECTIVES<br />
• To understand, design and implement a lexical analyzer.<br />
• To understand, design and implement a parser.<br />
• To understand, design code generation schemes.<br />
• To understand optimization of codes and runtime environment.</div><a name='more'></a><br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I INTRODUCTION TO COMPILING 9<br />
Compilers – Analysis of the source program – Phases of a compiler – Cousins of the Compiler – Grouping of Phases – Compiler construction tools – Lexical Analysis – Role of Lexical Analyzer – Input Buffering – Specification of Tokens.<br />
<br />
UNIT II SYNTAX ANALYSIS 9 <br />
Role of the parser –Writing Grammars –Context-Free Grammars – Top Down parsing – Recursive Descent Parsing – Predictive Parsing – Bottom-up parsing – Shift Reduce Parsing – Operator Precedent Parsing – LR Parsers – SLR Parser – Canonical LR Parser – LALR Parser.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III INTERMEDIATE CODE GENERATION 9<br />
Intermediate languages – Declarations – Assignment Statements – Boolean Expressions – Case Statements – Back patching – Procedure calls.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV CODE GENERATION 9<br />
Issues in the design of code generator – The target machine – Runtime Storage management – Basic Blocks and Flow Graphs – Next-use Information – A simple Code generator – DAG representation of Basic Blocks – Peephole Optimization.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V CODE OPTIMIZATION AND RUN TIME ENVIRONMENTS 9<br />
Introduction– Principal Sources of Optimization – Optimization of basic Blocks – Introduction to Global Data Flow Analysis – Runtime Environments – Source Language issues – Storage Organization – Storage Allocation strategies – Access to non-local names – Parameter Passing. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">TUTORIAL 15</div><div style="text-align: justify;"> </div><div style="text-align: justify;"> TOTAL : 60<br />
TEXT BOOK<br />
1. Alfred Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers Principles, Techniques and Tools”, Pearson Education Asia, 2003.</div><div style="text-align: justify;"> </div><div style="text-align: justify;"> REFERENCES<br />
1. Allen I. Holub “Compiler Design in C”, Prentice Hall of India, 2003.<br />
2. C. N. Fischer and R. J. LeBlanc, “Crafting a compiler with C”, Benjamin Cummings, 2003.<br />
3. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, Tata McGraw-Hill, 2003.<br />
4. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001.<br />
5. Kenneth C. Louden, “Compiler Construction: Principles and Practice”, Thompson Learning, 2003</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-85317746735973342202010-09-16T19:10:00.001-07:002010-09-16T19:10:57.676-07:00CS1351 ARTIFICIAL INTELLIGENCE<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><strong>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER</strong></div><div> </div><div style="color: blue; text-align: justify;"><strong>CS1351 ARTIFICIAL INTELLIGENCE 3 0 0 100<a name='more'></a></strong></div><div style="text-align: justify;"> </div><div style="text-align: justify;">AIM<br />
Artificial Intelligence aims at developing computer applications, which encompasses perception, reasoning and learning and to provide an in-depth understanding of major techniques used to simulate intelligence.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">OBJECTIVE<br />
• To provide a strong foundation of fundamental concepts in Artificial Intelligence<br />
• To provide a basic exposition to the goals and methods of Artificial Intelligence<br />
• To enable the student to apply these techniques in applications which involve perception, reasoning and learning. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I INTRODUCTION 8<br />
Intelligent Agents – Agents and environments - Good behavior – The nature of environments – structure of agents - Problem Solving - problem solving agents – example problems – searching for solutions – uniformed search strategies - avoiding repeated states – searching with partial information.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II SEARCHING TECHNIQUES 10<br />
Informed search and exploration – Informed search strategies – heuristic function – local search algorithms and optimistic problems – local search in continuous spaces – online search agents and unknown environments - Constraint satisfaction problems (CSP) – Backtracking search and Local search for CSP – Structure of problems - Adversarial Search – Games – Optimal decisions in games – Alpha – Beta Pruning – imperfect real-time decision – games that include an element of chance.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III KNOWLEDGE REPRESENTATION 10<br />
First order logic – representation revisited – Syntax and semantics for first order logic – Using first order logic – Knowledge engineering in first order logic - Inference in First order logic – prepositional versus first order logic – unification and lifting – forward chaining – backward chaining - Resolution - Knowledge representation - Ontological Engineering - Categories and objects – Actions - Simulation and events - Mental events and mental objects</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV LEARNING 9<br />
Learning from observations - forms of learning - Inductive learning - Learning decision trees - Ensemble learning - Knowledge in learning – Logical formulation of learning – Explanation based learning – Learning using relevant information – Inductive logic programming - Statistical learning methods - Learning with complete data - Learning with hidden variable - EM algorithm - Instance based learning - Neural networks - Reinforcement learning – Passive reinforcement learning - Active reinforcement learning - Generalization in reinforcement learning.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V APPLICATIONS 8<br />
Communication – Communication as action – Formal grammar for a fragment of English – Syntactic analysis – Augmented grammars – Semantic interpretation – Ambiguity and disambiguation – Discourse understanding – Grammar induction - Probabilistic language processing - Probabilistic language models – Information retrieval – Information Extraction – Machine translation.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">TOTAL : 45<br />
TEXT BOOK<br />
1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, 2nd Edition, Pearson Education / Prentice Hall of India, 2004.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES<br />
1. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd., 2000.<br />
2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata McGraw-Hill, 2003.<br />
3. George F. Luger, “Artificial Intelligence-Structures And Strategies For Complex Problem Solving”, Pearson Education / PHI, 2002.<br />
</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-10997942088624647622010-09-14T19:20:00.003-07:002010-09-14T19:20:56.943-07:00IT1252 DIGITAL SIGNAL PROCESSING<span id="goog_841625761"></span><img align="left" alt="EMB2" height="117" hspace="12" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjKjo9D2rQQ5QPUZXdGZuSZFP3FE7PvF-N8IJO-9zglElJBr9yPzHvyu4zlDE_bDc1BKG8JWHX0qm9OB2ctUrDBeFbD1SzLAnfTDQ3cew5Rc6022nuthpWo8a5x-grGHdsDo6H0GUk-f0I/s400/annauniv_logo.gif" width="131" /><span id="goog_841625762"></span><b style="color: blue;">ANNA UNIVERSITY CHENNAI:: CHENNAI 600 025<br />
CURRICULUM 2004 <br />
B.TECH. INFORMATION TECHNOLOGY<br />
SEMESTER IV</b> <br />
<div style="color: blue;"><b>IT1252 DIGITAL SIGNAL PROCESSING</b></div><div style="color: blue;"><b>AIM</b></div>To review signals and systems, study DFT and FFT, discuss the design of IIR & FIR filters and study typical applications of digital signal processing.<br />
<div style="color: blue;"><b>OBJECTIVES</b></div>• To have an overview of signals and systems.<br />
• To study DFT & FFT<br />
• To study the design of IIR filters.<br />
• To study the design of FIR filters.<br />
• To study the effect of finite word lengths & applications of DSP<br />
<a name='more'></a><br />
UNIT I SIGNALS AND SYSTEMS 9<br />
Basic elements of digital signal Processing –Concept of frequency in continuous time and discrete time signals – Sampling theorem –Discrete time signals. Discrete time systems – Analysis of Linear time invariant systems –Z transform –Convolution and correlation. <br />
UNIT II FAST FOURIER TRANSFORMS 9 <br />
Introduction to DFT – Efficient computation of DFT Properties of DFT – FFT algorithms – Radix-2 and Radix-4 FFT algorithms – Decimation in Time – Decimation in Frequency algorithms –Use of FFT algorithms in Linear Filtering and correlation.<br />
UNIT III IIR FILTER DESIGN 9 <br />
Structure of IIR – System Design of Discrete time IIR filter from continuous time filter – IIR filter design by Impulse Invariance. Bilinear transformation – Approximation derivatives – Design of IIR filter in the Frequency domain.<br />
UNIT IV FIR FILTER DESIGN 9 <br />
Symmetric & Antisymteric FIR filters – Linear phase filter – Windowing technique – Rectangular, Kaiser windows – Frequency sampling techniques – Structure for FIR systems.<br />
UNIT V FINITE WORD LENGTH EFFECTS 9<br />
Quantization noise – derivation for quantization noise power – Fixed point and binary floating point number representation – comparison – over flow error – truncation error – co-efficient quantization error - limit cycle oscillation – signal scaling – analytical model of sample and hold operations – Application of DSP – Model of Speech Wave Form – Vocoder.<br />
TUTORIAL 15 <br />
TOTAL : 60<br />
TEXT BOOK<br />
1. John G Proakis and Dimtris G Manolakis, “Digital Signal Processing Principles, Algorithms and Application”, PHI/Pearson Education, 2000, 3rd Edition.<br />
REFERENCES<br />
1. Alan V Oppenheim, Ronald W Schafer and John R Buck, “Discrete Time Signal Processing”, PHI/Pearson Education, 2000, 2nd Edition.<br />
2. Johny R.Johnson, “Introduction to Digital Signal Processing”, Prentice Hall of India/Pearson Education, 2002.<br />
3. Sanjit K.Mitra, “Digital Signal Processing: A Computer – Based Approach”, Tata McGraw-Hill, 2001, Second Edition.GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-20269770833303137122010-09-14T19:20:00.001-07:002010-09-14T19:20:11.478-07:00CS1404 INTERNET PROGRAMMING LABORATORY<div style="text-align: justify;"> <b style="color: blue;">CS1404 INTERNET PROGRAMMING LABORATORY 0 3 100 </b></div><div style="color: blue; text-align: justify;"><b>LIST OF EXPERIMENTS</b></div><div> </div><div style="text-align: justify;">1. Write programs in Java to demonstrate the use of following components Text fields, buttons, Scrollbar, Choice, List and Check box <br />
2. Write Java programs to demonstrate the use of various Layouts like Flow Layout, Border Layout, Grid layout, Grid bag layout and card layout<br />
3. Write programs in Java to create applets incorporating the following features:<br />
• Create a color palette with matrix of buttons<br />
• Set background and foreground of the control text area by selecting a color from color palette.<br />
• In order to select Foreground or background use check box control as radio buttons<br />
• To set background images<br />
4. Write programs in Java to do the following.</div><a name='more'></a><br />
• Set the URL of another server.<br />
• Download the homepage of the server.<br />
• Display the contents of home page with date, content type, and Expiration date. Last modified and length of the home page.<br />
5. Write programs in Java using sockets to implement the following:<br />
• HTTP request<br />
• FTP<br />
• SMTP<br />
• POP3 <br />
6. Write a program in Java for creating simple chat application with datagram sockets and datagram packets.<br />
7. Write programs in Java using Servlets:<br />
• To invoke servlets from HTML forms <br />
• To invoke servlets from Applets<br />
8. Write programs in Java to create three-tier applications using servlets <br />
• for conducting on-line examination.<br />
• for displaying student mark list. Assume that student information is available in a database which has been stored in a database server.<br />
9. Create a web page with the following using HTML<br />
i) To embed a map in a web page <br />
ii) To fix the hot spots in that map<br />
iii) Show all the related information when the hot spots are clicked.<br />
10. Create a web page with the following.<br />
i) Cascading style sheets.<br />
ii) Embedded style sheets.<br />
iii) Inline style sheets.<br />
iv) Use our college information for the web pages.GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-48449297421325809322010-09-14T19:19:00.001-07:002010-09-14T19:19:16.713-07:00CS1403 CASE TOOLS LAB<div style="text-align: justify;"> <b style="color: blue;">CS1403 CASE TOOLS LAB 0 3 100 </b></div><div style="text-align: justify;">1. Prepare the following documents for two or three of the experiments listed below and develop the software engineering methodology.<br />
2. Program Analysis and Project Planning.<br />
Thorough study of the problem – Identify project scope, Objectives, Infrastructure.<br />
3. Software requirement Analysis<br />
Describe the individual Phases / Modules of the project, Identify deliverables.<br />
4. Data Modeling<br />
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test lass diagrams, Sequence diagrams and add interface to class diagrams.<br />
5. Software Development and Debugging <br />
6. Software Testing <br />
Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop test case hierarchy, Site check and Site monitor.</div><div> </div><div style="text-align: justify;"> <span style="color: blue;">SUGGESTED LIST OF APPLICATIONS</span><br />
1. Student Marks Analyzing System<br />
2. Quiz System<br />
3. Online Ticket Reservation System<br />
4. Payroll System<br />
5. Course Registration System<br />
6. Expert Systems<br />
7. ATM Systems<br />
8. Stock Maintenance<br />
9. Real-Time Scheduler<br />
10. Remote Procedure Call Implementation</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-65779944978191689592010-09-14T19:18:00.001-07:002010-09-14T19:18:49.274-07:00CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER </b></div><div style="color: blue;"> </div><div style="color: blue; text-align: justify;"><b>CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN 3 1 0 100 </b></div><div style="text-align: justify;"> </div><div style="text-align: justify;">AIM <br />
To understand the concepts of object oriented analysis and design. <br />
<b style="color: blue;">OBJECTIVES</b><br />
• To understand the object oriented life cycle.<br />
• To know how to identify objects, relationships, services and attributes through UML.<br />
• To understand the use-case diagrams.<br />
• To know the Object Oriented Design process.<br />
• To know about software quality and usability.</div><a name='more'></a><br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I INTRODUCTION 8<br />
An Overview of Object Oriented Systems Development - Object Basics – Object Oriented Systems Development Life Cycle.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II OBJECT ORIENTED METHODOLOGIES 12<br />
Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks – Unified Approach – Unified Modeling Language – Use case - class diagram - Interactive Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity Diagram.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III OBJECT ORIENTED ANALYSIS 9<br />
Identifying use cases - Object Analysis - Classification – Identifying Object relationships - Attributes and Methods.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV OBJECT ORIENTED DESIGN 8<br />
Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V SOFTWARE QUALITY AND USABILITY 8<br />
Designing Interface Objects – Software Quality Assurance – System Usability - Measuring User Satisfaction <br />
<br />
TUTORIAL 15 <br />
<br />
TOTAL : 60<br />
<br />
TEXT BOOKS<br />
1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 1999 (Unit I, III, IV, V).<br />
2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002. (UNIT II)</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES<br />
1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-Hill, 2003.<br />
2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language Reference Manual”, Addison Wesley, 1999.<br />
3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG Press Wiley Publishing Inc., 2004.</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-38970776800585855582010-09-14T19:17:00.001-07:002010-09-14T19:17:53.716-07:00CS1401 INTERNET PROGRAMMING<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER </b></div><div style="color: blue;"> </div><div style="color: blue; text-align: justify;"><b>CS1401 INTERNET PROGRAMMING 3 0 0 100 </b></div><div style="text-align: justify;"> </div><div style="text-align: justify;">AIM<br />
To explain Internet Programming concepts and related programming and scripting languages.</div><div style="text-align: justify;"> </div><div style="text-align: justify;"><b style="color: blue;">OBJECTIVES</b><br />
• To describe basic Internet Protocols.<br />
• Explain JAVA and HTML tools for Internet programming.<br />
• Describe scripting languages – Java Script.<br />
• Explain dynamic HTML programming.<br />
• Explain Server Side Programming tools.</div><a name='more'></a><br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I BASIC NETWORK AND WEB CONCEPTS 9<br />
Internet standards – TCP and UDP protocols – URLs – MIME – CGI – Introduction to SGML. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II JAVA PROGRAMMING 9<br />
Java basics – I/O streaming – files – Looking up Internet Address - Socket programming – client/server programs – E-mail client – SMTP - POP3 programs – web page retrieval – protocol handlers – content handlers - applets – image handling - Remote Method Invocation. <br />
<br />
UNIT III SCRIPTING LANGUAGES 9<br />
HTML – forms – frames – tables – web page design - JavaScript introduction – control structures – functions – arrays – objects – simple web applications </div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV DYNAMIC HTML 9<br />
Dynamic HTML – introduction – cascading style sheets – object model and collections – event model – filters and transition – data binding – data control – ActiveX control – handling of multimedia data <br />
<br />
UNIT V SERVER SIDE PROGRAMMING 9<br />
Servlets – deployment of simple servlets – web server (Java web server / Tomcat / Web logic) – HTTP GET and POST requests – session tracking – cookies – JDBC – simple web applications – multi-tier applications. <br />
<br />
TOTAL : 45<br />
TEXT BOOKS<br />
1. Deitel, Deitel and Nieto, “Internet and World Wide Web – How to program”, Pearson Education Publishers, 2000.<br />
2. Elliotte Rusty Harold, “Java Network Programming”, O’Reilly Publishers, 2002</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES<br />
1. R. Krishnamoorthy & S. Prabhu, “Internet and Java Programming”, New Age International Publishers, 2004.<br />
2. Thomno A. Powell, “The Complete Reference HTML and XHTML”, fourth edition, Tata McGraw Hill, 2003.<br />
3. Naughton, “The Complete Reference – Java2”, Tata McGraw-Hill, 3rd edition, 1999.</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-30087258208076417182010-09-13T19:25:00.000-07:002010-09-13T19:25:03.021-07:00IT1402 MOBILE COMPUTING<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><strong>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER</strong></div><div> </div><div style="color: blue; text-align: justify;"><strong>IT1402 MOBILE COMPUTING 3 0 0 100</strong></div><div style="text-align: justify;"> </div><div style="text-align: justify;"><b style="color: blue;">AIM</b><br />
To provide basics for various techniques in Mobile Communications and Mobile Content services.</div><div style="text-align: justify;"> </div><div style="text-align: justify;"><b style="color: blue;">OBJECTIVES</b><br />
• To learn the basics of Wireless voice and data communications technologies.<br />
• To build working knowledge on various telephone and satellite networks.<br />
• To study the working principles of wireless LAN and its standards.<br />
• To build knowledge on various Mobile Computing algorithms.<br />
• To build skills in working with Wireless application Protocols to develop mobile content applications.</div><a name='more'></a><br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9<br />
Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II TELECOMMUNICATION NETWORKS 11<br />
Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite Networks - Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast Systems – DAB - DVB.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III WIRLESS LAN 9<br />
Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE 802.11a - 802.11b standards – HIPERLAN – Blue Tooth.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV MOBILE NETWORK LAYER 9<br />
Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – Alternative Metrics.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V TRANSPORT AND APPLICATION LAYERS 7<br />
Traditional TCP – Classical TCP improvements – WAP, WAP 2.0.<br />
TOTAL : 45<br />
TEXT BOOKS<br />
1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. <br />
(Unit I Chap 1,2 &3- Unit II chap 4,5 &6-Unit III Chap 7.Unit IV Chap 8- Unit V Chap 9&10.) <br />
2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2002. (Unit I Chapter – 7&10-Unit II Chap 9)</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES<br />
1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education, 2003.<br />
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile Computing”, Springer, New York, 2003.<br />
3. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.<br />
</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-60058354598794688472010-09-12T19:11:00.004-07:002010-09-12T19:11:46.538-07:00MG1351 PRINCIPLES OF MANAGEMENT<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V</b></div><div style="color: blue;"> </div><div style="text-align: justify;"><b style="color: blue;">MG1351 PRINCIPLES OF MANAGEMENT 3 0 0 100</b><br />
(Common to all Branches)</div><div style="text-align: justify;"> </div><div style="text-align: justify;">OBJECTIVE<br />
Knowledge on the principles of management is essential for all kinds of people in all kinds of organizations. After studying this course, students will be able to have a clear understanding of the managerial functions like planning, organizing, staffing, leading and controlling. Students will also gain some basic knowledge on international aspect of management. </div><a name='more'></a><br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">1. HISTORICAL DEVELOPMENT 9<br />
Definition of Management – Science or Art – Management and Administration – Development of Management Thought – Contribution of Taylor and Fayol – Functions of Management – Types of Business Organisation.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">2. PLANNING 9<br />
Nature & Purpose – Steps involved in Planning – Objectives – Setting Objectives – Process of Managing by Objectives – Strategies, Policies & Planning Premises- Forecasting – Decision-making.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">3. ORGANISING 9 <br />
Nature and Purpose – Formal and informal organization – Organization Chart – Structure and Process – Departmentation by difference strategies – Line and Staff authority – Benefits and Limitations – De-Centralization and Delegation of Authority – Staffing – Selection Process - Techniques – HRD – Managerial Effectiveness.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">4. DIRECTING 9<br />
Scope – Human Factors – Creativity and Innovation – Harmonizing Objectives – Leadership – Types of Leadership Motivation – Hierarchy of needs – Motivation theories – Motivational Techniques – Job Enrichment – Communication – Process of Communication – Barriers and Breakdown – Effective Communication – Electronic media in Communication.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">5. CONTROLLING 9<br />
System and process of Controlling – Requirements for effective control – The Budget as Control Technique – Information Technology in Controlling – Use of computers in handling the information – Productivity – Problems and Management – Control of Overall Performance – Direct and Preventive Control – Reporting – The Global Environment – Globalization and Liberalization – International Management and Global theory of Management.</div><div style="text-align: justify;"> </div><div style="text-align: justify;"> TOTAL : 45<br />
TEXT BOOKS<br />
1. Harold Kooritz & Heinz Weihrich “Essentials of Management”, Tata McGraw-Hill, 1998.<br />
2. Joseph L Massie “Essentials of Management”, Prentice Hall of India, (Pearson) Fourth Edition, 2003.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES<br />
1 Tripathy PC And Reddy PN, “ Principles of Management”, Tata McGraw-Hill, 1999.<br />
2. Decenzo David, Robbin Stephen A, ”Personnel and Human Reasons Management”, Prentice Hall of India, 1996<br />
3. JAF Stomer, Freeman R. E and Daniel R Gilbert Management, Pearson Education, Sixth Edition, 2004.<br />
4. Fraidoon Mazda, “Engineering Management”, Addison Wesley, 2000.</div><div style="text-align: justify;"> </div><div style="text-align: justify;"> Richard Johnsonbaugh, “Discrete Mathematics”, Fifth Edition, Pearson Education Asia, New Delhi, 2002.</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-54339854429737534542010-09-12T19:11:00.002-07:002010-09-12T19:11:24.746-07:00MA1256 DISCRETE MATHEMATICS<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V</b></div><div style="color: blue;"> </div><div style="text-align: justify;"><b style="color: blue;">MA1256 DISCRETE MATHEMATICS 3 1 0 100</b><br />
<br />
AIM<br />
To extend student’s mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">OBJECTIVES<br />
At the end of the course, students would<br />
• Have knowledge of the concepts needed to test the logic of a program.<br />
• Have gained knowledge which has application in expert system, in data base and a basic for the prolog language.<br />
• Have an understanding in identifying patterns on many levels.<br />
• Be aware of a class of functions which transform a finite set into another finite set which relates to input output functions in computer science. <br />
• Be exposed to concepts and properties of algebraic structures such as semigroups, monoids and groups.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT I PROPOSITIONAL CALCULUS 10 + 3</div><a name='more'></a><br />
Propositions – Logical connectives – Compound propositions – Conditional and biconditional propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical equivalences and implications – DeMorgan’s Laws - Normal forms – Principal conjunctive and disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.<br />
<div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT II PREDICATE CALCULUS 9 + 3<br />
Predicates – Statement function – Variables – Free and bound variables – Quantifiers – Universe of discourse – Logical equivalences and implications for quantified statements – Theory of inference – The rules of universal specification and generalization – Validity of arguments.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT III SET THEORY 10 + 3<br />
Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and Cartesian product – Relations on sets –Types of relations and their properties – Relational matrix and the graph of a relation – Partitions – Equivalence relations – Partial ordering – Poset – Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra – Homomorphism.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT IV FUNCTIONS 7 + 3<br />
Definitions of functions – Classification of functions –Type of functions - Examples – Composition of functions – Inverse functions – Binary and n-ary operations – Characteristic function of a set – Hashing functions – Recursive functions – Permutation functions.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">UNIT V GROUPS 9 + 3<br />
Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids – Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange’s theorem – Normal subgroups – Normal algebraic system with two binary operations - Codes and group codes – Basic notions of error correction - Error recovery in group codes. </div><div style="text-align: justify;"> </div><div style="text-align: justify;">TUTORIAL 15</div><div style="text-align: justify;"> </div><div style="text-align: justify;">TOTAL : 60<br />
TEXT BOOKS<br />
1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.<br />
2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”, Fourth Edition, Pearson Education Asia, Delhi, 2002.</div><div style="text-align: justify;"> </div><div style="text-align: justify;">REFERENCES<br />
1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.<br />
2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Fifth Edition, Tata McGraw – Hill Pub. Co. Ltd., New Delhi, 2003.<br />
3.</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-33197550857847787912010-09-12T19:11:00.000-07:002010-09-12T19:11:02.575-07:00CS1307 DATABASE MANAGEMENT SYSTEMS LAB<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V</b></div><div style="color: blue;"> </div><div style="color: blue; text-align: justify;"><b>CS1307 DATABASE MANAGEMENT SYSTEMS LAB 0 0 3 100</b></div><div style="color: blue; text-align: justify;"> </div><div style="text-align: justify;"><b style="color: blue;">LIST OF EXPERIMENTS</b><br />
1. Data Definition Language (DDL) commands in RDBMS.<br />
2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.<br />
3. High-level language extension with Cursors.<br />
4. High level language extension with Triggers<br />
5. Procedures and Functions.<br />
6. Embedded SQL.<br />
7. Database design using E-R model and Normalization.<br />
8. Design and implementation of Payroll Processing System.<br />
9. Design and implementation of Banking System.<br />
10. Design and implementation of Library Information System.<br />
</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-67111978595182614582010-09-12T19:10:00.001-07:002010-09-12T19:10:26.967-07:00CS1306 MICROPROCESSORS AND MICROCONTROLLERS LAB<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V</b></div><div style="color: blue; text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>CS1306 MICROPROCESSORS AND MICROCONTROLLERS LAB 0 0 3 100</b></div><div style="color: blue; text-align: justify;"> </div><b style="color: blue;">LIST OF EXPERIMENTS</b><br />
<div style="text-align: justify;"> 1. Programming with 8085 – 8-bit / 16-bit multiplication/division using repeated addition/subtraction<br />
2. Programming with 8085-code conversion, decimal arithmetic, bit manipulations.<br />
3. Programming with 8085-matrix multiplication, floating point operations<br />
4. Programming with 8086 – String manipulation, search, find and replace, copy operations, sorting. (PC Required)<br />
5. Using BIOS/DOS calls: Keyboard control, display, file manipulation. (PC Required)<br />
6. Using BIOS/DOS calls: Disk operations. (PC Required)<br />
7. Interfacing with 8085/8086 – 8255, 8253<br />
8. Interfacing with 8085/8086 – 8279,8251<br />
9. 8051 Microcontroller based experiments – Simple assembly language programs (cross assembler required).<br />
10. 8051 Microcontroller based experiments – Simple control applications (cross assembler required).<br />
</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0tag:blogger.com,1999:blog-6415044635689191798.post-79449054395276395212010-09-12T19:09:00.007-07:002010-09-12T19:09:59.493-07:00CS1305 NETWORK LAB<div style="text-align: justify;"> </div><div style="color: blue; text-align: justify;"><b>ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025<br />
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING<br />
(Offered in Colleges affiliated to Anna University)<br />
CURRICULUM AND SYLLABUS – REGULATIONS – 2004 SEMESTER V</b></div><div style="color: blue;"> </div><div style="text-align: justify;"><b style="color: blue;">CS1305 NETWORK LAB 0 0 3 100</b><br />
(All the programs are to be written using C)</div><div style="text-align: justify;"> </div><div style="text-align: justify;">1. Simulation of ARP / RARP.<br />
2. Write a program that takes a binary file as input and performs bit stuffing and CRC Computation.<br />
3. Develop an application for transferring files over RS232.<br />
4. Simulation of Sliding-Window protocol.<br />
5. Simulation of BGP / OSPF routing protocol.<br />
6. Develop a Client – Server application for chat.<br />
7. Develop a Client that contacts a given DNS Server to resolve a given host name.<br />
8. Write a Client to download a file from a HTTP Server.<br />
9 &10 Study of Network Simulators like NS2/Glomosim / OPNET .</div>GKhttp://www.blogger.com/profile/01895247047553790394noreply@blogger.com0