Scribd
Upload
31 views

TPNNR: Ffixnnmlwatron

This document appears to be a past exam paper for the subject "Data Structures using C" from the May-June 2013 semester. It contains 5 questions with multiple parts each. Question 1 covers definitions of data structures, differences between functions, uses of header nodes, hash functions, and definitions of binary trees. Question 2 involves algorithms for linked lists and queues. Question 3 covers sorting algorithms like merge sort and selection sort. Question 4 deals with stacks, infix to postfix conversions, and algorithms. Question 5 is about binary search trees.

Uploaded by

GAURAV MISHRA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

TPNNR: Ffixnnmlwatron

This document appears to be a past exam paper for the subject "Data Structures using C" from the May-June 2013 semester. It contains 5 questions with multiple parts each. Question 1 covers definitions of data structures, differences between functions, uses of header nodes, hash functions, and definitions of binary trees. Question 2 involves algorithms for linked lists and queues. Question 3 covers sorting algorithms like merge sort and selection sort. Question 4 deals with stacks, infix to postfix conversions, and algorithms. Question 5 is about binary search trees.

Uploaded by

GAURAV MISHRA
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Click Here to read answers

(Plez.se u)rlte your Exdm 8.otl Na,| &xormRoI! IVo. ..........'..i..;... :..

Emp Tpnnr ffixnnmlwATron


Spcown Semasrpn M*v-Junn-z013
Csde: tsCAlg& SiubJect; Dats. Strzrctures uslng 'C'
Hours Msxlmum Morks
Note: Attempt o'll questdons. Interaal cholce ls lndlcated..
Q.1. Attempt all parts of the followingi
{a) Define Data Structure and also write down the difference between primitive data structure and non-
pi'im itive data structu rc (4)
(b) Diff erence between malloc and calloc functions. (4)
(c) What are the uses of header node in a linked list? (2)
{d) What is hash function? {2}
{e) Def!ne a
{i} Binary"l ree (ii) Complete 13inary Tree iiii) Height balanced trees
t3)
Q.2. Attempt egygngpart of the following:-
(a) ii) Write an algorithm to insert and delete an item intofirom a doutrly tinked list. Consider all the
possible cases.
{7'
(ii) write the functions for insertion and deletion operations perforrned in the DEeut, consider all the
possible cases.
{8}
ilil;;.;;;-nhm for insertion and detetion in a eueue using pointers. - {7)
^Wtl
' {ii) Write an algorithm to inserting a new node at the specified position and deteting the node from
specifled position in the linked list. t8l

Q.3. Attemptgqyone. part of the following:-


dgXi) Wtit" an algorithm for merge sorting on an numbers. Show various stages in merge sorting over the
data:l!, ?,9,13,57,25,17,1,90,3. {S}
(ii) Vi/rite an algorithm for selection sorting on a numbers. Show various stlges in selection sorting ovei

(b) ti) ;H3::t;*'ll'i1;li;irtion sorrins on a numbers. Show uarious srasrs-inirserriun ro*,ng *::l- -
thedata:25,17,37,13,2. {g)
it.
{ii} What i! hashine? Explain l7l
Q,4, Atteppt
/ part of the following:-
gnV_g-[C

\QY$I Write an algorithm for inserting an item into the Stack and deleting an item from the Stack. (7t
(ii) Convert the foltowing expression from infix to postfix:
-
1) A*B+C/D
2l A+BIC-D
3)
{A+B}/(c-o)
4)
A+{B*C-{D/E^Fi*G}*H t8)
(b) (i) Write an algorithm for converting lnfix expression to Postfix form in the stack. 17l
(ii) Evaluate Postfix forrn:
t) 598+46*+7-*
.21 4213*3-84/L]-+/+ t8l

Q.5. Attgmpt anv one part of the following:-


fi Write an algorithm to iffiedion anrhffiisn
J*f (ii) of a node into/from a Binary Search Tree. {e)
Traverse the following tree in Pre-ord,er and Post order traversal.

(b) {i) create a B tree of order i6l


5 on inserting the keys 10, 20, 50, 60, 40, g0, L00, 70, 130, 90, 3a, lza, 140,
25, 35, 160, 180, inserted in left to right sequence. Show the trees on deleting 190 and 60, (8)
(ii) What is AVL Tree? Write down an algorithm of AVL Tree
{7)

Click Here to read answers


Similar Papers

BCA 2nd sem Data Structure using C paper 2015

Data structure using C Papers

BCA 2nd sem Data Structure Using C paper 2014

BCA 2nd sem Data Structure using C paper 2017

BCA 2nd sem Data Structure using C paper 2016

You might also like