12.
13.
14.
16.

16.
17.

18.
19.
20.

21.
22.
23.

24.
25.

26.
21.

28.

2 D 71623

Define the terms node, address, null pointer and next pointer for linked list

Explain different applications of queue.
Explain how do you represent the binary tree in the computer’s memory ?

Write an algorithm to find the location of a node N ina graph G. Explain.
(5 x 3 = 15 marks)

Section C

Answer any five questions (Short Essay Type) out of eight questions.
Each question carries 5 marks.

Define Big O notation. Explain with examples.
Define two way linked list. Write a program to delete a node from two way linked list using recursive
function - pass arguments.

Write a program to implement Stack using linked list.

Write a program to traverse a binary search tree non recursively in preorder.

Write a program to delete even numbered nodes from a list use recursive function and pass

parameters.
What is Breadth First search? Explain with example.

What is hash function? Explain different hash function with example.
Compare sequential and binary search, write a program to search an element using sequential

search.
(5 x 5 = 25 marks)

Section D

٠

Answer any three questions (Long Essay Type) out of five questions.
Each question carries 10 marks.

Explain first pattern matching algorithm with example
Compare array and linked list. Write a program to implementation of circular linked list, using

recursive functions.
Write a program to sort a list of nine integer numbers using quicksort. Explain with example.

How to represent a tree using an array ? Write a program to delete an element from a binary tree.

How can we sort a list of numbers using Insertion sort ? Write algorithm with suitable example of

insertion sort.
(3 x 10 = 30 marks)