Sno. | Project title | Report | Present. date | Team members |
1 | Binary search using 8085 A. lang. | Recvd. | 22-Nov | UG201010015 |
2 | Arbitray precision calculator | Recvd. | 22-Nov | UG201010011, UG201010012 |
3 | Matrix Multil. in 8085 Assembly lang. | Recvd. | 22-Nov | UG201010009, UG201010018 |
4 | Quick-sort using 8085 Assembly lang. | Recvd. | 22-Nov | UG201010014, UG201010044 |
5 | Modern traffic control | Recvd. | 22-Nov | UG201010028, UG201010041 |
6 | Interpreter for Assembly lang. | Recvd. | 22-Nov | UG201010007, UG201010030 |
7 | Stack machine to compute postfix | Recvd. | 22-Nov | UG201010033, UG201010034 |
8 | Simulation of general cache memory sys. | Recvd. | 22-Nov | UG201010035, UG201010037 |
9 | Interpreter for Assembly lang written in C | Recvd. | 22-Nov | UG201010042, UG201010043 |
10 | Stack M/C (zer addr.) to simulate a. lang. | Recvd. | 22-Nov | UG201010032, UG201010025 |
11 | Architecture for parity check | Recvd. | 22-Nov | UG201010031, UG201010019 |
12 | Case study of mobile processor | Recvd. | 22-Nov | UG201010010 |
13 | Implement matrix mult. | Recvd. | 23-Nov | UG201010023, UG201010027 |
14 | Arbitray precision arithmetic | Recvd. | 23-Nov | UG201010038, UG201010005 |
15 | Quantum computers | Recvd. | 23-Nov | UG201010013, UG201010026 |
16 | Quantum Computers | Recvd. | 23-Nov | UG201010003 |
17 | Computer keybd as piano | Recvd. | 23-Nov | UG201010016, UG201010029 |
18 | Inter preter in for A. lang. | Recvd. | 23-Nov | UG201010036, UG201010020 |
19 | PID controller | Recvd. | 23-Nov | UG201010001, UG201010002 |
20 | Quick sort | Recvd. | 23-Nov | UG201010008 |
21 | Simulation of general cache | Recvd. | 23-Nov | UG201010004, UG201010017 |
22 | Architecture for parity checking | Recvd. | 23-Nov | UG201010006, UG201010021 |
23 | Interpreter in C++/Java | Recvd. | 23-Nov | UG201010022, UG201010024 |
24 | Simulation of modern traffic control sys. | Recvd. | 23-Nov | UG201010039, UG201010040 |
Note: Time for each team 5 minutes (max), highlight only main points in 3-5 slides. The report can be submitted latest by 23-Nov.(1.00 PM). The presentations can be stored on one laptop, and team members of each project will jointly present. The presentation order can be your own also, provided minimum 12 presentations are completed on 22nd Nov.