Write a C program (DO NOT USE C++) to do the followings. • Define a node structure that contains an integer data and the next node pointer. • Ask user to enter the total count of nodes (N) in the Linked List. • In a loop, dynamically allocate N nodes one-by-one and add them to the Linked List (unordered) with the rules below: • The value of a node's data should be randomly assigned between 0 and 100. (Use the built-in C functions srand and rand). • If the data is ODD, then the node should be added to the beginning of the linked list. Otherwise it should be added to the end of the linked list. • Program should display the counts of ODD and EVEN numbers. • By looping, program should also display the Linked List as shown below. Sample Screen Output: Enter total count of nodes in Linked List : 20 Count of ODD numbers : 8 Count of EVEN numbers : 12 LINKED LIST : ODD PART: 37 93 87 91 57 67 41 19 EVEN PART: 14 10 56 8 60 16 18 42 38 64 6 60

Write a C program (DO NOT USE C++) to do the followings. • Define a node structure that contains an integer data and the next node pointer. • Ask user to enter the total count of nodes (N) in the Linked List. • In a loop, dynamically allocate N nodes one-by-one and add them to the Linked List (unordered) with the rules below: • The value of a node's data should be randomly assigned between 0 and 100. (Use the built-in C functions srand and rand). • If the data is ODD, then the node should be added to the beginning of the linked list. Otherwise it should be added to the end of the linked list. • Program should display the counts of ODD and EVEN numbers. • By looping, program should also display the Linked List as shown below. Sample Screen Output: Enter total count of nodes in Linked List : 20 Count of ODD numbers : 8 Count of EVEN numbers : 12 LINKED LIST : ODD PART: 37 93 87 91 57 67 41 19 EVEN PART: 14 10 56 8 60 16 18 42 38 64 6 60

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section13.4: Linked Lists

Problem 2E

See similar textbooks

Similar questions

Write a code in C language that will create graphs and write them to a file in a particular format. The program should be able to accept a number of vertices, create an cycleusing adjacency list data structure and finally output the graph. Where N is the number of vertices in the graph with V vertices and E edges. P[] = Pointer for each vertex V, 1 <= V <= N denoting the starting point in E[] of the list ofvertices adjacent to vertex V. That is, the vertices adjacent to vertex V are indicated inlocations E[P[V]], E[P[V]+1], ..., E[P[V+1]-1].E[] = list of distinct graph edges (length = 2E)Give the asymptotic running timeRun your code for various values of n and time itCreate a table showing the running times for various values.Create a graph of the running times vs various values. Use a linear scale on theaxis.
Write a C program that will initially create an UNSORTED list containing the following and then run the program:MitchDianeJackRobbieKatherine Answer and explain the following questions below:a) If we check the memory location of each element in the list, what would it be? What index represent each element?b) What happens if we add Morrie in the list? What will be its index value? c) What does the new list look like? Where do you think Morrie should be placed and why? With the same list above (with Morrie added), delete/remove Jack. Answer and explain the following questions below:a) What is the new list? Identify the elements of the list and its index.b) What happened to the former location occupied by Jack?
Write a C++ program to add two large integers with up to 300 digits. One approach is to treat each number as a list, each of whose elements is a block of digits of that number. For example, the integer 179,534,672,198 might be stored with block[O] = 198, block[l] = 672, block[2] = 534, block[3] = 179. Then add two integers (lists), element by element, carrying from one element to the next when necessary.
Write a c++ program that requires 5% of the sizeof the array to be reserved as slots for other operations. Show in a program how you would achieve this, and then create a method to populate the array-based queue.
Write a c++ program that sort a linked list by moving the nodes of the list until their data are in ascending order. Explain how you would achieve thisusing any sorting algorithm, and why it is the only way to achieve this.
Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…
write a c++ program by using linked list to visit a single linklist consisting of five nodes and having a data field of integer type. calculate the factorial of each value stored in it. crete a new linked list and store the factorial the newly created linked list and also print both the linked list. plz do in c++
Write a program in C++ or C to create a singly linked list of n nodes and display it in reverse order. Test Data : Input the number of nodes : 3 Input data for node 1 : 5 Input data for node 2 : 6 Input data for node 3 : 7 Expected Output : Data entered in the list are: Data = 5 Data = 6 Data = 7 The list in reverse are: Data = 7…
write a c++ program by using linked list to visit a single linklist consisting of five nodes and having a data field of integer type. calculate the factorial of each value stored in it. crete a new linked list and store the factorial the newly created linked list and also print both the linked list.
by using the linked list technique, write a full c programming that could display as below: A character array of size 25 containing the student’s name An integer number containing the student’s age A floating-point number containing the student’s GPA A pointer for the next node and dispay the location address of the node for each student for all head and tail The program shall displayed the expected outcome that was attached.
Write a c++ code that compare the times to traverse a list (containing a large number of elements) implemented in an array, in a simple linked list, and in an unrolled linked list. In this experiment, you need to generate a large list, store it in each representation, and then measure the time to traverse the list in each representation. For the array, this is almost straightforward: Fill the array and then do a sequential scan. Here is the thing to watch for: When you fill the array, it all gets read into cache. So, somehow you need to ensure that almost all of the array is NOT in cache before you do your traversal. One thing you can do is make your array big enough that most of it will not fit in cache at once. You need to make sure that the node capacity is not too small, or it will behave too much like a simple linked list.
Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists.For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space. Input:List1 = 1->3->30->90->120->240->511List2 = 0->3->12->32->90->125->240->249 Output: Following is resulting linked list out of two sorted listsResultingList = 1->3->12->32->90->125->240->511