Description
CSC 220.02 + .03 ASSIGNMENT 01
PART A – Communication, 10 points
1. iLearn a. Log in iLearn. b. In “ASMT 1 Discussions” forum, please reply to the post “Welcome to CSC 220.02 and CSC 220.03” c. Take a screenshot of your reply. d. Include the screenshot in your assignment report.
2. Emailing To answer A.2 questions, you may write: YES. This is to confirm that I … a. Please write a statement here to confirm that you will use your SFSU email address (@mail.sfsu.edu) when contacting your grader and your course instructor so that your emails will not be filtered. Thank you. b. Please write a statement here to confirm that when contacting your course instructor, you will start your email subject with this format: “CSC 220.02 PoNG” or “CSC 220.03 PiNG” so that you will get an answer timely.
Thank you. c. Please confirm that if you do not get an answer within 24 hours, you will check if you sent your email properly. And in either case, you will kindly resend your email message. Thank you. P E R F O R M A N C E T R A C K E R ASMT GRADE YOUR GRADE ZOOM 05 01 20 TOTAL 25 A: 90-100% B: 80-89% C: 70-79% D: 60-69% F: 0-60% The course grader provides feedback to your assignments on iLearn.
TA Updated: 1/23/2021 9:04 AM 3. Grader We have one grader for each section of our class who grades our assignments. Questions regarding assignments and assignment grades should be directed to the grader. a. What is the URL of your grader’s forum on iLearn? b. What is your grader’s full name? c. What is your grader’s SFSU email address? Please email your grader when you have questions.
4. Guidelines for All Assignment and Assignment Report Template To answer A.4, you may write: YES. This is to confirm that I have carefully read, understood, and agreed to the Guidelines for ALL Assignments above and the Assignment Report Template.
I will strictly follow the instructions. Please write a statement here to confirm that you have carefully read, understood, and agreed to the Guidelines for ALL Assignments above and the Assignment Report Template. If you have any questions, please list all of them here then please email the course grader or the course instructor before the 2nd week of the semester to get an answer. Thank you.
5. Course Policy on Student Conduct and Academic Honesty To answer A.5, please write exactly: YES. This is to confirm that I have carefully read, understood, and agreed to the Course Policy on Student Conduct and Academic Honesty which was distributed to me with the course syllabus and whose digital copy was shared with me on the File Manager. I am acutely aware that the policy includes, but is not limited to, the San Francisco State University’s Code of Student Conduct (at https://conduct.sfsu.edu/standards), the Computer Science Department’s Student Policies (at https://cs.sfsu.edu/student-policies), and the Honor Code of this course (at https://csc220.ducta.net/00-README-StudentConduct_AcademicHonesty.pdf).
I will strictly follow all the rules. Please write a statement here to confirm that you have carefully read, understood, and agreed to the Course Policy on Student Conduct and Academic Honesty which was distributed with the course syllabus and whose digital copy was shared on the File Manager. You are acutely aware that the policy includes, but is not limited to, the San Francisco State University’s Code of Student Conduct (at https://conduct.sfsu.edu/standards), The Computer Science Department’s Student Policies (at https://cs.sfsu.edu/student-policies), and the Honor Code of this course (at https://csc220.ducta.net/00-README-StudentConduct_AcademicHonesty.pdf).
You will honor and strictly follow all the rules. If you have any questions, please list all of them here then please email the course grader or the course instructor before the 2nd week of the semester to get an answer. Thank you. 6. CSC220 File Manager a. Please log in to the CSC 220 File Manager. b. Locate file “2020Fall-CSC220-AdvisingForCSC220.html” and read through it. Include a screenshot of this page in your assignment report. c. Locate directory “CSC220/StrongFoundationCSC210” and browse through it. Include a screenshot of this directory in your assignment report.
PART B – NetBeans IDE Installation, 5 points
1. Install the latest NetBeans IDE by following the instructions given in class and the lecture slides including: – On Windows: https://csc220.ducta.net/WEEK-01/NetBeans_Installation_Windows.pdf – On macOS: https://csc220.ducta.net/WEEK-01/NetBeans_Installation_MacOS.pdf 2. Change the name of a favorite Java program you wrote to “MyFavoriteApp.java” and run it in your newly installed NetBeans. 3. Take a screenshot of your NetBeans.
The screenshot should show both code and output. 4. In half a page or more, outline how you would make your program better. 5. Please remember to submit your MyFavoriteApp.java file (and related files, if any).
PART C – NetBeans Plugins and Shortcuts, 5 points
1. Install 3 NetBeans Plugins – Please install QuickOpener and 2 other plugins of your choice. – Useful links, applicable to the newer NetBeans versions including NetBeans 12.2 of 2021: – https://csc220.ducta.net/WEEK-01/NetBeans_Installation_QuickOpener_Plugin.pdf – https://cwiki.apache.org/confluence/display/NETBEANS/Using+8.2+Plugins+in+9.0 – https://plugins.netbeans.org/plugin/62668/quickopener
a. In your NetBeans, take screenshot(s) of the window Tools/Plugins/Installed to show the 3 plugins you installed. b. In 4 sentences or more, discuss the 2 plugins you chose. 2. Netbeans-Shortcuts-80.pdf a. In the CSC 220 File Manager and under WEEK-01 directory, open file “Netbeans-Shortcuts-80.pdf” b. Try as many NetBeans shortcuts as you can and see if they work in the latest NetBeans you installed. c. In 3 sentences or more, describe your favorite shortcut(s).
PART D – Class Design Guidelines, 2 Extra Credit points
The WEEK-01 lectures introduce Y. Daniel Liang’s Class Design Guidelines, in 1 page or more, discuss in-depth 1 of the guidelines. You can use code to demonstrate your points. The code should not be more than one-third of your writing.
CSC 220.02 + .03 ASSIGNMENT 02
ABOUT
CSC 210, a good foundation in Java programming, is CSC 220’s course prerequisite. We were supposed to have a prerequisite exam
to demonstrate our knowledge of Java programming.
Instead of a test, this assignment is our opportunity to review (and to learn) a number of important Java topics and to get us ready
for Data Structures. Please study our review materials including PKG 01 and PKG 02 thoroughly, which will help us complete this
assignment and succeed in this course.
The supporting materials for this assignment are organized under this directory:
– Please see: https://csc220.ducta.net/Assignments/assignment-02-Materials/index.php
– We must use the provided starter code and follow the assignment instructions below to get credit.
Happy coding!
PART A – OOP Class Design Guidelines, 15 points
Y. Daniel Liang’s 8 Class Design Guidelines:
– https://csc220.ducta.net/Assignments/assignment-02-Materials/ClassDesignGuidelines.pdf
Please choose 3 guidelines and discuss them in-depth. For each guideline, use at least one page for your discussion. It is
OK to use code to help demonstrate your points. The code portion, if any, should not take up more than 1/3 of each
guideline’s discussion.
PART B – OOP, 60 points
Our commencement ceremony will be hosted at Oracle Park, home of the San Francisco Giants. The Giants is hiring us to
develop a messenger application to help them take SF Giants Thank You card orders from SF State students.
The 6 complete sample outputs are posted on the File Manager. Please read all the sample outputs carefully.
– https://csc220.ducta.net/Assignments/assignment-02-Materials/index.php
To get credit, our program must meet the output requirements and the programming requirements which are described in the
following.
Output Requirements:
– Identical: Our program must produce output identical to the complete sample output provided on File Manager. Please
read each sample output for further information and assistance.
P E R F O R M A N C E T R A C K E R
ASMT GRADE YOUR GRADE
ZOOM 05
01 20
02-PREPARATION 25
02 75
TOTAL 125
A: 90-100% B: 80-89% C: 70-79% D: 60-69% F: 0-60%
The course grader provides feedback to your assignments
on iLearn.
*** Please use this table to communicate clearly to our grader which output requirements we completed successfully.
Programming Requirements:
1. We must use this starter code:
– https://csc220.ducta.net/Assignments/assignment-02-Materials/Assignment-02-Code.zip
2. We can add code. Our task to complete implementing the incomplete classes among the provdied starter-code files.
3. We cannot change and cannot remove the provided code, especially the code in file “Messenger.java”.
4. We must keep all of our data fields “private”. We must not create any new classes.
5. We must use a programming style provided in the directory File Manager/Assignments. 3 styles were provided.
6. In our assignment report, we must demonstrate to our grader that:
– Our program runs properly on the latest version of NetBeans and that
– Our program meets the requirements successfully.
– Please document each sample run clearly so that our grader can see how much work and passion we put into developing
our program.
PART C – Database, 5 EXTRA CREDIT points
Make our program allow students to choose which SF Giants player to chat with. Our program should output updated player’s
information as listed on Wikipedia:
– https://en.wikipedia.org/wiki/2021_San_Francisco_Giants_season#Current_roster
Please create our creative demonstration to show our successful implementation of this requirement to get credit.
Thank you and happy coding!
REMINDER:
We should start ASMT 02-Preparation and ASMT 02 at the same time. ASMT 02-Preparation is a team learning experience. Each
team should have five members. ASMT 02 is a regular assignment. We can work alone or work with one classmate on ASMT 02.
Please refer to the Assignment Template and the Guidelines for All Assignments.
Thank you and happy learning.
Complete Sample Output Main Topic Output Requirement Pts
SampleOutput-01.pdf 3 pillars of OOP (CSC 210) Identical 25
SampleOutput-02.pdf Internationalization (CSC 210/220) Identical 7
SampleOutput-03.pdf Date and Time (CSC 210/220) Identical 7
SampleOutput-04.pdf Exception Handling (CSC 210) Identical 7
SampleOutput-05.pdf ANSI Colors (CSC 210) Identical 7
SampleOutput-06.pdf File I/O (CSC 210) Identical 7
CSC 220.02 + .03 ASSIGNMENT 03
ABOUT
Assignment 02 was a thorough practice of Object-Oriented Programming and common utilities. We completed reviewing CSC 210
and gained a strong foundation in programming and in project management. Time management is an important component of
project management. We learned to use available resources for success. We learned the fundamentals of problem solving.
Assignment 03 provides us with opportunities to explore new data structures, starting with the two primary data structures, and
data structure programming techniques. Mastering these sets of skills will enable us to learn the more complex data structures.
– Please download and use the starter code provided: https://csc220.ducta.net/Assignments/Assignment-03-Code.zip
– For all the assignment parts, we can add code. We cannot change and cannot remove the provided code. Thank you.
PART A – The Linked Bag, 20 points
Please implement class LinkedBag focusing on method removeAllOccurrences. This method removes all occurrences of
the given entries from a bag. Our program’s output must be identical to the following same output:
PART B – Stack, 15 points
Please add code to the provided code. Our
program tests whether an input string is a
palindrome. Our program output must be identical
to this sample output.
A palindrome is a string of characters (a word,
phrase, or sentence) that is the same regardless of
whether we read it forward or backward. For
example, Race car is a palindrome. So is A man, a
plan, a canal: Panama. More about palindromes:
https://www.palindromelist.net/. We ignore spaces
P E R F O R M A N C E T R A C K E R
ASMT GRADE YOUR GRADE
ZOOM 05
01 20
02-PREPARATION 25
02 75
03 75
TOTAL 200
A: 90-100% B: 80-89% C: 70-79% D: 60-69% F: 0-60%
The course grader provides feedback to your assignments
on iLearn.
=== LINKED BAG 220 JAVA ==========================================================
[+] Creating a CSC220 LinkedBag…
[+] Adding…. these items to the bag: A _ _ G Bb A _ u n o A o d Bb A A l l
[>] The bag now contains 18 string(s): l l A A Bb d o A o n u _ A Bb G _ _ A
[+] Creating… a 2D test array with the below contents:
A A A A A A
B A Bb B Bb B
C B _ A
n u l l
[+] Removing 2D test array items from the bag…
[-] Converting 2D array to 1D…
[-] Removing duplicates in 1D array…
[>] The final 1D array now contains: A B Bb C _ n u l
[-] Removing the final 1D array items from the bag…
[>] The bag now contains 4 string(s): G o o d
=== LINKED BAG 220 JAVA ==========================================================
[>>] Enter a string (or a ! to exit): Csc
[+] Yes. “Csc” IS a palindrome!
[>>] Enter a string: CSC 220 – Data Structures
[-] No. “CSC 220 – Data Structure” is NOT a palindrome!
[>>] Enter a string: Ah, Satan sees Natasha!
[+] Yes. “Ah, Satan sees Natasha!” IS a palindrome!
[>>] Enter a string: Amy, must I jujitsu my ma?
[+] Yes. “Amy, must I jujitsu my ma?” IS a palindrome!
[>>] Enter a string: A man, a plan, a canal: Panama.
[+] Yes. “A man, a plan, a canal: Panama.” IS a palindrome!
[>>] Enter a string: Are Mac ‘n’ Oliver evil on camera?
[+] Yes. “Are Mac ‘n’ Oliver evil on camera?” IS a
palindrome!
[>>] Enter a string: !
[<<] Thank you!
and punctuations. Please do not worry about ellipsis, n-dash, and m-dash, and case. Please see
https://simple.wikipedia.org/wiki/Punctuation .
PART C – Recursion, 15 points
In the language of an alien race, all words take the form of Blurbs. A Blurb is a
Whoozit followed by one or more Whatzits. A Whoozit is the character ‘x’ followed
by zero or more ‘y’s. A Whatzit is a ‘q’ followed by either a ‘z’ or a ‘d’, followed by a
Whoozit. Please add code to the provided code to complete a recursive program that
generates random Blurbs in this alien language. Our program must behave in the
same manner as the sample run does:
PART D – Recursion, 10 points
Please add code to the provided code to complete a recursive program that determines and
prints the nth row of Pascal’s Triangle (as shown on the left). Each interior value is the sum of
the two values above it. Our program output must be identical to the sample out. Hint: use an
array to store the values on each line.
PART E – The Efficiency of Algorithms, 15 points
1. Show how you count the number of operations (not only basic
operations) required by the algorithm to the right, 5 points:
It is OK to do this part on a sheet of paper then snapshot it. Please include the screenshot in our assignment report. Microsoft
Office Lens, Adobe Scan, and Google Lens are good phone applications for this purpose.
Coding is recommended but not required. Please make sure our handwriting is readable to our grader.
2. Consider Loop A and Loop B in the box to the right, 5 points:
Although Loop A is O(n) and Loop B is O(n2), Loop B can be faster than
Loop A for small values of n. Design and code a creative experiment to
find a value of n for which Loop B is faster.
Please submit both our code and our discussion.
3. Repeat question E.2 but use Loop C in place of Loop B, 5 points:
Please submit both our code and our discussion.
Happy Coding!
int i, n = 5, sum = 5;
for (i = 5; i < 3 * n; i++) {
sum *= n + i * 7 + 37;
}
// Loop A
for (i = 1; i <= n; i++)
for (j = 1; j <= 10000; j++)
sum = sum + j;
// Loop B
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
sum = sum + j;
Enter a number of blurbs: 7
Blurb #1: xyyyqdxyyyyyyyqdxyy
Blurb #2: xqdxyqzxyyyyyqzx
Blurb #3: xyqdxyyyy
Blurb #4: xqzxqzx
Blurb #5: xyqdxyyyyyy
Blurb #6: xyqdxqzxqzxqzxqdxyyyy
Blurb #7: xqzx
Enter a row of Pascal’s Triangle: 0
1
Enter a row of Pascal’s Triangle: 1
1 1
Enter a row of Pascal’s Triangle: 2
1 2 1
Enter a row of Pascal’s Triangle: 4
1 4 6 4 1
Enter a row of Pascal’s Triangle: 6
1 6 15 20 15 6 1
Enter a row of Pascal’s Triangle: 11
1 11 55 165 330 462 462 330 165 55 11 1
Enter a row of Pascal’s Triangle: !
Adiós!
// Loop C
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
for (k = 1; k <= n; k++)
sum = sum + k;
CSC 220.02+.03 ASSIGNMENT 04
ABOUT
This assignment contains several small problems. We will need the starter code and the output (part E) provided here: – Download: https://csc220.ducta.net/Assignments/Assignment-04-Code.zip – We must use the provided starter code and follow the assignment instructions to get credit. The programming techniques and the data structures which we practice in this assignment is very important. We need to master them in order to understand the advanced part of CSC 220 and to prepare ourselves for success in the coming advanced courses starting with CSC 340.
PART A – Introduction to Sorting, 9 points
Please use this array of integers for the A.1, A.2, and A.3 problems: 9 1 2 4 3 5 6 2 9 8 5 7 – Use pen & paper to show our work and answers. We can scan/snapshot our work and include the images in our report. – Use code to demonstrate our approaches and solutions. Submit code and include screenshots of output in our report. – Each of these problems (A.1, A.2, and A.3) is worth 3 points.
1. Show the contents of the array each time a selection sort changes it while sorting the array into ascending order. 2. Show the contents of the array each time an insertion sort changes it while sorting the array into ascending order. 3. Show the contents of the array each time a Shell sort changes it while sorting the array into ascending order.
PART B –Sorting, 11 points
1. — 3 points — Suppose we want to find the largest entry in an unsorted array of n entries. Algorithm A searches the entire array sequentially and records the largest entry seen so far. Algorithm B sorts the array into descending order and then reports the first entry as the largest. Compare the time efficiency of the two approaches. Coding is not required but highly recommended.
2. — 8 points — Consider an n by n array of integer values. Write an algorithm to sort the rows of the array by their first value. The starter code for this problem is provided in the Assignment-04-Code.zip archive. Our output must be identical to the output to the right.
P E R F O R M A N C E T R A C K E R ASMT GRADE YOUR GRADE ZOOM 05 01 20 02-PREPARATION 25 02 75 03 75 MIDTERM EXAM 01 25 04 75 TOTAL 300 A: 90-100% B: 80-89% C: 70-79% D: 60-69% F: 0-60% The course grader provides feedback to your assignments on iLearn. The array is initially 1 2 3 4 5 3 4 5 1 2 5 2 3 4 1 2 3 1 4 5 4 2 3 1 5 The array after sorting is 1 2 3 4 5 2 3 1 4 5 3 4 5 1 2 4 2 3 1 5 5 2 3 4 1
PART C – Queues, Deques, and Priority Queues, 15 points
1. — 5 points — After each of the following statements executes, what are the contents of the queue? Please explain. QueueInterface myQueue = new LinkedQueue<>(); myQueue.enqueue(“Jane”); myQueue.enqueue(“Jess”); myQueue.enqueue(“Jon”); myQueue.enqueue(myQueue.dequeue()); myQueue.enqueue(myQueue.getFront()); myQueue.enqueue(“Jim”); String name = myQueue.dequeue(); myQueue.enqueue(myQueue.getFront());
2. – 5 pts – After each of the following statements executes, what are the contents of the deque? Please explain. DequeInterface myDeque = new LinkedDeque<>(); myDeque.addToFront(“Jim”); myDeque.addToFront(“Jess”); myDeque.addToBack(“Jen”); myDeque.addToBack(“Josh”); String name = myDeque.removeFront(); myDeque.addToBack(name); myDeque.addToBack(myDeque.getFront()); myDeque.addToFront(myDeque.removeBack()); myDeque.addToFront(myDeque.getBack()); 3. – 5 pts – After each of the following statements executes, what are the contents of the priority queue? Please explain. PriorityQueueInterface myPriorityQueue = new LinkedPriorityQueue<>(); myPriorityQueue.add(“Jim”); myPriorityQueue.add(“Josh”); myPriorityQueue.add(“Jon”); myPriorityQueue.add(“Jane”); String name = myPriorityQueue.remove(); myPriorityQueue.add(name); myPriorityQueue.add(myPriorityQueue.peek()); myPriorityQueue.add(“Jose”); myPriorityQueue.remove();
It is OK to assume that the alphabetically earliest string has the highest priority.
PART D – Queue and Deque, Circular Doubly Linked Chain, 20 points
Use a circular doubly linked chain to implement the ADT deque. In a doubly linked chain, the first and last nodes each contain one null reference, since the first node has no previous node and the last node has no node after it. In a circular doubly linked chain, the first node references the last node, and the last node references the first.
Only one external reference is necessary—a reference to the first node—since we can quickly get to the last node from the first node. The code for this problem is provided in the Assignment-04-Code.zip archive. Our output must be identical to the output to the right.
PART E – Priority Queue, 20 points
The San Francisco State University’s One Stop Student Services Center asks us to recommend solutions for their service lines. – The starter code for this problem is provided in the Assignment-04-Code.zip archive. – Our output must be identical to the complete output provided in the ZIP archive: PartE-The_Complete_Sample_Run.pdf – The right table is a portion of the output for preview purposes. It is NOT the complete output. – It is a good idea to analyze the complete output thoroughly before programming a solution.
Empty deque: true [FRONT] Jerry << Tom << Minnie << Mickey << … [BACK] Sylvester >> Goofy >> Donald >> … Empty deque: true Sayōnara -> removeFront found deque empty -> removeBack found deque empty ————————————————————- SFSU ONE STOP STUDENT SERVICES CENTER ————————————————————-
Priority: default (provided by supervisors) Mickey Mouse 1002 3.70 1 17 Minnie Mouse 1001 3.90 10 15 Milo Dog 1004 3.70 7 17 Goofy Dog 1007 2.30 17 1 Daisy Duck 1003 1.70 1 17 Pluto Dog 1005 3.70 7 17 Donald Duck 1006 3.10 5 2
CSC 220.02+.03 ASSIGNMENT 05
ABOUT
This assignment aims to add Google Guava Dictionary to our set of skills. – How to add Google Guava to our IDEs: URL: https://csc220.ducta.net/WEEK-14/dictionaryGoogleGuava-00-HowToImport/index.php – This assignment is our last assignment for this semester. Congratulations and Thank you!
PART A: GOOGLE GUAVA – Importing Google Guava, 25 points
Please follow the instructions posted on File Manager and the demonstration in class to import Google Guava into our IDE. It is OK to use either NetBeans or IntelliJ. – NetBeans version: https://csc220.ducta.net/WEEK-14/dictionaryGoogleGuava-00-HowToImport/GoogleGuava_import_NetBeans.pdf – IntelliJ version: https://csc220.ducta.net/WEEK-14/dictionaryGoogleGuava-00-HowToImport/GoogleGuava_import_IntelliJ.pdf – More resources: – URL: https://csc220.ducta.net/WEEK-14/dictionaryGoogleGuava-00-HowToImport/index.php – URL, the dictionaryGoogleGuava directories: https://csc220.ducta.net/WEEK-14/ In our assignment report, please clearly show the steps and demonstrate Google Guava imported successful.
PART B AND PART C: GOOGLE GUAVA – Mastering Google Guava, 65 points
Please implement an interactive dictionary. Our dictionary takes input from users and use the input as search key to look up value(s) associated with the key. 1. This assignment does not require following any given skeleton code. 2. We are required to use Enum and Google Guava Multimap in our implementation. 3. Please state clearly in our report if we implement both versions. 4. Please keep the two version separate: Part B – The Standard version vs.
Part C – The Professional version. PART B – Standard Version, 50 points
Our program’s output must be identical to the output on the 2 nd page. PART C – Professional Version, 15 Extra Credit points Our program’s output must be identical to the output on the 3 rd page. I am going to volunteer additional office hours. Please see me if I can assist you with this assignment or anything else including a casual chat. See you.
Thank you and Happy learning! P E R F O R M A N C E T R A C K E R ASMT GRADE YOUR GRADE ZOOM 05 01 20 02-PREPARATION 25 02 75 03 75 MIDTERM EXAM 01 25 04 75 MIDTERM EXAM 02 25 05 75 TOTAL 400 A: 90-100% B: 80-89% C: 70-79% D: 60-69% F: 0-60% The course grader provides feedback to your assignments on iLearn.
PART A’s OUTPUT – Standard Version – DICTIONARY 220 JAVA Standard —– —– powered by Google Guava – Search: book | Book: A written work published in printed or electronic form. Book: To arrange for someone to have a seat on a plane. | Search: boOK | Book: A written work published in printed or electronic form. Book: To arrange for someone to have a seat on a plane. | Search: bookable | Bookable: Can be ordered in advance. | Search: bookcase | Bookcase: A piece of furniture with shelves. | Search: bookbinder | Bookbinder: A person who fastens the pages of books. | Search: cSc220 | CSC220: Data Structures.
CSC220: Ready to create complex data structures. CSC220: To create data structures. | Search: Facebook | | Search: !q —–THANK YOU—– Please continue to the next page
PART C’s OUTPUT – Professional Version – DICTIONARY 220 JAVA Professional —– —– powered by Google Guava – Search: boOK | Book [noun] : A written work published in printed or electronic form. Book [verb] : To arrange for someone to have a seat on a plane. | Search: BooK noun | Book [noun] : A written work published in printed or electronic form. | Search: book verb | Book [verb] : To arrange for someone to have a seat on a plane. | Search: bOOk oops | <2nd argument must be a part of speech or “distinct”> | Search: Facebook | | Search: cSc220 | CSC220 [adjective] : Ready to create complex data structures. CSC220 [noun] : Data Structures. CSC220 [verb] : To create data structures.
| Search: csC220 adjective | CSC220 [adjective] : Ready to create complex data structures. | Search: bookcaSE | Bookcase [noun] : A piece of furniture with shelves. | Search: bookable verb | | Search: bookable adjective | Bookable [adjective] : Can be ordered in advance. | Search: bookBINDER v | <2nd argument must be a part of speech or “distinct”> | Search: !Q —–THANK YOU—–