Categories
Important question

CS6504 Important Questions COMPUTER GRAPHICS Regulation 2013 Anna University

CS6504 Important Questions COMPUTER GRAPHICS

CS6504 Important Questions COMPUTER GRAPHICS Regulation 2013 Anna University free download. COMPUTER GRAPHICS CG CS6504 Important Questions pdf free download.

Sample CS6504 Important Questions COMPUTER GRAPHICS:

1.Define Computer Graphics.
Computer Graphics remains one of the most existing and rapidly growing computer fields. Computer graphics
may be defined as the pictorial representation or graphical representation of objects in a computer cs6504 important questions computer graphics

2.Write short notes on video controller.
Video controller is used to control the operation of the display device.A fixed area of the system is reserved for
the frame buffer and the video controller is given direct access to the frame buffer memory Here, the frame
buffer can be anywhere in the system memory, and the video controller accesses the frame buffer to refresh the
screen. In addition to the video controller, more sophisticated raster systems employ other processors as cs6504 important questions computer graphics
coprocessor sand accelerators to implement various graphics operations.

3.Write notes on Graphics controller?
An application program is input and stored in the system memory along with a graphics package. Graphics
commands in the application program are translated by the graphics package into a display file stored in the
system memory. This display file is then accessed by the display processor to refresh the screen. The display
processor cycles through each command in the display file program once during every refresh cycle. Sometimes
the display processor in a random-scan system is referred to as a display processing unit or a graphics controller cs6504 important questions computer graphics

4.List out a few attributes of output primitives?
Attributes are the properties of the output primitives; that is, an attribute describes how a particular primitive is
to be displayed. They include intensity and color specifications, line styles, text styles, and area-filling patterns.
Functions within this category can be usedto set attributes for an individual primitive class or for groups of
output primitives. cs6504 important questions computer graphics

 

Subject Name COMPUTER GRAPHICS
Subject code CS6504
Regulation 2013

CS6504 Important Questions COMPUTER GRAPHICS click here to download 

CS6504 Syllabus COMPUTER GRAPHICS


CS6504 Notes COMPUTER GRAPHICS


CS6504 Question Bank COMPUTER GRAPHICS


 

Categories
r2013 notes

CS6504 Notes COMPUTER GRAPHICS Regulation 2013 Anna University

CS6504 Notes COMPUTER GRAPHICS

CS6504 Notes COMPUTER GRAPHICS Regulation 2013 Anna University free download. COMPUTER GRAPHICS CG CS6504 Notes pdf free download.

OBJECTIVES: CS6504 Notes COMPUTER GRAPHICS

The student should be made to:
 Gain knowledge about graphics hardware devices and software used.
 Understand the two dimensional graphics and their transformations.
 Understand the three dimensional graphics and their transformations.
 Appreciate illumination and color models.
 Be familiar with understand clipping techniques.

OUTCOMES: CS6504 Notes COMPUTER GRAPHICS

At the end of the course, the student should be able to:

 Design two dimensional graphics.

 Apply two dimensional transformations.

 Design three dimensional graphics.

 Apply three dimensional transformations.

 Apply Illumination and color models.

 Apply clipping techniques to graphics.

 Design animation sequences.

TEXT BOOKS: CS6504 Notes COMPUTER GRAPHICS

1. John F. Hughes, Andries Van Dam, Morgan Mc Guire ,David F. Sklar , James D. Foley, Steven K. Feiner and Kurt Akeley ,”Computer Graphics: Principles and Practice”, , 3rd Edition, Addison-Wesley Professional,2013. (UNIT I, II, III, IV).

2. Donald Hearn and Pauline Baker M, “Computer Graphics”, Prentice Hall, New Delhi, 2007 (UNIT V).

REFERENCES: CS6504 Notes COMPUTER GRAPHICS

1. Donald Hearn and M. Pauline Baker, Warren Carithers,“Computer Graphics With Open GL”, 4th Edition, Pearson Education, 2010.

2. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett Publishers, 2006.

3. Hill F S Jr., “Computer Graphics”, Maxwell Macmillan” , 1990.

4. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard, Kelvin Sung, and AK Peters, Fundamental of Computer Graphics, CRC Press, 2010.

5. William M. Newman and Robert F.Sproull, “Principles of Interactive Computer Graphics”, Mc Graw Hill 1978.

6. http://nptel.ac.in/

 

Subject Name COMPUTER GRAPHICS
Subject code CS6504
Regulation 2013

CS6504 Notes COMPUTER GRAPHICS click here to download 

CS6504 Syllabus COMPUTER GRAPHICS


CS6504 Important Questions COMPUTER GRAPHICS


CS6504 Question Bank COMPUTER GRAPHICS


 

Categories
UG syllabus R 2013

CS6504 Syllabus COMPUTER GRAPHICS Regulation 2013 Anna University

CS6504 Syllabus COMPUTER GRAPHICS

CS6504 Syllabus COMPUTER GRAPHICS Regulation 2013 Anna University free download. COMPUTER GRAPHICS CG CS6504 Syllabus pdf free download.

UNIT I INTRODUCTION CS6504 Syllabus COMPUTER GRAPHICS

Survey of computer graphics, Overview of graphics systems – Video display devices, Raster scan systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard copy Devices, Graphics Software; Output primitives – points and lines, line drawing algorithms, loading the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object geometry, filled area primitives.

UNIT II TWO DIMENSIONAL GRAPHICS CS6504 Syllabus COMPUTER GRAPHICS CG

Two dimensional geometric transformations – Matrix representations and homogeneous coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing coordinate reference frame; widow-to-viewport coordinate transformation, Two dimensional viewing functions; clipping operations – point, line, and polygon clipping algorithms.

UNIT III THREE DIMENSIONAL GRAPHICS CS6504 Syllabus COMPUTER GRAPHICS CG

Three dimensional concepts; Three dimensional object representations – Polygon surfaces- Polygon tables- Plane equations – Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby
objects; Spline representations – Bezier curves and surfaces -B-Spline curves and surfaces. TRANSFORMATION AND VIEWING: Three dimensional geometric and modeling transformations –
Translation, Rotation, Scaling, composite transformations; Three dimensional viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection methods.

UNIT IV ILLUMINATION AND COLOUR MODELS CS6504 Syllabus COMPUTER GRAPHICS

Light sources – basic illumination models – halftone patterns and dithering techniques; Properties of light – Standard primaries and chromaticity diagram; Intuitive colour concepts – RGB colour model – YIQ colour model – CMY colour model – HSV colour model – HLS colour model; Colour selection.

UNIT V ANIMATIONS & REALISM CS6504 Syllabus COMPUTER GRAPHICS CG

ANIMATION GRAPHICS: Design of Animation sequences – animation function – raster animation – key frame systems – motion specification –morphing – tweening. COMPUTER GRAPHICS REALISM: Tiling the plane – Recursively defined curves – Koch curves – C curves – Dragons – space filling curves – fractals – Grammar based models – fractals – turtle graphics – ray tracing.

 

Subject Name COMPUTER GRAPHICS
Subject code CS6504
Regulation 2013

CS6504 Syllabus COMPUTER GRAPHICS click here to download 

CS6504 Notes COMPUTER GRAPHICS


CS6504 Important Questions COMPUTER GRAPHICS


CS6504 Question Bank COMPUTER GRAPHICS


 

Categories
question bank

CS6503 Question Bank Theory of Computation Regulation 2013 Anna University

CS6503 Question Bank Theory of Computation

CS6503 Question Bank Theory of Computation Regulation 2013 Anna University free download. Theory of Computation TOC CS6503 Question Bank pdf free download.

Sample CS6503 Question Bank Theory of Computation:

1. Convert the following grammar into CNF
(i) ScBA, SA, AcB, AAbbS, Baaa (6) NOV/DEC 2012
(ii) Sa|AAB, Aab|aB| ε, Baba| ε (8) APR/MAY 2011
(iii) SA|CB, AC|D, B1B|1, C0C|0, D2D|2 (16) APR/MAY 2010
(iv) SaAD AaB|bAB B b D d (6) NOV/DEC 2014

2. State and prove the pumping lemma for CFL. What is its main application? Give two examples. (10) NOV/DEC 2012, NOV/DEC 2011, MAY/JUNE 2013 CS6503 Question Bank Theory of Computation

3. Design a Turing machine for the following
(i) Reverses the given string {abb}. (8) NOV/DEC 2012
(ii) L={1n0n1n|n>=1} (10) MAY/JUNE 2012
(iii) L={anbncn} (8) APR/MAY 2011 CS6503 Question Bank Theory of Computation TOC
(iv) To perform proper subtraction (8) APR/MAY 2011 (v) To move an input string over the alphabet A ={a} to the right one cell. Assume that the tape head starts somewhere on a blank cell to the left of the input string. All other cells are blank, labeled by ^. The machine must move the entire string to the right one cell, leaving all remaining cells blank. (10) APR/MAY 2010

4. Write briefly about the programming techniques for TM. (8) NOV/DEC 2012,MAY/JUNE 2013 CS6503 Question Bank Theory of Computation TOC

5. Find Greibach normal form for the following grammar
(ii) SAA | 1, ASS |0 (10) MAY/JUNE 2012
(iii) Sa|AB, Aa|BC, Bb, Cb (4) APR/MAY 2011
(iv) SAA|0, ASS|1 (8) NOV/DEC 2010
(v) A1A2A3, A2A3A1|b, A3A1A2|a (10) NOV/DEC 2014

6. Explain any two higher level techniques for Turing machine construction. (6) MAY/JUNE 2012, NOV/DEC 2011

7. Discuss the closure properties of CFLS. (6) MAY/JUNE 2012, NOV/DEC 2011,NOV/DEC 2010, MAY/JUNE 2013

8. Prove that every grammar with ε productions can be converted to an equivalent grammar without ε productions. (4) APR/MAY 2011, NOV/DEC 2013

9. Explain the different models of Turing machines. (10) NOV/DEC 2011 CS6503 Question Bank Theory of Computation

10. Define Pumping Lemma for Context Free Languages. Show that L={ai bj ck : i<j<k}is not context free grammar (6) APR/MAY 2010

11. construct the following grammar in CNF
A->BCD/b
B->Yc/d
C->gA/c
D->dB/a
y->f

Subject Name Theory of Computation
Subject code CS6503
Regulation 2013

CS6503 Question Bank Theory of Computation click here to download 

CS6503 Syllabus Theory of Computation


CS6503 Notes Theory of Computation


CS6503 Important Questions Theory of Computation


 

Categories
Important question

CS6503 Important Questions Theory of Computation Regulation 2013 Anna University

CS6503 Important Questions Theory of Computation

CS6503 Important Questions Theory of Computation Regulation 2013 Anna University free download. Theory of Computation TOC CS6503 Important Questions pdf free download.

Sample CS6503 Important Questions Theory of Computation:

PART – A
ANSWER ALL QUESTIONS (20 * 2 =40 MARKS)

1. What is Turing machine?

2. Give the difference between FA and TM.

3. Define Multitape Turing Machine. CS6503 Important Questions Theory of Computation

4. What is meant by halting problem?

5. What is Mapping reducibility?

6. Define Turing reducible. CS6503 Important Questions Theory of Computation

7. Give the definition of linear bound automaton.

8. Find a match in the following instance of PCP.
{[ab/abab],[b/a],[aba/b],[aa/a]}

9. What is Time complexity?

10. Define class P and NP completeness.

11. Prove that CLIQUE is in NP.

12. State the True or False for the following statement
(i) n^2=o(log^2 n)
(ii) nlogn=o(n^2) CS6503 Important Questions Theory of Computation

13. Define Probabilistic Turing machine.

14. Define trapdoor function.

15. What is one – way permutation?

16. Prove that CIRCUIT-VALUE is p-complete?

17. What are the classes L and NL? CS6503 Important Questions Theory of Computation

18. Define EXSPACE-complete.

19. Give the proof idea for FORMULA-GAME is PSPACE-complete.

20. Define PSPACE and PSPACE-complete?

PART – B Important question 

ANSWER ANY FIVE QUESTIONS (5 X 12 = 60 MARKS )

21.(i) Give implementation-level description of Turing machines that decide the following language
over the alphabet{0,1}
(a) {w/w contains an equal number of 0s and 1s}. (8)
(ii) Show that a language is Turing-recognizable if and only if some enumerators enumerates it.(4)

22.(i) Prove that every CFL is decidable.(6)
(ii) Show that EQ(DFA) is a decidable language.(6)

23.(i) Prove that Recursive theorem.(6) CS6503 Important Questions Theory of Computation
(ii) Show that MIN(TM) is not Turing-recognizable.(6)

24.(i) Prove that HALT(TM) is decidable.(6)
(ii) Prove that EQ(TM) is neither Turing-recognizable nor Co-Turing-recognizable.(6) CS6503 Important Questions TOC Theory of Computation

25. Prove that HAMPATH is NP-complete.

Subject Name Theory of Computation
Subject code CS6503
Regulation 2013

CS6503 Important Questions Theory of Computation click here to download 

CS6503 Syllabus Theory of Computation


CS6503 Notes Theory of Computation


CS6503 Question Bank Theory of Computation


 

 

 

Categories
r2013 notes

CS6503 Notes Theory of Computation Regulation 2013 Anna University

CS6503 Notes Theory of Computation

CS6503 Notes Theory of Computation Regulation 2013 Anna University free download. Theory of Computation TOC CS6503 Notes pdf free download.

OBJECTIVES: CS6503 Notes Theory of Computation TOC

The student should be made to:
 Understand various Computing models like Finite State Machine, Pushdown Automata, and Turing Machine.
 Be aware of Decidability and Un-decidability of various problems.
 Learn types of grammars.

OUTCOMES: CS6503 Notes Theory of Computation TOC

At the end of the course, the student should be able to:  Design Finite State Machine, Pushdown Automata, and Turing Machine.  Explain the Decidability or Undecidability of various problems

TEXT BOOKS: CS6503 Notes Theory of Computation TOC

1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2008. (UNIT 1,2,3)

2. John C Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, Tata McGraw Hill Publishing Company, New Delhi, 2007. (UNIT 4,5)

REFERENCES: CS6503 Notes Theory of Computation TOC

1. Mishra K L P and Chandrasekaran N, “Theory of Computer Science – Automata, Languages and Computation”, Third Edition, Prentice Hall of India, 2004.

2. Harry R Lewis and Christos H Papadimitriou, “Elements of the Theory of Computation”, Second Edition, Prentice Hall of India, Pearson Education, New Delhi, 2003.

3. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition, Narosa Publishers, New Delhi, 2002.

4. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata Theory and Computation”, Pearson Education 2009.

Subject Name Theory of Computation
Subject code CS6503
Regulation 2013

CS6503 Notes Theory of Computation click here to download 

CS6503 Syllabus Theory of Computation


CS6503 Important Questions Theory of Computation


CS6503 Question Bank Theory of Computation


 

 

 

Categories
UG syllabus R 2013

CS6503 Syllabus Theory of Computation Regulation 2013 Anna University

CS6503 Syllabus Theory of Computation

CS6503 Syllabus Theory of Computation Regulation 2013 Anna University free download. Theory of Computation TOC CS6503 Syllabus pdf free download.

UNIT I FINITE AUTOMATA CS6503 Syllabus Theory of Computation

Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions – Finite Automaton – DFA & NDFA – Finite Automaton with €- moves – Regular Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NDFA‟s with and without €-moves – Equivalence of finite Automaton and regular expressions –Minimization of DFA- – Pumping Lemma for Regular sets – Problems based on Pumping Lemma.

UNIT II GRAMMARS CS6503 Syllabus Theory of Computation TOC

Grammar Introduction– Types of Grammar – Context Free Grammars and Languages– Derivations and Languages – Ambiguity- Relationship between derivation and derivation trees – Simplification of CFG – Elimination of Useless symbols – Unit productions – Null productions – Greiback Normal form – Chomsky normal form – Problems related to CNF and GNF.

UNIT III PUSHDOWN AUTOMATA CS6503 Syllabus Theory of Computation

Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Equivalence of Pushdown automata and CFL – pumping lemma for CFL – problems based on pumping Lemma.

UNIT IV TURING MACHINES CS6503 Syllabus Theory of Computation TOC

Definitions of Turing machines – Models – Computable languages and functions –Techniques for Turing machine construction – Multi head and Multi tape Turing Machines – The Halting problem – Partial Solvability – Problems about Turing machine- Chomskian hierarchy of languages.

UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS CS6503 Theory of Computation Syllabus

Unsolvable Problems and Computable Functions – Primitive recursive functions – Recursive and recursively enumerable languages – Universal Turing machine. MEASURING AND CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly intractable problems – P
and NP completeness – Polynomial time reductions.

Subject Name Theory of Computation
Subject code CS6503
Regulation 2013

CS6503 Syllabus Theory of Computation click here to download 

CS6503 Notes Theory of Computation


CS6503 Important Questions Theory of Computation


CS6503 Question Bank Theory of Computation


 

Categories
question bank

CS6502 Question Bank OBJECT ORIENTED ANALYSIS AND DESIGN Regulation 2013 Anna University

CS6502 Question Bank OBJECT ORIENTED ANALYSIS AND DESIGN 

CS6502 Question Bank OBJECT ORIENTED ANALYSIS AND DESIGN Regulation 2013 Anna University free download. OBJECT ORIENTED ANALYSIS AND DESIGN OOAD CS6502 Question Bank pdf free download.

Sample CS6502 Question Bank OBJECT ORIENTED ANALYSIS AND DESIGN:

1. What is GRASP?
General Responsibility Assignment Software Patterns (or Principles), abbreviated GRASP, consists of guidelines for assigning responsibility to classes and objects in object-oriented design. cs6502 Question Bank object oriented analysis and design

2. What is Responsibility-Driven Design?
A popular way of thinking about the design of software objects and also larger scale Components 3 are in terms of responsibilities, roles, and collaborations. This is part of a larger approach called responsibility-driven design or RDD.

3. What is Responsibilities? cs6502 Question Bank object oriented analysis and design
The UML defines a responsibility as “a contract or obligation of a classifier”. Responsibilities are related to the obligations or behavior of an object in terms of its role.

4. What are the two responsibilities? cs6502 Question Bank object oriented analysis and design
The responsibilities are of the following two types: doing and knowing.
Doing responsibilities of an object include:
• doing something itself, such as creating an object or doing a calculation
• initiating action in other objects
• controlling and coordinating activities in other objects
Knowing responsibilities of an object include:
• knowing about private encapsulated data
• knowing about related objects
• knowing about things it can derive or calculate

5. Define Pattern? cs6502 Question Bank object oriented analysis and design
A pattern is a named problem/solution pair that can be applied in new context, with advice on how to apply it in novel situations and discussion of its trade-offs

6. What are the GRASP patterns?
They describe fundamental principles of object design and responsibility assignment. expressed as patterns.

7. How to Apply the GRASP Patterns? cs6502 Question Bank object oriented analysis and design

Subject Name OBJECT ORIENTED ANALYSIS AND DESIGN
Subject code CS6502
Regulation 2013

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN  Question Bank click here to download 

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Syllabus


CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Notes


CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Important Questions


 

 

Categories
Important question

CS6502 Important Questions OBJECT ORIENTED ANALYSIS AND DESIGN Regulation 2013 Anna University

CS6502 Important Questions OBJECT ORIENTED ANALYSIS AND DESIGN 

CS6502 Important Questions OBJECT ORIENTED ANALYSIS AND DESIGN Regulation 2013 Anna University free download. OBJECT ORIENTED ANALYSIS AND DESIGN OOAD CS6502 Important Questions pdf free download.

Sample CS6502 Important Questions OBJECT ORIENTED ANALYSIS AND DESIGN :

1. How to Choose the Initial Domain Object?

Choose as an initial domain object a class at or near the root of the containment or aggregation hierarchy of domain objects. This may be a facade controller, such as Register, or some other object considered to contain all or most other objects, such as a Store.

2. Define patterns. cs6502 important questions object oriented analysis and design

A pattern is a named problem/solution pair that can be applied in new context, with advice on how to apply it in novel situations and discussion of its trade-offs.

3. How to Connect the UI Layer to the Domain Layer? cs6502 important questions object oriented analysis and design

An initializing routine (for example, a Java main method) creates both a UI and a domain object, and passes the domain object to the UI.
A UI object retrieves the domain object from a well-known source, such as a factory object that is responsible for creating domain objects.

4. Mention the Interface and Domain Layer Responsibilities.

The UI layer should not have any domain logic responsibilities. It should only be responsible for user interface tasks, such as updating widgets. The UI layer should forward requests for all domain-oriented tasks on to the domain layer, which is responsible for handling them.

5. How to Apply the GRASP Patterns? cs6502 important questions object oriented analysis and design

The following sections present the first five GRASP patterns: Information Expert
Creator
High Cohesion Low Coupling Controller

6. Define Responsibilities and Methods.

The UML defines a responsibility as “a contract or obligation of a classifier” [OMG01]. Responsibilities are related to the obligations of an object in terms of its behavior. Basically, these responsibilities are of the following two types:
– knowing
-doing cs6502 important questions object oriented analysis and design

7. List out some scenarios that illustrate varying degrees of functional cohesion.

-Very low cohesion -low cohesion -High cohesion -Moderate cohesion

Subject Name OBJECT ORIENTED ANALYSIS AND DESIGN
Subject code CS6502
Regulation 2013

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Important Questions click here to download 

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Syllabus


CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Notes


CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Question Bank


 

 

Categories
r2013 notes

CS6502 Notes OBJECT ORIENTED ANALYSIS AND DESIGN Regulation 2013 Anna University

CS6502 Notes OBJECT ORIENTED ANALYSIS AND DESIGN 

CS6502 Notes OBJECT ORIENTED ANALYSIS AND DESIGN Regulation 2013 Anna University free download. OBJECT ORIENTED ANALYSIS AND DESIGN OOAD CS6502 Notes pdf free download.

OBJECTIVES: CS6502 Notes OBJECT ORIENTED ANALYSIS AND DESIGN

The student should be made to:
 Learn the basics of OO analysis and design skills.
 Learn the UML design diagrams.
 Learn to map design to code.
 Be exposed to the various testing techniques.

OUTCOMES: CS6502 Notes OBJECT ORIENTED ANALYSIS AND DESIGN

At the end of the course, the student should be able to:  Design and implement projects using OO concepts.  Use the UML analysis and design diagrams.  Apply appropriate design patterns.  Create code from design.  Compare and contrast various testing techniques.

TEXT BOOK: CS6502 Notes OBJECT ORIENTED ANALYSIS AND DESIGN

1. Craig Larman, “Applying UML and Patterns: An Introduction to Object-Oriented Analysis and
Design and Iterative Development”, Third Edition, Pearson Education, 2005.

REFERENCES: CS6502 Notes OBJECT ORIENTED ANALYSIS AND DESIGN

1. Simon Bennett, Steve Mc Robb and Ray Farmer, “Object Oriented Systems Analysis and
Design Using UML”, Fourth Edition, Mc-Graw Hill Education, 2010.

2. Erich Gamma, and Richard Helm, Ralph Johnson, John Vlissides, “Design patterns:
Elements of Reusable Object-Oriented Software”, Addison-Wesley, 1995.

3. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling Language”,
Third edition, Addison Wesley, 2003.

4. Paul C. Jorgensen, “Software Testing:- A Craftsman‟s Approach”, Third Edition, Auerbach Publications, Taylor and Francis Group, 2008.

Subject Name OBJECT ORIENTED ANALYSIS AND DESIGN
Subject code CS6502
Regulation 2013

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Notes click here to download 

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Syllabus


CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Important questions


CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN Question Bank