Please give a few C/C++ questions on the topics............?

I need a few questions for writing programs in c/c++ on the following topics (its a college assignment !!!! )


structures, linked lists, class, arrays, strings, functions, pointers, file input/output. The questions should not be from any book preferable (or if it is, then please specify the name of the book). Thanks.

Please give a few C/C++ questions on the topics............?
1. Perform recursive binary search and Linear search. Hence find the time required to search an element.





2. Sort a given set of elements using the Heapsort method.





3. a)Sort a given set of elements using Merge Sort Method.


b)Check whether a given graph is connected or not using DFS method.





4. Sort a given set of elements using selection sort and hence find the time required to sort elements.





5. a) Obtain the Topological ordering of vertices in a given digraph.


b)Soft a given set of elements using Insertion sort method.





6. Implement 0/1 Knapsack problem using dynamic programming.





7. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm.





8. Sort a given set of elements using Quick sort method.





9. Find minimum Cost spanning Tree of a given undirected graph using Kruskal’s algorithm.





10. a)Print all the nodes reachable from a given starting node in a digraph using Breadth First Search method.


b)Implement all pair shortest paths problem using Floyd’s algorithm.





11. Find a subset of a given set S = {s1, s2,….,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S = {1,2,5,6,8} and d=9 there are two solutions {1,2,6} and {1,8}. A suitable message is to be displayed if the given problem instance doesn’t have a solution.





12. a) Implement Horspool algorithm for string matching.


b) Find the Binomial Co-efficient using Dynamic Programming.





13. Find minimum Cost spanning Tree of a given undirected graph using Prims algorithm.





14. a)Print all the nodes reachable from a given starting node in a given digraph using Depth First Search method.


b) Compute the transitive closure of a given directed graph using Warshall’s algorithm. Implement N Queen’s problem using Back Tracking.





write a c++ program to create a class called STRING and implement the following operations. Display the results after every operation by overloading the operator %26lt;%26lt;.


a. string s1=”aaa”.


b. String s2=”dddddd”.


c. String s3=s1+s2 (use copy constructor).





.Check whether a given graph is connected or disconnected using Depth First Search Method





write a c++ program to create a class called matrix using a two dimensional array of integers. Implement the following operations by overloading the operator == which checks the compatibility of two matices to be added and subtracted. Perform the addition and subtraction by overloading the operators + and - respectively. Display the results by overloading the operator %26lt;%26lt;


if(m1==m2)


{


m3=m1+m2;


m4=m1-m2;


}


else


display error








Write a C++ program to create a class called bin tree with member functions to perform inorder ,postorder,preorder traversals.Create a binary tree object to demonstrate traversals.





these are lab programs for 3rd sem engg
Reply:http://yepoocha.blogspot.com


might help Report It

Reply:how to program a perfect diamond using c++


the output is like this








enter a character:___A____(enter a character to use ex. A)


enter size :____5___(enter the how many characters in the center or its size)








______A


_____AAA


____AAAAA


_____AAA


______A





( "_" the underscore there is a space)
Reply:May be you can contact a C++ expert at websites like http://askexpert.info/
Reply:C++++++++++++++++++++++++++


+++++++++++++++++++++++++++


+++++++++++++++++++++++++++