What is Hamming Code?
What is the square root of 256?
Using bitwise operations, how would you test that a number is a power of 2?
What does ELF stand for?
example of a latency device
example of a throughput device
What is the Hamming Distance?
What are the 5 steps of the compiling process?
What is parsing?
What is lexical analysis?
What is code generation?
size of char in bits
size of char in bytes
size of bool in bits
size of short in bits
size of short in bytes
size of int in bits
size of int in bytes
size of long in bits
size of long in bytes
size of long long in bits
size of long long in bytes
size of float in bits
size of float in bytes
size of double in bits
size of double in bytes
size of wchar_t in bits
size of wchar_t in bytes
Write a function that reverses a linked list, with this argument: pointer to pointer to the head node.
Delete a given value from a BST rooted at given node. Returns a pointer to node.
Get the successor of a value in a BST rooted by given node. Returns int.
Using recursion, insert a value into a tree: root = insert(node*, int)
Using an iterative approach, insert a value into a BST: insert(node*, int)
Write a method is_binary_search_tree that returns true if a given tree is a BST (use helper function).
Using an iterative approach, write a function find_node(bst_node* root, int target) that returns the node with the given target value in a BST.
Using an recursive approach, write a function: find_node(bst_node* node, int value) that returns the node with the given target value in a BST.
Function that returns the height (in nodes) of a BST: int get_height(bst_node* node)
How many levels in a complete binary tree of size n?
How can build heap be done in linear time?
C or Python: Sort an array of numbers using heap sort.
How are queues usually implemented?
How is a deque usually implemented?
How would you swap 2 integers using only bitwise operations?
How would you turn ON the 3rd bit from the end in a bitstring?
How would you turn OFF the 3rd bit from the end in a bitstring?
Write a function that calculates the Hamming distance.
Write a function to calculate the Hamming weight of an integer. (Kernighan method)
Write a function that calculates the Hamming weight in constant time. Divide and Conquer strategy.
Write a function that tells you if a number is even, using bitwise operation.
Write a function to add 2 integers using bitwise operations.
Write a function to get the sign of an integer.
Write a function to calculate the absolute value of a 32-bit integer.
Write a binary search function that works iteratively, taking a target int, array of ints, and size of the array, returning the index of the found item, or -1.
Write a binary search function that works recursively, returning the index of the found item, or -1.
In C or Python, Write a universal hashing function for a string, taking as arguments a string and the capacity of the hashtable.
Describe the universal hashing function for an integer. What arguments would it need? What would it look like?
What is a Binary Search Tree?
What is an AVL tree?
What is a red-black tree?
What is a splay tree?
What is a treap?
What is typical cache line size?
What is latency?
What is a y-fast trie?
What is an x-fast trie?
What is a van Emde Boas tree?
What is a compressed trie?
What relationship of the keys do you lose with a hash table?
Sed command to take a file separated by spaces, turn spaces into newlines, and then sort it alphabetically.
Print columns 2, 3, and 6 from the date command.
Take a file delimited by : and make it tab-delimited.
Output a file with line numbers.
Is quicksort stable?
Can quicksort be done in-place?
Can merge sort be done in-place?
Is merge sort stable?
Is insertion sort stable?
Can insertion sort be done in-place?
Can selection sort be done in-place?
Is selection sort stable?
Is heap sort stable?
Can heap sort be done in-place?
Write merge sort in C (check answer carefully)
Write a MergeSort class in Python (check answer carefully)