import math
def volume(r):
volume = 2 * math.pi * math.pow(r, 3) / 3
print("Volume = ", '%.4f' %volume)
def surface_area(r):
s_area = 2 * math.pi * math.pow(r, 2)
print("Surface Area = ", '%.4f' %s_area)
r = 11
volume(r)
surface_area(r)
Solve Problems by Coding Solutions - A Complete solution for python programming
import math
def volume(r):
volume = 2 * math.pi * math.pow(r, 3) / 3
print("Volume = ", '%.4f' %volume)
def surface_area(r):
s_area = 2 * math.pi * math.pow(r, 2)
print("Surface Area = ", '%.4f' %s_area)
r = 11
volume(r)
surface_area(r)
def countDyckPaths(n):
res = 1
for i in range(0, n):
res *= (2 * n - i)
res /= (i + 1)
return res / (n+1)
n = 4
print("Number of Dyck Paths is ",
str(int(countDyckPaths(n))))
def DFS(graph, src, prev_len,
max_len, visited):
visited[src] = 1
curr_len = 0
adjacent = None
for i in range(len(graph[src])):
adjacent = graph[src][i]
if (not visited[adjacent[0]]):
curr_len = prev_len + adjacent[1]
DFS(graph, adjacent[0], curr_len,
max_len, visited)
if (max_len[0] < curr_len):
max_len[0] = curr_len
curr_len = 0
def longestCable(graph, n):
max_len = [-999999999999]
for i in range(1, n + 1):
visited = [False] * (n + 1)
DFS(graph, i, 0, max_len, visited)
return max_len[0]
if __name__ == '__main__':
n = 6
graph = [[] for i in range(n + 1)]
graph[1].append([2, 3])
graph[2].append([1, 3])
graph[2].append([3, 4])
graph[3].append([2, 4])
graph[2].append([6, 2])
graph[6].append([2, 2])
graph[4].append([6, 6])
graph[6].append([4, 6])
graph[5].append([6, 5])
graph[6].append([5, 5])
print("Maximum length of cable =",
longestCable(graph, n))
class Node:
def __init__(self, data):
self.key = data
self.left = None
self.right = None
def inorder(root):
if root != None:
inorder(root.left)
print(root.key, end = " ")
inorder(root.right)
def reversePath(node, key, q1):
if node == None:
return
if node.key == key:
q1.insert(0, node.key)
node.key = q1[-1]
q1.pop()
return
elif key < node.key:
q1.insert(0, node.key)
reversePath(node.left, key, q1)
node.key = q1[-1]
q1.pop()
elif (key > node.key):
q1.insert(0, node.key)
reversePath(node.right, key, q1)
node.key = q1[-1]
q1.pop()
return
def insert(node, key):
if node == None:
return Node(key)
if key < node.key:
node.left = insert(node.left, key)
elif key > node.key:
node.right = insert(node.right, key)
return node
if __name__ == '__main__':
root = None
q1 = []
k = 80;
root = insert(root, 50)
insert(root, 30)
insert(root, 20)
insert(root, 40)
insert(root, 70)
insert(root, 60)
insert(root, 80)
print("Before Reverse :")
inorder(root)
reversePath(root, k, q1)
print()
print("After Reverse :")
inorder(root)
Python for Engineers has been selected by Feedspot as one of the Top 60 Python Blogs on the web
https://blog.feedspot.com/