Chawan Vinod CMR Engineering College 21, Male |
Class | Board | Marks |
B. Tech., Computer Science Engineering | CMR Engineering College | 70.00 |
12th | State Board of Technical Education and Training | 80.00 |
10th | Telangana Board of Secondary Education | 87.00 |
Programming Languages | C, Java, Javascript, PHP, Python, HTML, XML |
Database | MySQL |
Operating Systems | Windows 10, Windows 3.1, Windows 95/98/Me, Windows NT/2000/2003/2008, Windows XP/Vista/7, MacOS |
Certifications | CCNA |
Software | Visual Studio, Python IDE, Photoshop, AUTOCAD, MS Word, MS Excel, MS PowerPoint |
Other Skills | Apache Administrator, Database administrator, Cloud Computing, ML, AI, Web development |
Data leakage detection - U.Mahender (CMR ENGINEERING COLLEGE) | May, 2023 - Jan, 2024 |
A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the data are leaked and found in an unauthorized place (e.g., on the web or somebody's laptop). The distributor must assess the likelihood that the leaked data came from one or more agents, as opposed to having been independently gathered by other means. We propose data allocation strategies (across the agents) that improve the probability of identifying leakages. | |
Object Detection - T Neha (CMR ENGINEERING COLLEGE) | Apr, 2023 - May, 2023 |
Basically, object detection is a modern computer technology that is related to image processing, deep learning and computer vision to detect the objects present in an image file. All the technologies used in the Object detection technique (as we mentioned earlier) deals with detecting instances of the object in the image | |
Sorting visualizer algorithm - Mr. S. Kiran Kumar (CMR ENGINEERING COLLEGE) | Nov, 2022 - Dec, 2022 |
Bubble Sort is an iterative sorting algorithm that imitates the movement of bubbles in sparkling water. The bubbles represents the elements of the data structure. The bigger bubbles reach the top faster than smaller bubbles, and this algorithm works in the same way. It iterates through the data structure and for each cycle compares the current element with the next one, swapping them if they are in the wrong order. |
|