Posts

Showing posts from 2016

3rd semester(10cs33) Module 3 Linked list Question Bank

Question Bank of Module-3 Linked list 1.        What is linked list? With example, Explain how linked list are represented in memory .Also explain the advantage and disadvantage of linked list 2.        Write a short note on Memory allocation & Garbage Collection 3.        Explain with neat sketch types of linked list. 4.        Explain with algorithm operations of linked list a)Inserting into linked list b)Deleting 5.        Explain with algorithm operation of linked list a)Traversing b) Searching 6.        What is single linked list. Explain operation of linked list : 1)Insert 2)Delete 3)Search 4)Delete 5)Create 6) Display 7.        Write a c program to implement create, insert,delete ,search and display of Single linked list 8.        What is double linked list. With Pseudocode ,Explain the operation of Double linked list . 9.        Write a C program to implement double linked list to create,insert,delete,search and display of double linked list. 10.   

10CS43 Design and Analysis of Algorithm Question Bank-Unit 1

Design and Analysis of Algorithm(10cs43) UNIT 1 INTRODUCTION QUESTION BANK 1.What is algorithm? What are properties of Algorithm? 2.If f 1 (n)€O(g 1 (n)) and If f 2 (n)€O(g 2 (n)) prove that f 1 (n)+ f 2 (n) €O(max{g 1 (n),g 2 (n)}) 4.Explain briefly various Asymptotic Notation? 5. Design a recursive Algorithm for solving Tower of Hanoi problem and give general plan of analyzing that algorithm. Show that time complexity of tower of Hanoi algorithm is exponential in nature. 6.Write an algorithm for computing GCD.               a)Using Euclid Algorithm.              b)Repetitive subtraction             c) Consecutive Integer Checking 7.Explain the Sieve of Eratosthenes Alogrithm to generate prime factor? 8.Write general plans for non recursive algorithm for analyzing time efficiency?Explain with algorithm Element Uniqueness problem.Show that time efficiency is Quadratic in nature. 9.Explain non recursive algorithm to find Maximum of n-elements .Also provid