HW0: Skills Survey

# HW0: Skills Survey

## Instructions

* Be as truthful as possible on the questions below. 
* The goal is to accurately assess your abilities and to optimally place you with other students that will compliment you.  It is not to get every question right. 
* Please refrain from using external resources to try to find answers. 
* Use only what you knew before you saw this questionnaire, trial and error and perhaps the man pages.

## Preliminary Questions

NetID:

Expected Graduation Date (month/year):

Which section are you in:
* Section 1
* Section 2
* Section 3

Semesters Completed in Current Degree:

Undergrad Degree/Major: (circle)
* CS
* Math
* Stats
* Eng
* Bio
* Eco
* Other -

Grad Degree/Major: (circle)
* None yet
* CS
* Math
* Stats
* Eng
* Bio
* Eco
* Other -

Have you had a course in:
* Data Structures
* Discrete Math
* Computer Algorithms
* Operating Systems
* Computer Architecture

Rate Proficiency in: [0-9]
* UNIX\Linux
* Assembly
* C
* C++
* Java
* Python

Rate Proficiency in: [0-9]
* Programming
* Algorithms
* Proving Theorems
* Machine Learning
* Computer Systems
* Networking
* Compilers


Rate Proficiency in: [0-9]
* Physics
* EE
* Comp Eng
* Bio
* Stats

Describe Yourself As: [0-9]
* Programmer
* Mathematician
* Engineer
* Technician
* Biologist
* Algorithmicist

## Questions

<ol start="0"
  <liPredict the output of this snippit: </li
  
  ```c
int main() {
    int main = 56;
    printf("%d\n", main);
    return 0;
}
  ```
<ol type="a"
  <liCompiler Error</li
  <liDepends on the compiler</li
  <li5</li
  <linone of above</li
</ol
 
  <liPredict the output of this snippit: </li
  
  ```c
#include <stdio.h

int main() {
    char ch;
    if (ch = printf("")) {
        printf("It matters\n");
    }
    else {
        printf("It doesn't matter\n");
    }

    return 0;
}

  ```
<ol type="a"
  <liIt matters</li
  <liIt doesn’t matter</li
  <liRun time error</li
  <liNothing</li
</ol
  
  <liHow many times is Hello world printed by the code snippit below?</li
  
  ```c
  int main() {
    fork();
    fork();
    printf("Hello world\n");
}
  ```
<ol type="a"
  <li1</li
  <li2</li
  <li4</li
  <li8</li
</ol

  <liWhat is the output of this C code?</li
  
  ```c
  #include <stdio.h

int main() {
    int x = 1, y = 0, z = 5;
    int a = x && y || ++z;

    printf("%d\n", z++);
}
  ```
<ol type="a"
  <li1</li
  <li5</li
  <li6</li
  <li7</li
</ol
  
  <liWhat is the output of this C code?</li
  
  ```c
  #include <stdio.h

int main() {
    int y = 2;
    int z = y + (y = 10);
    printf("%d\n", z);
}
  ```

<ol type="a"
  <li2</li
  <li4</li
  <li20</li
  <liCompile time error</li
</ol
 
  <liWhat is the output of this C code?</li
  
  ```c
  #define max(a) a

int main() {
    int x = 1;
    switch (x)
    {
        case max(2):
            printf("yes\n");
        case max(1):
            printf("no\n");
        break;
    }
}
  ```
<ol type="a"
  <liyes</li
  <lino</li
  <liRuntime error</li
  <liCompile time error</li
</ol

  <liWhat is the output of this C code?</li
  
  ```c
  #include <stdio.h

int main() {
    int x = 35;
    printf("%d %d %d", x == 35, x = 50, x 40);
}
  ```  
<ol type="a"
  <li1 50 1</li
  <li0 50 0</li
  <liRuntime error</li
  <liCompile time error</li
</ol

  <liYou have two numbers, A and B. 
  
  Using bitwise operations and loops, write code to determine how many bits must be flipped in order to turn A in to B.</li

e.g.

A: 101001

B: 10**01**01

Answer: 2 bits

  <liPresume you have an implementation of Quicksort that picks the first element in a list as its pivot. 
  
  Construct a list of 13 numbers that would make this algorithm run in O(n^2) time.</li
  
 
  <liWrite code to solve the below in O(n) time with one pass over the array. If you can not, provide your best code and state the asymptotic running time.</li
  
  * In this challenge, given an array of integers, the goal is to efficiently find the subarray that has the greatest positive value when all of its elements are summed together.
  * Write some code that, if given an array of integers, will find the subarray that has the greatest sum. A subarray is a contiguous subset of the original array.
  * Keep in mind the maximal subarray is not necessary a proper subset, and might contain the whole original array.
    * Be careful. Some array elements may be negative, so less can be more.
    * If all the elements in an array are negative, the maximal sum should be null as we are interested in the greatest positive value, not the greatest arithmetic value.
 * For example: Given the array: `{1, 2, -5, 4, -3, 2}`
    * The maximum sum of a subarray is 4 and it contains only the element 4.
 * Before you write the code, take some time to think of the most efficient solution possible; it may surprise you. The major goal of this question is to test your algorithmic skills rather than merely your ability to write code quickly.

  <liRE pattern matching. 

  Draw an NFA (nondeterministic finite state automata) that recognizes the same language that the regular expression `((A*B | C )* | D )`</li


  <liAre there any preferences you have for grouping?</li
</ol