Write a function createPassword() with no return value to randomly select 8 capital letters from the alphabet.The function receives the address of the first characters of the password string as parameter.Hint: Declare a characters string that contains all the capital letters of the alphabet and use the index valuesof the characters in the string for random selection of characters, e.g. char alpha [27] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"char 'pAlpha = alpha;Display the password from the main() function.Write a function replaceVowels() with no return value to replace all the vowels (A, E, I, O, U) that have beenselected with a symbol from the list ($ % @ # &). That is, A must be replaced by S, E replaced by %, I mustbe replaced by @. O replaced by #, and U must be replaced by &.The function receives the address of the first characters of the password string as parameter.Display the password agin from the main() function.Example output:Random charactersWYYHBORTVowels replacedWYYHB#R@

Actually, program is a executable software that runs on a computer.

Write a function createPassword() with no return value to randomly select 8 capital letters from the alphabet. The function receives the address of the first characters of the password string as parameter. Hint: Declare a characters string that contains all the capital letters of the alphabet and use the index values of the characters in the string for random selection of charac

Write a function createPassword() with no return value to randomly select 8 capital letters from the alphabet. The function receives the address of the first characters of the password string as parameter. Hint: Declare a characters string that contains all the capital letters of the alphabet and use the index values of the characters in the string for random selection of charac

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Write a function inde which returns the index (start from 1) of the occurrence of a given value. Use helper function. Two functions are enough.inde(1, [1,2,1,1,2,2,1]) → [1,3,4,7] Write a function nele which repeats each element in a list n times. Use helper function. Two functions only.nele([1,2],3) → [1,1,1,2,2,2] Write a function isfact to determine if a positive integer is a factorial number. Do not use any formula such as T(n)=n(n+1)/2. Do it in recursive fashion. Two functions are enough.isfact(120) → true
18) Write a function that takes in 2 lists and checks whether they have the same elements in the same order. If the elements are all the same, the function should return the string “same”. If any of the elements are different, the function should return the string “different”. The definition of the function should be: Def equals(a, b):
Write the following function that sorts and merges two lists into a new sorted list. The new list contains only even numbers. def myMergeEvenList(list1, list2): Enter list1: 10,5,6,7 Enter list2: 12,8,5,0,1 The merged list is: 0,6,8,10,12
Suppose we use a Python dictionary to store gradebooks of multiple courses. gradebooks = {'Course 1': [['Troy', 92], ['Alice', 95]], 'Course 2': [['James', 89], ['Charles', 100], ['Bryn', 59]], 'Course 3': [['Jack', 74], ['Karren', 97], ['Astha', 92], ['Nancy', 96]]} Use the builtin sorted function with appropriate programming constructs (e.g., lambdas, comprehensions, , etc.) to complete the following tasks: Write code to create a new list named gradebooks_a, with students of each course being sorted by score in descending order. The expected result is: [[['Alice', 95], ['Troy', 92]], [['Charles', 100], ['James', 89], ['Bryn', 59]], [['Karren', 97], ['Nancy', 96], ['Astha', 92], ['Jack', 74]]]
Instructions are given within the quotations for each function. 1)def remove_duplicate_sorted(t): """ this function returns a new list generated from t that has t's elements without duplicates and is sorted from smallest to largest. """ return [] 2)def list_to_dictionary(t): """ t is a list of values (values could be str, list, tuple, set, dictionary), create and return a dictionary such that the key is len(v) for some v in t, and the value is a list of values [v1, v2, ...] from t (in the order they appeared in t) whose len(vi) is the key. for example: if t = [(1,2,3), "abc", [1, 2], (), ""] then return value of this function should be: {3: [(1, 2, 3), 'abc'], 2: [[1, 2]], 0: [(), '']} """ return {} 3)def run(): """ This function repeatedly ask user to enter a string and store them in a list and print it out. It also passes this list to remove_duplicate_sorted() function and list_to_dictionary() function and print out the results of the function calls. """ return if __name__ ==…
Write a user defined function named as “length_list” function that finds the length of a list of list_node_t nodes. This code should fit with the following code.Partial Code: #include <stdio.h> #include <stdlib.h> /* gives access to malloc */ #define SENT -1 typedef struct list_node_s { int digit; struct list_node_s *restp; } list_node_t; list_node_t *get_list(void); int main(void) { list_node_t *x;int y; x=get_list(); printf("%d\n",x->digit); printf("%d\n",x->restp->digit); printf("%d\n",x->restp->restp->digit); // your length_list function should be called from here printf("Length is: %d",y); } /* * Forms a linked list of an input list of integers * terminated by SENT */ list_node_t * get_list(void) { int data; list_node_t *ansp; [20]scanf("%d", &data); if (data == SENT) { ansp = NULL; } else { ansp = (list_node_t *)malloc(sizeof (list_node_t)); ansp->digit = data; ansp->restp = get_list(); } return (ansp);
Use the following code which adds and prints elements of a simply linked list, and add a member function that will duplicate nonzero value nodes in a list. Call your function properly in main and print the list again. #include <iostream> using namespace std; struct node { int data; node *next; node(int d,node*n=0) { data=d; next=n; } }; class list { node *head; public: list() { head=0; } void print() { for (node *t=head;t!=0;t=t->next) cout<<t->data<<" "; cout<<endl; } void add(int el) { head=new node(el,head); } }; void main() { list l; l.add(0); l.add(7); l.add(1); l.add(0); l.add(3); l.print(); }
Q1:Write a function that returns a new list by eliminating theduplicate values in the list. Use the following function header:def eliminateDuplicates(lst):Write a test program that reads in a list of integers, invokes the function,and displays the result. Here is the sample run of the program Enter ten numbers: 2 3 2 1 6 3 4 5 2The distinct numbers are: 1 2 3 6 4 5 Q2:Write a program that reads in your Q1 Pythonsource code file and counts the occurrence of each keyword in the file.Your program should prompt the user to enter the Python source code filename. This is the Q1: code: def eliminateDuplictes(lst):newlist = [] search = set() for i in lst: if i not in search: newlist.append(i) search.add(i) return newlist a=[] n= int(input("Enter the Size of the list:")) for x in range(n):item=input("\nEnter element " + str(x+1) + ":") a.append(item) result = eliminateDuplictes(a) print('\nThe distinct numbers are: ',"%s" % (' '.join(result)))
Define the function (siftNum lst). This function should resolve to all the numbers in the list, lst. For example: (siftNum '(a 8 2 1 m l 90 p 2)) resolves to '(8 2 1 1 90 2).
Use the following code which adds, searches and prints elements of a doubly linked list, and add a member function that will union 2 doubly linked lists and store the union elements in a new list. Call your function properly in main and print all 3 lists. Note: You can consider that each list is a set, where no redundant elements are found. #include <iostream> using namespace std; struct node { int data; node *next,*prev; node(int d,node*n=0,node *p=0) { data=d; next=n; prev=p; } }; class list { node *head; public: list() { head=0; } void print() { for (node *t=head;t!=0;t=t->next) cout<<t->data<<" "; cout<<endl; } bool search(int el) { for (node *t=head;t!=0;t=t->next) if(t->data==el) return true; return false; } void add(int el) { if(head==0) head=new node(el); else { node *t=head; for(;t->next!=0;t=t->next); t->next=new node(el,0,t); } } }; void main() { list l1,l2,l3; l1.add(0); l1.add(7);…
C++ Create a generic function add_bookends(ls, e) that adds a copy of element e to the front and back of list ls.
# Create a list of tuplestuples = [("p", 1), ("q", 2), ("r", 3)]# Use enumerate() to iterate over the tuples and print the index and valuefor index, value in enumerate(tuples):print(index, value)This code will print the following output:0 p1 q2 r Could you try to modify your code to get the output mentioned by you? Also, the output for the above function should be0 ('p', 1)1 ('q', 2)2 ('r', 3) Could you please confirm?