CST 363 - Week 2

 Hey everyone!

    We are back with an update of this online journey. This has been a fun week. We learned so many new things. I find SQL easier to grasp onto, compared to other coding languages. It just seems very similar to our normal English language. 

    This week, we learned different types of joins, aggregation, and views. The labs really helped understand the concepts, after reading about them in Zybooks, and listening to Professor's lectures. The homework assignment seemed to go smoother as well, because of the practice we got in the lab assignments. 

 1. SQL has the flexibility to join tables on any column(s) using any predicate (=, >, < ). Most of the time the join will use equality between a primary and foreign key. Think of example where joining on something other than keys would be needed. Write the query both as an English sentence and in SQL. If you can't think of your own example, search the textbook or internet for an example.

English: Find all orders where the order amount falls within any of the promotion ranges and display the order details along with the applicable promotion information.

SQL: SELECT o.OrderID, o.CustomerID, o.OrderAmount, p.PromotionID, p.Discount

            FROM Orders o

            JOIN Promotions p

            ON o.OrderAmount BETWEEN p.MinAmount AND p.MaxAmount;


2. What is your opinion of SQL as a language? Do you think it is easy to learn and use? When translating from an English question to SQL, what kinds of questions do you find most challenging?

    So far, I have found SQL to be the easiest to learn and use. It is pretty similar to the everyday English language we use to. I found joins, views, and subqueries a little challenging at first, but after some practice, it seems to be getting easier now.



That is it for this week. I am excited to learn more new things next week. See you next time!

Comments

Post a Comment

Popular posts from this blog

CST 334 - Week 6

 Hey everyone!      This week we submitted our research collab project. It was quite interesting and fun. I learned a lot and our team bonded more as well. We also learned many new things through our lectures and labs.       Concurrency is a critical concept in computer systems, enabling multiple processes to execute simultaneously. However, with great power comes great complexity.       A semaphore is a synchronization primitive that helps manage access to shared resources in a concurrent environment. Semaphores can be thought of as counters that control the number of processes allowed to access a resource. They come in two main types :             - Counting Semaphores : These can have values greater than one and are often used to manage a   pool of resources, such as threads or connections.           - Binary Semaphores : These function like locks and c...
Read more

CST 334 - Week 4

Hey everyone!       This week, I learned about how operating systems manage memory, which is one of their most important jobs. One topic was free space management , where the system keeps track of memory or storage that isn’t being used. Two common methods are bitmaps (using bits to mark if memory is free or taken) and linked lists (connecting free memory blocks together). Each method has its pros and cons, like how much space they use or how fast they work.      I also studied paging , which splits memory into small chunks called pages. These pages are mapped to physical memory, keeping processes separate and organized. However, this mapping can slow things down because the computer has to translate addresses often. To make it faster, Translation Lookaside Buffers (TLBs) store recent translations in a small, quick cache. I also learned about advanced page tables , which are smarter ways of organizing these mappings to save memory.    ...
Read more

CST 370 - Week 1

 Hey everyone, This week, we learned several important topics that form the foundation of computer science and programming. We started with GitHub and practiced using manual commands like git init, git add, git commit, and git push to manage our code. This helped us understand version control and how to keep track of changes when working on projects, especially when collaborating with others. We were also introduced to algorithms and learned what they are—step-by-step methods for solving problems. One example we focused on was Euclid’s Algorithm for finding the greatest common divisor (GCD) of two numbers. It uses a simple but powerful idea: repeatedly replace the numbers with GCD(b, a % b) until the second number becomes zero. We also practiced writing pseudocode, which helped us plan out algorithms in plain language before coding. We also had a homework assignment to help us further understand GitHub commands. Later in the week, we learned about graphs, both weighted and unweight...
Read more