Guidelines for B.Sc.(H) Computer Science Semester VI These are only guidelines and in no case to be treated as syllabus.

The guidelines may be updated from time to time. Click here for changes that were made in September, 2008.
January 24, 2007 601 – Theory of Computation Sr. No.
1

Topic

Chapter

Reference

Languages: Alphabets, string, language, Basic Operations on language, Concatenation, Kleene Star Regular Languages: (a) Regular Expressions (b) DFA Concepts of TGs & GTGs (C) NFA (d) Regular languages (e) Pumping Theorem

2

1

2

(f) Design of lex 3 Context free languages: (a) Context free grammars (b) Pushdown automata (c) Pumping Theorem

4 5 6 7 9 10 (Definition Regular languages, Theorem 13 and 14 with examples) 3.3.2

1 1 1 1 1 1

2

12 14 16 theorem 35 theorem 36 7.2.2

1 1 1 or 2 2 3

(d) Properties of context free languages Models of Computations: (a) RAM, TM (b) UTM, Language acceptability decidability, insolvability problems (Excluding Tiling Problem, Rice Theorem, Proof of Undecidable Problems of CFG)

7.3 Ch. 4 till 4.5 And 4.7 (Introduction) 5

3

References
1 Daniel I.A.Cohen, Introduction to computer theory, Second Edition (2000) - John Wiley.

Introduction to Automata theory.Foley – Computer Graphics: Principles & Practice –II Edition Donald Hearn & MP Baker – Computer Graphics. 5 6 7 8 9 Nemeth Synder & Hein. Language & Computation – II Edition. D. Aho. Richard Stevens. Aho. Multimedia in Practice .Cohen.Jeffcoate. 602. Operations Research 11 Rich & Knight. 3 References For Paper No. II Edition.F. 603. Elements of the theory of computation – II Edition PHI. J. PHI D.W. 605 1 2 Daniel I.A.A.Taha.2 Hoperoft.I and Expert Systems – PHI 13 J.Rogers. Patterson. Introduction to A. Elements of the theory of computation – II Edition PHI W. Language & Computation – II Edition. Lewis & Papadimitriou. Adams – Mathematical Elements for computer Graphics. Unix Network Programming Networking APIS:Sockets & XTI – Vol. Introduction to Automata theory.T.D. Pearson Education. Pearson Education. 3 4 Lewis & Papadimitriou. 601. Ullman. Ullman.Ravindran. Operations Research: An Introduction – Seventh Edition 10 A. Introduction to computer theory – John Wiley (1986) Hoperoft. Linux Administration Handbook – Pearson Edition J. 1 2nd Edition. II Edition H.Solberg.S. Artificial Intelligence – Tata McGraw Hill 12 DAN.Phillips. 604.

Implement UDP Echo Client & UDP Echo Server ( Concurrent) 4. Implement TCP daytime Client & TCP daytime Server ( Iterative) 3. Implement UDP daytime Client & UDP daytime Server ( Iterative) 5. Unix Network Programming Networking APIS:Sockets & XTI – Vol.1 – 10.602 – Network Programming and Administration Sr. Richard Stevens. 1 2 3 4 5 6 7 8 9 10 11 Topic Chapter Reference Introduction Transport Layer : TCP & UDP Sockets Introduction Elementary TCP Sockets TCP Client-Server Example I/O Multiplexing Socket Options Title????? Elementary Name & Address Conversions IPV4 & IPV6 Interoperability TCP/IP Networking 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 12 Networking Management & Debugging 10. . Nemeth Synder & Hein. Linux Administration Handbook – Pearson Edition Suggested Practicals: 1. No. Implement TCP Echo Client & TCP Echo Server ( Concurrent) 2.3 1 Chapter 13 Upto pg 2 264 ( Self Study) Pg 264 – 274 Pg 278 – 302 20 2 References: 1 2 W. 1 2nd Edition. Write a program to print all IP addresses of a host machine.

PHI D.1 – 11.2.2.2.1.3 (leaving 2nd order differentials order) 2. 11. 1 Topic Overview of CG sys.) (introduction of 11.9 only) 3 till 3.4. Adams – Mathematical Elements for computer Graphics. No. II Edition.17.Rogers. 15. II Edition . Chapter 2 8(8.1 – 14.7 – 11.D.7.2.5 2 16 2 3 3 1 References: 1 2 3 J.603 – Computer Graphic Sr.2.Foley – Computer Graphics: Principles & Practice –II Edition Donald Hearn & MP Baker – Computer Graphics. 15.F.1 1 14. 11.4. 3 2 2 3 1 Reference 3 Raster Graphics Clipping Transformation & Viewing Geometric Modeling 4 5 6 7 8 Hidden lines and surfaces Shading Animation 11.5.2 only) 1 (1.5(Defenitions only)).3 (just def.10 15.

5. Implement scan conversion algorithm – DDA. WAP to draw a polygon and fill it using scan-line fill algorithm. 7.g. midpt ellipse (create a library). WAP to draw a line and clip it with a window using – (i) cohen suther and (ii) cyrus-bick algorithm. 2-D object. 6. WAP to implement buffer algorithm. style. 3. WAP to draw a line with following attributes – width. B WAP to translate. WAP to create any new font e. mid-pt circle. 11. color. A. 9. scale & rotate any list. 4. WAP to display a cubic parametric termite & bezier curve. 8.Practical List 1. . WAP to implement Sutherland hodgeman algorithm of polygon clipping. WAP to model a 3-dimentional object say a cube and project it using parallel and puspective projection. 2. 10. Bresenham. WAP to show sun rise and sun set.

3. 2.604 – Operational Research Techniques Sr.Solberg. 1 2 3 4 5 6 7 Topic The nature of Operations Research Introduction to Linear Programming The Simplex Method Duality and Sensitivity Analysis Transportation Model and its variants Decision Analysis and Games Network Analysis Chapter 1.2.4 2.S.T.1.7 Pages 109-118 (PERT) 122-126 10. Kantiswaroop & Manmohan Gupta.Ravindran. J. 3.2.4.2.4.3.1.2. 3.5.4 4.2. Operations Research.2 ( Graphical approach only) 3.Taha.5.1.3.3.11 20. D.3.2 Wolfe’s method to be done from any other book on operations research 2 1 1 1 1 1 2 Reference 8 Deterministic Dynamic Programming 1 9 10 Queuing Models Classical Optimization Theory 2 1 References: 1 2 H.1.2. (Page 403 onwards) 10.1 14.2. (selected applications libe knapsack problem/Cargo loading problem 7.1 – 7. Introduction to operational Research.5.3.1.1.3.4.1.Phillips.1.1.1 – 1.4.2.A.4. No.2.5.4. 10.14.3.3. .2.3.1.1 5. Operations Research: An Introduction – Seventh Edition A.

605 – Artificial Intelligence Sr. 1 2 3 4 5 6 7 8 9 10 11 Topic Chapter Reference What is Artificial Intelligence Problems. frames & related structures Natural language processing Pattern Recognition Expert Systems Architectures 1 2 2 3 4 5 6 7 12 13 15 1 1 1 2 2 2 2 2 2 2 2 References: 1 2 Rich & Knight. Problem Spaces and Search Heuristic Search Techniques Lisp and other AI Programming Language Formalized symbolic logics Dealing with inconsistencies uncertainties Probabilistic Reasoning Structured knowledge: graph. Artificial Intelligence – Tata McGraw Hill DAN. Patterson. No. Introduction to A.I and Expert Systems – PHI .W.

1.1.1.3 6. 13. 5.2. Use filters to display an image in grey scale. 5. 3. 8.3 9. Create a script that repeatedly flashes an image on the screen (fade in fade out).2. 2.3. 4.1.3 7. TMH © 2006 Practicals: HTML done in 1st Semester to be used for operating MM files using different audio & video compression like JPEG. 6. MPEG.3.Multimedia in Practice Principles of Multimedia by Ranjan Parekh. 6. 7. 12. LIST (Using Javascript HTML) 1. 8. x-ray normal.2 4 5. Program to make playlist of songs.No. 1.2. .6. Also inters pence image with text. Create a script that repeatedly zooms in and zooms out an image on the screen. 7. 9. Allow user to control blink speed.605 – Multimedia Applications Sr. Program to make playlist of videos.3 8. Topic 1 2 3. MULTIMEDIA LAB. 11. 10. invert. 9. 4. Jeffcoate.1 12 13 16.3 Virtual Reality (Xerox Notes) Reference 1 1 1 1 1 1 1 1 1 1 1 1 Notes 1. etc. 2. J. 3.1-5. . 6.1. 3. Create a script that repeatedly flashes an image on the screen. 7.4. 9. 2. 6.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.