Exam paper of Discrete Mathematics, Exams of Discrete Mathematics

Download Exam paper of Discrete Mathematics and more Exams Discrete Mathematics in PDF only on Docsity!

” eee. | Paper Code: TCS 302 End Semester Examination 2019 B.Tech {CSE} {il Semester Data Structure with C Time: Three Hours MM: 100 Note: (i) All questions are compulsory. (ii) Answer any two sub questions in each main question (iii) Total marks for each main question is twenty. Qi. (2X 10 = 20 Marks) a. Give Memory representation and linked fist representation of the following graph. b, Write a C function to Create a binary search tree and then write a C function to count total number of nodes (Use double pointer). c. Explain threaded binary search tree. Give an example of left threaded binary search tree. az, (2% 10 = 20 Marks) a. Assuming that we have queue implemented using linked list having pointers front and rear. Write C function to print the queue from rear to front. b. Explain minimal spanning tree. Find minimai spanning tree of the following graph. ¢, Explain Huffman's algorithm Using Huffman’s algorithm encode following signal. ‘ ccececacdcecdcecacecbbcdebdebdcebdc