Without using built in python functions. Try to write a program that will find the largest and
Fantastic news! We've Found the answer you've been seeking!
Question:
Try to write a program that will find the largest and second largest item in a list
2Define a linked list, how does it differ from a list
3using a for loop print the even numbers from 56-202
Try to write a function that using a for loop will take a list as a parameter and will print the items of a list in reverse (no use of built in python functions is allowed)
'''
'''
5Try to write a function that will prompt a user to add items to a list, when the user types done, stop asking them for numbers, print out
the list of numbers the user created but where each number is squared
'''
'''
6Define all data structures we spoke on
'''
'''
7Try to write a functon that will create a table in docx
and fill it with any data you chose
'''
'''
8Try to write a function that takes a string as a parameter and returns a dictionary where each letter is a key and the value associated with this key is the amount of times the letter is repeated
for example, given
hello
return
{
"h":1,
"e":1,
"l":2,
"o":1
}'
9Try to write a function that will open an excell fileand read information from A1 to C3
10what is a queue? how is it different from a stack?
11what is the difference between a set and a tuple?
12Create a linked list of 5 nodesHINT: make sure to use 2 different class definitions..thenTry to write a printlist method in the linked list class
13Try to create a new Linked list BUT with nodes thathave a different class definitionmake nodes that also contain a previous pointer as well as nextnow try to write a pop function for this doubly linked list
14try to write code that will open a generic txt file andprint its contents line by line
15Try to write code that will open an existing xlsx file called
test
and then try to create a new sheet in this workbook
then fill the cells from A1 to C3 with numbers
A B C
1 1 2 3
2 4 5 6
3 7 8 9
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: