LAB
EXPERIENCES:
LAB
EXPERIENCES:
· Structured programming with C including recursion; arrays, stacks, strings, queues, lists, trees, sets and graphs; algorithm for tree and graphs traversals, connected component, spanning trees, shortest paths; hashing, sorting and searching algorithm design and analysis techniques, big 'oh' notation, solution of sample recurrence relations”
· Data structures: Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph; Programming Methodology: C programming, Program control (iteration, recursion, Functions), Scope, Binding, Parameter passing, Elementary concepts of Object oriented, Functional and Logic Programming;
· Algorithms for problem solving: Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy, Dynamic Programming, Divide-and-conquer); Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, Linking (static and dynamic)
· Operating Systems: Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.
· Databases: Relational model (ER-model, relational algebra, tuple calculus), Normalization techniques, Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B+ trees), Transactions and concurrency control
· Computer Networks: Implementation of TCP/UDP, IP, RPC protocols.