INSTRUCTOR LED ONLINE LIVE SESSIONS

Finishing School(FS)

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 Finishing School
The Finishing School aims to bridge the gap by providing engineering graduates specialized training; both technical and soft skills to enhance their employability skills.
The Finishing School -The flagship program of Keshav Memorial Institute of Technology (KMIT), is now being offered to students from other colleges on www.teleuniv.com. Students get access to top class faculty for quality learning. An opportunity that is rare, a chance that should not be missed!
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.

    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
C

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.

    Single Linked Lists- insertion and deletion at beginning, middle & end, Find Length of a Linked List (Iterative and Recursive), Reverse a linked list Lab.

    Learning Outcomes:

    • You will be able to insert and delete the node at beginning, middle & end on linked list
    • Get familiar with writing recursive methods.
    • You will be able to find the length of a linked list (Iterative and Recursive)
    • You will be able to reverse a linked list(Iterative and Recursive)

    Concatenating singly linked list Linked List Deletion (Deleting a given key) Linked List Deletion (Deleting a key at given position).

    Learning Outcomes:

    • You will be able to swap nodes in a linked list without swapping data
    • You will be able to concatenate singly linked list
    • You will be able to Delete a given key from linked list
    • You will be able to Delete a given key at given position from linked list

    Operations for Circularly linked lists, Split a Circular Linked List into two halves , Sorted insert for circular linked list.

    Learning Outcomes:

    • You will be able to perform operations on circular linked list
    • You will be able to Split a Circular Linked List into two halves
    • You will be able to Sort insert for circular linked list

    Doubly Linked List Introduction and Insertion Delete a node in a Doubly Linked List Reverse a Doubly Linked List.

    Learning Outcomes:

    • You will be able to insert and delete a Double linked list
    • You will be able to Reverse a Doubly Linked List

    Implement two stacks in an array Reverse a stack using recursion Sort a stack using recursion.

    Learning Outcomes:

    • You will be able to implement a stack using arrays and linked list
    • You will be able to Reverse a stack using recursion
    • You will be able to Implement two stacks in an array
    • You will be able to Sort a stack using recursion

    Implement Stack using Queues, Implement Queue using Stacks Circular queue, Find the first circular tour that visits all petrol pumps.

    Learning Outcomes:

    • You will be able to implement queue using arrays and linked list
    • You will be able to Implement Stack using Queues
    • You will be able to Implement Queue using Stacks
    • You will be able to implement circular Queue

    Introduction to Binary Trees Properties of Binary Trees Representations and Traversals: preorder, inorder and postorder Threaded binary trees.

    Learning Outcomes:

    • You will be able to implement Binary Trees
    • You will be able to implement preorder traversal (Iterative and Recursive)
    • You will be able to implement inorder traversal (Iterative and Recursive)
    • You will be able to implement postorder traversal (Iterative and Recursive)

    Implementation of Max Heap Insertion into a Max Heap Deletion from a Max Heap.

    Learning Outcomes:

    • You will be able to implement priority Queue ADT You will be able to insert and delete from max heap
    • You will be able to implement heap sort

    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.

    Learning Outcomes:

    • You will be able to implement Graphs using arrays and linked list
    • You will be able to implement BFS
    • You will be able to implement DFS
    • You will be able to Detect Cycle in a Directed Graph
    • You will be able to Detect Cycle in an Undirected Graph

    Bubble, selection, insertin, quick, heap, mearge and radix sort.

    Learning Outcomes:

    • You will be able to perform bubble sort on list of elements
    • You will be able to perform selection on list of elements
    • You will be able to perform quick sort on list of elements
    • You will be able to perform merge on list of elements
    • You will be able to perform heap sort on list of elements
    • You will be able to perform radix on list of elements

    Binary Search Tree, AVL and Splay tree.

    Learning Outcomes:

    • You will be able to implement BST
    • You will be able to implement AVL tree You will be able to implement splay tree

Mr. Younus
Data Structures

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 Python, Data Science with python, HTML5 , CSS3 and Android Programming.

    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
MySQL

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.

Mr. Younus
Java

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.

    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.

    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.

Mr.Chaitanya Deshpande
Aptitude

Mr. Chaitanya Deshpande Is a prolific Aptitude trainer with 15 years of fruitful experience.

He has the distinction of having imparted training in about 15 colleges across Andhra Pradesh & Telangana.

An entrepreneur with a thriving business,a former manager with a Mumbai based educational group. A masters degree holder, a silver medalist in Civil Engineering from NIT he has much to offer a sincere learner

Mr Deshpande is passionate about his work. With his Aptitude training, he wholeheartedly guides final year students through the initial and the most crucial stage of the recruitment process

Nilima Gogate
Verbal Ability & Employability Skills

Nilima Gogate is a Personality Enhancement and English Language Consultant.

She has been training individuals in Chennai Mumbai and Hyderabad for Life Skills, Soft Skills, Employability Skills and Verbal Ability since the year 2004

Nilima Gogate has been associated as a Personality Enhancement and English Language trainer with the Malla Reddy Group of Institutes since the year 2012, and has coached the students of MRIT, MRIET, MAIN CAMPUS and MRCEW (first year to fourth year) in particular which has resulted in industry placements. She has created lasting impressions and changed life for better of many a youngster. She has coached and trained all age groups up to 55 years, which included retiring army personnel.

Given the background, qualifications and the experience, she perfectly qualifies to be a natural Coach, Guide or a Mentor to all, especially the young generation.

She comes from the Army background and hails from Mumbai

Nilima Gogate has the academic accreditations of B.A, (Bombay University) B.Ed., (H N Bahuguna University) PG (Dip) in Guidance and Counselling (Annamalai University) and PG (Dip) in Fine Arts. (Chennai)

  • 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 TeleUniv.

  • 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?

    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.

  • 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. TeleUniv 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: 3 to 7 lakhs per annum

  • What is 100% refund policy?

    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.

  • What will happen if I miss any session?

    Back up classes can be arranged for upto 3 sessions. In any case, recording of the session shall be provided.

  • What will happen if I am unable to get pass marks in exam? Won't I get the certificate?

    We will identify your weak areas and help you give the exam again. Certificate will be awarded only on passing the exam successfully.

  • What is the difference between online medium of course delivery and in-class training?

    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.

WHAT TO EXPECT:

  • 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 Teleuniv account!

Don't have an account? Sign up

Sign up and start learning!

Show

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