BISHAL LAMA


                                            RESUME

Personal Details

Born                             April 3, 1987                                                                                                 Contact No.                  +91-97329-32467 (Mobile)                                                                                Contact Address            B-115, LLR Hall of Residence, IIT Kharagpur, Kharagpur, W.B.-721302.
E-mail                                   bslama4@gmail.com

What I Bring ABOUT With Myself

  • High motivation levels and perseverance.
  • Capacity to work hard 
  • Strong academic background
  • Demonstrated leadership skills
  • Strong communication and interpersonal skills
 

education

Year

Institute

Degree

Score

Currently

Indian Institute of Technology, Kharagpur

Bachelor of Technology

 (2nd Year)

7.15

(CGPA)

2003-2005

St. Robert’s School, Darjeeling

Class XII: State Board 

67%

1997-2003

St. Robert’s School, Darjeeling

Class X: State Board

78.9%

 

 

Academic Achievements

· 

·      #   Secured highest in District in 10th Board Examination.

·      #  Secured highest in school in 12th Board Examination.

 

Extra-Academic Achievements

·        #  Regular team member of the Institute Football Team.

·        #  Won silver medal at the Inter-IIT Sports Meet 2006.

·        # Secretary of the Technology Students’ Gymkhana at IIT Kharagpur.

·         # Completed a Project on “Sustainable Agriculture” at St. Robert’s School for the National Children Science   Congress of which I was the Project Leader.

·         # Prefect at St. Robert’s High School.

       

COURSES TAKEN

              DEPARTMENTAL                                OTHER DEPARTMENT

 

§         Programming and Data Structure*

§         Discrete Structures

§         Switching Circuits and Logic  Design*(+)

§         Design and Analysis of Algorithms*

§         Formal Languages & Automata  Theory(+)        

§         Software Engineering*(+)

 

 

§           Signals and Networks*

§           Basic Electronics*

§           Electrical Technology*

§           Engineering Drawing and       

       Graphics*

§           Mathematics- I and II

§           Probability and Statistics(+)

§           Physics*

§           Chemistry*

§           English for Communication

§           Mechanics

§           Contract (From the School of Intellectual Property Law)

 

*          Indicates laboratory component

+       To be undertaken before summer 2008

 

PROGRAMMING EXPERIENCE


§         Designed and implemented various algorithms related to graphs including Kruskal’s and Prim’s Algorithm for growth of minimum spanning trees, Bellman-Ford algorithm and Dijkstra’s algorithm for single-source shortest paths, Floyd-Warshall algorithm for all-pairs shortest paths and Ford-Fulkerson algorithm for network flows.

 

§         Designed and implemented an algorithm which could multiply sparse matrices with running time O(m.n^2) where m and n are the number of non-zero entries of Matrices B and A while finding the product AB

 

§         Designed and Implemented a depth-first branch and bound algorithm for the Travelling                        Salesperson problem using the minimum cost spanning tree heuristic as the bounding function.

  

      §        Designed and implemented an algorithm for multiplying two n-digit numbers by an                     efficient Θ(n1.59) algorithm that breaks problem into 3 multiplications of two n/2-bit                        numbers and uses Θ(n) additions and shifts.

 

       §        Designed and implemented an efficient O(n) algorithm to find a median and use it as pivot                for Quicksort.

       SKILLS                                                                                                                                 

 

§         Worked on Windows, UNIX, Linux, and Solaris systems.

§         Knowledge of C, C++, Java, HTML.

§         Knowledge of softwares such as AutoCAD, Adobe Photoshop, MS Office.

 

Sign in  |  Recent Site Activity  |  Terms  |  Report Abuse  |  Print page  |  Powered by Google Sites