Major Practical 3 Notes | B.Sc. (Information Technology) Semester 3 | Mumbai University | munotes

Contents

Module I 1. Write programs for the following:

1. How This Practical Is Examined: the Slip, the Journal and the Viva 1
2. The Laboratory from Zero: Python, IDLE, and Your First Program 5
3. Practical 1: Input, Output, and the Year You Turn 100 10
4. Practical 1 continued: Even or Odd, and the SGPI Grade Ladder 15
5. Practical 2: the Fibonacci Series, and the Sum of the Digits 21
6. Practical 3: Arrays, Basic Operations, Indexing and Slicing 27
7. Practical 3 continued: Mathematical Functions, Aliasing and Copying 33
8. Practical 4: NumPy Slicing, Basic and Advanced Indexing 41
9. Practical 4 continued: the Dimensions and Attributes of an Array 48
10. Practical 5: Functions, Armstrong Numbers and Palindromes 55
11. Practical 5 continued: Recursion, and the Lambda 62
12. Practical 6: Counting the Characters and the Words in a String 68
13. Practical 6 continued: the Geometry Module, and pointyShapeVolume 73
14. Practical 7: a Common Member, and a Dictionary Sorted by Value 79
15. Practical 8: the Tuple Return, Area and Circumference 86
16. Practical 8 continued: Text Files, Binary Files, and the Last n Lines 92
17. Practical 9: Counting a Word in a File with a Regular Expression 100
18. Practical 9 continued: Extracting Every Hyperlink from an HTML File 106
19. Practical 10: Comparing Two Dates in DD/MM/YYYY Form 113
20. Practical 10 continued: Measuring Execution Time, and the Calendar Module 119

Module II 1. Array Operations: Write a program to implement basic array operations:

1. Python for Data Structures, and the Cost of an Operation 126
2. Practical 1: Array Operations, Insert, Delete and Linear Search 137
3. Practical 2: Building a Singly Linked List 144
4. Practical 2 continued: Deleting a Node from a Linked List 152
5. Practical 3: a Stack over an Array 160
6. Practical 3 continued: Infix to Postfix with a Stack 167
7. Practical 4: a Queue over an Array 177
8. Practical 4 continued: Simulating a Customer Service Queue 186
9. Practical 5: the Binary Search Tree, Create, Insert and Search 193
10. Practical 6: Tree Traversal, Pre-order, In-order and Post-order 203
11. Practical 7: a Hash Table with Separate Chaining 212
12. Practical 8: Bubble, Insertion and Selection Sort Compared 224
13. Practical 9: Linear and Binary Search Compared 233
14. Practical 10: the Combined Application 243
15. If Your College Runs Module 2 in C 253

Module J The journal, the viva and the practical examination

1. Keeping the Journal, and What Goes on the Page 268
2. A Worked Practical Slip: Q1, Q2 and Q3 275
3. The Viva: the Questions Asked at the Table 285