Storage structures and memory allocations. Primitive data structures. Data abstraction and Abstract Data Types.  Array and  record structures. Sorting algorithms and quick sort. Linear & binary search. Complexity of algorithms. String processing. Stacks & queues; stack operations, implementation of recursion, polish notation and arithmetic expressions. Queues and their implementations. Dequeues & priority queues. Linked storage representation and linked-lists. Doubly linked lists and circular lists. Binary trees. Tree traversal algorithms. Tree searching. General trees. Graphs; terminology, Operation on graphs and traversing algorithms. (Prerequisite: EENG112)

Circuit variables and circuit elements. Some circuit simplification techniques. Techniques of circuit analysis. The operational amplifiers. The natural and step response of RL and RC circuits. Natural and step responses of RLC circuits. Sinusoidal steady-state analysis. Introduction to the Laplace Transform. The Laplace Transform in circuit analysis.

Number systems, arithmetic operations, decimal codes, alphanumeric codes, Boolean algebra, Karnaugh maps, NAND and NOR gates, exclusive-OR gates, integrated circuits, combinational circuits, decoders, encoders, multiplexers, adders, subtractors , multipliers, sequential circuits, latches, flip-flops, sequential circuits analysis, registers, counters, RAM and ROM memories, programmable logic technologies (PLA, PLD, CPLD, FPGA).