By Tamim Shahriar Subeen Pdf: Computer Programming 2nd Part

Tamim Shahriar Subeen is celebrated for his lucid and accessible Bengali writing style.

4.1 Concept of recursion
4.2 Base case and recursive case
4.3 Tracing recursive calls
4.4 Recursion vs iteration
4.5 Classic examples: factorial, Fibonacci, GCD
4.6 Recursive string reversal
4.7 Tower of Hanoi
4.8 Backtracking introduction (N-Queens basics) Computer Programming 2nd Part By Tamim Shahriar Subeen Pdf

12.1 Reading problem statements carefully
12.2 Choosing the right data structure
12.3 Writing modular code for competitive programming
12.4 Debugging techniques
12.5 Sample solved problems (from beginner to intermediate level) Tamim Shahriar Subeen is celebrated for his lucid

2.1 Understanding memory addresses
2.2 Pointer declaration and dereferencing
2.3 Pointer arithmetic
2.4 Pointers and arrays
2.5 Pointers and strings
2.6 Dynamic memory allocation (malloc, calloc, realloc, free)
2.7 Common dynamic memory errors
2.8 Array of pointers & pointer to pointer Computer Programming 2nd Part By Tamim Shahriar Subeen Pdf

9.1 Linear search
9.2 Binary search (iterative & recursive)
9.3 Bubble sort, selection sort, insertion sort
9.4 Merge sort (divide & conquer)
9.5 Quick sort (partition & recursion)
9.6 Counting sort (for limited range)
9.7 Comparing algorithm complexities (Big-O basics)