The Engineer's Academy

The Engineer's Academy  Branch

Latest Updates

Online admission for students is now available at The Engineer's Academy.

Useful links & downloads

  C AND C++

Learn C / C++

C++ is a general-purpose programming language. C++ is regarded as a mid-level language, as it comprises a combination of both high-level and low-level language features. It is a statically typed, free-form, multi-paradigm, usually compiled language supporting procedural programming, data abstraction, object-oriented programming, and generic programming.

Advance Courses

Advance C Programming (Duration: 2 Months)
1. Pointers
2. GCC
3. GDB
4. Splint Overview
5. C for Scientist & Engineers Point of View
6. How to create makefile, Compile your program through makefile
7. DDD Memory Leak Checking
8. Compile with different Options
9. Assignment is based on Modular Approach

Preferred Text Books:

1. Pointers On C By Kenneth A. Reek
2. GCC Complete Reference By Arthur Griffith
3. Debugging with GDB (The GNU source Debugger) By Richard Stallman, Roland Pesch. GNU Press
4. Debugging with GDB (RHEL 3)
5. Splint Manula By Secure Programming Group, University of Virginia
6. C for Scientist & Engineers (Manufacturing Engineering Modular Series) By Robert L. Wood
7. Advance C By Peter D. Hipson
8. DDD Manual
9. Makefile Manual

Learn C / C++ but if you don't know how to use " malloc" or "new" key words, even you don't know about file handling, string mainpulations (not just like strlen, strcat), pointers (single ponters, double pointers, multiple pointers), arrays, passing pointers to a functions or return pointers from the functions just go back and study C language thoroughly. Don't feel void. If you don't know Data Structure very well, you are not the Computer Science (Engineer) or I.T. Engineer.

What is data structure? Why it is useful? Where it is applied?
Sorting & Searching
(Insertion sort, Selection sort, Merging, Merge-sort, Radix sort, bubble sort, Shell sort, Quick sort, Heap sort, Tree search)
1. Arrays - order array and unorder array
2. Linked list - order linked list and unorder linked list.
3. How to compare between order array and order linked list same for unorder linked list and arrays? (In terms of may be nano-seconds.)
4. Doubly linked list
5. Circular linked list.
6. Order linked list with linear search.
7. Order array with binary search.
8. Stack & Queues
9. Recursion
10. Binary Trees
11. B Trees
12. Balanced Binary Search Trees
13. Finger Search Trees
14. Red blak Trees
15. Splay Trees
16. AVL Trees
17. Frequent Pattern Trees (For Data Mining)
18. Trees with minimum Weighted path length
19. Randomized Directory Structures
20. Shortest Path Algorithms
21. Self-organising Array with Transpose Heuristic
22. Self-organising Linked list with Transpose Heuristic
23. Self-organising Array with Move to Front Heuristic
24. Self-organising Linked List with Move to Front Heuristic
25. Comparision between Self-organising Arrays and Linked list.
26. Hashing
27. Graphs ( _ _ _)

MultiDimensional and Spatial Structures
28. Multidimensional Spatial Data Structures
29. Planar Straight line graphs
30. Interval, Segment, Range, and Priority Search Trees
31. Quadtrees and Octrees
32. Binary Space Partitioning Trees
33. R-Trees
34. Manaing Spatio-Temporal Data
35. Kinetic Data Structures
36. Online Dictionary Structures
37. Cuttings
38. Approximate Geometric Queue Structures
39. Geometric and Spatial Data Structures in External Memory

Miscellaneous Data Structures
40. Tries
41. Suffix Trees and Suffix Arrays
42. String Searching
43. Persistent Data Structures
44. PQ Trees, PC Trees, and Planar Graphs
45. Data Structure of Sets
46. Cache-Oblivious Data Structures
47. Dynamic Trees
48. Dynamic Graphs
49. Succint Representation of Data Structures
50. Randomized Graph Data - Structures for Approximation Shortest Path
51. Searching and Priority Queues in o(log n) Time
Data Structures In Languages and Libraries
oncurrent Data Structures (So many things.)
Important:
52. Find algorithm analysis and complexity and used to with it.
53. Algorithms + Data structures = Programs
54. Disk spin-up time and Disk seek time and then time to read the file at ______ Mb/Sec. (i.e., How much time it will take to read from disk to give output to your console) It is a research subject.