Search & Filtering
Make a program that will accept an integer and loop from 1 to that integer. Then, print all numbers from that range that are greater than 3.
The characters don’t need to be in particular order. For example, the characters [“y”, “r”, “o”, “u”] are needed to form the words [“your”, “you”, “or”, “yo”] Note: the input words won’t contain any spaces; however, they might contain punctuation and/or special characters. Sample Input words = ["this", "that", "did", "deed", "them!", "a"] Sample Output ["t", "t", "h", "i", "s", "a", "d", "d", "e", "e", "m", "!"] Solution Instruction ● You can submit your solution in the programming language of your choice. Y
Make a program that will input two number, If the two number entered are ODD then perform the addition and display the Sum. Your program will be terminated by an option if the user not to proceed another entry.
The Picture class has a Rectangle variable rectangle and has a color variable (a string) as well. Create the constructor for Picture.
Linked List in c++.
1:Write a function to delete a node from end. 2. Write a function to delete a node at given position. 3. Write a function to get the middle the linked list (only use single pointer i.e. head) 4. write a function to move last to nodes of a linked list to the front. Example: 1->2->3->4->5, then the function should change the list to 5->4->1->2->3. 5. Write a function to remove nodes with similar data in a given linked list.
Consider the following list:2 10 17 45 49 55 68 85 92 98 110Using the binary search, how many comparisons are required to determine whether the following items are in the list or not? Show the values of first, last, and middle and the number of comparisons after each iteration of the loop.
Create a class Node with
a. attributes data, next and previous pointer
b. accessors and mutators for this class
c. constructor and destructor
d. function called display.
1. insert a node at first ,
2. overload to Insert a node at last
3. overload to Insert at specified position of double linked list. E.g if the position number is 6, it is inserted between node at position 5 and 7. If position number is greater than the size of list, it is prompted that the position number does not exist and therefore is being inserted at end.
4. eliminate duplicates from doubly linked list
5. delete a node from first,
6. overload to delete a node from last
7. overload to delete at specified position of double linked list. E.g if the position number is 6, it is deleted from between node at position 5 and 7. If position number is greater than the size of list, it is prompted that the position number does not exist and therefore is being deleted from the end.
Create a class Node with
a. attributes data, next pointer
b. accessors and mutators
c. constructor and destructor
d. a function called display.
1. Write functions to perform the following operations
a. create a circular singly linked list to perform
i. insertion,
ii. deletion
iii. traversing
b. create a sub menu for merge operations of two circular linked list L1, L2
i. Press 1 to append L1 to L2.
ii. Press 2 to append L2 to L1.
iii. Press 3 to merge L1 and L2 in sorted order.
c. print odd nodes of a circular linked list to divide the circular linked list into two parts into odd and even list?
c++ full program that calculate the value of u. u=a+gv(squareRoot2), where g is constant
c++ full program that allows a lecture to add a semester mark final examination mark, the program must then compute to whether the student pass or not
