Skip to main content

MCS-021 Assignment Questions July 2012

Question 1:
Write an algorithm for multiplication of two sparse matrices using Linked Lists.

Question 2:
Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.

Question 3:
Write a note of not more than 5 pages summarizing the latest research in the area of “Shortest Path Algorithms” for graphs. Refer to various journals and other online resources.

Question 4:
What are the applications of Red-Black Trees.
Labels:

Comments

Post a Comment

Popular posts from this blog

IGNOU Syllabus for interview/test for admission to PhD programme in Computer Science

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...
Post a Comment
Read more