New Member FAQ | Forums | Earn Revenue | Distance Education | Help Topics | Admissions 2013
Awards & Gifts
 
Login Login    Register      

ArticlesPractice TestsAsk ExpertsQuestion PapersJobsUniversitiesCollegesCoursesSchools

Active Members
TodayLast 7 Daysmore...

Join our online Google+ community for Bloggers, Content Writers and Webmasters




Download Model question papers & previous years question papers

Posted Date: 09 Jun 2012      Posted By:: Gili Gails    Member Level: Bronze    Points: 5 (Rs. 1)

2012 Jawaharlal Nehru Technological University, Hyderabad B.Tech I Year Examinations JNTUH, May/June -2012 COMPUTER PROGRAMING AND DATA STRUCTURES Question paper



Course: B.Tech   University/board: Jawaharlal Nehru Technological University, Hyderabad




Code No: 09A1EC01 R09
B.Tech I Year Examinations, May/June -2012
COMPUTER PROGRAMING AND DATA STRUCTURES
(Common to all Branches)
Time: 3 hours Max.Marks:75
Answer any 5 questions
All questions carry equal marks
1.a) Explain and specify the interactions between various
components that support the basic functionality of computer.
b) Draw a flowchart to check whether a given number is perfect or
not.
c) Describe various categories of computing environments.
[6+4+5]
2.a) What is type conversion? Explain briefly about implicit and
explicit type conversions?
b) An integer is divisible by 9 if the sum of its digit is also divisible by 9.Write
a C program that prompts the user to input an integer .The program
should then output the number and a message stating whether the
number is divisible by 9.
[8+9]
3.a) What is a storage class? Explain various storage classes in C with examples.
b) Explain the differences between call-by-value and call-by-reference with
suitable examples.
[Marks:8+7]
4.a) Explain how strings are declared and initialized in C?
b) What are the arithmetic operators that are permitted on pointers?
c) Writ ea C program to reverse the string passed as an argument that cannot
be altered.
[Marks:4+4+7]
5.a) What is self referential structure? How it differs from nested structures.
Explain with an illustrative example.
b) Write a short note on typedef and enum.
[Marks:9+6]
6.a) What are the ways to set the file pointer randomly in a file? Explain.
b) Write a C program t copy contents of one file to another.
[Marks:8+7]
7.a) Write a C program for binary search using recursion to find a given integer
in an array of n elements.
b) Illustrate the results for each pass of selection sort, for the following array of
elements 2,3,78,5,46,32,56,8,100,9.
[Marks:8+7]
8.a) Write a C program to demonstrate the operations of a circular queue using
arrays.
b) Explain the procedure for converting infix expression to postfix expression
with an example routine.
[Marks:8+7]





Return to question paper search

Next Question Paper: CS 04 803 Internet Technologies DEC 2009 Eighth semester B.Tech Degree (Engineering) Examination

Previous Question Paper: Calicut university 2010 Basics of Electrical, electronics and communication engineering

Related Question Papers:


  • 4-2 Examinations,April/May 2012 Wireless Communications and Networks


  • IV B.Tech II Semester Examinations,APRIL 2011 BIOMETRICS Information Technology


  • Digital logic and design


  • Digital logic and design


  • II Year,I Semester Examinations, December 2011, DATA STRUCTURES THROUGH C (Set-4)


  • 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.

    Subscribe to Email
  • Get Jobs by Email
  • Forum posts by Email
  • Articles by Email
  • Online MembersJebaprincy
    ajmeri
    Raj Verma
    venkatesh
    chintan
    payal bajaj
    venkata Kumar
    Kokil Kumar Sarma
    vinu omanan
    Nageswari
    anuj
    More...


    About Us    Contact Us    Copyright    Privacy Policy    Terms Of Use    AdSense Revenue Sharing sites   Advertise   Talk to Tony John
    ISC Technologies, Kochi - India. Copyright © All Rights Reserved.