A linear list is being maintained circularly in an array c[0...n-1] with front, and rear set up as for circular queues. a) Draft a formula/algorithm in terms of front, rear, and n for the number of elements in the list. Answer: Algorithm If Front == -1 then number of elements = 0 If Front == Rear then number of elements = 1 If Front < Rear then number of elements = Rear - Front +1 If Front> Rear then number of elements = (Front - n) + (Rear + 1) b) Write an algorithm to delete the k-th element in the list. Answer: Algorithm We have to transverse the ayerse list and do following (a) Count node before deletion. b) If (count ==k) that means current node is to be deleted. (i) Delete current nodes (ii) Reset count as 0, i.e., do count = 0. (c) Update the previous node if cQunt != 0, if count is 0 that means that node is a starting point. (d) Update pointer and continue until all k-th node gets deleted. c) Write an algorithm to insert an element y immediately after the k-th element. Answer: Replace the current kh element with new element as Step 1) edit list to k-1 location Step 2) set (k-1)-> next node = new element which you want to insert. Step 3) new element-> next =k-> next. Step 4) free older k which is now replaced with new element d) Calculate the time complexity of your algorithms for b) and c). Answer: The time complexity of enQueue(value) or deQueue(value) operation is Q(1) because we have the hands over front and rear at any time. And we simply insert at rear and delete from front.

Object Oriented Programming System (OOPs) is a programming model built on the perception of “objects” that contains data and methods. The major purpose of Object Oriented Programming is to increase the maintainability and flexibility of programs. Object …