## New Update

IGNOU BCA, MCA New, PGDCA New, M.com, PGDIBO solved assignments July-January 2022-23 & January 2023-July 2023 now available. Note: If do not get solved assignments after payment then mail us. Thanks You...

## Saturday, 25 June 2022

IGNOU BCA, MCA MCS 021 term-end exam notes, questions papers, upcoming guess paper, important questions free download.
IGNOU BCA, MCA, PGDCA all semester term-end exam notes, questions papers, upcoming guess paper, important questions new revised (1st semester, 2nd semester, 3rd semester, 4th semester, 5th semester and 6th semester) solved assignments ,term-end exam notes, study materials, important questions, books/blocks (June-December) free download.

IGNOU BCA, MCA, PGDCA MCS-021 Term-End Examination (DATA AND FILE STRUCTURES) books/block, term-end exam notes, upcoming guess paper, important questions, study materials, previous year papers download.
Important questions/topic with solutions and old/previous years paper with solutions june 2014 to dec. 2018.
 Important question/topic with solutions and old/previous years papers (June 2014 to Dec. 2018 with solutions) S. No. Topic 1. Introductions 2. Link List Program 3. Stack and Queue 4. Searching and Sorting 5. Tree 6. Graph and File 7. Applications 8. Guess Questions Old/Previous years papers (June 2014 to Dec. 2018 with solutions)

Note-1

1. (a) Describe the asymptotic notations in detail.
(b) Write an algorithm to implement the insertion and deletion operations into a singly linked list.
(c) What is a circular queue ? Write an algorithm for insertion and deletion in a circular queue.
(d) Explain the types of rotations performed on AVL trees with an example.

2. (a) Write an algorithm to perform each of the following operations :
(i) Insertion of an element into a linear array.
(ii) Delete every third element from a linear array.
(b) Write an algorithm to implement dequeue using array.

3. (a) Define binary tree. What are the traversals in binary tree ? Explain each traversal with an                    example.
(b) Create a Binary Search Tree for the following alphabets. Start from an empty BST.
R, F, G, B, Z, U, P, K, L.
Show the trees at each stage.

4. (a) Discuss the Prim's algorithm to find the minimum cost spanning tree.
(b) Explain the process of converting a tree to a binary tree.

5. (a) Illustrate inserting an element into a heap with the following numbers :
2, 3, 81, 62, 1, 20, 35, 15, 9, 48.
(b) Write a short note on various file organizations.

Notes-2

1. (a) Write an algorithm that accepts two polynomials as input and prints the resultant polynomial               due to the addition of input polynomials.
(b) What is a stack ? Explain the various operations of stack with an example for each operation.
(c) Write an algorithm for each of the following :
(i) Depth first search
(d) What is a Splay Tree ? How does it differ from a Tree ?

2. (a) Write an algorithm for the implementation of a doubly linked list.
(b) Write an algorithm for the implementation of a stack.

3. (a) Write a non-recursive algorithm for inorder traversal of a binary tree.
(b) Define B-tree. Give an example of a B-tree.

4. (a) Explain Kruskal's algorithm with an example.
(b) What are red-black trees ? Explain the properties of a red-black tree.

5. (a) Explain QuickSort algorithm. Trace the algorithm for the following set of data :
25, 0, 8, 78, 6, 34, 56, 90, 100
(b) Explain the merits and demerits of various file organisations.

Notes-3

1. (a) Prove by induction that
(i) The number of leaves in a binary tree of height 'h' are less than or equal to 2h.
(ii) The number of nodes in a full binary tree of height 'h' are equal to (2h+1 _ 1).
(b) Write an algorithm to implement Doubly Linked List.
(c) Compare Heap sort and Quick sort with each other.
(d) Write an algorithm for addition of two Sparse Matrices.

2. (a) Write an algorithm for insertion sort. Write step by step working of the algorithm for the                       following set of data.
43, 16, 11, 89, 32, 46, 1, 88
(b) What is a splay tree ? Write the steps involved in a top-down splaying procedure.

3. (a) How is a circular queue better than a linear queue ? Also, write functions for adding and
removing an element from the circular queue.
(b) Write an algorithm for implementing a singly linked list using arrays.

4. (a) Write prim's algorithm for constructing a minimum cost spanning tree and trace the
algorithm on the following network.

(b) Discuss the various file organisation methods. Also, list the advantages and disadvantages of               each.

5. (a) Explain the depth first search algorithm with an example.
(b) What are Red-Black Trees ? What is their significance ?

IGNOU BCA/MCA MCS-021 3rd semester Term-End Examination (DATA AND FILE STRUCTURES) term-end exam notes

Also available:-