joinList(n) (2 pts) Takes an integer number n. This functions returns the list [1,2,..,n,n,...2,1] for every n>0. Preconditions: While the function will receive integer values, you should not make any assumptions about the value of n. Input An integer value Output list Starting at 1 moving upwards, a list with the sequence 1 to n, followed the sequence that starts at n moving downwards to 1 Argument do not satisfy the conditions of the function None Example: >>> joinList(5) [1, 2, 3, 4, 5, 5, 4, 3, 2, 1] >>> joinList(1) [1, 1] >>> joinList(-3) is None True

joinList(n) (2 pts) Takes an integer number n. This functions returns the list [1,2,..,n,n,...2,1] for every n>0. Preconditions: While the function will receive integer values, you should not make any assumptions about the value of n. Input An integer value Output list Starting at 1 moving upwards, a list with the sequence 1 to n, followed the sequence that starts at n moving downwards to 1 Argument do not satisfy the conditions of the function None Example: >>> joinList(5) [1, 2, 3, 4, 5, 5, 4, 3, 2, 1] >>> joinList(1) [1, 1] >>> joinList(-3) is None True

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

Related questions

Q: Write a function to get the value of the Nthnode in a Linked List. [Note: The first (N=1) item in…

A: Please find the answer below :

Q: Create a function that takes each value of the averaged sequence and passes it through the…

A: Here's an example function that implements the requirements you've specified:- f(x) = { 1 / (x-5),…

Q: The coding language is python The code in there may or not be correct I was playing around with it…

A: PROGRAM: # The user in prompted for input and stored in userInput userInput = str(input("Enter the…

Q: Using Clojure Write a procedure remove-third that takes a list, and returns the same list with the…

A: remove is used in clojure to remove an element from list by using diffrenet condition.It is a lazy…

Q: C function takes a simply-linked list as an input argument. It modifies the list by moving the last…

A: Lets see the solution.

Q: struct insert_at_back_of_dll { // Function takes a constant Book as a parameter, inserts that book…

A: Find the snippet.

Q: write codes in python

A: Your list comprehension is almost there, but there seems to be a slight issue in how you're…

Q: value_list is read from input. shift_right() has one parameter list_to_modify, and shifts…

A: Store the last element of the list in a temporary variable temp.Iterate over the elements of the…

Q: Write a function called CommonElements that takes in two ADT Lists and returns a new ADT List with…

A: The language of function is C++ as no language is mentioned but logic remains the same Function to…

Q: Focus on: Basic list operations, methods, use of functions, and good programming style Part 1.…

A: The program generates a random list of integers between 0 and 19, and then performs the requested…

Q: Fill in the blanks in the function such that it works as intended. def deep_add(collection): if…

A: Please find the answer below :

Q: With Head node or not? statement is: if(first != null) p = first;

Q: True/False 3. Arrays are usually heterogeneous, but lists are homogeneous.

A: Array is a data structure which contains collections of similar data type elements. List is a…

Q: 2. listAverage() returns the average number in a list. Which of these functions does this correctly?…

A: listaverage() function which return the average of number given in list.

Q: If I double the number of items in a sorted list of numbers, all algorithms will take twice as long…

A: Answer for all given below with explanation

Q: In this lab you are asked to complete the provided code so that it: Accepts integers as input from…

A: we have to shift single linked list to right.if it contain 1 node it will remain same else tail…

Q: 5. The following function indexCounter aims to find and return all the indices of the element x in a…

A: def indexCounter(L, x): indexList = [] startIndex = 0 while startIndex < len(L):…

Q: A loop that iteratively processes a given list is called a for construct. So long as there are…

A: For loop is a programming language conditional iterative statement which is used to check for a…

Q: Write a function that takes in a list and a number, and returns whether or not the list contains the…

A: In this question we need to implement a python function which takes a list and a number as parameter…

Q: The chapter is nested lists Create code in python using for loops Thanks!

A: A Python program for the given criteria is as follows, File name: “main.py” #Get user input…

Q: With Head node or not? statement is: if(first->llink == first) output << "List is empty"; O a. It is…

A: The question has been answered in step2

Q: struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book…

A: Required code is as follows as provided in the next step:

Question

joinList(n)
(2 pts)
Takes an integer number n. This functions returns the list [1,2,...,n,n,...2,1] for every n>0.
Preconditions:
While the function will receive integer values, you should not make any assumptions about the
value of n.
Input
An integer value
Output
list
Starting at 1 moving upwards, a list with the sequence 1 to n, followed the sequence
that starts at n moving downwards to 1
None Argument do not satisfy the conditions of the function
Example:
>>> joinList(5)
[1, 2, 3, 4, 5, 5, 4, 3, 2, 1]
>>> joinList(1)
[1, 1]
>>> joinlist(-3) is None
True

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Write a function sum_alt that takes a list of numbers zand calculates their alternating sum, defined as n-1 Σ(-1)+1 zk. k=0 Here Zo, Z1, Zn-1 denote the individual elements of the list.
in #lang scheme
python LAB: Subtracting list elements from max When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This can be done by normalizing to values between 0 and 1, or throwing away outliers. Write a program that adjusts a list of values by subtracting each value from the maximum value in the list. The input begins with an integer indicating the number of integers that follow.
Pythong help!
• find_last(my_list, x): Takes two inputs: the first being a list and the second being any type. Returns the index of the last element of the list which is equal to the second input; if it cannot be found, returns None instead. >> find_last(['a', 'b', 'b', 'a'], 'b') 2 >>> ind = find_last(['a', 'b', 'b', 'a'], 'c') >>> print(ind) None
Write a function called find_duplicates which accepts one list as a parameter. This function needs to sort through the list passed to it and find values that are duplicated in the list. The duplicated values should be compiled into another list which the function will return. No matter how many times a word is duplicated, it should only be added once to the duplicates list. NB: Only write the function. Do not call it. For example: Test Result random_words = ("remember","snakes","nappy","rough","dusty","judicious","brainy","shop","light","straw","quickest", "adventurous","yielding","grandiose","replace","fat","wipe","happy","brainy","shop","light","straw", "quickest","adventurous","yielding","grandiose","motion","gaudy","precede","medical","park","flowers", "noiseless","blade","hanging","whistle","event","slip") print(find_duplicates(sorted(random_words))) ['adventurous', 'brainy', 'grandiose', 'light', 'quickest', 'shop', 'straw', 'yielding']…
struct nodeType { int infoData; nodeType * next; }; nodeType *first; … and containing the values(see image) Using a loop to reach the end of the list, write a code segment that deletes all the nodes in the list. Ensure the code performs all memory ‘cleanup’ functions.
LAB: Playlist (output linked list) Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the head node, which does not contain user-input values. Ex: If the input is: Stomp! 380 The Brothers Johnson The Dude 337 Quincy Jones You Don't Own Me 151 Lesley Gore -1 the output is: LIST OF SONGS ------------- Title: Stomp! Length: 380 Artist: The Brothers Johnson Title: The Dude Length: 337 Artist: Quincy Jones Title: You Don't Own Me Length: 151 Artist: Lesley Gore
5 partition_list (head) This is a little like split_list() from the Short problem, except that, instead of splitting the list into two by cutting it into the middle, you will now build two lists to return, using alternate values. The first value in the input list should be returned at the head of the first new list; the second value should be the head of the second list. Keep on alternating from there, putting one new value on the first list, and one on the second. (But remember that the length of the input list might be odd.) Example Suppose you have the following input list: 10 - 13 -> -1 -> 1000 - 0 It should return the following two lists: 10 1 0 13 -> 1000
Replace XXX in the following function header for a doubly-linked list: ListInsertAfter(listName, currentNode, XXX) Group of answer choices headNode tailNode middleNode newNode
A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary. ----------------------------------------------------------------------------------- """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst): """Returns the position of the target item if found, or -1 otherwise. The lyst is assumed to be sorted in ascending order.""" position = 0 while position < len(lyst): if target == lyst[position]: return position position += 1 return -1 def main(): """Tests with three lists.""" print(sequentialSearch(3, [0, 1, 2, 3, 4])) print(sequentialSearch(3, [0, 1, 2])) # Should stop at second position. print(sequentialSearch(3, [0, 4, 5, 6])) if…
python programming Write a function that will insert a new value into the middle of a Linked List. INPUT: The head of the Linked List, the value to insert OUTPUT: Nothing is output RETURNED: Nothing is returned