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 a C code that will search an int type target from a dynamic linked list. The linked list contains int type values inside each of the nodes. The “search” function will use following input-output arguments,Input: Pointer to the head of the list that you are searching Target value that you are searchingOutput: Pointer to the node that contains the target if found or, NULL if not found.
Write a program in C++ to create a Binary Search tree (BST) of integers. The program will perform these operations: Insert node(s), Traverse In-order, Search node, Delete node, Leaf Count, Parent of a node and Quit. Use the header file similar to this: #include #ifndef BT_H #define BT_H using namespace std; class BT { private: struct node { int data; node* left; node* right; }; node* root; public: BT(); bool isEmpty() const { return root == NULL; } void insert(int); void print_inorder(); void inorderTrav(node*); void searchBST (int); void deleteNode(int); int count (); int leafCount(node*); void nodeParent(int); //Constructor //Check for empty //Insert item in BST //In-order traversing driver //In-order traversing //Searches BST for a specific node //Delete item from BST //Count driver //Counts number of leaves in BST //Finds parent of a node }; #endif Use the following menu in your program. MENU 1. Insert node(s) 2. Traverse In-order 3. Search node 4. Delete node 5. Leaf Count 6.…
Write a program in Java to manipulate a Singly Linked List: Count the number of nodes Insert a new node before the value 5 of Singly Linked List Search an existing element in a Singly linked list (the element of search is given by the user) Suppose List contained the following Test Data: Input data for node 1: 2Input data for node 2 : 3Input data for node 3 : 5 Input data for node 4: 8
complete a C program which delete the first and last nodes of Linked List by using below functions: void Firstnodedelete(); void Lastnodedelete();
Solve this Question in C++ Given the head of a linked list, rotate the list to the right by k places. Please hard code your initiallinked list.
C++ DO NOT COPY FROM OTHER WEBSITES Code with comments and output screenshot is must for an Upvote
C++ Program: It is given to the same members containing n whole numbers. You have to switch to multiple K elements of this list, so that the outgoing list becomes a continuation of arithmetic. From all the arithmetic continuity, you have to choose the best one. You can differently describe the arithmetic continuity with the two numbers a0 and d - the first element of a given continuity and a step that describes the next aspect. (ai = a0 + į* d). Continuation A (a0, do) is much better than continuation B (b0, d1) if (a0
C++ Design and implement a concordance program, that stores a library of books records. Create a book class with name, ISBN, author, and publication date. Use a binary search tree to store the records, where the author name is the search key. Revise the binary search tree to be able to store and retrieve duplicate search keys.
In C++, develop an algorithm that adds the value val to a queue object Q. The queue is represented using an array data of size s. The algorithm should assume that the queue is not full. The most recently added item is at index r (rear), and the least recently added item is at index f (front). If the queue is empty, r = f = -1.
Write c++ program with output and comments on the lines of code for Reverse the given linked list:For example:Input: 100 > 200 > 300 > 400 > 500 > 600Reversed: 600 > 500 > 400 > 300 > 200 > 100 NOTE: ATTACH OUTPUT AND MUST ADD COMMENTS WITH THE CODE
Give correct answer. Don't copy other's work.
Implement a STUDENT RECORD program in C++ (SINGLY LINKED LIST) that does the following: 1. Displays a Menu (do..while loop) with choices for user to choose from (similar to the one shown below) MENU • • Add a student to the record. Remove a student from the record. Display the whole record list. Modify the student record. Exit. 2. Enables the user to choose the choice of action by typing the number between (1 to 5): adding a student to the record. removing a student from the record. displaying the whole record; 4) modify the student record. exit. The record contains students' full name, student number, and general weighted average. 3. The list must display proper messages (when the list is full, or when the list is empty, or when the items requested to be deleted is not in the list, etc.) 4. The program should run until user chooses to Exit. NOTE: - All the code must be well commented per line - Must be a singly linked list - Use dynamic memory allocation - Use an array Has the…