Merge branch 'aiwithqasim:dev' into dev

Author: AhsanMuhammad90

AbdulRehman_BCE_BUKC/README.md

@@ -0,0 +1,5 @@
+👋 Hi, I’m @abdulrehman2811
+👀 I’m interested in Cyber Security, Penetration Testing, Networking, Information Technology
+🌱 I’m currently learning AI, IT, and Networking
+💞️ I’m looking to collaborate on the domains mentioned above.
+📫 Reach out to me through my Email ID: [abdulrehmanarshad95@gmail.com]

DanialAzeem_BahriaUniversity_BCE7A/Lab4/AI-Lab4-Danial Azeem.docx

@@ -0,0 +1,26 @@
+{
+    "students": [
+        {
+            "firstName": "Nikki",
+            "lastName": "Roysden"
+        },
+        {
+            "firstName": "Mervin",
+            "lastName": "Friedland"
+        },
+        {
+            "firstName": "Aron ",
+            "lastName": "Wilkins"
+        }
+    ],
+    "teachers": [
+        {
+            "firstName": "Amberly",
+            "lastName": "Calico"
+        },
+        {
+            "firstName": "Regine",
+            "lastName": "Agtarap"
+        }
+    ]
+}

DanialAzeem_BahriaUniversity_BCE7A/Lab4/data.json

@@ -0,0 +1,8 @@
+from collections import Counter
+
+counter = Counter({'Math': 81, 'Physics': 83, 'Chemistry': 87})
+
+sorted_value = dict(sorted(counter.items(), key=lambda item: item[1], reverse=True))
+
+for key, value in sorted_value.items():
+    print(f'{key}: {value}')

DanialAzeem_BahriaUniversity_BCE7A/Lab4/task1.py

@@ -0,0 +1,21 @@
+import json
+
+original_dict = {
+    'students': [
+        {'firstName': 'Nikki', 'lastName': 'Roysden'},
+        {'firstName': 'Mervin', 'lastName': 'Friedland'},
+        {'firstName': 'Aron ', 'lastName': 'Wilkins'}
+    ],
+    'teachers': [
+        {'firstName': 'Amberly', 'lastName': 'Calico'},
+        {'firstName': 'Regine', 'lastName': 'Agtarap'}
+    ]
+}
+
+json_file_path = 'data.json'
+
+with open(json_file_path, 'w') as json_file:
+    json.dump(original_dict, json_file, indent=4)
+
+print(f"Original dictionary:\n{original_dict}")
+print(f"Json file to dictionary:\n{json.dumps(original_dict, indent=4)}")

DanialAzeem_BahriaUniversity_BCE7A/Lab4/task2.py

@@ -0,0 +1,18 @@
+original_list = [
+    {'id': '#FF0000', 'color': 'Red'},
+    {'id': '#800000', 'color': 'Maroon'},
+    {'id': '#FFFF00', 'color': 'Yellow'},
+    {'id': '#808000', 'color': 'Olive'}
+]
+
+removed_item = {'id': '#FF0000', 'color': 'Red'}
+
+new_list = [d for d in original_list if d != removed_item]
+
+print("Original list of dictionaries:")
+for d in original_list:
+    print(d)
+
+print("\nRemove id #FF0000 from the list:")
+for d in new_list:
+    print(d)

DanialAzeem_BahriaUniversity_BCE7A/Lab4/task3.py

@@ -0,0 +1,21 @@
+def reverse_words_in_string(input_string):
+
+    words = input_string.split()
+
+    reversed_words = words[::-1]
+
+    reversed_string = ' '.join(reversed_words)
+
+    return reversed_string
+
+def main():
+
+    input_string = input("Enter a long string with multiple words: ")
+
+    reversed_string = reverse_words_in_string(input_string)
+
+    print("Reversed string with words in backward order:")
+    print(reversed_string)
+
+if __name__ == "__main__":
+    main()

DanialAzeem_BahriaUniversity_BCE7A/Lab4/task4.py

@@ -0,0 +1,12 @@
+def fibonacci(n):
+    if n <= 0:
+        return 0
+    elif n == 1:
+        return 1
+    else:
+        return fibonacci(n - 1) + fibonacci(n - 2)
+
+n = 6
+result = fibonacci(n)
+
+print(f"The {n}th Fibonacci number is {result}")

DanialAzeem_BahriaUniversity_BCE7A/Lab4/task5.py

@@ -0,0 +1,26 @@
+from collections import deque
+
+def bfs(graph, start):
+    visited = set()
+    queue = deque([start])
+
+    while queue:
+        node = queue.popleft()
+        if node not in visited:
+            print(node, end=' ')
+            visited.add(node)
+            queue.extend(neighbour for neighbour in graph[node] if neighbour not in visited)
+
+graph = {
+    'A': ['B', 'C'],
+    'B': ['A', 'D', 'E'],
+    'C': ['A', 'F'],
+    'D': ['B'],
+    'E': ['B', 'F'],
+    'F': ['C', 'E']
+}
+
+start_node = 'A'
+
+print("BFS traversal starting from", start_node)
+bfs(graph, start_node)

DanialAzeem_BahriaUniversity_BCE7A/Lab4/task6-BFS.py

@@ -0,0 +1,21 @@
+def dfs(graph, node, visited):
+    if node not in visited:
+        print(node, end=' ')
+        visited.add(node)
+        for neighbor in graph[node]:
+            dfs(graph, neighbor, visited)
+
+graph = {
+    'A': ['B', 'C'],
+    'B': ['A', 'D', 'E'],
+    'C': ['A', 'F'],
+    'D': ['B'],
+    'E': ['B', 'F'],
+    'F': ['C', 'E']
+}
+
+start_node = 'A'
+
+print("DFS traversal starting from", start_node)
+visited_nodes = set()
+dfs(graph, start_node, visited_nodes)