Assignment I Questions:

1. Find the time complexity for the following

2. Solve this equation

T(n)=T(n-1)+T(n-1)+1+1 n>1
T(1)=1 n=1
3. Solve this equation
T(n)=3T(n/2)+n3 log2n
4. Solve this equation
T(n)=3T(n/3)+n/2
5. True or false? Why?
Anyone of the following can be used to declare anode for a singly linked list
and “NODEPTR nodePtr;” can be used to declare pointer to a node using any
of the following
/*1st declaration*/
typedef struct node
{
int data;
struct node *nextPtr;
}*NODEPTR;
/*2nd declaration*/
struct node
{
int data;
struct node *nextPtr;
};
typedef struct node *NODEPTR;
 6. Consider a singly linked list having n nodes. The data items d1, d2, …., dn are
stored in the n nodes. Let Y be a pointer to the jth node (1 ≤ j ≤ n) in which dj
is stored. A new data item d stored in a node with address Y is to be inserted.
Give an algorithm to insert d into the list to obtain a list having items d1, d2,
……, dj-1, d, dj, …..dn in that order without using the header.
7. A company wants to maintain their employee’s details such as Name, ID,
DOJ, department and area. When the employee is reliving from the company
remove that record. Implement this using double linked list in C. Display it in
employee ID order.
8. Write a C program to convert infix expression into postfix expression and
evaluate postfix expression.
9. Write a C program to insert and delete elements from Binary search tree.
Display BST elements using in order, pre order and post order.
10. Write a C program to create hash table with size 12 for linear probing
and quadratic probing.

Hand written Assignment I Submission date: on or before

26/02/2019