Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities Members BookmarksPolls Fresher Jobs Funny Pictures MCA Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter




Download Model question papers & previous years question papers

Posted By: CONFIDENCE IS THE COMPANION OF SUCCESS       Member Level: Diamond       Posted Date: 22 Apr 2008

2007 Anna University Diploma Information Technology DATA STRUCTURES Question paper



Course: Diploma Information Technology   University: Anna University




DATA STRUCTURES
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A — (10 ´ 2 = 20 marks)
1. Define Pseudo Code.
2. What do Time Complexity and Space Complexity mean?
3. Give two examples for Divide and Conquer Algorithm.
4. What is meant by Recursion? Give an example.
5. Write the hierarchy of operations in C Language.
6. What is the basic difference between Structure and Union in C?
7. Define Complete Binary Tree.
8. What is the difference between Singly Linked List, Doubly Linked List and Circularly Linked List?
9. What is meant by Minimum Spanning Tree?
10. When a Graph becomes a Tree?
PART B — (5 ´ 16 = 80 marks)
11. Explain the backtracking technique used to solve the 4–queens problem.
12. (a) Explain the implementation of merge sort using divide and conquer method.
Or
(b) Explain the different ways of parameter passing with suitable example.
13. (a) Write a C Program to Create and Read a data file.
Or
(b) What is meant by self–referential structures? Explain with an example.
14. (a) What is Towers of Hanoi Problem? Explain how stack is used to solve it for a problem with 3 Pegs and 3 Disks.
Or
(b) Explain a procedure to convert a General Tree into a Binary tree with an example.
15. (a) Explain any one algorithm to find the Minimum Spanning Tree for a Graph.
Or
(b) Explain the differences between linear search and binary search.





Return to question paper search

Next Question Paper: Computer Architecture

Previous Question Paper: Paper - I : GENERAL CHEMISTRY

Related Question Papers:


  • Anna University B.E Electronics and Communication ELECTROMAGNETIC WAVES AND WAVE GUIDES


  • B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2007.


  • MA 1251 NUMERICAL METHODS


  • principles of management


  • Cryptography and Network Security


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.

    Watch TV Channels



    Contact Us    Privacy Policy    Terms Of Use   

    SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.