|
RAR-files |
| booktime-2024-dsup.rar |
50,000,000 |
45A8CBA4 |
| booktime-2024-dsup.r00 |
50,000,000 |
30001B28 |
| booktime-2024-dsup.r01 |
50,000,000 |
7876586E |
| booktime-2024-dsup.r02 |
50,000,000 |
3FD883BD |
| booktime-2024-dsup.r03 |
50,000,000 |
2DF7D094 |
| booktime-2024-dsup.r04 |
50,000,000 |
F0ECC166 |
| booktime-2024-dsup.r05 |
50,000,000 |
F62A52DC |
| booktime-2024-dsup.r06 |
50,000,000 |
043FD5AA |
| booktime-2024-dsup.r07 |
50,000,000 |
ACFBCAD3 |
| booktime-2024-dsup.r08 |
50,000,000 |
9312844C |
| booktime-2024-dsup.r09 |
50,000,000 |
60E96003 |
| booktime-2024-dsup.r10 |
50,000,000 |
CBA8B34C |
| booktime-2024-dsup.r11 |
50,000,000 |
64152BF1 |
| booktime-2024-dsup.r12 |
50,000,000 |
39169364 |
| booktime-2024-dsup.r13 |
50,000,000 |
FA270BDF |
| booktime-2024-dsup.r14 |
50,000,000 |
E9EE408F |
| booktime-2024-dsup.r15 |
50,000,000 |
1E139FBC |
| booktime-2024-dsup.r16 |
50,000,000 |
8D2E1AAC |
| booktime-2024-dsup.r17 |
50,000,000 |
5DF4845F |
| booktime-2024-dsup.r18 |
50,000,000 |
7983199D |
| booktime-2024-dsup.r19 |
50,000,000 |
F32F5A73 |
| booktime-2024-dsup.r20 |
50,000,000 |
30D4A6FE |
| booktime-2024-dsup.r21 |
50,000,000 |
13C6C819 |
| booktime-2024-dsup.r22 |
50,000,000 |
C97992F2 |
| booktime-2024-dsup.r23 |
50,000,000 |
7BE3A51E |
| booktime-2024-dsup.r24 |
50,000,000 |
3453D423 |
| booktime-2024-dsup.r25 |
50,000,000 |
97124DD7 |
| booktime-2024-dsup.r26 |
50,000,000 |
C95BD915 |
| booktime-2024-dsup.r27 |
50,000,000 |
07C51194 |
| booktime-2024-dsup.r28 |
50,000,000 |
0EE1300E |
| booktime-2024-dsup.r29 |
50,000,000 |
9D8E4A1A |
| booktime-2024-dsup.r30 |
50,000,000 |
6CF7CA19 |
| booktime-2024-dsup.r31 |
50,000,000 |
71D42C4B |
| booktime-2024-dsup.r32 |
50,000,000 |
46EB1077 |
| booktime-2024-dsup.r33 |
50,000,000 |
EE4F79D1 |
| booktime-2024-dsup.r34 |
50,000,000 |
12A06228 |
| booktime-2024-dsup.r35 |
50,000,000 |
5D1DE17F |
| booktime-2024-dsup.r36 |
50,000,000 |
08B65AC2 |
| booktime-2024-dsup.r37 |
50,000,000 |
98734AB9 |
| booktime-2024-dsup.r38 |
50,000,000 |
988E0F93 |
| booktime-2024-dsup.r39 |
50,000,000 |
C7740B94 |
| booktime-2024-dsup.r40 |
50,000,000 |
1BFA0273 |
| booktime-2024-dsup.r41 |
50,000,000 |
8BB478EA |
| booktime-2024-dsup.r42 |
50,000,000 |
CDB7E05D |
| booktime-2024-dsup.r43 |
50,000,000 |
231EEA78 |
| booktime-2024-dsup.r44 |
50,000,000 |
2F6291E0 |
| booktime-2024-dsup.r45 |
50,000,000 |
4417208A |
| booktime-2024-dsup.r46 |
50,000,000 |
32C02DAA |
| booktime-2024-dsup.r47 |
50,000,000 |
CB14AFEB |
| booktime-2024-dsup.r48 |
50,000,000 |
8F436522 |
| booktime-2024-dsup.r49 |
50,000,000 |
F1D4B9A2 |
| booktime-2024-dsup.r50 |
50,000,000 |
BAE45C89 |
| booktime-2024-dsup.r51 |
50,000,000 |
1778537C |
| booktime-2024-dsup.r52 |
50,000,000 |
6EDEB681 |
| booktime-2024-dsup.r53 |
50,000,000 |
3BFE7BCE |
| booktime-2024-dsup.r54 |
50,000,000 |
71F25896 |
| booktime-2024-dsup.r55 |
50,000,000 |
B1DFA342 |
| booktime-2024-dsup.r56 |
50,000,000 |
6E04F61B |
| booktime-2024-dsup.r57 |
50,000,000 |
BE3946FB |
| booktime-2024-dsup.r58 |
50,000,000 |
2E41DBDA |
| booktime-2024-dsup.r59 |
50,000,000 |
DC39A7A9 |
| booktime-2024-dsup.r60 |
30,809,792 |
6599336F |
|
| Total size: |
3,080,809,792 |
|
|
| Archived
files |
|
Chapter_6-Stacks\55. Understanding Stacks.mp4
[92b55af5f64ab58]
|
47,355,986 |
EFD0DF62 |
|
Chapter_6-Stacks\56. Implementing Stacks in Python.mp4
[a1faeadf7ab3d3ac]
|
108,558,342 |
2E4E4644 |
|
Chapter_6-Stacks\57. Implementing Stacks Using Lists with built-in methods in Python.mp4
[185da8b4b730c96f]
|
22,353,991 |
974EF920 |
|
Chapter_6-Stacks\58. Implementing Stacks Using Collections-dequeue in Python.mp4
[c17e5a6b405d99b3]
|
27,479,922 |
104BA9B6 |
|
Chapter_6-Stacks\59. Implementing Stacks Using Queue-Lifo Queue in Python.mp4
[d6ef55955d4d3cfb]
|
48,061,340 |
DDE019F6 |
|
Chapter_6-Stacks\60. Linked List Implementation of Stacks in Python.mp4
[b972ac1f774d6a7]
|
99,204,945 |
8678E877 |
|
Chapter_6-Stacks\61. Stack Application Balanced Parenthesis.mp4
[96cc7f306b60571a]
|
26,524,375 |
D5C5F2F0 |
|
Chapter_6-Stacks\62. Using Stacks for Checking Balanced Parenthesis.mp4
[930edeb7bd40fb2b]
|
64,291,294 |
F6ADFF02 |
|
Chapter_6-Stacks\Additional_Files\Stacks.pptx |
333,431 |
2BE354CE |
|
Chapter_7-Queues\63. Understanding Queues.mp4
[961719a7285cc031]
|
86,734,728 |
B893CE27 |
|
Chapter_7-Queues\64. Implementing Queues Using Lists with built-in methods in Python.mp4
[6b88243e0ca5203]
|
25,530,759 |
016B8736 |
|
Chapter_7-Queues\65. Implementing Queues Using Collections-dequeue in Python.mp4
[5124398bcc631615]
|
27,401,827 |
5156E7CA |
|
Chapter_7-Queues\66. Implementing Queues using queue module in Python.mp4
[83b3a9a12ef8ba90]
|
39,676,307 |
973D09EA |
|
Chapter_7-Queues\67. Implementing Queues Using LinkedLists.mp4
[b71b72a4c2ee3e37]
|
79,260,228 |
F1F3E4EF |
|
Chapter_7-Queues\68. Circular Queues.mp4
[69f54436b654220a]
|
39,982,749 |
00562516 |
|
Chapter_7-Queues\Additional_Files\Queues.pptx |
736,575 |
5EC63B47 |
|
Chapter_8-Trees\69. Tree Terminology.mp4
[7c4f1b1ec9a8e52c]
|
17,590,452 |
F23F3806 |
|
Chapter_8-Trees\70. Defining Binary Tree and Complete Binary Tree.mp4
[1e7ce5db1717bc66]
|
12,454,803 |
4D184CE5 |
|
Chapter_8-Trees\71. Representation of a Binary Tree.mp4
[45dc61785b719c1e]
|
59,410,031 |
32DE440F |
|
Chapter_8-Trees\72. Binary Tree Traversals.mp4
[25705d5acf3a8e76]
|
25,218,623 |
997CAED2 |
|
Chapter_8-Trees\73. How to Implement Inorder Traversal in Python .mp4
[b3301a4d674d10d6]
|
24,228,725 |
60143D68 |
|
Chapter_8-Trees\74. How to Implement Pre-order Traversal in Python .mp4
[2d384856500bf69a]
|
23,201,964 |
0BB17F26 |
|
Chapter_8-Trees\75. How to Implement Post-order Traversal in Python .mp4
[bc95a70d3cff9481]
|
25,842,678 |
39704F0E |
|
Chapter_8-Trees\76. How to Implement Height of a Binary Tree in Python .mp4
[85710436b54acbde]
|
20,762,207 |
D6B443A6 |
|
Chapter_8-Trees\77. Sum of Elements in a Binary Tree.mp4
[e12641bb43971964]
|
57,508,930 |
A0C9645D |
|
Chapter_9-Binary_Search_Trees\78. Definition of BST with Example.mp4
[2cdf35ffdf2804b6]
|
16,589,772 |
08026031 |
|
Chapter_9-Binary_Search_Trees\79. Search operation in BST.mp4
[4ebcabe1261dbd3c]
|
14,972,664 |
9BC149AB |
|
Chapter_9-Binary_Search_Trees\80. Inserting a node in BST.mp4
[49cd540003a6a625]
|
17,618,964 |
13C98118 |
|
Chapter_9-Binary_Search_Trees\81. Creating a BST.mp4
[af9e112599f82e22]
|
16,580,558 |
6902E89A |
|
Chapter_10-Graphs\82. Basics of graphs.mp4
[7b7dd35e90196822]
|
18,857,202 |
89678F75 |
|
Chapter_10-Graphs\83. Adjacency Matrix Representation.mp4
[858ae77ee6bf21a6]
|
35,646,394 |
85A17544 |
|
Chapter_10-Graphs\84. Adjacency List Representation.mp4
[69dd5bbc9cc7155c]
|
12,819,376 |
98F90C8D |
|
Chapter_12-Bonus_Lecture\85. Bonus Lecture.mp4
[3f63d204aa4117a9]
|
60,907,289 |
532E2BB5 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\1. Variables.mp4
[a85630bc2ef8e82]
|
26,347,466 |
A7E8998B |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\10. While loop.mp4
[cd8afec214e56311]
|
34,136,574 |
50B638C7 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\11. While loop to count the digits in a given number.mp4
[b0f6df2290c71571]
|
16,167,996 |
281023F9 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\12. While loop to display multiplication table.mp4
[d0a068f63fc78e3d]
|
18,913,465 |
70DE8BAD |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\13. For loop.mp4
[e15417e205763595]
|
39,276,805 |
DE2B2682 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\14. Displaying numbers using for loop.mp4
[363e782ccfcc7db2]
|
12,739,244 |
C872766A |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\15. Break and Continue statement.mp4
[6ff920c76ff0a2b2]
|
12,840,674 |
30C1691F |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\16. Finding Sum of first 10 numbers.mp4
[54ec71397a1af225]
|
11,924,518 |
074A3558 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\17. Finding Sum of digits in a given number.mp4
[272a9353ee509a5e]
|
17,501,923 |
C77D28C1 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\2. Conditionals & If statement.mp4
[7ca340078d8da7a2]
|
24,948,872 |
1E707333 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\3. If statement example.mp4
[8b69d794f6e3bd83]
|
21,080,676 |
E75FAFC2 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\4. If else statement.mp4
[110736eed026089c]
|
10,463,090 |
69B0875B |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\5. Example for If else statement.mp4
[1a93e4b8feaeb440]
|
13,031,069 |
5F558A77 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\6. Elif Statement.mp4
[e97831e6627a95bd]
|
19,574,537 |
5280F523 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\7. Example for Elif Statement.mp4
[ec176f496a3796cf]
|
15,970,783 |
0101DE12 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\8. Nested if statement.mp4
[538d4c0bb948f63e]
|
19,046,384 |
7E8BD8A3 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics\9. Example for Nested if statement.mp4
[19067dcc1f93d077]
|
25,843,207 |
4E91EB94 |
|
Chapter_2-Arrays_in_Python\18. Definition.mp4
[6611e4d2450c01a9]
|
8,566,692 |
94CFB271 |
|
Chapter_2-Arrays_in_Python\19. Creating and Displaying 1D Arrays.mp4
[e3e5570f2a36389b]
|
8,421,586 |
06BEF00B |
|
Chapter_2-Arrays_in_Python\20. Accessing 1D Arrays.mp4
[697114ef5e358586]
|
8,535,927 |
901260F8 |
|
Chapter_2-Arrays_in_Python\21. Searching in 1D Arrays.mp4
[b0f8a4638a11eea0]
|
3,102,386 |
5A8BFCA1 |
|
Chapter_2-Arrays_in_Python\22. Insertion in 1D Arrays.mp4
[a3d4e305ced92922]
|
13,682,682 |
41709F62 |
|
Chapter_2-Arrays_in_Python\23. Deletion in 1D Arrays.mp4
[1e86eae541ba2f9b]
|
11,762,726 |
CF742D8E |
|
Chapter_2-Arrays_in_Python\24. Updating in 1D Arrays.mp4
[67a077fa451a0dad]
|
8,217,757 |
9759DEE0 |
|
Chapter_2-Arrays_in_Python\25. Accessing 2D Arrays.mp4
[e064f616639e8e5b]
|
11,182,728 |
98E23917 |
|
Chapter_2-Arrays_in_Python\26. Insertion Operation in 2D Arrays.mp4
[118b1d8111aebfd5]
|
13,601,709 |
384C67A0 |
|
Chapter_2-Arrays_in_Python\27. Deletion Operation in 2D Arrays.mp4
[9bce425c3c6663ae]
|
7,296,734 |
213DF528 |
|
Chapter_2-Arrays_in_Python\28. Update Operation in 2D Arrays.mp4
[e584c58049290a7]
|
10,941,778 |
04664AAC |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\29. Accessing Elements & Searching Element in a List.mp4
[af8347dfd34c8744]
|
56,968,740 |
FE8A06F0 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\30. Working with Operators on Lists.mp4
[fb9af10b68fd8f71]
|
20,082,312 |
A6E0E19E |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\31. Indexing and Slicing in Lists.mp4
[85315edb4dd8a725]
|
40,993,543 |
EC50B226 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\32. Working with List Methods.mp4
[bea1ab8c9fa79d92]
|
198,965,443 |
ADC66D64 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\33. List Comprehension.mp4
[8e47391b94437ffa]
|
18,839,102 |
A3D3131F |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\34. Finding Maximum and Minimum Element in a List.mp4
[dc656f2989be3916]
|
28,019,002 |
73ADA201 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\35. Tuples.mp4
[388768a0e05286c8]
|
15,701,797 |
F9378E37 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\36. Tuple Indexing and Slicing.mp4
[e04c693883dca75b]
|
82,380,826 |
68CE69A1 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\37. Manipulating Tuples.mp4
[cfee24f8f5634d81]
|
29,837,997 |
C42B5C61 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\38. Unpacking Tuples.mp4
[f783939135b60b76]
|
5,654,309 |
6C4FFDD7 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\39. Basics of Dictionary.mp4
[a9b47a112ae4a5e6]
|
139,604,114 |
64120BC9 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\40. Accessing dictionary elements.mp4
[e2e0a681ba0d0ab6]
|
46,476,535 |
2BFA3239 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\41. Working with dictionary.mp4
[4a5b258dc76a60ee]
|
27,138,548 |
9CE743F5 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python\42. Understanding Sets in Python.mp4
[939a9a90718cd382]
|
50,819,456 |
89942629 |
|
Chapter_4-Recursion\43. Functions in python.mp4
[29f483b28c987770]
|
34,645,369 |
8F3600FE |
|
Chapter_4-Recursion\44. Example program1 on functions.mp4
[dc17c2d4859dd264]
|
61,072,765 |
BA71837A |
|
Chapter_4-Recursion\45. Example program2 on functions.mp4
[5f2295924dcaeed4]
|
55,331,238 |
98FBBE04 |
|
Chapter_4-Recursion\46. Example program3 on functions.mp4
[a29e42024f61f15d]
|
78,886,840 |
FEA8BDEA |
|
Chapter_4-Recursion\47. Recursion.mp4
[7fed99de713c7397]
|
32,270,606 |
6DCB1D34 |
|
Chapter_5-Linked_Lists\48. Basics of Linked lists.mp4
[3e6b2dc90526afc0]
|
100,262,164 |
2A528DD7 |
|
Chapter_5-Linked_Lists\49. Inserting an Element in a Linked List.mp4
[7f7d604583610883]
|
57,391,384 |
D590BDAE |
|
Chapter_5-Linked_Lists\50. Searching an Element in a Linked List.mp4
[5e3dd81725ba16bf]
|
32,717,598 |
C4A773A0 |
|
Chapter_5-Linked_Lists\51. Finding Middle Element in a Linked List.mp4
[b3e531b19e8ebf7c]
|
35,993,660 |
2BE67F78 |
|
Chapter_5-Linked_Lists\52. Checking whether two given Linked Lists are Identical or not .mp4
[93716b8d3e0af2bd]
|
46,391,420 |
C7D5460C |
|
Chapter_5-Linked_Lists\53. Finding maximum value in a Linked list.mp4
[900f75359a9ca358]
|
88,012,131 |
82FC6A72 |
|
Chapter_5-Linked_Lists\54. Deleting the Linked List.mp4
[bc4c3cea80830d6]
|
47,516,256 |
2DC26DFC |
|
Chapter_6-Stacks\Additional_Files |
0 |
00000000 |
|
Chapter_7-Queues\Additional_Files |
0 |
00000000 |
|
Chapter_6-Stacks |
0 |
00000000 |
|
Chapter_7-Queues |
0 |
00000000 |
|
Chapter_8-Trees |
0 |
00000000 |
|
Chapter_9-Binary_Search_Trees |
0 |
00000000 |
|
Chapter_10-Graphs |
0 |
00000000 |
|
Chapter_12-Bonus_Lecture |
0 |
00000000 |
|
Chapter_1-Bonus_Section_Quick_review_on_Python_Basics |
0 |
00000000 |
|
Chapter_2-Arrays_in_Python |
0 |
00000000 |
|
Chapter_3-Lists_Tuples_Sets_and_Dictionaries_in_Python |
0 |
00000000 |
|
Chapter_4-Recursion |
0 |
00000000 |
|
Chapter_5-Linked_Lists |
0 |
00000000 |
|
| Total size: |
3,080,790,574 |
|
|
