Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

bca data structure paper ignou paper, Papers of Data Structures and Algorithms

dadata structure paper ignou paper for bca third sem

Typology: Papers

2020/2021

Uploaded on 02/13/2021

akshita-bhardwaj
akshita-bhardwaj 🇮🇳

1 document

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MCS
-
021
I
No. of Printed Pages : 3
MCA (Revised) / BCA (Revised)
Term-End Examination
December, 2018
C.19 e,3
:FA
MCS-021 :
DATA AND FILE STRUCTURES
Time : 3 hours
Maximum Marks : 100
(Weightage : 75%)
Note : Question number 1 is compulsory. Attempt any
three questions from the rest. All algorithms
should be written nearer to 'C' language.
1.
(a) Describe big 0 notation and S2 notation.
10
(b)
Explain the process of converting a tree
into a binary tree.
10
(c)
Write an algorithm to implement stack,
using array.
10
(d) What is linear search ? Write linear search
algorithm and find its time complexity.
10
1
P.T.O.
MCS-021
pf3

Partial preview of the text

Download bca data structure paper ignou paper and more Papers Data Structures and Algorithms in PDF only on Docsity!

No. of Printed Pages : 3 MCS- 021 I

MCA (Revised) / BCA (Revised) Term-End Examination December, 2018 C.19 e,3:FA

MCS-021 : DATA AND FILE STRUCTURES

Time : 3 hours (^) Maximum Marks : 100 (Weightage : 75%)

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

1. (^) (a) Describe big 0 notation and S2 notation. (^) 10

(b) Explain the process of converting a tree into a binary tree. (^) 10

(c) (^) Write an algorithm to implement stack, using array. (^) 10

(d) What is linear search? Write linear search algorithm and find its time complexity. (^) 10

MCS-021 (^1) P.T.O.

  1. (a) What is sparse matrix? Explain 3-tuple representation of a sparse matrix with the help of an example.^10

(b) Explain Indexed Sequential^ File Organization.^10

  1. (a) Write an algorithm for creation of a circular queue and deletion of an element from a circular queue.^^10

(b) Traverse the following binary tree in Pre-order and Post-order.^10

  1. (a) Explain inserting an element into a heap with the following numbers :^10 4, 5, 21, 18, 16, 64, 2

MCS-021 2