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.
Single Linked Lists- insertion and deletion at beginning, middle & end, Find Length of a Linked List (Iterative and Recursive), Reverse a linked list Lab.
Concatenating singly linked list Linked List Deletion (Deleting a given key) Linked List Deletion (Deleting a key at given position).
Operations for Circularly linked lists, Split a Circular Linked List into two halves , Sorted insert for circular linked list.
Doubly Linked List Introduction and Insertion Delete a node in a Doubly Linked List Reverse a Doubly Linked List.
Implement two stacks in an array Reverse a stack using recursion Sort a stack using recursion.
Infix to Postfix Conversion using Stack Evaluation of Postfix Expression.
Implement Stack using Queues, Implement Queue using Stacks Circular queue, Find the first circular tour that visits all petrol pumps.
Introduction to Binary Trees Properties of Binary Trees Representations and Traversals: preorder, inorder and postorder Threaded binary trees.
Implementation of Max Heap Insertion into a Max Heap Deletion from a Max Heap.
Terminology, Graph Representations, Graph traversals- BFS ,DFS Applications of Depth First Search and Breadth First Traversal Detect Cycle in a Directed Graph, Detect Cycle in a an Undirected Graph.
Bubble, selection, insertin, quick, heap, mearge and radix sort.
Binary Search Tree, AVL and Splay tree.
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.
Percentages, Profit and Loss, Time and Distance, Time and Work.
Plane Geometry, Solid Geometry, Coordinate Geometry.
Permutations and Combinations, Probability, Statistics.
Data Interpretation, Data Sufficiency.
Indices Fractions, Ratios, Equations, Number System,LCM and HCF, Ages.
Linear arrangements.(1-D), Linear arrangements (2-D), Linear arrangements(3-D), Circular arrangements.
Blood relationships, Number series and Missing numbers, Symbols Pictorial analysis, Directions, Coding and Decoding.
Cubes and painted surfaces, General Puzzles, Analytical Puzzles, Logical Blocks, Calendars, Races.
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 TeleUniv.
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.
Teleuniv 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. TeleUniv is powered by KMIT and with 30+ companies visiting KMIT for placements every year the deserving students will get jobs.
Expected Package: 3 to 7 lakhs per annum
If you change your mind to discontinue within the first two sessions of the course, you can ask for refund of the course fee within two weeks of commencement . The same shall be credited back to you. However no refund shall be made under any other condition.
Back up classes can be arranged for upto 3 sessions. In any case, recording of the session shall be provided.
We will identify your weak areas and help you give the exam again. Certificate will be awarded only on passing the exam successfully.
Frankly, there is no difference whatsoever. The candidate will be able to interact with peers and trainers in both mediums with same amount of ease and speed. In both the mediums, the practical project can be executed on personal laptops and screen can be shared with the rest of the class. Yes if there is a difference, that is solely your level of convenience to take 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|