You are looking inside
The cover and contents of this subject are open. Every chapter unlocks when you buy.
Already bought it? Sign in and it opens.
Semester 3 · Subject 5 of 5
Major Practical 3
0 of 38 read
Before Module I
Cover and contents
Open
Module I
1. Write programs for the following:
Locked
0 of 20 read
- 1 How This Practical Is Examined: the Slip, the Journal and the Viva (locked) 9 min
- 2 The Laboratory from Zero: Python, IDLE, and Your First Program (locked) 11 min
- 3 Practical 1: Input, Output, and the Year You Turn 100 (locked) 10 min
- 4 Practical 1 continued: Even or Odd, and the SGPI Grade Ladder (locked) 12 min
- 5 Practical 2: the Fibonacci Series, and the Sum of the Digits (locked) 11 min
- 6 Practical 3: Arrays, Basic Operations, Indexing and Slicing (locked) 13 min
- 7 Practical 3 continued: Mathematical Functions, Aliasing and Copying (locked) 18 min
- 8 Practical 4: NumPy Slicing, Basic and Advanced Indexing (locked) 15 min
- 9 Practical 4 continued: the Dimensions and Attributes of an Array (locked) 14 min
- 10 Practical 5: Functions, Armstrong Numbers and Palindromes (locked) 14 min
- 11 Practical 5 continued: Recursion, and the Lambda (locked) 13 min
- 12 Practical 6: Counting the Characters and the Words in a String (locked) 11 min
- 13 Practical 6 continued: the Geometry Module, and pointyShapeVolume (locked) 13 min
- 14 Practical 7: a Common Member, and a Dictionary Sorted by Value (locked) 15 min
- 15 Practical 8: the Tuple Return, Area and Circumference (locked) 11 min
- 16 Practical 8 continued: Text Files, Binary Files, and the Last n Lines (locked) 16 min
- 17 Practical 9: Counting a Word in a File with a Regular Expression (locked) 13 min
- 18 Practical 9 continued: Extracting Every Hyperlink from an HTML File (locked) 14 min
- 19 Practical 10: Comparing Two Dates in DD/MM/YYYY Form (locked) 13 min
- 20 Practical 10 continued: Measuring Execution Time, and the Calendar Module (locked) 15 min
Module II
1. Array Operations: Write a program to implement basic array operations:
Locked
0 of 15 read
- 21 Python for Data Structures, and the Cost of an Operation (locked) 23 min
- 22 Practical 1: Array Operations, Insert, Delete and Linear Search (locked) 16 min
- 23 Practical 2: Building a Singly Linked List (locked) 17 min
- 24 Practical 2 continued: Deleting a Node from a Linked List (locked) 17 min
- 25 Practical 3: a Stack over an Array (locked) 15 min
- 26 Practical 3 continued: Infix to Postfix with a Stack (locked) 21 min
- 27 Practical 4: a Queue over an Array (locked) 19 min
- 28 Practical 4 continued: Simulating a Customer Service Queue (locked) 14 min
- 29 Practical 5: the Binary Search Tree, Create, Insert and Search (locked) 21 min
- 30 Practical 6: Tree Traversal, Pre-order, In-order and Post-order (locked) 20 min
- 31 Practical 7: a Hash Table with Separate Chaining (locked) 26 min
- 32 Practical 8: Bubble, Insertion and Selection Sort Compared (locked) 20 min
- 33 Practical 9: Linear and Binary Search Compared (locked) 21 min
- 34 Practical 10: the Combined Application (locked) 23 min
- 35 If Your College Runs Module 2 in C (locked) 34 min