Formal languages. Grammars and the Chomsky hierarchy. Regular expressions. Finite state machines (FSM): Mealy and Moore models. Machine congruence and reduction of states. Deterministic and non deterministic automata. Push down automata and context-free grammars. Turing machines and computability.
Reference link: BLG311E
Introduction, Secondary Storage Devices, Asymptotic Analysis; Recurrences, classwork; Sorting, merge sort, heap sort; Dictionaries, hashing, classwork; Binary search trees, 2-3 trees, 2-3-4 trees, red and black trees; B-trees; Other balanced trees: AVL, Splay, Tries; Binomial heaps; Fibonacci heaps; Sorting Networks; String-matching algorithms.
Reference link: BLG381E
In order to implement the fundamental concepts taught in microprocessor course, following lab experiments are included: - Introduction of microprocessor experiment kit - Example programs - Introduction to basic components in ITU-Egit operating system - Procedures and stack operations - Introduction to Freescale experiment kits - Asyncronous communication interface - Parallel communication interface - Real time circuits - Interrupt applications.
Reference link: BLG51E
Database concepts. Relational model, relational algebra, queries. Application development. Database design, normalization, entity-relationship model. Concurrency, transactions, locking. Object-oriented databases, object/relational mapping, XML data model and queries.
Reference link: BLG361E