Rahul Pareek

Language Used: Java
Design Pattern Used: Strategy pattern, Proxy pattern, Reflection.
Data Structure Used: Vector

Description: Project to implement several pattern.
In this we need to apply design principles as well as Reflection and proxy pattern concept of java.
In this project is to design and build a generic Checkpointing system.
As the output, we are displaying the "Total no of mismatch Objects”, and we are performing Serialization and deserialization of Objects.

Language Used : C
Data Structure Used: FIFO Queue

Description :
- Implemented a Character Device Driver in linux kernel i.e kernel-level pipe for exchanging strings among user-level processes. Maintained concurrency, synchronization, and various kernel primitives.
- classical producer-consumer problem.
- A FIFO queue is maintained.

Language Used: Java
Design Pattern Used: Visitor pattern,MVC.
Data Structure Used: Red-Black Tree, BST

Description: Implemented visitor pattern and other design principle applied.
purpose of this project is to design and build a Word Count system and making this work more time efficient based on the data structure we are using, using visitor design pattern.
As the output, we are displaying the "Total no of words", "most frequently used word", "number of characters(without… Show more

Language Used: Java
Design Pattern Used: Visitor pattern,MVC.
Data Structure Used: Red-Black Tree, BST

Description: Implemented visitor pattern and other design principle applied.
purpose of this project is to design and build a Word Count system and making this work more time efficient based on the data structure we are using, using visitor design pattern.
As the output, we are displaying the "Total no of words", "most frequently used word", "number of characters(without whitespaces)", "and the word based on search string, how many time it occurs". Show less

Language Used: C

Description: Implemented own system call in linux kernel. Experimented it as a bad code. Checked for all loops holes.

Data Structure Used: Array
Language Used: C programming
Description : a linux based mini shell, can perform all operation. All functions are user defined , Signal handling, implement command filters, and many more other functionalities implemented.

Data Structure Used: Graph
Developed web application and hosted on Apache instance running on an EC2 micro instance, used CloudFormation to create, configure and start the components of the solution, used S3 for storing data and hosting the static pages over it. Other technologies used HTML, CSS, JavaScript, Python, Bootstrap, MS SQL Server 2008 with ACM group team members.

Language Used : Java 7
Data Structure Used : Dynamic Array, Queue

Apex 5 stage pipeline simulator with register renaming, data forwarding with ROB, LSQ, IssueQueue Dependencies are handled. Three function units are present in this variation 2 which we have implemented in our project:

• INT FU, FU implements all basic arithmetic operation other than multiply and logical operation as well as branch operation. All are implemented with one stage, single cycle latency. BZ, BNZ use… Show more

Language Used : Java 7
Data Structure Used : Dynamic Array, Queue

Apex 5 stage pipeline simulator with register renaming, data forwarding with ROB, LSQ, IssueQueue Dependencies are handled. Three function units are present in this variation 2 which we have implemented in our project:

• INT FU, FU implements all basic arithmetic operation other than multiply and logical operation as well as branch operation. All are implemented with one stage, single cycle latency. BZ, BNZ use a simple prediction based on the sign of the offset; if the offset is negative the prediction is taken, if it is positive the branch is predicted to be not taken. The sign of the offset is NOT known till the branch instruction has just entered the first decode/rename stage. We have assumed that the target address is available when the sign of the offset is detected. o Even with a correct prediction of taken, there is a 2-cycle bubble. o On incorrect predictions and on executing the BALR and JUMP instructions, the pipeline is flushed and rename table entries altered by the flushed instructions are correctly restored. On correct predictions of taken, the two instructions following the BZ or BNZ are flushed.

o Multiply operation is implemented with latency of 4 cycles. • Memory FU o In this FU we have implemented LOAD and STORE operation. o In this we have implemented as a 3 pipeline stages with single cycle latency per stage. • Project involves the implementation of 3 types of queues: Issue Queue, IQ has 8 entries. We have implemented Queue as data structure for Issue Queue.
ROB, ROB has 16 entries. We have implemented Queue as data structure for this ROB.

• Total 9 architectural registers; R0 to R7 and another register ‘X’ which makes up the Architectural Register file (ARF)
• Total 16 registers is Physical Register File PRF
•Tag based forwarding mechanism is implemented in decode stage
• Implements register renaming in decode stage. Show less

Language Used : C, C++, Java, Javascript
Data Structure Used: Array
Algorithm Used: Backtracking

-Sudoku Solver is a solver for Sudoku of 16 x 16 blocks. Used 4 different languages.
-Created a common driver for all the languages. It run and solve the sudoku efficiently.
-Compare performance of different languages.
-We have to take care about given filled numbers which we can not modified while doing back track.

Language used : Java

A CAN is a P2P distributed infrastructure. The nodes in the infrastructure are spread over a 2-dimensional logical cartesian coordinate space. At any point in time, the coordinate space is dynamically partitioned among all the nodes in the network.

Implementing CAN P2P System in Java.
Implemented functionalities:

1. File insert and retrieve algorithm
2. Routing mechanism
3. Node join and node leave protocol
4. Displaying peer information

Language Used: Java
Data Structure Used: Array

Description: Implemented a Grammar Recognizer using Recursive Descent Parsing.
Check for
- Presence of syntactic errors.
- Presence of multiple rules set for the same non-terminal.
- Presence of non-terminals that have been used within a rule set but haven't been defined in the grammar.
- Presence of non-terminals that have been defined in the grammar but have never been used.

Language Used: ASP.net 3.5 and MS SQL Server 2008 as backend.
Data Structure Used: Array, Binary tree

Developed a Career Guidance and Placement Unit using . Implemented following modules,
- Student and Company registration module where student or company will register themselve and their details are recorded.
- placement exam Schedule module where company will schedule or reschedule exams for student.
- exam module where student will give exam on their scheduled date and… Show more

Language Used: ASP.net 3.5 and MS SQL Server 2008 as backend.
Data Structure Used: Array, Binary tree

Developed a Career Guidance and Placement Unit using . Implemented following modules,
- Student and Company registration module where student or company will register themselve and their details are recorded.
- placement exam Schedule module where company will schedule or reschedule exams for student.
- exam module where student will give exam on their scheduled date and time.
- Student and Company Profile module where details of students and company are seen as well as results of exams given by students and which students are selected by which company are seen here. Show less

Data Structure used: linkedlist(simple, doubly, circular), stack, queue
Language : graphich in C,C++
Descripton: based on user input dynamically generate and show the data in visualized form of data structure as given by user choice.