COMPUTER SCIENCE AND APPLICATION (Syllabus for interview/test for admission to PhD programme in Computer Science) Computer Architecture: representation of numbers; Octal, Hexadecimal, and Binary 2’s complement and 1’s complement arithmetic, Floating point representation. Combinational Circuit Design, Sequential Circuit Design, Hardware and Microprogrammed processor design, Instruction formats, Addressing modes, Memory types and organisation, interfacing peripheral devices, Interrupts. Data Structures & Algorithms: Arrays, stacks, queues, lists, linked, trees, graphs priority queues, heaps, Binary tree, AVL tree, B-tree and Hash tables. Graphs : connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning tree of a graph, Eccentricity of a vertex, radius and diameter of a graph. Hamiltonian, Eulerian graphs and Planar graphs. Sorting and Searching Algorithms, Binary Search, Analysis of Algorithms, Asymptotic notation...
Comments
Post a Comment