By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10 001st prime number? I utilized a Sieve of Erastothenes with a bit vector implemented in C++ to solve this problem. The answer …
Your assignment will be to write a Y86-64 program to perform bubblesort. For reference, the following C function implements bubblesort using array referencing: /* Bubble sort: Array version */ void bubble_a(long *data, long count) { long i, last; for(last = count-1; last > 0; last–){ for( i = 0; i …
/* Sources: http://www.gnu.org/software/libc/manual/html_node/Getopt.html https://en.wikipedia.org/wiki/C_dynamic_memory_allocation Computer Systems A Programmers Perspective */ #include <stdlib.h> #include <stdio.h> #include <getopt.h> #include “cachelab.h” #include <math.h> #include <strings.h> typedef unsigned long long int address; typedef int bool; #define true 1 #define false 0 typedef struct // Structure for holding command line parameters given when calling …
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … By considering the terms in the Fibonacci sequence whose values do not …
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. Solution in Python total = 0; …
Using names.txt (right click and ‘Save Link/Target As…’), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score. For example, …
Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner. How many such routes are there through a 20×20 grid? This problem is solvable via combinatorics; since you are …
#include #include using namespace std; struct Node { char _data; Node *_next; Node() { this->_next = 0; this->_data = 0; } Node(char ch) { this->_data = ch; this->_next = 0; } ~Node() { } }; class LinkedList { private: Node *_header; int listCount; public: LinkedList(); ~LinkedList(); Node *getHeader(); void setHeader(Node …
#ifndef _LINKED_LIST_ #define _LINKED_LIST_ #include struct Node{ // Data Link void *data; // Pointers to previous and next Node *next; }; class LinkedList { private: // Keeps count of the number of list elements int listCount; // Keeps track of the head of the list for traversal Node *head; public: …
/* Sources: Computer Systems a Programmers Perspective The C Programming Language http://danluu.com/malloc-tutorial/ http://g.oswego.edu/dl/html/malloc.html https://www.cs.cmu.edu/~fp/courses/15213-s05/code/18-malloc/malloc.c */ #include <stdio.h> #include <stdlib.h> #include <assert.h> #include <unistd.h> #include <string.h> #include “mm.h” #include “memlib.h” /* malloc, realloc, and free implementation in C. The list is searched in a first fit manner, where the first fit …