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.

Q: True/False 8. Loops are more general than recursion

A: Loops can be easily conceptualized and programmed since it's execution is straightforward.  On other…

Q: Using C++ draw a house

A: The provided C++ program showcases a simple yet creative use of ASCII characters to construct a…

Q: Design of a calculator program using pseudocode and a Python program that uses a list and functions…

A: # Program make a simple calculator # This function adds two numbersdef add(x, y):    return x + y #…

Q: 6) There are other recursive functions such as the Lucas Sequence, how can you apply what you have…

A: DESCRIPTION: Using unordered map we can save the repeating values and use them later to reduce the…

Q: c) Recursive computation with dynamic programming.

A: Below i have given dp program with output:

Q: 8) In MATLAB, a list menu architecture should be done by O loop structure O stack O if-else…

A: The answer for the above question is as follows.

Q: 2. fast please in c++ If an array is already sorted, which of the following algorithms will exhibit…

A: Introduction: Sorting algorithms are an essential part of computer science and are used to arrange…

Q: Write a recursive function that takes a number n and a list num_list as inputs, then determines…

A: Given: Write a recursive function that takes a number n and a list num_list as inputs, then…

Q: what goes in the blank

A: Here have to determine about what goes in the blank.

Q: What, precisely, are strings, if you may ask?

A: Datatype: In computer programming, data types are classifications of data that determine the type of…

Q: How does the concept of recursion work in computer programming?

A: Computer programming is a form of low art writing programs or instructions that the computer can…

Q: hy do we use loops in programming and are loops really

A: Loops are an essential concept in programming that allow us to execute a block of code repeatedly.…

Q: Working with Lists

A: A required Python program is as follows, File name: “threeLists.py” # a)List comprehension of…

Q: How can a coder escape an endless loop?

A: The solution is given in the below step

Class

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 Oriented Programming gets together data and its behavior (methods) in a single location (object) which makes it easier to understand.