A list is either empty or it consists of two parts: the first element which is a (head) and a tail, which is the remining elements. In Prolog we represent the empty list by the atom [] and a non-empty list by a term [H|T] where H is the head and T is the tail. From the list, write the following programs: 1. Merge two lists generating an ordered list. 2. Find the last element in a list with screenshot please

A list is either empty or it consists of two parts: the first element which is a (head) and a tail, which is the remining elements. In Prolog we represent the empty list by the atom [] and a non-empty list by a term [H|T] where H is the head and T is the tail. From the list, write the following programs: 1. Merge two lists generating an ordered list. 2. Find the last element in a list with screenshot please

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

A list is either empty or it consists of two parts: the first element which is a (head) and a tail, which is the remining elements. In Prolog we represent the empty list by the atom [] and a non-empty list by a term [H|T] where H is the head and T is the tail. From the list, write the following programs: b. Merge two lists generating an ordered list. c. Find the last element in a list. d. Find the maximum and minimum number in a list. e. Delete an element from the list. please answer all 4 questions.
Answer the given question with a proper explanation and step-by-step solution. Java N people are arranged in a circle.(Each assigned a number in sequence). Starting from the first, countdown , removing each k-th person from the list, while closing the circle. Determine the number of the last one remaining in the circle (k<=N) Hint: to solve this problem, use a list in which the reference field of the last element contains a link to the first element
A list of int values can be defined recursively as: a list item, a comma, and a list, where a list item is any int value.
Answer the given question with a proper explanation and step-by-step solution. Write in Java: Write a menu-driven program to illustrate the use of a linked list. The entries will only consist of integer number keys (values). The program should implement the following options in order: • Insert- insert a key into a list- not allowing duplicate integers. • Delete- delete a key from the list. • Search- finds or does not find a particular key in the list. • Print- prints the list graphically in horizontal form. If the list is empty output- "Nothing to print". • Size- count of all the keys in the list. • Sort- sorts the keys in the list in ascending order. • Reverse- reverses the order of the keys in the list • Rotate- moves the key at the front of the list to the end of the list. If the list has 0 or 1 elements it should have no effect on the list. • Shift- rearranges the keys of a list by moving to the end of the list all values that are in odd number positions (indexes) and otherwise…
Write a recursive function in Python which should take a nested/embedded list and return us the number of string elements present in it (also counting the strings present in inner lists). Sample calls are shown below; >>> countstr([10,'abc',20,'hello']) 2 >>> countstr([10,'abc',2,'20']) 2 >>> countstr([10,'abc',20,['20','fahad',100], None, 10.5]) 3
Suppose we have a singly linked list implemented with the structure below and a function that takes in the head of the list.typedef struct node{int num;struct node* next;} node;int whatDoesItDo (node * head){struct node * current = head;struct node * other, *temp;if (current == NULL)return head;other = current->next;if (other == NULL)return head;other = other->next;temp = current->next;current->next = other->next;current = other->next;if (current == NULL){head->next = temp;return head;}other->next = current->next;current->next = temp;return head;}If we call whatDoesItDo(head) on the following list, show the list after the function has finished.head -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7
Write a LISP program that creates two variables, x and y. The program should then bind (assign) the list (q r s t) to variable x and then bind (assign) the list (1 3 5 7) to variable y. Then, using only variables x and y, write LISP S-expressions (statements) to generate the following lists: (t s r q) (1 3 s (r 5)) ((q r s t) . 1) (((q s) (1 3)) . q) ((q 1) (r 3) (s 5) (t 7)) Print each of these lists on the screen using an appropriate function (print would work). Note that the dots in there are important and they count.
Prolog programme Q1) Write a Prolog program ac2bd/2 that transforms a list of letters into anotherlist where each a is replaced by b and each c is replaced by d. All other atomsshould remain unchanged.
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
A difference between a list and tuple is that a tuplecannot be sliced, while a list can. A) False B) True C) True, but only for numeric lists/tuples D) Depends on the size of the list/tuple
Python Exercise: Given a sorted list of integers, output "Middle item: " followed by the middle integer. Assume the number of integers is always odd. Ex: If the input is: 2 3 4 8 11 the output is: Middle item: 4 The maximum number of inputs for any test case should not exceed 9. If exceeded, output "Too many inputs". Hint: First read the data into a list. Then, based on the list's size, find the middle item.
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…