Scribd
Upload
68 views1 page

Bca Part 2 Data Structures 2017

This document contains 5 units that cover different topics in data structures: 1. Unit 1 defines data structures and lists areas of application. It also differentiates between primitive and non-primitive data structures and discusses common data structure operations. 2. Unit 2 explains how a two-dimensional array is represented in memory and what pointers are. It also compares linear and binary search. 3. Unit 3 discusses linked list representations and converting an expression to postfix form. It also compares stacks and queues. 4. Unit 4 explains binary tree representation using arrays and performing traversals on a sample tree. It also describes how to insert an element in a binary tree. 5. Unit 5 defines insertion

Uploaded by

Sanjay Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views1 page

Bca Part 2 Data Structures 2017

This document contains 5 units that cover different topics in data structures: 1. Unit 1 defines data structures and lists areas of application. It also differentiates between primitive and non-primitive data structures and discusses common data structure operations. 2. Unit 2 explains how a two-dimensional array is represented in memory and what pointers are. It also compares linear and binary search. 3. Unit 3 discusses linked list representations and converting an expression to postfix form. It also compares stacks and queues. 4. Unit 4 explains binary tree representation using arrays and performing traversals on a sample tree. It also describes how to insert an element in a binary tree. 5. Unit 5 defines insertion

Uploaded by

Sanjay Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

PRSU BCA PART 2 QUESTION PAPER

PAPER 3 : DATA STRUCTURES - 2017

Time : Three Hours] [Maximum Marks : 50


Note : Attempt any two parts from each question. All questions carry equal marks.

UNIT - 1
1. (a) What do you mean by data structure ? List out the areas in which data structures are
applied.
(b) Differentiate between primitive and non-primitive data structure.
(c) Discuss the various data structure operations with example.
UNIT - 2
2. (a) How is a two-dimensional array represented in memory ?
(b) What are pointer. ? How are they used in data structure ?
(c) Differentiate between linear search and binary search with their complexity.
UNIT - 3
3. (a) What is the need for linked representations of lists?
(b) Convert the following expression into postfix form (A + B) * C/D
(c) What are the differences between stack and queries ? Explain with example.
UNIT - 4
4. (a) Explain the representation of binary tree using array.
(b) For the binary tree given below :

(i) Find one-way in-order traversing


(ii) One-way pre-order traversing.

(c) How to insert an element in binary tree ? Explain with procedure.

UNIT - 5
5. (a) What is Insertion Sort ? How does it differ from the bubble sort ?
(b) Sort the following list in ascending order using selection sort : 56, 57, 92, 38, 44, 90, 61, 73
(c) Explain the time complexity of merge sort with suitable example.

a2zSubjects.coom

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy