Electronics & Telecommunication (University) is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Electronics & Telecommunication (University)

Data Structures and Algorithms

Complexity, searching and sorting, stacks and queues, linked lists in C, trees and graphs.

Interview questions
Notes for Data Structures and Algorithms are being written and reviewed. Until they're up, Aria teaches every topic — ask for any part of the syllabus, with worked numericals.

Coming next in Data Structures and Algorithms

  1. Data structures and abstract data types· notes coming
  2. Time and space complexity, asymptotic notation· notes coming
  3. Linear and binary search· notes coming
  4. Bubble, selection and insertion sort· notes coming
  5. Stack and its array implementation· notes coming
  6. Infix to postfix conversion· notes coming
  7. Postfix expression evaluation· notes coming
  8. Queue and its array implementation· notes coming
  9. Circular queue· notes coming
  10. Priority queue and applications of queues· notes coming
  11. Pointers and dynamic memory allocation· notes coming
  12. Singly linked list operations· notes coming
  13. Doubly and circular linked lists· notes coming
  14. Stack and queue using linked lists· notes coming
  15. Polynomial representation and addition with linked lists· notes coming
  16. Tree terminology and binary trees· notes coming
  17. Binary tree representation and traversals· notes coming
  18. Binary search tree operations· notes coming
  19. AVL trees and rotations· notes coming
  20. Graph terminology and representation· notes coming
  21. BFS and DFS traversal· notes coming
  22. Minimum spanning tree: Kruskal's algorithm· notes coming
  23. Minimum spanning tree: Prim's algorithm· notes coming
  24. Dijkstra's shortest path algorithm· notes coming
  25. Threaded binary trees· notes coming
  26. B-trees and B+ trees· notes coming
  27. Quick sort and merge sort· notes coming
  28. Heap sort· notes coming
  29. Hashing and collision resolution· notes coming
  30. Arrays and their storage representation· notes coming