lab08
.py
keyboard_arrow_up
School
Purdue University *
*We aren’t endorsed by this school
Course
177
Subject
Computer Science
Date
Dec 6, 2023
Type
py
Pages
3
Uploaded by SuperTree11868
# -*- coding: utf-8 -*-
file2 = 'sample_data.txt'
def load_inventory(filename):
data = open(filename, "r").readlines()
fin_dict = dict()
for line in data:
line = line.strip()
line_str = line.split(",")
key = line_str[0]
value = tuple((line_str[1], int(line_str[2]), int(line_str[3]),
int(line_str[4]), int(line_str[5])))
fin_dict.update({key:value})
return fin_dict
diction = load_inventory(file2)
def get_stats(data):
stat = (data[1][1], data[1][2], data[1][3], data[1][4])
return stat
def get_spot(data):
spot = (data[1][0])
return spot
#statis = tuple((stats[1], stats[2], stats[3], stats[4]))
#return statis
def get_name(data):
name = data[0]
return name
x = ('Starlight',('Main Hand', 1, -1, 3, 2))
y = ('Sunflare Rapier', ('Main Hand', 2, 0, 3, -1))
z = 'Starlight'
w = 'Sunflare Rapier'
def stat_num(stat):
if stat == "Damage":
n = 0
elif stat == "Defense":
n = 1
elif stat == "Speed":
n = 2
elif stat == "Magic":
n = 3
return n
def compare(data1, data2, typ):
stat1= get_stats(data1)
stat2 = get_stats(data2)
if typ == "Damage":
if stat1[0] >= stat2[0]:
return get_name(data1)
else:
return get_name(data2)
if typ == "Defense":
if stat1[1] >= stat2[1]:
return get_name(data1)
else:
return get_name(data2)
if typ == "Speed":
if stat1[2] >= stat2[2]:
return get_name(data1)
else:
return get_name(data2)
if typ == "Magic":
if stat1[3] >= stat2[3]:
return get_name(data1)
else:
return get_name(data2)
def replace_better(data, typ, name1, name2):
thing1 = (name1, data.get(name1))
thing2 = (name2, data.get(name2))
final = compare(thing1, thing2, typ)
final2 = (final, data.get(final))
spot = get_spot(final2)
return (spot, final)
def optimize_equipment(data, stat):
equipment = dict()
equipment.update({'Main Hand':''})
equipment.update({'Off Hand':''})
equipment.update({'Head':''})
equipment.update({'Hands':''})
equipment.update({'Chest':''})
equipment.update({'Legs':''})
equipment.update({'Neck':''})
equipment.update({'Cloak':''})
equipment.update({'Neck':''})
items = data.items()
for i in items:
equip_name = i[0]
spot = get_spot(i)
if equipment.get(spot) == "":
equipment.update({spot:equip_name})
else:
old = equipment.get(spot)
new = equip_name
better = replace_better(data, stat, old, new)
equipment[better[0]] = better[1]
shitters = []
for i in equipment:
j = equipment.get(i)
formatt = (j, data.get(j))
stuts = get_stats(formatt)
num = stat_num(stat)
if stuts[num] < 0:
shitters += [i]
for word in shitters:
equipment.pop(word)
return equipment
qual = optimize_equipment(diction, "Defense")
qual2 = optimize_equipment(diction, "Damage")
#qual2 = optimize_equipment(diction, 'Damage')
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
- Access to all documents
- Unlimited textbook solutions
- 24/7 expert homework help
Related Questions
Reuse Files
Add-ins
Media
Links
Comments
Header & Footer
void show byte(byte_pointer start, int len)
{
Q2
int i;
for(i=0; į
arrow_forward
programming language: C++
How can you generate unique id with file handling and by using data structure like linked list or algorithm? System will search first in the file when it is not there, it will increment the largest number and then input it in the system whenever the user input a new video in the list.
The file will look like this:
101,Raya and the Last Dragon,Animation,Walt Disney Studio,6102,Captain America: The First Avenger,Adventure ,Marvel,10100,Captain America,Adventure ,Marvel,8
arrow_forward
Dec2Hex function :
def decimal_to_hex(number): hex_map = {0: '0', 1: '1', 2: '2', 3: '3', 4: '4', 5: '5', 6: '6', 7: '7', 8: '8', 9: '9', 10: 'A', 11: 'B', 12: 'C', 13: 'D', 14: 'E', 15: 'F'} hex_digits = [] while number > 0: hex_digits.append(hex_map[number % 16]) number //= 16 # Reverse the order of the hex digits and join them to form the final hex string hex_string = ''.join(reversed(hex_digits)) return f'0x{hex_string}' if hex_string else '0x0'
Perform a Profile of your Dec2Hex function.
Write a function that takes a timedate object as a parameter andcalculates the number of years from NOW to the time in the timedateobject.
Add unit-testing code to your Dec2Hex exercise, and then perform aUnit test of the updated Dec2Hex code.
arrow_forward
Data structures
dict_from_string(dict_str:str)->dict
This function will be given a single parameter, a string representing a dictionary. Your job is to convert the string into an actual dictionary and return the dictionary. Make sure all key-value pairs in the string exist in the newly created dictionary. The string will contain only numbers or single letters as key values pairs. Make sure all letters are kept as strings and all numbers are converted to integers in the newly created dictionary.
Example:
String Input: '{9: 'V', 'G': 0, 'M': 9, 'u': 3, 2: 'o', 8: 'u', 'q': 9, 'D': 1}'
Expected: {9: 'V', 'G': 0, 'M': 9, 'u': 3, 2: 'o', 8: 'u', 'q': 9, 'D': 1}
String Input: '{10: 'D', 1: 'Z', 5: 'a'}'
Expected: {10: 'D', 1: 'Z', 5: 'a'}
String Input: '{'M': 2, 'V': 0, 3: 'x', 6: 'J', 5: 'J', 7: 'T', 8: 'P', 4: 'q', 1: 'h'}'
Expected: {'M': 2, 'V': 0, 3: 'x', 6: 'J', 5: 'J', 7: 'T', 8: 'P', 4: 'q', 1: 'h'}
String Input: '{3: 'D', 10: 'T', 7: 'm', 'u': 9, 't': 5, 6: 'Z', 'H': 10, 'B':…
arrow_forward
Word FrequencyWrite a python program that reads the contents of a text file. The program should create a dictio-nary inwhich the keys are the individual words found in the file and the values are the number of timeseach word appears. For example, if the word “the” appears 128 times, the dictionary wouldcontain an element with 'the' as the key and 128 as the value. The program should eitherdisplay the frequency of each word or create a second file containing a list of each word and itsfrequency.
arrow_forward
Turn this into a flowchart/pseudo code.
//This is where the functions go void insertfront(int data);void insert(int data);void display();void deletedata(int data);void reverselist();void searchdata(int data);void swap();void datasort();void deleteList();
#include <iostream>#include <stdlib.h>using namespace std;
struct Node {int data;struct Node *next;};
struct Node* head = NULL;struct Node* rhead = NULL;int count1;
//insert in front for reversedlistvoid insertfront(int data){Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = data; new_node->next = rhead; rhead=new_node;}//insert at endvoid insert(int new_data){Node* ptr;ptr = head;Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = new_data; new_node->next = NULL;if (head == NULL) { head = new_node; } else{while (ptr->next!= NULL) { ptr = ptr->next;}ptr->next=new_node;}count1++;}//display listvoid display() {struct Node* ptr;ptr = head;if(head==NULL){cout<<"Sorry the list…
arrow_forward
Data structures
concatenate_dict(dict_list:list)->dict
This function will be given a single parameter known as the Dictionary List. Your job is to combine all the dictionaries found in the dictionary list into a single dictionary and return it. There are two rules for adding values to the dictionary:
1. You must add key-value pairs to the dictionary in the same order they are found in the Dictionary List.
2. If the key already exists, it cannot be overwritten. In other words, if two or more dictionaries have the same key, the key to be added cannot be overwritten by the subsequent dictionaries.
Example:
Dictionary List: [{'Z': 6, 'k': 10, 'w': 3, 'I': 8, 'Y': 5}, {'Y': 1, 'Z': 4}, {'X': 2, 'L': 5}]
Expected: {'Z': 6, 'k': 10, 'w': 3, 'I': 8, 'Y': 5, 'X': 2, 'L': 5}
Dictionary List: [{'z': 0}, {'z': 7}]
Expected: {'z': 0}
Dictionary List: [{'b': 7}, {'b': 10, 'A': 8, 'Z': 2, 'V': 1}]
Expected: {'b': 7, 'A': 8, 'Z': 2, 'V': 1}
arrow_forward
Statement is true or false
arrow_forward
# convert_revised_1.py # We will try to print a table without using "string formatting"def main():print("celsius", "fahrenheit") for celsius in range (-50, 200, 20):fahrenheit = 9/5 * celsius + 32print(celsius, fahrenheit)main()
Please revise above program convert_revised_1.py with "string formatting"
Basically, you only need to revise the TWO print statements, one is before the "for loop", for Table Header another one is within the "for loop".
(required width for Celsius value is 35, width Fahrenheit value is 35, both should be right-aligned/justified
arrow_forward
FILE HANDLING
please attach sourcecode/c language program
arrow_forward
C++
arrow_forward
bit_flag.c
#include <stdio.h>
#include <stdlib.h>
#include "bit_flags.h"
typedef struct bit_flags
{
int size;
int capacity;
int *bit;
} Bit_flags;
BIT_FLAGS bit_flags_init_number_of_bits(int number_of_bits)
{
Bit_flags* pBit_flags;
if(number_of_bits > 0) // The given number is positive
{
pBit_flags = (Bit_flags*)malloc(sizeof(Bit_flags));
if(pBit_flags != NULL)
{
pBit_flags->capacity = sizeof(int);
pBit_flags->size = number_of_bits;
pBit_flags->bit = (int*)malloc(sizeof(int));
if(pBit_flags->bit != NULL)
{
*pBit_flags->bit = 0;
}
else
{
printf("Could not set memory for bit value.\n");
pBit_flags = NULL;
}
}
printf("Bit flags object memory print created!\n\n");
}
else // Given number was 0 or negative
{
printf("Number of bits cannot be negative.\n");
pBit_flags = NULL;
}
return pBit_flags;
}
Status bit_flags_set_flag(BIT_FLAGS hBit_flags, int flag_position)
{
Status stat;
int bit_to_set = flag_position;
int* temp;
Bit_flags* phBit_flags =…
arrow_forward
A deque data structure implements the following functions:
insertFront(int); //Insert at the front
insertBack(int);//Insert at the back
removeFront();//Remove and print front element
eraseBack();//Remove and print last element
first();//print first element
last();//print last element
Write the output of the following sequence of operations:
insertFront(3), insertBack(8), insertBack(9),
insertFront(5), removeFront(), eraseBack(),
first(), insertBack(7), removeFront(), last(), eraseBack().
arrow_forward
A deque data structure implements the following functions:
insertFront(int); //Insert at the front
insertBack(int);//Insert at the back
removeFront();//Remove and print front element
eraseBack();//Remove and print last element
first();//print first element
last();//print last element
Write the output of the following sequence of operations:
insertFront(3), insertBack(8), insertBack(9),
insertFront(5), removeFront(), eraseBack(),
first(), insertBack(7), removeFront(), last(), eraseBack().
Write the sequence of numbers without space or comma.
arrow_forward
1
2 var a = 6;
3 var b
= 5;
4 var c = 0;
6 function mystery (numl, num2) {
7
var a;
8.
c = numl + num2;
6.
a = numl + num2 + C;
10
num2 - numl;
document.write(c + "" );
document.write(a + "" );
11
12
13 }
14
15 mystery ( 4, 3);
16 document.write(a +
+ b + "");
17 document.write(c +
"" );
18
19
What value for 'c' does line 11 display?
What value for 'a' does line 12 display:
What value for 'a' does line 16 display:
What value for 'b' does line 16 display:
What value for 'c' does line 17 display:
arrow_forward
C programming language
Topic
: Input/Output
Program
: Product list (product.c)
Definition : The program reads a series of items form a file and displays the data in columns. The
program obtains the file name from the command line. Each line of the file will have the following
form: item, mm-dd-yyyy, price
For example, suppose that the file contains the following lines:
123, 12.00, 12/25/2006
124, 18.30, 1/10/2020
Expected output:
Item
Unit
Purchase
Price
Date
123
$ 12.00
12/25/2006
124
$ 18.30
1/10/2020
arrow_forward
File read write and string manipulation
data1.txt(down below)
4,5-t 2,4-d 20-p7int 2D 2nd 2 1080 &c 10-p7int 10th 11-p7int 12-p7int 16-p7int 18-p7int 1st 2,4,5-t 2,4-d 20-p7int 2D 2nd 30-30 3D 3-D 3M 3rd 48-p7int 4-D 4GL 4H 4th 5-p7int 5-T 5th 6-p7int 6th 7-p7int 7th 8-p7int 8th 9-p7int 9th @ @' @- @&M @&P @. @.@.@. @.B. @.B.@. @.C. @.D. @.D.C. @.F. @.F.@.M. @.G. @.H. @.I. @.I.@. @.I.D. @.L. @.L.P. @.M. @.M.@. @.M.D.G. @.N. @.p. @.r. @.R.C.S. @.U. @.U.C. @.V. @.w. @.W.O.L. @/C @/F j54rs54y54d J54rs54yit54 j54rs54yit54s J54rs54ym@n j54rs54ys j54rs54y's J54rs54yvill54 j54rt J54rubb@@l J54rubb@l J54rus@l54m J54rus@l54mit54 j54rvi@ j54rvin j54rvin@ j54rvin54 J54rvis J54rk J54S J54sh J54sh54r J54smin54 j54sp54r J54sp54rs54n J54ss J54ss@ J54ss@b54ll j54ss@k5454d J54ss@lin J54ss@lyn j54ss@my j54ss@mi54s J54ss@myn J54ss@min54 j54ss@nt J54ss54 J54ss54@n j54ss54d J54ss5454 J54ss54y J54ss54lyn J54ss54lt7n J54ss54n j54ss54s J54ssi J54ssy J54ssic@ J54ssi54 kikkl54 kikkl54d kikkl54s…
arrow_forward
Please show an example of how or how to to solve coding the problem from Starting out with Java from control structures through data structures 4th edition: chapter 18 programming challenge 7
arrow_forward
Plse use c# programming language
arrow_forward
def main():
f= open("input.txt", "r")
record = extractDataRecord(f)
%3D
print(record[0]+"s population is "+str(record[1])+" Millions")
def extractDataRecord(inFile) :
main()
arrow_forward
Correct errors
arrow_forward
c program that coverts a txt file input1.txt and converts it into a 2d array
input1.txt looks like this
Spain
Republic of Ireland
United Kingdom
Ukraine
Russia
United States of America
China
Taiwan
Australia
Hong Kong
Italy
arrow_forward
def count_odds(values):
695
>>> count_odds([[111, 165, 207]])
[3]
>>> count_odds([[1, 2], [8], [5, 6, 7]])
[1,0, 2]
695
arrow_forward
It is a type used to represent a heterogeneous collection of data.
array
O function
struct
pointer
Check It!
Structure is a user-defined data type in C which allows you to
combine different data types to store a particular type of record.
O True
False
Check It!
arrow_forward
char buffer [BUFSIZE];
int fd = open("fooey", O_WRONLY|O_CREAT|O_TRUNC,0777);
strcpy(buffer, "First data");
write(fd, buffer, strlen(buffer));
1seek (fd, 90, SEEK_SET);
strcpy (buffer, "Second data");
write(fd, buffer, strlen(buffer));
1seek (fd, 100, SEEK_END);
strpcy (buffer, "Third data");
write(fd, buffer, strlen(buffer));
close(fd);
a. What is the size of the file at the end of this section of code?
b. Describe the contents of the file say exactly what byte offsets contain actual data, and what
offsets constitute "holes".
c. Why might holey files be useful?
d. Suppose, after the above sequence of writes, the same program opens the file for reading and
then does:
arrow_forward
SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Related Questions
- Reuse Files Add-ins Media Links Comments Header & Footer void show byte(byte_pointer start, int len) { Q2 int i; for(i=0; įarrow_forwardprogramming language: C++ How can you generate unique id with file handling and by using data structure like linked list or algorithm? System will search first in the file when it is not there, it will increment the largest number and then input it in the system whenever the user input a new video in the list. The file will look like this: 101,Raya and the Last Dragon,Animation,Walt Disney Studio,6102,Captain America: The First Avenger,Adventure ,Marvel,10100,Captain America,Adventure ,Marvel,8arrow_forwardDec2Hex function : def decimal_to_hex(number): hex_map = {0: '0', 1: '1', 2: '2', 3: '3', 4: '4', 5: '5', 6: '6', 7: '7', 8: '8', 9: '9', 10: 'A', 11: 'B', 12: 'C', 13: 'D', 14: 'E', 15: 'F'} hex_digits = [] while number > 0: hex_digits.append(hex_map[number % 16]) number //= 16 # Reverse the order of the hex digits and join them to form the final hex string hex_string = ''.join(reversed(hex_digits)) return f'0x{hex_string}' if hex_string else '0x0' Perform a Profile of your Dec2Hex function. Write a function that takes a timedate object as a parameter andcalculates the number of years from NOW to the time in the timedateobject. Add unit-testing code to your Dec2Hex exercise, and then perform aUnit test of the updated Dec2Hex code.arrow_forwardData structures dict_from_string(dict_str:str)->dict This function will be given a single parameter, a string representing a dictionary. Your job is to convert the string into an actual dictionary and return the dictionary. Make sure all key-value pairs in the string exist in the newly created dictionary. The string will contain only numbers or single letters as key values pairs. Make sure all letters are kept as strings and all numbers are converted to integers in the newly created dictionary. Example: String Input: '{9: 'V', 'G': 0, 'M': 9, 'u': 3, 2: 'o', 8: 'u', 'q': 9, 'D': 1}' Expected: {9: 'V', 'G': 0, 'M': 9, 'u': 3, 2: 'o', 8: 'u', 'q': 9, 'D': 1} String Input: '{10: 'D', 1: 'Z', 5: 'a'}' Expected: {10: 'D', 1: 'Z', 5: 'a'} String Input: '{'M': 2, 'V': 0, 3: 'x', 6: 'J', 5: 'J', 7: 'T', 8: 'P', 4: 'q', 1: 'h'}' Expected: {'M': 2, 'V': 0, 3: 'x', 6: 'J', 5: 'J', 7: 'T', 8: 'P', 4: 'q', 1: 'h'} String Input: '{3: 'D', 10: 'T', 7: 'm', 'u': 9, 't': 5, 6: 'Z', 'H': 10, 'B':…arrow_forwardWord FrequencyWrite a python program that reads the contents of a text file. The program should create a dictio-nary inwhich the keys are the individual words found in the file and the values are the number of timeseach word appears. For example, if the word “the” appears 128 times, the dictionary wouldcontain an element with 'the' as the key and 128 as the value. The program should eitherdisplay the frequency of each word or create a second file containing a list of each word and itsfrequency.arrow_forwardTurn this into a flowchart/pseudo code. //This is where the functions go void insertfront(int data);void insert(int data);void display();void deletedata(int data);void reverselist();void searchdata(int data);void swap();void datasort();void deleteList(); #include <iostream>#include <stdlib.h>using namespace std; struct Node {int data;struct Node *next;}; struct Node* head = NULL;struct Node* rhead = NULL;int count1; //insert in front for reversedlistvoid insertfront(int data){Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = data; new_node->next = rhead; rhead=new_node;}//insert at endvoid insert(int new_data){Node* ptr;ptr = head;Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = new_data; new_node->next = NULL;if (head == NULL) { head = new_node; } else{while (ptr->next!= NULL) { ptr = ptr->next;}ptr->next=new_node;}count1++;}//display listvoid display() {struct Node* ptr;ptr = head;if(head==NULL){cout<<"Sorry the list…arrow_forwardData structures concatenate_dict(dict_list:list)->dict This function will be given a single parameter known as the Dictionary List. Your job is to combine all the dictionaries found in the dictionary list into a single dictionary and return it. There are two rules for adding values to the dictionary: 1. You must add key-value pairs to the dictionary in the same order they are found in the Dictionary List. 2. If the key already exists, it cannot be overwritten. In other words, if two or more dictionaries have the same key, the key to be added cannot be overwritten by the subsequent dictionaries. Example: Dictionary List: [{'Z': 6, 'k': 10, 'w': 3, 'I': 8, 'Y': 5}, {'Y': 1, 'Z': 4}, {'X': 2, 'L': 5}] Expected: {'Z': 6, 'k': 10, 'w': 3, 'I': 8, 'Y': 5, 'X': 2, 'L': 5} Dictionary List: [{'z': 0}, {'z': 7}] Expected: {'z': 0} Dictionary List: [{'b': 7}, {'b': 10, 'A': 8, 'Z': 2, 'V': 1}] Expected: {'b': 7, 'A': 8, 'Z': 2, 'V': 1}arrow_forwardStatement is true or falsearrow_forward# convert_revised_1.py # We will try to print a table without using "string formatting"def main():print("celsius", "fahrenheit") for celsius in range (-50, 200, 20):fahrenheit = 9/5 * celsius + 32print(celsius, fahrenheit)main() Please revise above program convert_revised_1.py with "string formatting" Basically, you only need to revise the TWO print statements, one is before the "for loop", for Table Header another one is within the "for loop". (required width for Celsius value is 35, width Fahrenheit value is 35, both should be right-aligned/justifiedarrow_forwardFILE HANDLING please attach sourcecode/c language programarrow_forwardC++arrow_forwardbit_flag.c #include <stdio.h> #include <stdlib.h> #include "bit_flags.h" typedef struct bit_flags { int size; int capacity; int *bit; } Bit_flags; BIT_FLAGS bit_flags_init_number_of_bits(int number_of_bits) { Bit_flags* pBit_flags; if(number_of_bits > 0) // The given number is positive { pBit_flags = (Bit_flags*)malloc(sizeof(Bit_flags)); if(pBit_flags != NULL) { pBit_flags->capacity = sizeof(int); pBit_flags->size = number_of_bits; pBit_flags->bit = (int*)malloc(sizeof(int)); if(pBit_flags->bit != NULL) { *pBit_flags->bit = 0; } else { printf("Could not set memory for bit value.\n"); pBit_flags = NULL; } } printf("Bit flags object memory print created!\n\n"); } else // Given number was 0 or negative { printf("Number of bits cannot be negative.\n"); pBit_flags = NULL; } return pBit_flags; } Status bit_flags_set_flag(BIT_FLAGS hBit_flags, int flag_position) { Status stat; int bit_to_set = flag_position; int* temp; Bit_flags* phBit_flags =…arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education