Create a stack of size M for storing integer data. Our task is to insert a node at position P = M/2. If P is a decimal number, then P can be rounded to the nearest integer. please send me answer of this question . thank you.
Write a function to find binary equivalent of given decimal number.
Important note:
You have to display a switch menu like this:
Press <1> for Problem 1
Press <2> for Problem 2
Press <3> for Problem 3
Press <4> for Problem 4
Press <0> for exit
When user presses 1 your program should execute problem 1, when he/she press 2 it should execute problem 2 and so on. It clearly shows that you have to do the whole lab in one .c file.
Sort the data stored in 1) stack 2) queue and 3) linked list entered in part 1. Attach the code and output
Take integer input from user and store it in the form of 1) stacks 2) queues and 3) Linked list. Attach the code and output.
Create a stack of size M for storing integer data. Our task is to insert a node at position P = M/2. If P is a decimal number, then P can be rounded to the nearest integer.
Hint: A temporary stack can be used to store the data while inserting a new node. Use header file math.h and routine round(P), to round P to the nearest integer.
Multi Line Text.
Write a function to find Narcissistic number
Solve the problem of sparse 2- dimensional array
A sparse array is an array in which most of the elements have the same value (known
as the default value—usually 0 or null). The occurrence of zero elements in a large
array is inefficient for both computation and storage. It is required to implement
sparse 2- dimensional array in more efficient way. Your implementation should
allow:
Adding new value in a specific index.
Removing a value from specific index.
Search for a value and return its index if found.
Return a value from specific index.
We run the "Word mix" code , The output will be like this
The nth word in the output should contain nth letter of each word in the given sentence. The letters of the output word should be in same order as the words in the given sentence. If a word in the given sentence doesn't have n-letters, you can skip it while considering the letters of the n-th word.
Ex: Input :: Welcome to your first problem
Output :: Wtyfp eooir luro crsb otl me em
But,run the above code displayed only "Wtyfp" .
Given a string, write a program to print a secret message that replaces characters with numbers 'a' with 1, 'b' with 2, ..., 'z' with 26 where characters are separated by '-'.
Note: You need to replace both uppercase and lowercase characters. You can ignore replacing all characters that are not letters.
abcdefghij12345678910
klmnopqr1112131415161718
stuvwxyz1920212223242526
We run the "Word mix" code , The output will be lie this
The nth word in the output should contain nth letter of each word in the given sentence. The letters of the output word should be in same order as the words in the given sentence. If a word in the given sentence doesn't have n-letters, you can skip it while considering the letters of the n-th word.
Ex: Input :: Welcome to your first problem
Output :: Wtyfp eooir luro crsb otl me em