Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities Members BookmarksPolls Fresher Jobs Funny Photos B.Tech 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: Vidya       Member Level: Diamond       Posted Date: 09 Jun 2008

2006 Indira Gandhi National Open University (IGNOU) M.C.A Computer Aplications CS04 Data Structures through C and PASCAL (S) December 2006 Question paper



Course: M.C.A Computer Aplications   University: Indira Gandhi National Open University (IGNOU)




CS04 Data Structures through C and PASCAL (S) December 2006

Time : 2 hours
Maximum Marks : 60

Note: Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' & 'PASCAL' language.

1. (a). Write a program in C/PASCAL to create a doubly linked list in ascending order of information. The information field is of type integer. (Assume the value of integer yourself). (Mark 10)

(b). Write a program and algorithm to sort a given list using "Heap Sort" method. (Mark 10)

(c) Develop a program which reads a hexadecimal digit and returns its decimal equivalent number. (Mark 10)

2. Write a 'function to evaluate the postfix expression using stack. Explain how priorities of the operators are taken care of during the process of converting an infix to Postfix form.(Mark 10)

3. (a) How do you represent a stack and a queue by using one-dimensional array? (Mark 2)

(b) Write a function for pushing into or popping from a stack. (Mark 4)

(c) Write a function for adding an element to a Queue and removing an element from a Queue. (Mark 4)

4. (a) Build a B-tree for the following data: DHKZBPOQEASWTCLNYM (Mark 5)

(b) Write a program to count the number of words and lines in a text file, whose name is supplied in the command line. (Mark 5)

5. (a) Write a ā€˜C’ language program to print a file backwards. (Mark 5)

(b) Differentiate between sequential and indexed sequential file organisation. (Mark 5)






Return to question paper search

Next Question Paper: CS04 Data Structures through C and PASCAL 2006

Previous Question Paper: CS04 : Data Structures through C and PASCAL December

Related Question Papers:


  • Management Functions and Behaviour


  • MCS-021 : DATA AND FILE STRUCTURES


  • Computer Fundamentals


  • problem solving and programming


  • library automation


  • 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
  • Watch Asianet TV online
  • Kairali TV in Internet
  • Surya TV online
  • Amritha TV Channel

  • Contact Us    Privacy Policy    Terms Of Use   

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