Skip to main content

Python Studying Log

2017/09/04 
52% completed on CodeAcademy's python tutorials, understood the use of python dictionaries and manipulations of lists.

Seeking to use python to retrieve some useful information in a short period of time.

The next assignment based on the actualization of Sweepline algorithm would be attempted with Python as well, if everything goes well.

2017/09/05
Finished the first half of the assignment via Python, reading standard input is just so damn compact and easy compared to Java and C. (Before hand I though C was nice enough compared to Java)

Progressed a little bit more on the CodeAcademy tutorials, learned some new ways of importing classes into Python, as well as some useful functions that manipulates Strings.

Feeling a bit spoiled after using this language...

2017/09/07
Continuing on the CodeAcademy tutorials, should be able to finish them up within two days. 

Discovered more functions during these two days, including map() and the usage of tuples when coding for algorithm.

One thing that never made me lose my mind was that the simplicity was close from not reminding me of the time complexities. Gotta take care of that in Python.

2017/09/09
Finished the entire algorithm assignment in Python, the syntax got me around for a bit but eventually its so much more compact and easy to read.

The dynamic return types of functions may be good at times if used wisely, but could some times lead to confusion during implementation.

Though types are quite blurry in Python, it doesn't mean you could take less care with input types. These need to be handled with more caution as the type mismatches don't count as errors anymore.

2017/09/23
Got caught up by school work for too long, but nevertheless, although codeacademy's compiling duration feels like a century, finishing another assignment based on Python implementation (dynamic programming on based on tree structures) had helped to familiarize with the usage even more.

Though, the use of map is quite infrequent as the time complexity will have to be risen to a whole new level if they were to be reported in the time analysis, thus might need some practices in the near future to look on those.

2017/10/30
Attempted some studying on worms (is it the right way of expressing it in English?) to retrieve information from websites, still learning but requires some knowledge of HTML, needs a bit of patience on this one.

Previous algorithm assignments had all been completed with python, as well as during the 2017 ICPC qualifiers in the South Pacific division. Less chance of having mistakes with corners really saves time to debug with standard inputs etc.

Comments

Popular posts from this blog

Understanding database [9] : Choosing indexes

Understanding database 9 : Choosing indexes When choosing indexes, we choose the best plan that suits for the queries, and look for additional indexes that may potentially upgrade upon that. Before creating, we must also consider the impact on updates in the workload, such that indexes take disk space. For a query, the WHERE clause are the main focus point to make indexes on, where exact matches suggest a hash index and range queries suggest a tree index. Clustering is extremely helpful when it comes to range queries, and may also help with equality queries if there are duplicates. Search keys with multiple attribute should be considered if a WHERE clause contains multiple conditions, and the order of attributes is important for range queries. Searching may become ‘index-only’ with such indexes.

Understanding database [6] : Clustered Index

A clustered index is what is good for a range search over a range of search key values, and the index entries and the rows are ordered the same way, which is different from unclustered indexes (secondary indexes). To use a clustered index, we use the index to locate the first index entry at the start of the range, which where the first row is located at. If the index is clustered, subsequent rows will be stored in successive locations with the ordering , therefore it may minimize the page transfers and maximizes cache hits. For one table, there may only be one clustered index, whereas there can be as many unclustered indexes as you may want  to create. Unclustered indexes aren ’ t as good as clustered, but they might become necessary when it comes to finding for other attributes apart from the primary key. Smaller topics : Dense index & Sparse index When we say sparse index, we mean that there is an index entry for each page of the data file. With this structuring