Implement the build_dictionary() function to build a word frequency dictionary from a list of words. Ex: If the words list is:

Write a program that will take this dictionary: gradePoints = {"A":4,"B":3,"C":2,"D":1,"F":0} and this list: courseList = ["CST 161","Mat 144","ENG 201","PSY 101","HIS 101"] and randomly use elements from each of these lists : gradeList = ["A","B","C","D","F"] creditList = [3,4] and produce a grade point average. Academic average is determined by dividing the total number of qualitypoints earned by the total number of credits taken, whether passed orfailed. The following table is an illustration of this computation:GRADE & QUALITY NUMERICAL POINTSCourse . . . Credits Value Per CourseHIS 101. . . . . .3 C    (2) 6PSY 101. . . . . 3 B    (3) 9MAT 144. . . . 4 D    (1) 4ENG 201. . . .  3 B+ (3.5) 10.5CST 161. . . . . 3 F     (0) 0Total credits taken: 16Total quality points earned 29.529.5 divided by 16 results in a 1.8 gradepoint average. Here the gradeList element will be embedded as the key in referencing the grade points.   (e.g. gPoints = gradePoints[random gradeList element])…

Description: Given a string, find the first non-repeating character in it and return its index. If it doesn't exist, return -1. Example 1 input: "leetcode" output: 0 Example 2 input: "loveleetcode" output: 2 The solution we are targeting here is a linear time solution since we have to go over the entire string to know which one is unique in it. A straightforward method we can easily think of is having a Dictionary record letter frequency. Subsequently, iterate over the input again and return the index that has a letter frequency of 1.

3. Write the remove_evens() function that receives a list of integers as a parameter and returns a new list of integers containing only the odd numbers from the original list. Ex1) If n = [1, 2, 3, 4, 5, 6], remove_evens(n) returns [1, 3, 5]. Ex2) If n = [2, 4, 8], remov move_evens(n) returns [].

Create class Test in a file named Test.java. This class contains a main program that performs the following actions: Instantiate a doubly linked list. Insert strings “a”, “b”, and “c” at the head of the list using three Insert() operations. The state of the list is now [“c”, “b”, “a”]. Set the current element to the second-to-last element with a call to Tail() followed by a call to Previous()Then insert string “d”. The state of the list is now [“c”, “d”, “b”, “a”]. Set the current element to past-the-end with a call to Tail() followed by a call to Next(). Then insert string “e”. The state of the list is now [“c”, “d”, “b”, “a”, “e”] . Print the list with a call to Print() and verify that the state of the list is correct.

In Python Write code that creates a LIST (data type) of only the first names of the students who are juniors. call it juniorRoster= Given the folowing data set: studentDataScores =…

Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k)   Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.

Write a program that implements a sorted list using dynamic  allocated arrays.  DataFile.txt contains the information of poker cards. C: clubs(lowest),D: diamonds, H: hearts, S:spades(highest) 2 (lowest), 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A No Joker cards Any C cards are lower than any D cards. DataFile Content(You can write the file specification into your program.): H4,C8,HJ,C9,D10,D5,DK,D2,S7,DJ,H3,H6,S10,HK,DQ,C2,CJ,C4,CQ,D8,C3,SA,S2,HQ,S8,C6,D9,S3,SQ ,C5,S4,H5,SJ,D3,H8,CK,S6,D7,S9,H2,CA,C7,H7,DA,D4,H9,D6,HA,H10,S5,C10 H4, D5, HK, D2 H4, HK, SK C9,C10 For examples, DJ means J of Diamonds;H7 means 7 of hearts. Your job Create a list by dynamic allocated array and set the size to 20 Read the first 20 cards in the first line of the file, the put them one by one into the list by implementing and using putItem(). The list must be kept sorted in ascending order. Then print out all the cards in the list in one line separating by commas. Then delete the cards indicated in the second…