Skip to main content

Posts

Showing posts with the label CSE QP

CS2203 — OBJECT ORIENTED PROGRAMMING 141303 - OBJECT ORIENTED PROGRAMMING ANNA UNIVERSITY OF TECHNOLOGY,ANNA UNIVERSITY QUESTION PAPER APRIL/MAY 2010

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010 Third Semester Computer Science and Engineering CS2203 — OBJECT ORIENTED PROGRAMMING 141303 - OBJECT ORIENTED PROGRAMMING (Common to Information Technology) (Regulation 2008) Time: Three hours                                                                       Maximum: 100 Marks Answer ALL Questions PART A — (10 × 2 = 20 Marks) 1.  Write  a  C++  program  to  check  whether  an  integer  is  a  prime  or  a  composite   number. 2.  What is the difference between a class an...

CS2201 - DATA STRUCTURES 141301 - DATA STRUCTURES ANNA UNIVERSITY QUESTION PAPER APRIL/MAY 2010

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010. Third Semester Computer Science and Engineering CS2201 — DATA STRUCTURES 141301 - DATA STRUCTURES (Regulation 2008) Time: Three hours Maximum: 100 Marks Answer ALL Questions PART A — (10 × 2 = 20 Marks) 1. Define List Abstract Data Type with example. 2. Mention the Applications of stack. 3. Write an algorithm to declare nodes of a tree structure. 4. Give an example for Expression Trees. 5. Define Splaying. Give example. 6. List out the structural properties of B-Trees. 7. Mention the difference between Hashing & Extendible Hashing with example. 8. Define Path Compression. 9. What is topological sort? Give algorithm. 10. What is biconnected graph? Give example. PART B — (5 × 16 = 80 Marks) 11. (a) Describe the Cursor-based linked list with i...