Steps to create a word sequence

- Everyone needs to create their own vocabul line to be used in questions.

- Here are the steps for creating a word sequence. Follow the process steps to create the word sequence. Examples of how to create word sequences are given every step of the way.

- The word sequence created when answering questions will be used.

Step 1: Preparing a sequence of names: Type the first 10 letters of your first and last name in the following tiles without leaving a space between your first and last name. Every box will have a letter. If your first and last name have fewer than 10 letters, you can add random letters(s) to the last blank tiles. Let's call the sequence a series of names.

Figure 1. Name sequence

1st letter 2nd letter 3rd letter 4th letter 5th letter 6th letter 7th letter 8th letter 9th letter 10th letter

Example for Step 1: Here's how to create a sample name sequence.

For example, let the first and last name be SENA STONE. First and last name are a total of 7 letters.

These seven letters are settled in the first 7 tiles as follows, and randomly selected letters are added instead of the last three. Below are the randomly selected letters Y, H, T.

Sample name sequence

1st letter 2nd letter 3rd letter 4th letter 5th letter 6th letter 7th letter 8th letter 9th letter 10th letter

S E N A T A S Y H T

Step 2: The process of preparing a vocabulary sequence: A series of words consisting of two letters and 10 words will be used in the questions. Below are 10 words with one letter missing. The places of the missing letters are shown in the bottom line ( _ ). Instead of missing letters, type the letters you typed in the name sequence in Figure 1 above. The following is an example.

Figure 2. Word sequence

1.

Word 2.

Word 3.

Word 4.

Word 5.

Word 6.

Word 7.

Word 8.

Word 9.

Word 10.

Word

Words W_ _R _ _ _ _J _K _ X_ I_

Will come to the gap from the Name sequence in Figure 1

Letters From the name sequence to the space

1st letter From the name sequence to the space

2nd letter From the name sequence to the space

3rd letter From the name sequence to the space

4th letter From the name sequence to the space

5th letter From the name sequence to the space

6th letter From the name sequence to the space

7th letter From the name sequence to the space

8th letter From the name sequence to the space

9th letter 10th letter from name sequence to space

Next Next Next Next Next Next Next Next Next Next

Example for step 2: The following sample word sequence was created using the letters in the sample name sequence.

The letters added to the word spaces are shown in red. In the word sequence you create, you will have letters in the red number in the red places.

Sample word sequence

1.

Word 2.

Word 3.

Word 4.

Word 5.

Word 6.

Word 7.

Word 8.

Word 9.

Word 10.

Word

Words WS ER NI AD UT AJ SK UY XH IT

Letters that will come from the sample name sequence to the space From the name sequence to the space

1st letter From the name sequence to the space

2nd letter From the name sequence to the space

3rd letter From the name sequence to the space

4th letter From the name sequence to the space

5th letter From the name sequence to the space

6th letter From the name sequence to the space

7th letter From the name sequence to the space

8th letter From the name sequence to the space

9th letter From the name sequence to the space

10th letter

Next Next Next Next Next Next Next Next Next Next

Questions

Question 1:

a) Sort the word sequence you have created in step 2 above alphabetically (dictionary order) using bubble sorting (bubblesort) algorithm? Show enough process steps to sort half the words?

b) Sort the word sequence you created in step 2 above alphabetically (dictionary order) using the selectionsort algorithm? Show each action step?

Question 2: For this question, the graph structure given below will be used. Grafta indicated which word would come to which node. Graphta the sequence of words you created in step 2 above

nodes specified. After you create the graph, answer the a and b sleeks using the graph you created?

Note: When answering a and b, when you need to choose between the neighbors of a node, choose the one that is ahead alphabetically.

a) Find the shortest routes from the node where word 1 is written to other nodes using the width priority search algorithm? Show each action step?

b) Can Graph be ranked topologically?

-- If it can't be sorted, why explain?

-- If it can be sorted, how many different topological rankings can occur, list? Show the process steps for a sort?

Question 3: The following B+ tree will be considered for this question (some words in the tree are 2 and some words are 3 letters).). The internal node of the tree is 4 children, and the maximum number of data or elements held on the leaves is 4.

a) In step 2 above, click the word sequence that you have created,

in the B+ tree next to it? Show each action step?

b) Show changes in the B+ tree when QR and ROL are deleted from the tree formed in a style? Draw the final B+ tree?

c) Show the changes in the B+ tree when the MEMBER and VA are deleted from the tree formed in b, respectively? Draw the final B+ tree?

Question 4: Suppity that a linked list names students who take programming courses. In an AVL tree, students who take physics are kept. In both courses, the students' numbers, first and last names are kept. In avl tree, indeceding is done according to student number.

a) Only write the rough code of the function listing the information of the students who took physics? Use basic linked list and tree operations when writing the function.

b) Explain the logic of the function you are writing?

c) Draw the flow diagram of the function you are writing?

d) Calculate the execution time and time complexity of the function you are writing (show calculation process steps)?

(Note1: in both data structures, students are not ranked in any way.)

(Note2: Class lists will not change at the end of the function you type. In other words, the students in the data structures will remain the same.