Sample Codes for Algorithm, Pseudo code and Program
1. Write a program to check the given number is prime or not?
Algorithm: Pseudo code:
Input: n
If n <= 1:
Print "Not a Prime Number"
Else If n == 2:
Print "Prime Number"
Else:
For i from 2 to sqrt(n):
If n % i == 0:
Print "Not a Prime Number"
Exit
End For
Print "Prime Number"
Program:
import math
def is_prime(n):
if n <= 1:
return "Not a Prime Number"
if n == 2:
return "Prime Number"
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
return "Not a Prime Number"
return "Prime Number"
# Input from the user
number = int(input("Enter a number: "))
print(is_prime(number))
2. Write program to display the linked list elements:
Algorithm:
1. Start
2. Create a linked list structure with nodes containing data and a pointer to the next node.
3. Initialize a temporary pointer temp\text{temp}temp to the head of the linked list.
4. If temp is NULL, the linked list is empty.
5. Print "Linked List is empty".
6. Otherwise, traverse the linked list until temp becomes NULL:
7. Print the data in the current node.
8. Move temp\text{temp}temp to the next node.
9. Stop
Pseudo code:
Procedure DisplayLinkedList(head):
If head == NULL:
Print "Linked List is empty"
Exit
End If
Set temp = head
While temp != NULL:
Print temp.data
temp = temp.next
End While
End Procedure
Program:
class Node:
def __init__(self, data):
self.data = data
self.next = None
class LinkedList:
def __init__(self):
self.head = None
def append(self, data):
new_node = Node(data)
if not self.head:
self.head = new_node
return
temp = self.head
while temp.next:
temp = temp.next
temp.next = new_node
def display(self):
if not self.head:
print("Linked List is empty")
return
temp = self.head
while temp:
print(temp.data, end=" -> ")
temp = temp.next
print("NULL")
# Example Usage
ll = LinkedList()
ll.append(10)
ll.append(20)
ll.append(30)
print("Elements in the Linked List:")
ll.display()
2. Write program to display the items in binary tree:
Algorithm:
1. Start
2. Define the structure of a binary tree node with data, left, and right pointers.
3. If the root node is NULL:
4. Print "Tree is empty".
5. Otherwise, perform an in-order traversal:
6. Recursively traverse the left subtree.
7. Print the data in the current node.
8. Recursively traverse the right subtree.
9. Stop
Pseudo Code:
Procedure DisplayBinaryTree(node):
If node == NULL:
Return
End If
DisplayBinaryTree(node.left) // Traverse the left subtree
Print node.data // Print the current node's data
DisplayBinaryTree(node.right) // Traverse the right subtree
End Procedure
Program:
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
class BinaryTree:
def __init__(self):
self.root = None
def in_order_traversal(self, node):
if not node:
return
self.in_order_traversal(node.left) # Traverse left subtree
print(node.data, end=" ") # Visit current node
self.in_order_traversal(node.right) # Traverse right subtree
# Example Usage
tree = BinaryTree()
tree.root = Node(10)
tree.root.left = Node(5)
tree.root.right = Node(15)
tree.root.left.left = Node(3)
tree.root.left.right = Node(7)
tree.root.right.left = Node(12)
tree.root.right.right = Node(18)
print("In-Order Traversal of the Binary Tree:")
tree.in_order_traversal(tree.root)
