- Computer Systems (6011)
- Software Paradigms (6221)
- Computer Architecture (6461)
- Design and Analysis of Algorithms (6212)
- CSCI 6011(Computer Systems - simple C programs)
- arrayDiff.c
- binomialCoeff.c
- binRepInt.c
- binToHex.c
- calcNetIDHostID.c
- dynamicMemAllocation.c
- dynamicMemReAllocation.c
- floatToBin.c
- ipAddr.c
- linkedList.c
- mult64bitX86_32.c
- mult64bitX86_32.s
- numSetBitsFloat.c
- randNumArray.c
- rectCoord.c
- reverseEngAssemb.c
- sizeCircLinkedList.c
- stringReverse.c
- structArrSort.c
- textFileSize.c
- trailZeroBin.c
- twosComp.c
- validateIP.c
- varMemRep.c
- CSCI 6221 (Software Paradigms)
- CSCI 6461 (Computer Architecture)
- CSCI 6212 (Design and Analysis of Algorithms)
Simple program to find the largest number for each element of two arrays. For example, array1[0] is compared to array2[0] to find the larger number. Runs in linear time - O(n).
Implement the binomial coeffecient formula in C (for nonnegative integers). Runs in constant time - O(1).
|n| n!
| | = ----------
|k| k!(n-k)!
Count number of 1's in the binary representation of an integer. Loop through all bits in an integer, find if a bit is set and if it has incremented the set bit count.
Convert a binary number to a hexadecimal number.
Show the class, network ID, and host ID of a given IPv4 address. The class is based on the first octet as follows:
- Class A 1 to 126
- Class B 128 to 191
- Class C 192 to 223
- Class D 224 to 239
- Class E 240 to 254
Find the sum of array elements. The array elements are populated from user input using dynamic memory allocation.
Dynamically allocate memory for an array and populate with values. Change the size of the array and dynamically reallocate memory for new array aize and populate with values.
Convert a floating point number to a binary number.
Show the class based on IP address provided by the user. Similar to calcNetIDHostID.c.
Create a linked list using structures and memory allocation. Robust functionality includes find (O(n) time), print (O(n) time), insert at the head of the list (O(1) time), insert at a specified position in the list (O(1) time), delete a specified element (O(1) time), and modify values.
Multiply two long long data types. The goal is to see the assembly code for this simple operation.
Assembly code for mult64bitX86_32.c. This code was generating using the GNU Compiler Collection (GCC).
Count the set of bits in a floating point number. E.g. the number of 1's in a given binary number.
Create a program that takes two command line arguments that corresponds to the dimensions (rows and columns) of a 2D array of doubles. Allocate memory to create the array and assign random values to its elements so that the sum of the elements in each row is equal to 1.
Calculate the area based on two coordinates of a rectangle (on a graph). Use the x and y values to calculate the area. E.g. Area = Width * Length -> (y2 - y1) * (x2 - x1)
Based on the following assembly code, write the corresponding C source code.
pushl %ebp
movl %esp, %ebp
subl $24, %esp
movl $10, -4(%ebp)
movl $20, -8(%ebp)
movl -8(%ebp), %eax
movl %eax, 4(%esp)
movl -4(%ebp), %eax
movl %eax, (%esp)
movl $LC0, (%esp)
call _printf
movl $0, %eax
_add:
pushl %ebp
movl %esp, %ebp
movl 12(%ebp), %eax
addl 8(%ebp), %eax
popl %ebp
ret
Define the size of a circular linked list (no NULL end pointer at end node, points back to the HEAD).
Write a program to reverse the order of a string.
For 20 students, sort by grade and display students with a grade higher than the average grade of all students. Worst case runtime is O(n^2).
Compute the size (in bytes) of a given text file.
Count the number of trailing zeros (binary) for a given number (decimal) by using the bitwise operator. E.g. 8 = 1000 (3 trailing zeros).
Convert a byte or two nibbles from user input to the one's complement and the two's complement for that input.
Check the validity of user defined IP address.
Show the memory representation of the C variables such as int, float, and pointer.
Measure and compare the time it takes to create an array on both the stack and heap.
Create a program that will test both static and dynamic object binding using another object.
Implement the best practice of "Double Checked Locking" for thread safety and minimal locking.
Simple program that adds the elements of two arrays with a million elements each. This program uses host code (CPU).
Simple program that adds the elements of two arrays with a million elements each. This program uses device code (NVIDIA GPU).
Simple matrix multiplication using host code (CPU). The matrix size is 16x16, the values are all 32 and the output is 256.
Matrix multiplication using device code (NVIDIA GPU). I used an Elastic Cloud Compute (EC2) instance of an Amazon Machine ImageMatrix that had a NVIDIA GPU toolkit. Again, the size is 16x16, the values are all 32 and the output is 256.
Implement a Breadth First Search. The complexity is O(n^2), due to an adjacency matrix.
Implement a Depth First Search using recursion. The complexity is O(n^2), due to an adjacency matrix.
A greedy algorithm that finds a minimum spanning tree (MST) for a weighted undirected graph. The algorithm will take the smallest value edge and repeat to build the MST with careful attention not to create a cycle. The time complexity is O(n^2). If a min heap is used the time complexity can be O(nlogn).
A greedy algorithm that finds a minimum spanning tree (MST) for a weighted undirected graph. The algorithm will find the smallest value edge and continue to build the MST with the next smallest edge that is connected to the vertices from the previous edge (repeat until complete). The time complexity is O(n^2). If a min heap is used the time complexity can be O(nlogn).
Header file for queue data structure (node structure, enqueue function and dequeue function).
Given an elevation map (with non-negative integers), compute how much water the terrain map will trap. The map is shown below. This algorithm runs in O(n) time.
