Background, C Programs, Identifiers, Types, Variables, Constants, Input / Output, Operators(Arithmetic, relational, logical, bitwise etc.), Type conversions.
if and switch statements, Repetition statements ( loops)-while, for, do-while statements, Loop examples, other statements related to looping – break, continue.
Designing Structured Programs, Functions, user defined functions, inter function communication, Standard functions, Scope.
Recursive functions, Limitations of recursion, example C programs, Preprocessor commands.
Concepts, using arrays in C, inter function communication, array applications, two – dimensional arrays, multidimensional arrays, C program examples.
Introduction (Basic Concepts), Pointers for inter function communication, pointers to pointers, compatibility, Pointer Applications-Arrays and Pointers, Pointer Arithmetic and arrays, Passing an array to a function, memory allocation functions, array of pointers, programming applications, pointers to void, pointers to functions.
Concepts, C Strings, String Input / Output functions, arrays of strings, string manipulation functions, string / data conversion, C program examples.
Declaration, initialization, accessing structures, operations on structures, Complex structures, structures and functions, Passing structures through pointers.
Sorting- selection sort, bubble sort, Searching-linear and binary search methods. Command –line arguments, Input and Output.
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.
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.
Divide and Conquer method description, Applications of Divide and Conquer method using Tessellator programs: Binary search, Quick sort, Merge sort.
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.
Greedy Method Description, Job-Sequencing with Deadlines using Tessellator Program, Minimum Cost Spanning Trees: Prim's Algorithm and Kruskal's Algorithm using Tessellator programs.
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.
Description of the Backtracking method, State-Space Tree, N-Queens Problem, Sum of Subsets problem.
Description of the Branch and Bound method, 0/1 Knapsack problem using Branch and Bound.
Deterministic, Non-Deterministic Algorithms , 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.
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).
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?
Logical operators, Between operators, In operator, Pattern matching operators.
Detailed coverage of DDL (Data definition language):CREATE, ALTER, DROP, TRUNCATE, RENAME.
MySql Functions, Aggregate functions,Scalar functions (String functions, date related, numeric related, conversion function, null related functions.),Group by, order by, having clause.
Integrity constraints (column and table level). Different types of constraints.
Inner Join, Left Join, Right join and full join.
Triggers, Procedures, Functions, Views and ACID properties.
Normalization (1NF, 2NF, 3NF & BCNF).
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?
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.
Passing variables into methods. Array declaration, Construction and Initialization. Boxing and unboxing. Using wrapper classes. Garbage collection.
Assignment, Relational, Instanceof, arithmetic, conditional and logical operators.
Flow control (if, switch, labeled statements, while, for, do etc). Exceptions and its related keywords. Handling exceptions. Exception Hierarchy, Assertions (enabling and disabling assertions).
StringBuilder and String Buffer. File navigation and I/O. Serialization. Dates, Numbers and Currency. Parsing Tokening and Formatting.
Collections overview. Object class methods (equal, hashcode etc). Different types of collections and their usage. Generic types. Polymorphism and Generics etc.
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.
Using the Javac and Java commands. Static imports. How to create JAR files.
Purpose of web application development. Various elements of web applications.
Introduction to Hibernate,Hibernate Architecture.
Overview of Spring3 modules,AspectOrientedProgramming.
Struts 2 - Overview,Architecture.
Understand the advantages of the REST architecture for web services,Developing REST Full Web services using JAX-RS.
Defining SOAP Messages with WSDL,Role of SOAP in Web services Anatomy of a WSDL document.
No. There are no prerequisites for this course.
60% & above in Engineering. (CSE, IT & ECE)
No you cannot enroll for individual skill sets within a defined course on Inferdata.
Most learners are able to complete the course in about 4 months.
We recommend taking the courses in the order presented, as each subsequent course will build on material from previous courses.
Upon completion of the Finishing School program you will be a skilled professional ready to face interviews and land a deserving job.
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.
You can pay by Credit Card, Debit Card or Net Banking from all the leading banks. We use a Payment Gateway.
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.
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.
Expected Package: 2 to 3 lakhs per annum
We expect around 200 students to be part of the course
|C||1st July||3 Weeks|
|Data Structures||18th July||3 Weeks|
|MySQL||1st August||4 Weeks|
|Java||15th Aug||10 Weeks|
|DAA||1st Oct||3 Weeks|
|Aptitude||15th Aug||8 Weeks|
|Soft skills||1st Sept||4 Weeks|