1.Write a C program which uses Binary search tree library and implements following Functions: a) Create Binary Tree [10] b) Insert a node in a binary tree [5] c) Search a node in binary tree [5] d) Display a binary tree [5]
2. There are lists where insertion should ensure the ordering of data elements. Since the elements are in ascending order the search can terminate once equal or greater element is found. Implement a singly linked list of ordered integers (ascending/descending) with insert, search and display operations. i. Search, Display operation carries 5 marks each ii. Validate at appropriate position iii. Creation of singly linked list in sorted order
3.Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation Implement functions to print in degree, out degree and to Display the adjacency matrix 1.Read a graph as adjacency Matrix [5] 2.Creation of adjacency List [10] 3.alculate out degree & In degree from adjacency list [10]
4.Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation. Implement functions to print out degree of any vertex i (take i as parameter to the function) from adjacency list Read a graph as adjacency Matrix [5] Creation of adjacency List [10] Calculate out degree [10]
5.Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation. Write a function to display the graph in adjacency list form. 1.Read a graph as adjacency Matrix [5] 2.Creation of adjacency List [10] 3.Display adjacency List & In degree of any vertex i (take I as parameter to the function) each carries 5 marks [10]
6. Write a C program that accepts the graph as an adjacency matrix and checks if the graph is undirected. The matrix for undirected graph is symmetric. Also calculate in degree of all vertices Read a graph as adjacency Matrix [5] Check the matrix is symmetric or not [10] Calculate in degree of all vertices
7.Write a C program which uses Binary search tree library and implements following functions : Create Binary search Tree [10] Insert a node in a binary tree [10] Display a binary tree [5]
8. Write a C program which uses Binary search tree library and implements following Functions (use Recursion). a) Create Binary search Tree [10] b) In order [5] c) Pre order [5] d) Post order [5]
9.Write a C program which uses Binary search tree library and implements following functions Create Binary search Tree [10] In order [5] Search a node in binary tree [5] Count a node in binary tree [5]
10. Write a C program which uses Binary search tree library and implements following functions a) Create Binary search Tree [10] b) Insert a node in a binary tree [5] c) Search a node in binary tree [5] d) Display a binary tree [5]
11. Implement a stack library (dystack.h) of integers using a dynamic (linked list) implementation of the stack and implementing the Push,Pop,IsEmpty,Init,Peek operations. Write a menu driven program that includes stack library and calls different stack operations. Push & Pop operation carries 8 mark each [16] Isempty & Peek carries 4 mark each [8] Init function [1]
12. There are lists where new elements are always appended at the end of the list. The list can be implemented as a circular list with the external pointer pointing to the last element of the list.Implement singly linked circular list of integers with append and display operations. The operation append(L, n), appends to the end of the list, n integers either accepted from user or randomly generated Creation of circular Link List & Append Function each carrires 10 marks. [20] Display Function [5]
13.Implement a list library (singlylist.h) for a singly linked list with the insert, delete, search, display operations. Write a menu driven program to call the operations. Insert, Delete carries 6 marks each [12] Display Function [4] Search Function [5] Creation of Singly link list [4]
14.Implement a list library (doublylist.h) for a doubly linked list with the insert, delete search, display operations. Write a menu driven program to call the operations. Insert, Delete carries 6 marks each.
15.Implement a stack library (dystack.h) of integers using a dynamic (linked list) implementation of the stack and implementing the init,push,pop,peek & isempty operations. Write a menu driven program that includes stack library and calls different stack operations. Push & Pop operation carries 8 marks each. [16]
16.Implement a queue library (dyqueue.h) of integers using a dynamic (circular linked list) implementation of the queue and implementing the above Insert,Delete,Is Empty operations. Write a menu driven program that includes queue library and calls different queue operations.insert,Delete,Create ,IsEmpty,Disaplay operation carries 5 marks each.
17. Write a C program which uses Binary search tree library and implements following functions a) Create Binary Search Tree [10] b) Count a node in binary tree [5] c) Search a node in binary tree [5] d) Display a binary tree [5]
18.Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the Insert,Delete,IsEmpty,IsFull,Init,Peek operations. Write a Menu driven program that includes queue library and calls different queue operations.Insert, Delete operation carries 8 mark each.IsEmpty,IsFull function carries 3 mark each.Init ,Peek function.
19. Write a function that checks whether a string of characters is palindrome or not. The function should use a stack library (cststack.h) of stack of characters using a static implementation of the stack.
20.Write a function that reverses a string of characters. The function should use a stack library (cststack.h) of stack of characters using a static implementation of the stack. same as Slip no : 24_2
21.Implement a list library (singlylist.h) for a singly linked list with create() ,display(), insert(), delete() operations. Write a menu driven driver program to call the operations.
22.Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the Insert,Delete,IsEmpty,IsFull,Init,Peek operations. Write a Menu driven program that includes queue library and calls different queue operations.Insert, Delete operation carries 8 mark each.IsEmpty,IsFull function carries 3 mark each.Init ,Peek function.
23.Write a C program which uses Binary search tree library and implements following functions a) Create Binary search Tree [10] b) Insert a node in a binary tree [5] c) Search a node in binary tree [5] d) Display a binary tree [5]
24.Write a function that reverses a string of characters. The function should use a stack library (cststack.h) of stack of characters using a static implementation of the stack. same as Slip no : 24_2
25. Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the Insert,Delete,IsEmpty,IsFull,Init,Peek operations. Write a Menu driven program that includes queue library and calls different queue operations.Insert, Delete operation carries 8 mark each.IsEmpty,IsFull function carries 3 mark each.Init ,Peek function.
26.Implement a list library (doublylist.h) for a doubly linked list with the insert, delete search, display operations. Write a menu driven program to call the operations. Insert, Delete carries 6 marks each.
2. There are lists where insertion should ensure the ordering of data elements. Since the elements are in ascending order the search can terminate once equal or greater element is found. Implement a singly linked list of ordered integers (ascending/descending) with insert, search and display operations. i. Search, Display operation carries 5 marks each ii. Validate at appropriate position iii. Creation of singly linked list in sorted order
3.Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation Implement functions to print in degree, out degree and to Display the adjacency matrix 1.Read a graph as adjacency Matrix [5] 2.Creation of adjacency List [10] 3.alculate out degree & In degree from adjacency list [10]
4.Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation. Implement functions to print out degree of any vertex i (take i as parameter to the function) from adjacency list Read a graph as adjacency Matrix [5] Creation of adjacency List [10] Calculate out degree [10]
5.Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation. Write a function to display the graph in adjacency list form. 1.Read a graph as adjacency Matrix [5] 2.Creation of adjacency List [10] 3.Display adjacency List & In degree of any vertex i (take I as parameter to the function) each carries 5 marks [10]
6. Write a C program that accepts the graph as an adjacency matrix and checks if the graph is undirected. The matrix for undirected graph is symmetric. Also calculate in degree of all vertices Read a graph as adjacency Matrix [5] Check the matrix is symmetric or not [10] Calculate in degree of all vertices
7.Write a C program which uses Binary search tree library and implements following functions : Create Binary search Tree [10] Insert a node in a binary tree [10] Display a binary tree [5]
8. Write a C program which uses Binary search tree library and implements following Functions (use Recursion). a) Create Binary search Tree [10] b) In order [5] c) Pre order [5] d) Post order [5]
9.Write a C program which uses Binary search tree library and implements following functions Create Binary search Tree [10] In order [5] Search a node in binary tree [5] Count a node in binary tree [5]
10. Write a C program which uses Binary search tree library and implements following functions a) Create Binary search Tree [10] b) Insert a node in a binary tree [5] c) Search a node in binary tree [5] d) Display a binary tree [5]
11. Implement a stack library (dystack.h) of integers using a dynamic (linked list) implementation of the stack and implementing the Push,Pop,IsEmpty,Init,Peek operations. Write a menu driven program that includes stack library and calls different stack operations. Push & Pop operation carries 8 mark each [16] Isempty & Peek carries 4 mark each [8] Init function [1]
12. There are lists where new elements are always appended at the end of the list. The list can be implemented as a circular list with the external pointer pointing to the last element of the list.Implement singly linked circular list of integers with append and display operations. The operation append(L, n), appends to the end of the list, n integers either accepted from user or randomly generated Creation of circular Link List & Append Function each carrires 10 marks. [20] Display Function [5]
13.Implement a list library (singlylist.h) for a singly linked list with the insert, delete, search, display operations. Write a menu driven program to call the operations. Insert, Delete carries 6 marks each [12] Display Function [4] Search Function [5] Creation of Singly link list [4]
14.Implement a list library (doublylist.h) for a doubly linked list with the insert, delete search, display operations. Write a menu driven program to call the operations. Insert, Delete carries 6 marks each.
15.Implement a stack library (dystack.h) of integers using a dynamic (linked list) implementation of the stack and implementing the init,push,pop,peek & isempty operations. Write a menu driven program that includes stack library and calls different stack operations. Push & Pop operation carries 8 marks each. [16]
16.Implement a queue library (dyqueue.h) of integers using a dynamic (circular linked list) implementation of the queue and implementing the above Insert,Delete,Is Empty operations. Write a menu driven program that includes queue library and calls different queue operations.insert,Delete,Create ,IsEmpty,Disaplay operation carries 5 marks each.
17. Write a C program which uses Binary search tree library and implements following functions a) Create Binary Search Tree [10] b) Count a node in binary tree [5] c) Search a node in binary tree [5] d) Display a binary tree [5]
18.Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the Insert,Delete,IsEmpty,IsFull,Init,Peek operations. Write a Menu driven program that includes queue library and calls different queue operations.Insert, Delete operation carries 8 mark each.IsEmpty,IsFull function carries 3 mark each.Init ,Peek function.
19. Write a function that checks whether a string of characters is palindrome or not. The function should use a stack library (cststack.h) of stack of characters using a static implementation of the stack.
20.Write a function that reverses a string of characters. The function should use a stack library (cststack.h) of stack of characters using a static implementation of the stack. same as Slip no : 24_2
21.Implement a list library (singlylist.h) for a singly linked list with create() ,display(), insert(), delete() operations. Write a menu driven driver program to call the operations.
22.Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the Insert,Delete,IsEmpty,IsFull,Init,Peek operations. Write a Menu driven program that includes queue library and calls different queue operations.Insert, Delete operation carries 8 mark each.IsEmpty,IsFull function carries 3 mark each.Init ,Peek function.
23.Write a C program which uses Binary search tree library and implements following functions a) Create Binary search Tree [10] b) Insert a node in a binary tree [5] c) Search a node in binary tree [5] d) Display a binary tree [5]
24.Write a function that reverses a string of characters. The function should use a stack library (cststack.h) of stack of characters using a static implementation of the stack. same as Slip no : 24_2
25. Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the Insert,Delete,IsEmpty,IsFull,Init,Peek operations. Write a Menu driven program that includes queue library and calls different queue operations.Insert, Delete operation carries 8 mark each.IsEmpty,IsFull function carries 3 mark each.Init ,Peek function.
26.Implement a list library (doublylist.h) for a doubly linked list with the insert, delete search, display operations. Write a menu driven program to call the operations. Insert, Delete carries 6 marks each.
Your blog explained clearly about the recent talks in the industry. For Software Courses:
ReplyDeleteHadoop Training in Chennai
Android Training in Chennai
Selenium Training in Chennai
Digital Marketing Training in Chennai
JAVA Training in Chennai
German Classes in chennai
Qtp training in Chennai
Qtp Training in Adyar