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

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write your own functions to create, insert nodes (both from the front and the end of the list), delete nodes, count the number of nodes, display all the nodes, display a specific node for the linked list. C++ and Java
Write C++ statements for the following tasks: i. Create X point to the link(node) that stores data 21.ii. Create list point to the link containing data14.iii. Create Y point to the last link in the list.iv. Create list point to an empty list.v. Set the value of the link containing 23 to 33.vi. Create and insert the link with data 8 after the link pointed to by X.vii. Delete the link with data 21. Also, deallocate the memory occupied by this link.
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Please code this in Java Or C or C++ Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
E et SE Q.2 Write a program that uses a circular linked list to simulate the sequence of execution directly. The list is must built with key from 1 to N:the variable x holds onto the beginning of the list as it is built, and the pointer in the last node in the list is set to x(code in c).
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…
Please,help me by providing C++ programing solution. Do not use the LinkedList class or any classes that offers list functions. Implement a LinkList in C++. Pease,implement with an ItemType class and a NodeType structThe program should read a data file,and the data file has two lines of data as follow:100, 110, 120, 130, 140, 150, 160100, 130, 160The program will first add all of the numbers from the file,then display all of them,then delete.
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
Write a program in Java to manipulate a Double Linked List: Count the number of nodes Insert a new node before the value 7 of Double Linked List Search an existing element in a Double linked list (the element of search is given by the user) Suppose List contained the following Test Data: Input the number of nodes : 4Input data for node 1 : 5Input data for node 2 : 6 Input data for node 3 : 7 Input data for node 4: 9
2 //please write it in java This is a circular doubly linked list. It starts at the head pointer (Head). Write a function that adds a node (P) at the nth location away from the Head keeping the circle connected. For example, based on the image, the list is: C, D, B, A After calling addNthNode(Head, P, 2), the list becomes C, F, D, B, A Note that if the position is 1 then the Head should be updated. Your code should validate parameters, and handle edge cases. void addNthNode (Node Head, Node P, int position){ // your code goes here }
Write C++ code to display all even numbers in the a doubly linked list pointed to by Dlist. Use while loop to scan all nodes from the start to the end. (Each node has three fields: a data field that contains the information, and right and left fields contain pointers to nodes on either side. Ex. p->left represents the address of the node to the left of node p) (any number of nodes in the linked list) Dlist 4 3 8 HIIN 7 1