b) Sort random array of n integers (accept the value of n from the user) in ascending order by using the insertion sort algorithm.
Sort a random array of n integers in ascending order. Data Structure / Assignment 1 / Set A
a) Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the six operations. Write a driver program that includes a queue library and calls different queue operations.
Implement a queue library (stqueue.h) of integers using a static implementation of the queue and implementing the above six operations. Data Structure / Assignment 5 / Set A The User-defined…
a) Read the data from a file ‘cities.txt’ containing names of 100 cities and their STD codes. Accept a name of the city from the user and use a linear search algorithm to check whether the name is present in the file and output the STD code, otherwise output “city not in the list”.
Read the data from file cities.txt containing names of 100 cities and their STD codes. Data Structure / Assignment 3 / Set B Save above code as linear.c
b) Write a function that checks whether a string of characters is a palindrome or not. The function should use a stack library (cststack.h) of a stack of characters using a static implementation of the stack.
Write a function that checks whether a string of characters is palindrome or not. Data Structure / Assignment 4 / Set B The User-defined header file: Save this above code…
a) Write a function that reverses a string of characters. The function should use a stack library (cststack.h) of a stack of characters using a static implementation of the stack.
Write a function that reverses a string of characters. Data Structure / Assignment 4 / Set B The User-defined header file: Save this above code in the stack library file…
b) Write a C program that accepts the vertices and edges for a graph and stores it as an adjacency list. Implement functions to print outdegree of any vertex i.
Write a C program that accepts the vertices and edges for a graph and stores it as an adjacency list. Data Structure / Assignment 8 / Set A
a) A statically implemented queue may become full even if the initial positions in the array are unoccupied. To avoid this situation, a wrap around can be attempted and initial positions reused. The array can be treated as if it were circular. This can be implemented making use of mod function. Implement a queue library (cstqueue.h) of integers using a static implementation of the circular queue and implementing the above six operations.
A statically implemented queue may become full even if the initial positions in the array are unoccupied. Data Structure / Assignment 5 / Set B The above code saves as…
b) Implement a queue library dyqueue.h of integers using a dynamic (circular linked list) implementation of the queue and implementing the above five operations. Write a driver program that includes queue library and calls different queue operations.
Implement a queue library dyqueue.h of integers using a dynamic (circular linked list) implementation of the queue and implementing the above five operations. Data Structure / Assignment 5 / Set…
a) Write a C program which uses Binary search tree library and implements two more functions.
Create(T, n) – inserts n nodes in the Binary search tree where the values are either accepted from user or randomly generated (use insert)
Count(T) – returns the number of nodes in the tree
Write a C program which uses Binary search tree library and implements two more functions. Data Structure / Assignment 7 / Set B Binary Search Tree Btree.h The above file…
a) Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation. Write a function to display the graph in adjacency list form.
Write a C program that accepts the graph as an adjacency matrix and converts it to adjacency list representation. Data Structure / Assignment 8 / Set B