Explain why a linked list is called dynamic data structure, C/C++ Programming

Assignment Help:

Question:

(a) (i) What is recursion?
(ii) What advantage is there in its use?
(iii) What disadvantage is there in its use?

(b) The factorial of a positive number can be computed using the formula n ! = 1 × 2 × 3 ×..........× n

However, the function ‘factorial' can also be defined as a recursive function in programming exercises.

Write down the main part of the program which contains the following:

(i) the function prototype
(ii) declare a positive integer variable n
(iii) an output statement to display n

(iv) an input statement to allow a user to enter a number (which is stored in variable n)

(v) another output statement that calculates and displays the factorial of the number.

Now write down the function using recursion.

(c) (i) Explain why a linked list is called dynamic data structure?

(ii) What are the three most important advantages of using linked list over arrays?

(iii) State one disadvantage of using linked list in programs.

(d) A stack is also a dynamic data structure which can be implemented in its simplest way by making use of arrays.

Declare a structure containing

(i) an integer array to hold the elements of the stack
(ii) an integer to indicate the position of the current stack top within the array.

Now write the ‘pop' operation to remove the top element from the stack. Write the ‘push' operation to add an element to the stack.


Related Discussions:- Explain why a linked list is called dynamic data structure

Explain function templates, Function Templates Function templates give ...

Function Templates Function templates give you with the capability to write a one function that is a skeleton, or template, for a family of similar functions. In function ov

Padovan string., #question.A Padovan string P(n) for a natural number n is ...

#question.A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a s

Data structure and algorithm, implement two stacks in one array A[1...n] in...

implement two stacks in one array A[1...n] in such a way that neither stack overflows unless the total number of elements in both stacks together is n. For this you need to produce

Computer security and operating system, The Shortest Job Next (SJN) algorit...

The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst. Shortest remaining time rst algori

Program, program to check whether a given point lies inside a rectangle or ...

program to check whether a given point lies inside a rectangle or not

Verification class, I need help to understand and do this assignment ******...

I need help to understand and do this assignment ********************************************************* You are to insert the missing code in the C program given for combinatio

PROGRAMMING, PROCEDUAL PROGRAMMING INTRODUCTION

PROCEDUAL PROGRAMMING INTRODUCTION

Class booking system, I want source code for class booking system by using ...

I want source code for class booking system by using C++ Programming...Urgent

Define four facilities provided by c language preprocessor, Define Four Fac...

Define Four Facilities Provided by C Language Preprocessor? The C language preprocessor provides four separate facilities that you can use as you see fit:   Inclusion

String, A string is said to be "Beautiful"€, if it contains only non repet...

A string is said to be "Beautiful"€, if it contains only non repetitive alphabets

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd