QUESTION 12Consider the Double Linked List that is given below, where each box represents a 'node' type with two fields: integer data and a node type reference 'next' that points to thenext node in the list.a)Write an algorithm to count all nodes that contains an odd number.b)Write an algorithm to print all nodes that contain an even mumber in the reverse direction of the list.head2-国-null3.4nulltailTTTTParagraphArial3 (12pt)品DDQMashupsHTHL CSSClick Save and Submit to save and submit. Click Save All Answers to save all answers.

The two datatype are *next and data. 1. Count odd numbers in list. Algorithm new node ptr=head int…

STION 12 ider the Double Linked List that is given below, where each box represents a 'node' type with two fields: integer data and a node type reference 'next' that points to the node in the list. Write an algorithm to count all nodes that contains an odd number. O Write an algorithm to print all nodes that contain an even number in the reverse direction of the list. + null tail T F Paragraph v Arial 3 (12pt) Mashups HTHL ESS

STION 12 ider the Double Linked List that is given below, where each box represents a 'node' type with two fields: integer data and a node type reference 'next' that points to the node in the list. Write an algorithm to count all nodes that contains an odd number. O Write an algorithm to print all nodes that contain an even number in the reverse direction of the list. + null tail T F Paragraph v Arial 3 (12pt) Mashups HTHL ESS

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 Java Program
In a doubly-linked list with 2 dummy nodes, the list's _____. Group of answer choices head pointer may be null tail pointer may be null head and tail pointer may point to the same node head node's next pointer may point to the list's tail node
With Head node or not? statement is: if(first->llink == first) output << "List is empty"; O a. It is a Doubly linked list without Head node. O b. It is a Doubly linked list with Head node.
Data Structure 1
data structure-JAVA
LINKED LISTS These are the Nodes in the linked list. 50–40→30–20→10 Write a program for the singly linked list with insert, deletion and display operations.
Please solve this exercise in Python.
Given the following linked lists: Trace the following codeon these two linked lists and show what will be printed.
EXCEPTION: A linked list cannot represent a set. This is a set data structure without values. Sets have no duplicates. Sets are amenable to mathematical set functions like union and intersection.
T/F: All Linked Lists must have head node.
Q2) Given a singly linked list, write a function to find the last element from the beginning whose n%k == 0, where n is the number of elements in the list and k is an integer constant. For example, if n = 19 and k = 3 then we should return 18 th node. %3D
IN PYTHON THANK YOU