Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities Members BookmarksPolls Fresher Jobs Strange Photos Academic 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: gopal       Member Level: Diamond       Posted Date: 01 Sep 2008

2005 Jawaharlal Nehru Technological University Mechanical Engineering II B.Tech. I Semester Supplementary Examinations, May -2005 DATA STRUCTURES THROUGH C Question paper



Course: B.Tech Mechanical Engineering   University: Jawaharlal Nehru Technological University




Code No: RR210301 Set No.1
II B.Tech. I Semester Supplementary Examinations, May -2005
DATA STRUCTURES THROUGH C
( Common to Mechanical Engineering, Mechatronics, Metallurgy & Material
Technology, Production Engineering and Aeronautical Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. Write a C program to replacing substring with another string
2. Formulate insertion and deletion algorithm for a Queue which is represented by a
circular list.
3. (a) Write a C Program to convert a postfix expression into infix expression.
(b) Transform the following postfix expression to infix A B C + D E F - + $
4. (a) Write and explain algorithms to insert and delete an element to and from a
circular queue respectively.
(b) Given the circular queue with front (F)=6 and Rear(R)=2, give the values of
R and F after each operation in the sequence: insert, remove, remove, insert,
remove.
5. (a) Differentiate between complete binary tree and strictly binary tree.
(b) Write an algorithm and C program for post order traversal of a tree
6. (a) Write relative merits and demerits of different graph representations.
(b) What is spanning tree? When is it called a minimum spanning tree?
7. Write an iterative function for binary search method and trace it. Write a suitable
example.
8. Write a C program to implement quicksort





Return to question paper search

Next Question Paper: II B.Tech. I Semester Supplementary Examinations, May -2005 BASIC ELECTRONICS

Previous Question Paper: II B.Tech. I Semester Supplementary Examinations, May -2005 ELECTRO MECHANICS-I

Related Question Papers:


  • REFRIGERATION & AIR CONDITIONING IV B.Tech I Semester Regular Examinations, November 2006 set 1


  • RR-III B.Tech Software Engineering(Feb'Sup)-Set2


  • FOUNDRY AND WELDING[RR] Set No. 4


  • IV B.Tech. II Semester Regular Examinations, April/May -2006 , FOOD SCIENCE AND TECHNOLOGY


  • II B.Tech Supplimentary Examinations, Aug/Sep 2008 NSTRUMENTATION METHODS OF ANALYSIS


  • 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    Editors    Privacy Policy    Terms Of Use   

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