[C] Introduction to C

The Big Ideas:

  1. High-level and a low-level language:
    1. C is a compiled language (C -> assembly -> machine language).
    2. It has a few high-level constructs that can be readily translated into assembly.
  2. Imperative:
    1. Assignment statements explicitly change memory values.
    2. As opposed to declarative, where statements describe function.
  3. Procedural:
    1. All code statements are contained in functions.
    2. Functions can be bundled into libraries which allow you to build large programs from smaller pieces.
    3. Functions are implemented using a stack.
  4. File-oriented.
  5. Portability: the same C code can be compiled for different ISAs.
The Compilation Process:
  1. The code files that you write are compiled into assembly code which is then assembled into machine code.
  2. Some compilers, like clang, perform both phases and simply output the binary, executable result.
All C programs must start in the function "main". Recall that C is procedural. Everything is inside a function.

Variables in C:

There are four built-in data types. The width of each data type is machine dependent:
  1. char: 8 bits
  2. int: 16/32/64 bits
  3. float: 32 bits (IEEE Floating Point Standard)
  4. double: 64 bits (double the size of float)
Arrays in C:
  1. Array names are like pointers, but they're not pointers. The name of an array is a label for the starting address in memory.
  2. An array name is simply an assembly label. A pointer gets a slot in memory. An array name is the name of the slot.
Global Variables:
  1. There're two types of variables: automatic and static.
    1. Automatic variables close their values when their block terminates. Local variables are by default automatic.
    2. Static variables retain values between invocations. Global variables are static.
  2. Local variables can be declared static.
Constants:
  1. There are two ways to do it:
    1. Modifier const
    2. Pre-processor directive #define
  2. We can "#define"d values easily, but const types never change.
Location: Philadelphia, PA, USA

Comments

Post a Comment

Popular posts from this blog

[LeetCode] 269. Alien Dictionary

There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of  non-empty  words from the dictionary, where  words are sorted lexicographically by the rules of this new language . Derive the order of letters in this language. Example 1: Given the following words in dictionary, [ "wrt", "wrf", "er", "ett", "rftt" ] The correct order is:  "wertf" . Example 2: Given the following words in dictionary, [ "z", "x" ] The correct order is:  "zx" . Example 3: Given the following words in dictionary, [ "z", "x", "z" ] The order is invalid, so return  "" . Note: You may assume all letters are in lowercase. You may assume that if a is a prefix of b, then a must appear before b in the given dictionary. If the order is invalid, return an empty string
Read more

[LeetCode] 631. Design Excel Sum Formula

Your task is to design the basic function of Excel and implement the function of sum formula. Specifically, you need to implement the following functions: Excel(int H, char W):  This is the constructor. The inputs represents the height and width of the Excel form.  H  is a positive integer, range from 1 to 26. It represents the height.  W  is a character range from 'A' to 'Z'. It represents that the width is the number of characters from 'A' to  W . The Excel form content is represented by a height * width 2D integer array  C , it should be initialized to zero. You should assume that the first row of  C  starts from 1, and the first column of  C  starts from 'A'. void Set(int row, char column, int val):  Change the value at  C(row, column)  to be val. int Get(int row, char column):  Return the value at  C(row, column) . int Sum(int row, char column, List of Strings : numbers):  This function calculate and set the value at  C(row, column) , wh
Read more

[LeetCode] 714. Best Time to Buy and Sell Stock with Transaction Fee

Your are given an array of integers  prices , for which the  i -th element is the price of a given stock on day  i ; and a non-negative integer  fee  representing a transaction fee. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.) Return the maximum profit you can make. Example 1: Input: prices = [1, 3, 2, 8, 4, 9], fee = 2 Output: 8 Explanation: The maximum profit can be achieved by: Buying at prices[0] = 1 Selling at prices[3] = 8 Buying at prices[4] = 4 Selling at prices[5] = 9 The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8. Note: 0 < prices.length <= 50000 . 0 < prices[i] < 50000 . 0 <= fee < 50000 . Thought process: Each day there are two options, buy or sell. Use two variables buy and sell to keep track of the max profit. Solution: 1 2 3 4 5 6
Read more