IGNOU Question Bank For MCA

I am searching for MCA Question paper of IGNOU so from where can I get it?

[Arvind Kumar]

You want MCA Question paper of IGNOU so here it is:

1. (a) Write a program that sorts a given linked 10 list of integers. Also, write a function that splits this linked list into a linked of even numbers and linked list of odd integers.

(b) Write a program to find the frequency of 7 words in a given paragraph. Show output as words listing with frequency.

(c) Assume that 'TOP' consists of the address 7 of the root node of Binary Search Tree (BST). Write a program to delete an element from BST if it exists else return —1.

(d) Explain insertion sorting with an example. 6 Give other situations in which insertion sort is most efficient. Also, explain how the worst case can be avoided.

2. (a) Write a program to perform PUSH and POP 5 operations on stack using pointers.

(b) Indicate and explain situations which need 5 for "Double rotation" in an AVL Tree while inserting elements.

3. Represent a binary tree using pointers and write 10 a program to traverse a given tree level by level. In a particular level, the nodes are to be traversed from left to right.

Here I am uploading question paper and you can free download whenever you want.