Section A

a. Differentiate between primitive and non-primitive data structure. [4]

b. Write PUSH and POP algorithm on Stacks. [10]

c. What is preorder, Postorder and Inorder? [6]

d. What is recursion? [2]

Write a program in C to generate Fibonacci series using

recursion.. [10]

e. Explain the concept of array with the help of suitable example. [5]

f. What are different types of linked lists? [3]

g. Explain the concept of dynamic memory allocation? [2]

h. What is variable? [2]

Distinguish between local and global variable. [4]

i. Explain any one searching technique with example. [5]

Section B

i. Write an algorithm for insertion of an element into a linked list. [10]

ii. Define Binary Search Tree (BST) and operation associated with it. [5]

iii. Write the algorithm for Bubble sort. Explain it with suitable example [5]

iv. Explain following.

(a) Sequential search [5]

(b) Circular queue [5]

Section C

Write a program (attach source file of your program and include its source code your answer script too )

that does the following

• defines a structure for a phonebook contact with at least the following members: contact_name, phone_number, email.
• If the phonebook is empty it will prompt user to create list
• If not empty the program will list all the phonebook contacts and details .

[HINT] Implement a linked list and traverse the linked list [20]