Posts

Showing posts with the label IT - 3rd sem

Computer Programming-I [JAVA] (IT-3006)

Image
Objectives 1. Understand fundamentals of programming such as variables, conditional and iterative execution, methods, etc. 2. Understand fundamentals of object-oriented programming in Java and be familiar of the important concepts like class, inheritance and multithreading, AWT and JDBC. 3. Students will able to use the Java SDK environment to create, debug and run simple Java programs. Syllabus UNIT 1: Object-Oriented Programming , overview of Java, Installation, First Simple Program, Compilation process , Java Keywords , Identifiers , Literals, Comments, Data Types, Variables, Arrays, Declaration a variable, Dynamic initialization, the scope and life time of variable, type conversion and casting, Operators, Control Statements. UNIT 2 : Class Fundamentals, Simple Class , Abstract Classes, Declaring Objects, Introducing Methods, Constructors, this Keyword, Garbage Collection, finalize Method, Overloading Methods, Overloading Constructors, Using Objects as Parameters, Inheritan...

Discrete Structures (IT-3005)

Image
Objectives The main objectives of this course are: 1. To introduce students with sets, relations, functions, graph, and probability. 2. Students can perform set operation and solve logical reasoning and verify the correctness of logical statement. 3. They can apply the properties of relations and find partially ordered set and lattices. Syllabus UNIT 1: Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction. UNIT 2 : Algebraic Structur...

Digital circuits & system (IT-3003)

Image
Objectives In the modern age electronic computers, communication systems and Internet became an important part of our life. The operation of these systems is based on the principle of digital techniques. The objective of this course is to get familiar with the concept of digital techniques and these systems are referred to as digital systems. Syllabus UNIT 1: Number systems and logic gates: Decimal, Binary, Octal, Hexadecimal number systems and radix conversion. Codes- BCD, excess 3, gray, ASCII. Boolean algebra- Theorems and properties, Boolean functions, canonical and standard forms, De Morgans theorem, digital logic gates, Karnaugh maps. UNIT 2 : Combinational circuits: Introduction to combinational circuits, multilevel NAND, NOR implementation. Designing binary Adders and Subtractors. Decoder, Encoder, Multiplexer, Demultiplexer circuits. UNIT 3 : Sequential circuits: Introduction to Sequential circuits, flip-flops, RS, D, T, JK, M/S JK-flipflops, truth tables, excit...

Analysis and Design of Algorithms (IT-3002)

Image
Objectives Data structure includes analyzing various algorithms along with time and space complexities. It also helps students to design new algorithms through mathematical analysis and programming. Syllabus UNIT 1: Introduction of Algorithms, Analysis of algorithms: Space Complexity, Time Complexity, recurrence relation and Asymptotic Notation, Divide and Conquer: General Methods, Analysis and Design, Binary Search, Quick sort, Merge sort, Strassen’s matrix multiplication. UNIT 2 : Greedy Strategy: Introduction, examples of greedy method like optimal merge pattern, Huffman coding, Minimum spanning trees, knapsack problem, job sequencing with dead lines single source shortest path algorithms. UNIT 3 : Dynamic Programming: Introduction, Problem based on this approach such as 0/1 Knapsack Multistage graph, reliability design, Floyd-warshall algorithms. UNIT 4 : Backtracking Concept and its example like 8 Queen’s problem, Hamiltonian cycle, Graph coloring problem, 15 Pu...

Object Oriented Programming & Methodology (IT-3004)

Image
Objectives The objective of this course is to understand the advantage of object oriented programming over procedure oriented programming. It helps to understand the key features of Object Oriented Programming and Methodology like objects, methods, instance, message passing, encapsulation, polymorphism, data hiding, abstract data and inheritance. Syllabus UNIT 1: Object oriented programming, Introduction, Application, characteristics, difference between object oriented and procedure programming, Comparison of C and C++, Cout, Cin, Data Type, Type Conversion, Control Statement, Loops, Arrays and string arrays fundamentals, Function, Returning values from functions, Reference arguments, Overloaded function, Inline function, Default arguments, Returning by reference. UNIT 2 : Implementation of class and object in C++, access modifiers, object as data type, constructor, destructor, Object as function arguments, default copy constructor, parameterized constructor, returning object ...