Artificial Intelligence & Data Science 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.

Artificial Intelligence & Data Science

Digital Electronics and Logic Design

Number systems and K-maps, combinational circuits, flip-flops and counters, x86 and ARM, AI processors.

Interview questions

Coming next in Digital Electronics and Logic Design

  1. Number systems and conversions· notes coming
  2. Signed numbers and complements· notes coming
  3. Binary arithmetic· notes coming
  4. K-map minimisation· notes coming
  5. Codes: BCD, Gray and Excess-3· notes coming
  6. Adders and subtractors· notes coming
  7. BCD adder· notes coming
  8. Multiplexers and demultiplexers· notes coming
  9. Magnitude comparator· notes coming
  10. Flip-flops and excitation tables· notes coming
  11. Ring and Johnson counters· notes coming
  12. Synchronous and asynchronous counters· notes coming
  13. Moore and Mealy machines· notes coming
  14. Microprocessors and microcontrollers· notes coming
  15. Intel x86 architecture· notes coming
  16. ARM Cortex architecture· notes coming
  17. GPU-based edge AI: NVIDIA Jetson· notes coming
  18. CPU, GPU, TPU, NPU and VPU· notes coming
  19. Edge AI and cloud AI· notes coming
  20. Heterogeneous computing· notes coming
  21. AI hardware benchmarks· notes coming
  22. Verilog design flow and methodology· notes coming
  23. Simulation, synthesis and test benches· notes coming
  24. Verilog data types and number representation· notes coming
  25. Verilog operators· notes coming
  26. Gate-level modelling and delays· notes coming
  27. Dataflow modelling and continuous assignment· notes coming
  28. Behavioural modelling: initial and always blocks· notes coming
  29. Blocking and non-blocking assignments· notes coming
  30. if–else and case statements· notes coming
  31. Timing control and loop statements in Verilog· notes coming
  32. Procedural continuous assignments: assign–deassign and force–release· notes coming
  33. Synthesis of combinational and sequential logic· notes coming
  34. Moore and Mealy FSMs in Verilog· notes coming
  35. Counters and shift registers in Verilog· notes coming
  36. PLA, PAL and programmable logic devices· notes coming
  37. CPLD and FPGA architecture· notes coming
  38. FPGA design flow· notes coming
  39. Switch-level modelling and user-defined primitives· notes coming
  40. Error-detecting and error-correcting codes· notes coming
  41. Boolean algebra and universal gates· notes coming
  42. SOP and POS forms of logic functions· notes coming
  43. Quine–McCluskey tabular method· notes coming
  44. Decoders and encoders· notes coming
  45. Code converters· notes coming
  46. Hazards in combinational circuits· notes coming
  47. Latches and the SR flip-flop· notes coming
  48. State diagrams, state tables and state reduction· notes coming
  49. Sequence detector design· notes coming
  50. Parity generators and checkers· notes coming
  51. Minimising incompletely specified machines: merger charts· notes coming