Learn more about IndiaStudyChannel
Install Alexa Toolbar
and earn more...
 
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: Aparanjitha       Member Level: Gold       Posted Date: 26 May 2008

2005 Andhra University B.E Electronics and Communication Data Structures Question paper



Course: B.E Electronics and Communication   University: Andhra University




QuestionNo:1 is compulsory and answer any other four questions
All Questions carry equal marks

1)
a)write short notes on:
a)parameter passing techniques
b)recursion
c)Applications of stacks and queues
d)binary tree representaion
e)search techniques

2)
a)write a recursive function in "c" which prints the digits of a given input number n?
b)Give the sparse matrix representation using arrays. Write code for transposin such a matrix

3)
a)Write program for evaluation post fix expression
b)write program for converting an infix expression to postfix expression

4)
a)Give the datat structure of a queue using linked lists.Write all operations
b)Give the data structure of a stack using linked lists.Write all operations

5)
a)write code for Fibonacci search
b)write code for Dijkstra's shortest path method

6)
a)Define strongly connected component . write algorith/program to find strongly connected components of a graph
b)write algorithm.program for constructing a binary tree if reorder and in order traversals of the tree is given

7)
a)Explain the graph traversal techniques
b) An edge in a connected graph is called a bridge, if its removal disconnects the graph. Give the algorith for finding all bridges in a graph.

8)
a)write an algorithm to convert a general tree into binary tree
b)write a routine to list out nodes of a binary tree in level-order. List root, then nodes at depth1, followed by nodes at depth2 and so on





Return to question paper search

Next Question Paper: ET - 301A / ET - 534A System Methods - June 2007

Previous Question Paper: ET - 301B Computer Applications - June 2007

Related Question Papers:


  • ELEMENTS OF ELECTRICAL ENGINEERING


  • Consumer Behaviour and Marketing Research


  • Operation Research


  • International Marketing


  • Distance Education MBA (DM) - AMDM - 309 - Organisational Dynamics


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