Hanging Heart
Materials required:
* Tracing Paper
* Pencil
* Salt dough
* Roller
* Rolling Pin
* Craft knife
* Acrylic or fabric paint
* Paintbrushes
* Gold paperclips
* Polyurethane matt varnish
* Glue
Procedure to make heart:
First prepare the salt dough to make the decoration. Mix together 2 cups of flour and 1 cup of salt. Add 1 cup of water gradually to the mixture until it is stiff but not sticky. Knead the dough for about ten minutes until it is smooth and manageable.
Roll the dough out on a roller or a flat surface with a rolling pin in 1cm thickness.
Draw or trace out a heart shaped design. Place the design over the rolled dough and mark the squares with a needle or a pin. Then cut out the heart carefully from the rolled dough. Smoothen and round the edges with a moistened finger. Alternatively you can cut out the design from the rolled dough on your own, with a knife without the help of the design
With a knife carefully deepen the lines of the squares without going too deep so that the squares are not cut off. You can either fill the heart with squares or leave both sides free as in the figure.
Cut a paperclip in half and insert into the top of the heart. Make as many hearts as you need. Allow to dry thoroughly for a few days OR Bake in a warm oven at 120o C/250oF for a short time, but take care not to cook them or they will yellow.
Paint with acrylic emulsion (latex), then paint in the colour of your choice, leaving alternate squares plain. Allow to dry. Apply five coats of varnish. Thread some ribbon through the loop made by the paper clip and tie in a bow. You can hang your hearts from the wall.

BASIC MATHEMATICS:Elements of probability, matrix algebra, numerical methods: interpolation, root finding, differentiation and integration. Discrete mathematics: sets, relations, functions, mathematical induction, counting, groups, graphs, partial orders, lattices and boolean algebra, propostional logic.
THEORY OF COMPUTATION:Regular and context free languages, finite state machines and push down automata, turing machines and undecidability.
COMPUTER HARDWARE:Logic function, minimization techniques, design of combinational and sequential circuits using gates and flip-flops, design with integrated circuts incuding ROM and multiplexers, microprocessor architecture: programming, interfacing with memory and I/O devices(modes of data transfer and their implementation, serial and parallel communication interface). Detailed knowledge of 8085 microprocessor will be assumed.
COMPUTER ORGANIZATION:Number representation and airthmetic, functional organization, machine instructions and addressing modes, ALU, hardwired and microprogrammed control, instrucation pipelining, memory organization, input/output.
PROGRAMMING AND DATA STRUCTURE:structured programmming with pascal/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.
LANGUAGE PROCESSOR:Assembler, loader, linker, macroprocessors, text editors, programming languages, scope rules and parameter passing mechanism; compilers lexical analysis, parsing, syntax, directed translation, run time environment, machine code generation; interpreters.
OPERATING SYSTEM:Batch, multi-programming and time-sharing systems; processsor, memory, device and file management, virtual memory, process scheduling, interprocess communication, process synchoronization and concurrency, deadlocks, protection.
DATABASE SYSTEM:File organization techniques; indexing,B-trees, B-plus trees; relational and network datat models; normal forms; query language: SQL.