Career Connect

Course Brief

The scarcity of local software engineers in Hyderabad is striking.
Research shows universities and colleges in the region graduate roughly 1,00,000 engineers a year, of whom only about 25 percent are likely to be suitable to work in multinationals. There is a glaring employability skills gap between the demand and supply of engineers at current growth rates.
The only way to eliminate this problem is a Career Connect
The Career Connect aims to bridge the gap by providing engineering graduates specialized training; both technical and soft skills to enhance their employability skills.
A new dimension:A personal touch is now being added to this program where students after the courses through our digital learning platform, connect through a traditional environment as well. We call it ‘The Social Classroom’. The idea of Social Classroom is to share avenues which provide a great platform for the exchange of knowledge and ideas not only between teachers and students but also among students themselves.

Note: If you wish to join the course, Register for the online test to qualify. Test consists of simple questions in C, OS, Aptitude and Logical Ability

    Background, C Programs, Identifiers, Types, Variables, Constants, Input / Output, Operators(Arithmetic, relational, logical, bitwise etc.), Type conversions.

    Learning Outcomes:

    • Identify the structure of C
    • How data is stored
    • How to operate on data
    • How to input and output data

    if and switch statements, Repetition statements ( loops)-while, for, do-while statements, Loop examples, other statements related to looping – break, continue.

    Learning Outcomes:

    • How to control sequence of execution of instructions.
    • To be able to use various looping statements
    • When and how to use break, continue

    Designing Structured Programs, Functions, user defined functions, inter function communication, Standard functions, Scope.

    Learning Outcomes:

    • Understand the basic structure of C function
    • Implement modular approach in C programming.
    • Reusability of functions.

    Recursive functions, Limitations of recursion, example C programs, Preprocessor commands.

    Learning Outcomes:

    • Understand Recursive functions and its Limitations.

    Concepts, using arrays in C, inter function communication, array applications, two – dimensional arrays, multidimensional arrays, C program examples.

    Learning Outcomes:

    • Array as data type for storing large data.
    • Working with two dimensional and multi dimensional arrays

    Concepts, C Strings, String Input / Output functions, arrays of strings, string manipulation functions, string / data conversion, C program examples.

    Learning Outcomes:

    • Working with String manipulations
    • Understand String conversions

    Declaration, initialization, accessing structures, operations on structures, Complex structures,  structures and functions, Passing structures through pointers.

    Learning Outcomes:

    • Why structures
    • Structure declaration and its use
    • How to access structure elements
    • Array of structures.

    Sorting- selection sort, bubble sort, Searching-linear and binary search methods. Command –line arguments, Input and Output.

    Learning Outcomes:

    • Learn to implement various searching and sorting methods like selection sort, bubble sort etc
    • How to use command line arguments.

    Concept of a file, streams,  text files  and binary files, Differences between text and binary files, State of a file, Opening and Closing files, file input / output functions (standard library  input / output functions for files), file status functions (error handling),Positioning functions, C program examples.

    Learning Outcomes:

    •  Understand file operations.
    • Implement various file functions

Mr.Umesh Gogte

Col Umesh B Gogte belongs to the Army Education Corps. As a computer software trainer,he has 22 years of rich experience as instructor to the officer cadre of The Indian Army. Since 1984,he has served and taught at some of the most prestigious institutions like Indian Military Academy, Electrical & Mechanical Engineering School, and The National Defence Academy.

A faculty with the CSE Dept of The Keshav Memorial Institute of Technology (KMIT) since the year 2007, he takes up curriculum subjects like C, Data Structure through C and Java Programming.

Being a corporate trainer Col Gogte also imparts coaching in industry oriented subjects like C#, Objective C, iPhone OS, Python, HTML5, CSS3, ASP & ADO Dot Net, MS SQL Server, MySql, Sqlite3 and Data Science.

Col Umesh Gogte is a compulsive self-learner whose passion for knowledge is transferred to the learner through his style of teaching.

    Time and Space Complexity analysis, Rate of Growth, Asymptotic Notation: Big-Oh, Omega, Theta, Little-oh notations, Recurrence Relations, Derivation of Time and Space Complexity for example programs.

    Learning Outcomes:

    • Understand the need for performance improvements in Algorithm
    • Measurement of time and space complexities of Algorithms

    Divide and Conquer method description, Applications of Divide and Conquer method using Tessellator programs: Binary search, Quick sort, Merge sort.

    Learning Outcomes:

    • Understand the Divide, Conquer and Combine steps
    • Apply the method to Binary search, Quick Sort, Merge sort applications using Tessellator programs

    Recursive and Non-Recursive Binary-Tree traversal algorithms using Tessellator programs. Graph Traversals: Breadth first search and Depth first search using Tessellator programs. Spanning Trees.

    Learning Outcomes:

    • Understand Recursive and non-Recursive tree traversal algorithms and apply using Tessellator programs
    • Understand and implement BFS, DFS traversals using Tessellator programs
    • Understand concept of Spanning Tree

    Greedy Method Description, Job-Sequencing with Deadlines using Tessellator Program, Minimum Cost Spanning Trees: Prim's Algorithm and Kruskal's Algorithm using Tessellator programs.

    Learning Outcomes:

    • Understand the popular and simplest approach to solving optimization problems using Greedy Method
    • Implement the method to find Minimum Spanning Trees

    Limitations of Greedy method, Description of Dynamic programming, 0/1 Knapsack Problem using Tesselator program, Concepts of Traveling sales person problem, Optimal Binary Search trees.

    Learning Outcomes:

    • Understand the setting up of Recurrence Relation and apply it for solution using Dynamic Programming
    • Apply the method to famous and well-known applications

    Description of the Branch and Bound method, 0/1 Knapsack problem using Branch and Bound.

    Learning Outcomes:

    • Understand the Branch and Bound Technique, State-space tree
    • Apply the techniques to solving the 0/1 Knapsack problem

    Deterministic, Non-Deterministic Algorithms , P, NP, NP-Hard, NP-Complete problems.

    Learning Outcomes:

    • Understand the concepts of P,NP, NP-Hard, NP-Complete problems

    Case-studies, Examples on Performance analysis and improvements for Algorithms and Data-Structures ,Floyd's cycle detection algorithm ,Concept of Deadlock and Banker's algorithm ,TCP/IP, Routing protocols, Public Key Infrastructure (PKI) ,Develop sample Assembly-level and Machine-level programs ,Test Automation concepts ,Linux Programming Concepts ,Derive the core software building block modules of a real-time application such as Vehicle-challan system, Portal for Doctors-Patients.

    Learning Outcomes:

    • Apply the course knowledge to solving Case-studies and examples on performance improvements
    • Review few popular concepts on cycle detection, Deadlocks,
    • Routing, PKI, Assembly+Machine language program, Test Automation, Linux
    • Apply the learnings to derive software modules for real-time applications


After more than 20 years of fulfiling experience in the Software industry, Mr. K.R.Rao has now been working with various Engineering Colleges as a Computer Science faculty for well over 6 years.

He has worked with prestigious Software companies such as Tata Unisys Ltd., CMC Ltd, Patni Computer Systems, Satyam Computers, to name a few.

Through hard work and dedication, Mr. Rao has risen through the ranks from a Software Engineer to a Project Manager.

As part of his work, he has had the privilege to visit several countries such as U.S.A., Europe, Malaysia & Australia.

He has commendable contribution at various stages of software life cycle such as Feasibility Analysis, Requirements, Software Design, Software Development, Test Automation, Performance Improvements, Software Maintenance, Effort estimation and Project Management.

As faculty at KMIT, Mr. Rao teaches various subjects in Computer Science.

He has trained and inspired a number of students at The K.M.I.T. to confidently face Technical interviews for placements through K.M.I.T.'s Finishing school.

    Introduction to DBMS, What is a Database, What is Management System, Different views of data, Advantages and disadvantages of RDBMS,Introduction to SQL,Sub language of SQL (DDL, DML, DQL/DRL, TCL & DCL).

    Learning Outcomes:

    • Understand the RDBMS concepts and to get an understanding of SQL at high level

    What is a database table?, How do we create tables?, How do we insert Data?, How to retrieve/select data?, How do we delete data?, How do we update data?

    Learning Outcomes:

    • Basic SQL related to creating, inserting, deleting and updating data

    Logical operators, Between operators, In operator, Pattern matching operators.

    Learning Outcomes:

    • Different SQL operators and their usage

    Detailed coverage of DDL (Data definition language):CREATE, ALTER, DROP, TRUNCATE, RENAME.

    Learning Outcomes:

    • Understand the different DDL statements

    MySql Functions, Aggregate functions,Scalar functions (String functions, date related, numeric related, conversion function, null related functions.),Group by, order by, having clause.

    Learning Outcomes:

    • Understand the aggregate functions and group by/order by and having clause as part of SQL

    Inner Join, Left Join, Right join and full join.

    Learning Outcomes:

    • Understanding Joins in SQL

    Triggers, Procedures, Functions, Views and ACID properties.

    Learning Outcomes:

    • Understand how to create stored procedures, triggers, functions, views and ACID properties

    Normalization (1NF, 2NF, 3NF & BCNF).

    Learning Outcomes:

    • Role of Normalization for good RDBMS design

Ms. Jyothi SanjeevaMani

Ms. Jyothi SanjeevaMani has over 15 years of satisfying teaching and technical training experience. She is a Research Scholar of Big Data Analytics from a reputed university. As a technical trainer she trained many students in industry oriented subjects like C, C++, Java, MySQL, Oracle (SQL, PL/SQL), Python, Linux, Openstack, BigData - Hadoop(MapReduce, Pig, Hive, Sqoop, Flume), Data Science with both Python and R.

She is an Asst.Professor with the Department of IT at The Keshav Memorial Institute of Technology (KMIT).

She is a dedicated, resourceful and a result oriented instructor, who strives to help students change marginal grades into good grades.

    Java Language features (quick overview). Object oriented programming. Creating Java Program (source file declaration, compilation, execution). Class access modifiers. What is an interface? Abstract class? Local, static, final variables?

    Learning Outcomes:

    • Understand how to build Java applications and high level overview of the Java language features

    Object Orientation in more detail. Constructors. Data Encapsulation. Inheritance. Is-a, has-a. Polymorphism. Overriding/Overloading. Creating interfaces and their concrete classes. Static variables and methods. Coupling and cohesion.

    Learning Outcomes:

    • Declare Interfaces. Declare, Initialize, and Use Class Members. Use Overloading and Overriding. Develop Constructors. Describe Encapsulation, Coupling, and Cohesion.Use Polymorphism. Relate Modifiers and Inheritance. Use Superclass Constructors and Overloaded Constructors. Use IS-A and HAS-A Relationships

    Passing variables into methods. Array declaration, Construction and Initialization. Boxing and unboxing. Using wrapper classes. Garbage collection.

    Learning Outcomes:

    • Use Class Members. Develop Wrapper Code & Autoboxing Code. Determine the Effects of Passing Variables into Methods. Recognize when Objects Become Eligible for Garbage Collection

    Assignment, Relational, Instanceof, arithmetic, conditional and logical operators.

    Learning Outcomes:

    • To learn and apply the different types of operators supported in Java like arithmetic, conditional, relational etc

    Flow control (if, switch, labeled statements, while, for, do etc). Exceptions and its related keywords. Handling exceptions. Exception Hierarchy, Assertions (enabling and disabling assertions).

    Learning Outcomes:

    • Use if and switch Statements. Develop for, do, and while Loops. Use break and continue Statements. Develop Code with Assertions. Use try, catch, and finally Statements. State the Effects of Exceptions. Recognize Common Exceptions

    Collections overview. Object class methods (equal, hashcode etc). Different types of collections and their usage. Generic types. Polymorphism and Generics etc.

    Learning Outcomes:

    • Design Using Collections. Override equals() and hashCode(). Distinguish == and equals(). Use Generic Versions of Collections Including Set, List, and Map. Use Type Parameters, Write Generics methods. Use java.util to Sort and Search. Use Comparable and Comparator

    Inner classes, Method local inner classes, Anonymous Inner classes, Static nested classes.

    Learning Outcomes:

    • Using Inner Classes. Method-Local Inner Classes. Anonymous Inner Classes. Static Nested Classes

    Defining, Instantiating, and Starting Threads. Thread States and Transitions Synchronizing Threads. Interthread communication.

    Learning Outcomes:

    • Threading concept, Start New Threads, Recognize Thread States and Transitions. Use Object Locking to Avoid Concurrent Access. Write Code that Uses wait(), notify(), or notifyAll()

    Using the Javac and Java commands. Static imports. How to create JAR files.

    Learning Outcomes:

    • How to use Packages and Imports. Determine Runtime Behavior for Classes and Command-Lines. Use Classes in JAR Files Use Classpaths to Compile Code.

    Purpose of web application development. Various elements of web applications.

    Learning Outcomes:

    • Introduction to web application development.
    • Developing dynamic web applications using Servlet's

    Introduction to Hibernate,Hibernate Architecture.

    Learning Outcomes:

    • Object Persistence,Working with Persistent Objects.
    • Persistent Classes
    • Components,Associations
    • Transactions and Concurrency,HQL,Cache

    Overview of Spring3 modules,AspectOrientedProgramming.

    Learning Outcomes:

    • Dependency Injection /Inversion of control IOC Containers.
    • Spring 3 Expression Language(SpEL)
    • Annotation Driven Configuration in Depth
    • Spring Web MVC Annotation driven
    • Spring JDBC,Object Relational Mapping Intergration,Spring Transaction (TX) Management

    Struts 2 - Overview,Architecture.

    Learning Outcomes:

    • Introduction to Ajax.
    • Presentation with Struts Tags
    • Application Development with Struts 2
    • Action,Results,Interceptors

    Understand the advantages of the REST architecture for web services,Developing REST Full Web services using JAX-RS.

    Learning Outcomes:

    • Manage XML content using XML Schema and JAXB
    • Understanding Resources
    • Using Http Methods to represent CRUD operations

    Defining SOAP Messages with WSDL,Role of SOAP in Web services Anatomy of a WSDL document.

    Learning Outcomes:

    • Simple Web Services,Apache Axis2 Web Service Clients
    • Apache Axis2 Web Service End-points
    • Exposing Plain Old Java Objects (POJOs) as Web Services Implementing code-first Web services
    • Implementing Web Service Clients in Java Generating client code from WSDL

Mr. Younus

Prof. Mohammed Younus Shariff has over 10 years of satisfying training experience. His style of teaching leaves the students asking for more. Many a student has benefitted from interaction with him.

He is an Asst.Professor with the Department of Computer Science at The Keshav Memorial Institute of Technology (KMIT)

Prof. Shariff teaches Java,Python, Data Science with python, HTML5 , CSS3 and Android Programming.

  • Are there any pre requisites for this course?

    No. There are no prerequisites for this course.

  • Are there any eligibility criteria for joining Finishing School?

    60% & above in Engineering. (CSE, IT & ECE)

  • Can I just enroll in a single course? I'm not interested in the entire specialization.

    No you cannot enroll for individual skill sets within a defined course on Inferdata.

  • How long does it take to complete this Course?

    Most learners are able to complete the course in about 4 months.

  • Do I need to take the courses in a specific order?

    We recommend taking the courses in the order presented, as each subsequent course will build on material from previous courses.

  • What will I be able to do upon completing this specialization?

    Upon completion of the Finishing School program you will be a skilled professional ready to face interviews and land a deserving job.

  • Can I attend a demo session?

    We have limited number of participants in a live session to maintain the Quality Standards, hence, participation in a live class without enrollment is not possible. However, we can create a demo login for one demo session.

  • What are the payment options?

    You can pay by Credit Card, Debit Card or Net Banking from all the leading banks. We use a Payment Gateway. 

  • Do you provide placement assistance?

    Inferdata is associated with Keshav Memorial Institute of Technology, (KMIT) one among the top performing colleges in Hyderabad. Hence a number of recruitment firms contact us from time to time for our student’s profiles. Since there is a demand for skilled candidates, we help our certified students get connected to prospective employers. Please note that we don't guarantee any placements however we prepare you for the Industry. If you go through the course diligently and complete the assignments and exercises you will have a very good chance of getting a job.

  • What kind of placement assistance is provided for the Finishing School students?

    After having successfully completed all the courses in Finishing School your details will be shared with potential recruiters. Inferdata is powered by KMIT and with 30+ companies visiting KMIT for placements every year the deserving students will get jobs.

  • What kind of package can I expect from placements?

    Expected Package: 2 to 3 lakhs per annum

  • What is the typical batch size of a course?

    We expect around 200 students to be part of the course


  • 5 technical courses – 200 hrs.
  • Daily exercises, assignments and problem solving techniques
  • Performance evaluation and feedback
  • Preparation for International Certifications
  • Aptitude & Soft Skills – 40 hrs
  • Placement assistance

Duration: 4 Months

Expected Package: 2 to 3 lakhs per annum

Batch Size: 200

Eligibility: 60% & above (CSE, IT and ECE)

Timing: 7PM to 9PM

SubjectsStarts onDuration
C1st July3 Weeks
Data Structures18th July3 Weeks
MySQL1st August4 Weeks
Java15th Aug10 Weeks
DAA1st Oct3 Weeks
Aptitude15th Aug8 Weeks
Soft skills1st Sept4 Weeks

Login to your Inferdata account!

Sign up and start learning!


By signing up, you agree to our Terms of Use and Privacy Policy.

Already have an account? Login

Forgot Password?

Lost your password? Please enter your email address. You will receive a link to create a new password.

Error message here!

or Back to login