Learn more about IndiaStudyChannel
Install Alexa Toolbar
and earn more...
 
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: S.Yamininagarajan       Member Level: Diamond       Posted Date: 17 May 2008

2004 Andhra University B.Sc BSc Computer Science Question paper



Course: B.Sc Computer Science   University: Andhra University







Andhra University Model Paper
B.Sc Degree Second Year (Computer Science)

Time: 3 hours
Max. Marks: 100

Instructions
Answer any FIVE Questions
Question No. 1 is compulsory.
All Questions carry equal marks.

1.
a) What are Memory Management Operators.
b) Explain Type Cast Operators.
c) What is Pointer.
d) What is Inheritance.
e) What is Abstract Base Class.
f) What is Time Complexity.
g) Define Complete Binary Tree.
h) What is a Graph.
i) Write any two Applications of Stacks

2.Differentiate between Object Oriented Programming Languages and Structured Programming Languages and State the advantages and disadvantages for using Object Oriented Programming Languages.

3. Describe Security Constraints in C++

4. Explain Polymorphism and Dynamic Binding

5. Explain the Algorithm for Inserting an element into doubly Linked List and Circular Linked List.

6. a) What is the difference between recursion and iteration? Explain with example.
b) Implement Queue using I) Arrays II) Linked List

7.
a) What are the applications of Binary Trees?
b) Write a program to create Binary Tree and display the contents of the tree using inorder tree traversal techniques.

8.
a) Write the algorithm for Prim's Minimal Spanning Tree
b) Write an algorithm that takes an adjacency matrix and return 1 if the graph is connected, returns 0 otherwise.





Return to question paper search

Next Question Paper: Biology of Invertebrates and Cell Biology

Previous Question Paper: Database management systems

Related Question Papers:


  • Elective-1: DISTRIBUTED SYSTEMS/ Second Year: Second Semester/ M.C.A. Degree Examination


  • Satellite and mobile communications


  • PROBLEM SOLVING AND PROGRAMMING USING C


  • MARKETING OF SERVICES


  • B.Tech Information Technology - - Digital Communications


  • 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   

    ISC Technologies. 2006 - 2008 All Rights Reserved.