Embedded Files
Click the topics for details:
Click the topics for details:
Science 2. Mathematics 3. Mathematics Education 4. Innovation 5. Physics
6. Electronics 7. Computer 8. Light & Eyes 9. Time
Descriptors/Topics
• Concepts of OOP, Features of Java, How Java is different from C++, Data types, Control Statements, Identifiers, arrays, Operators.
• Inheritance: Multilevel hierarchy, Method overriding, Abstract classes, Final classes, String Class.
• Difference between Applet and Application, Run time polymorphism, Lambda Expression
• Defining, Implementing, Applying Packages and Interfaces, Importing Packages.
• Fundamentals, Types, Uncaught Exceptions, Multiple catch Clauses, •Java’s Built-in Exception.
• Creating, Implementing and Extending thread, Thread priorities, Synchronization suspending, resuming and stopping Threads,
• Constructors, Various Types of String Operations, I/O using java.io package
• Event handling Mechanism,Event Model, Event Classes, Sources of Events, Event Listener Interfaces
• AWT: Working with Windows, AWT Controls, Layout Managers
Module I:Bisection Method, Method of False Position, Newton-Raphson method, Jacobi iteration method, Gauss Seidal method, Finite Differences & Difference tables, Polynomial Interpolation: Newton’s forward and backward formula, Central Difference Formulae: Gauss forward and backward formula, Interpolation with unequal intervals: Lagrange’s Interpolation, Newton divided difference formula
Module II:Numerical differentiation, Numerical Integration : Trapezoidal rule, Simpson’s 1/3 and 3/8 rules, Solution of differential equations: Euler’s Method,Euler's Modified Formula Runga-Kutta 4th Order Method
Module III:Overview of Probability, Introduction and expected value of Random variable (discrete and continuous), Variance of Random Variable, Probability Distribution: Binomial, Poisson, Normal
Module IV:Moments about a point, mean and origin, Skewness, Kurtosis Pearson’s β and γ – coefficients. Curve Fitting using Method of Least Squares, Fitting of Straight lines, Fitting of second degree parabola
Module I: Introduction to Languages and Automata:Formal Grammars and Chomsky Hierarchy, Regular Expression Deterministic and Nondeterministic Finite Automata, Regular Expression, Regular Expression to Finite Automata and vice versa, Arden’s Theorem , Two way Finite Automata, Finite Automata with output, Properties of regular sets, pumping lemma for regular sets, My-Hill-Nerode Theorem .
Module II: Context Free Grammars and Pushdown Automata: CFG: Formal Definition, Derivation and Syntax trees, Simplification Forms, Ambiguous Grammar, Properties of CFL, Normal Forms (CNF and GNF), Pushdown Automata: Definitions, Relationship between PDA and context free language, Decision Algorithms
Module III: Turing Machine: The Turing Machine Model, Language acceptability of Turing Machine, Design of TM, Variation of TM, Universal TM, Church’s Machine. Recursive and recursively enumerable language, unrestricted grammars, Context Sensitive Language, Linear Bounded Automata (LBA).
Module IV: Un-decidability: Turing machine halting Problem, UTM, Undecidable problems for recursive enumerable language, Post correspondence problems (PCP) and Modified Post correspondence problems, Undecidable problems for CFL.
Module V: Computability: Partial and Total Functions, Primitive Recursive functions, Recursive functions.
Module I : Introduction: Difference between C and C++, Procedure Oriented and Object-Oriented Approach, Basic Concepts: Objects, classes, Principals like Abstraction, Encapsulation, Inheritance and Polymorphism. Dynamic Binding, Message Passing, Characteristics of Object-Oriented Languages Module II: Class & Objects: Abstract data types, Object & classes, attributes, methods, C++ class declaration, Local Class and Global Class, State identity and behaviour of an object, Local Object and Global Object, Scope resolution operator, Friend Functions, Inline functions, Constructors and destructors, instantiation of objects,Types of Constructors, Static Class Data, Array of Objects,Constant member functions and Objects, Memory management Operators Module III: Inheritance. Inheritance, Types of Inheritance, access modes – public, private & protected, Abstract Classes, Ambiguity resolution using scope resolution operator and Virtual base class, Aggregation, composition vs classification hierarchies, Overriding inheritance methods, Constructors in derived classes, Nesting of Classes. Module IV: Polymorphism: Polymorphism, Type of Polymorphism – Compile time and runtime, Function Overloading, Operator Overloading (Unary and Binary), Polymorphism by parameter, Pointer to objects, this pointer, Virtual Functions, Pure virtual functions. Module V: Strings, Files & Exception Handling: Manipulating strings, Streams and files handling, Formatted and Unformatted Input output. Exception handling, Generic Programming – function template, class Templats, Standard Template Library: Standard Template Library, Overview of Standard Template Library, Containers, Algorithms, Iterators, Other STL Elements, the Container Classes.
B. Tech. (Analysis and Design Algorithm ) Click here for details
Module I: Introduction: Algorithm Design paradigms - motivation, concept of algorithmic efficiency, run time analysis of algorithms, Asymptotic Notations. Recurrences- substitution method, recursion tree method, master method Module II: Divide and Conquer: Structure of divide-and-conquer algorithms: examples; Binary search, quick sort, Merge sort, Strassen matrix multiplication; Run time analysis of divide and conquer and recurrence relations. Greedy Method: Overview of the greedy paradigm examples of exact optimization solution (minimum cost spanning tree), approximate solution (Knapsack problem), Single source shortest paths problems, traveling salesman problem Module III:Dynamic Programming: Overview, difference between dynamic programming and divide and conquer technique, Applications: Shortest path in graph, chain matrix multiplication, Traveling salesman Problem, longest Common sequence problem, knapsack problem Module IV:Graph Searching and Traversal: Overview, Representation of graphs, strongly connected components, Traversal methods (depth first and breadth first search) and its analysis
Back tracking: Overview, 8-queen problem, and Knapsack problem Brach and bound: LC searching Bounding, FIFO branch and bound, LC branch and bound application: 0/1 Knapsack problem, Traveling Salesman Problem Module V:Computational Complexity: Complexity measures, Polynomial Vs non-polynomial time complexity; NP-hard and NP-complete classes, examples.
B. Tech. (Data Structure Using C ) Click here for details
Module I : Introduction to Data Structures
Definition, Types. Algorithm design, Complexity, Time-Space Tradeoffs. Use of pointers in data structures. Array Definition and Analysis, Representation of Linear Arrays in Memory, Traversing of Linear Arrays, Insertion And Deletion, Single Dimensional Arrays, Two Dimensional Arrays, Multidimensional Arrays, Function Associated with Arrays, Character String in C, Character String Operations, Arrays as parameters, Implementing One Dimensional Array, Sparse matrix.
Module II: Stacks and Queues: Definition, Array representation of stacks, Operations Associated with Stacks- Push & Pop, Polish expressions, Conversion of infix to postfix, infix to prefix (and vice versa),Application of stacks recursion, polish expression and their compilation, conversion of infix expression to prefix and postfix expression, Tower of Hanoi problem. Queue: Definition, Representation of Queues, Operations of queues- Insert, Delete, Priority Queues, Circular Queue, Deque.
Module III: Programming with Linked Lists: Introduction to Singly linked lists: Representation of linked lists in memory, Traversing, Searching, Insertion into, Deletion from linked list, Garbage collection and compaction, doubly linked list, operations on doubly linked list, circular linked list, operations on circular linked list, generalized list. Applications of Linked List-Polynomial representation using linked list and basic operation. Stack and queue implementation using linked list.
Module IV: Trees: Basic Terminology, Binary Trees and their representation, expression evaluation, Complete Binary trees, extended binary trees, Traversing binary trees, Searching, Insertion and Deletion in binary search trees, General trees, AVL trees, Threaded trees, B trees.
Module V: Searching and Sorting Techniques: Insertion Sort, Bubble sort, Selection sort, Quick sort, Merge sort, Heap sort, Partition exchange sort, Shell sort, Sorting on different keys, External sorting. Linear search, Binary search, Hashing:,Hash Functions, Collision Resolution Techniques.
Module VI: Graph and Their Applications: Introduction, Graph Theory Terminology, Sequential Representation of Graph (Adjacency and Path Matrix), Warshall Algorithms, Linked Representation of Graph, Different Operations on Graphs, Traversing A Graph(DFS, BFS)., Spanning Trees-Introduction .Representation of Spanning tree, Constructing A Spanning Tree(Prim’s Algorithm, Kruskal’s Algorithm).
#For Your Knowledge
#For Your Knowledge
#Electronics
#Electronics
#Physics
#Physics
Page updated
Report abuse