400 Syl
400 Syl
400 Syl
UNIT I
Introduction to programming – definitions and developing Algorithms and flowcharts for simple programs.
Introduction to C Programming: Origin and history of c programming character set, Identifiers and keywords,
data types, constants, variables, operators, special operators, Expressions and operators precedence, compound
statements, structure of C program, Input and output function.
UNIT II
C Statements : Selection statements – if nested if’s, if-else, if ladder conditional expressions, switch statement
nested switch statements. Iteration statements(looping) – for loop, for loop variations, while loop, do-while loop,
declaring variable within selection and iteration statements, goto statement, return statement, break statement,
continue statement, exit() function.
UNIT III
Arrays – Array Declaration, Array Initialization – Accessing individual elements of an array, Two Dimensional
Arrays, Multi Dimensional Array, – Rules of using an array. Strings: definition, String I/O, string Manipulation.
Functions- The General Form of a Function, elements of function, function categories- built-in and user
defined functions, Math functions, string functions. Function Arguments Call by value, Call by Reference, return
statement. Passing an array element to a function, Uses of functions.
C pre – processors, types with examples and storage classes – Automatic ,Register, Static and external.
Pointers – definition, pointer variables, pointer expressions, arithmetic pointers, pointers and arrays, initializing
pointers and functions and problems with pointers.
UNIT IV
Structures – definition, accessing structure members, structure assignments, Unions – definitions, structure Vs
union.
object oriented programming, characteristics of object-oriented languages C and C++. C++ Programming basics
: Output using cout. Directives. Input with cin.
UNIT V
Making sense of core object concepts (Classes, Object, Encapsulation, Polymorphism, Inheritance)
Implementation of class in C++, constructor functions.structures and classes.
Unit I
Introduction: Introduction to web, protocols using on web, Web Site, Web Portal, Web applications, web
project & team, Browser, Web Server.
Unit II
Static Web Page Designing: Introduction to HTML, Html tags- Head, Body, Title, anchor, formatting tags,
table, images, frames, Div.
Unit III
Dynamic Webpage Design: - Introduction to forms, Form Elements Text, Button, checkbox, radio, combo
box, list, Cascading Style Sheets .
Unit IV
Introduction to Java script, documents, forms, statements, functions, objects, event and event handling
Unit V
DOM, introduction to COM/DCOM, Introduction to XML, Protocols governing web- email, www, DNS,
HTTP.
UNIT I
Number Systems & Codes: Number System - Base Conversion - Binary Codes -Code Conversion. Digital
Logic: Logic Gates - Truth Tables - Universal Gates.
UNIT II
Boolean Algebra: Laws & Theorems - SOP, POS Methods - Simplification of Boolean Functions - Using
Theorems, K-Map, Prime - Implicant Method – Implementation using Universal Gates. Binary Arithmetic:
Binary Addition - Subtraction - Various Representations of Binary Numbers - Arithmetic Building Blocks -
Adders -Subtracters.
UNIT III
UNIT IV
Sequential Logic: RS, JK, D, and T Flip-Flops - Edge-Triggered - Master-Slave Flip-Flops. Registers: Shift
Registers - Types of Shift Registers. Counters: Asynchronous Counters Ripple, Mod, Up-Down Counters-
Decoding Gates, Synchronous Counters - Ring, Decade, Presettable, Shift Counters. Memory: Basic Terms &
Ideas - Magnetic Memories - Memory Addressing - Types of ROMs – Types of RAMs.
UNIT V
Memory Basic cell of static and dynamic RAM; Building large Organization memories using chips; Associative
memory; Cache memory organization and Virtual memory organization
UNIT I
Sets - finite and Infinite sets, uncountable Infinite Sets; functions, relations, Properties of Binary Relations,
Closure, Partial Ordering Relations; counting - Pigeonhole Principle, Permutation and Combination;
Mathematical Induction, Principle of Inclusion and Exclusion.
UNIT II
Algebraic systems – Semi groups and monoids – Groups – Subgroups – Homomorphism‘s – Normal subgroup
and cosets – Lagrange‘s theorem – Definitions and examples of Rings and Fields.
UNIT III
Vectors , vector product, dot and cross , vector space, Matrix and its types- symmetric matrix, determinant
operations on matrices(scalar, vector), diagonal matrix Sparse Matrix, Transpose, Inverse, Simultaneous
equations through matrix, Eigen values, Eigen vectors and characteristics equations, SVD.
UNIT IV
Basic Terminology, Models and Types, multi graphs and weighted graphs, Graph Representation, Graph
Isomorphism, Connectivity, Euler and Hamiltonian Paths and Circuits, Planar Graphs, Graph Coloring, Trees,
Basic Terminology and properties of Trees, Introduction to Spanning Trees
Boolean algebra and lattices. Logical Connectives, Well-formed Formulas, Tautologies, Equivalences, Inference
Theory, Partial ordering – Posets – Lattices as posets – Properties of lattices
2. “Discrete Mathematics and its Applications”, Author: Rosen, K.H., Publisher:Tata McGraw Hill Pub. Co.
Ltd., New Delhi, Special Indian Edition, 2011.
3. “Discrete Mathematical Structures with Applications to Computer Science”, Author: Tremblay, J.P. and
Manohar.R,”, Publisher: Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
Enviornmental Studies (BHCS – 008) (Qualifying Course )
Definition-causes, effects and control measures of: Air, Water and Soil pollution-e-waste management-Disaster
management: Natural and man made-food/earthquake/cyclone, tsunami and landslides.
Unit I
Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algorithm, Time
and Space Complexity, Asymptotic notations: Big-Oh, Time-Space trade-off. Abstract Data Types
(ADT)Arrays: Definition, Single and Multidimensional Arrays.
Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists, Doubly
Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal,
Polynomial Representation and Addition, Generalized Linked List
Unit II
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack
in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion, Tower of
Hanoi Problem, Simulating Recursion, Principles of recursion, Tail recursion, Removal of recursion Queues,
Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of
queues in C, Dequeue and Priority Queue.
Unit III
Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and Dynamic
Representation, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees,
Tree Traversal algorithms: Inorder, Preorder and Postorder, Threaded Binary trees, Traversing Threaded Binary
trees, Huffman algorithm.
Unit IV
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices, Adjacency List,
Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search, Connected Component,
Spanning Trees, Minimum Cost Spanning Trees
Unit V
Searching : Sequential search, Binary Search, Comparison and Analysis Internal Sorting: Insertion Sort, Selection,
Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Radix Sort.
Search Trees: Binary Search Trees (BST) Hashing: Hash Function, Linear probing.
Unit I
Floating point representation and computer arithmetic, Significant digits, Errors in numerical computation.
Bisection method, Secant method, Regula−Falsi method, Newton−Raphson method, Iteration method, error
analysis.
Unit II
Iterative methods:, Gauss elimination direct method and pivoting. Gauss-Seidel iterative methods difference
operators. Interpolation & extrapolation method, Lagrange‘s and Newton‘s forward and backward finite
difference formula.
Unit III
Numerical integration and differentiation: Trapezoidal rule, Simpson‘s 1/3 & 3/8 rule, Boole’s rule.
Unit IV
Numerical Solution of elementary ordinary and partial differential equation. Laplace and Fourier,
tchebycheff , transform and introduction to wavelets, straight line, parabolic and exponential.
Unit V
Sampling methods, simple random sampling, Purposive sampling, stratified random sampling. Test of
significance: Chi square test for goodness of fit of uniformity and independence of attributes, one and two
sample t-test. Forecasting and time series analysis: time series models, methods of moving average.
Unit I
Unit II
Constituents of Technical Written Communication Words and Phrases: Word formation. Synonyms and
Antonyms; Homophones; Select vocabulary of about 500-1000 New words; Correct Usage: all Parts of Speech;
Modals; Concord; Articles; Infinitives; Requisites of Sentence Construction: Paragraph Development:
Techniques and Methods-Inductive, Deductive, Spatial, Linear, Chronological etc; The Art of Condensation-
various steps.
Unit III
Business Communication Principles, Sales & Credit letters; Claim and Adjustment Letters; Job application and
Resumes. Reports: Types; Significance; Structure, Style & Writing of Reports. Technical Proposal; Parts;
Types; Writing of Proposal; Significance, Negotiation & Business Presentation skills
Unit IV
Presentation Strategies and Listening Skills. Defining Purpose; Audience & Local; Organizing Contents;
Preparing Outline; Audio-visual Aids; Nuances of Delivery; Body Language; Dimensions of Speech: Syllable;
Accent; Pitch; Rhythm; Intonation; Paralinguistic features of voice; Listening Skills: Active Listening, Passive
Listening. methods for improving Listening Skills.
Unit V
Value-Based Text Readings Following essays form the suggested text book with emphasis on Mechanics of
writing.
Unit II
8086 architecture, Instruction Set: Characteristics - Operand Types - Operation Types - Addressing Modes -
instruction Formats , Addressing Modes (Simple Examples), assembly language programming , elementary
assembly pipelining . interrupts.
Unit III
Input/Output: External Devices - I/O Module - Programmed I/O - Interrupt Driven I/O - DMA - I/O Channels &
Processors. Computer Arithmetic: ALU -. Integer Representation and Arithmetic - Floating Point Representation
and Arithmetic.
Unit IV
CPU: Organization of Processors and Registers - Instruction Cycle - Instruction Pipelining - Pentium Processor.
RISC: Characteristics - Large Register File - Register Optimisation - Architecture Pipelining. Instruction Set
Architecture(ISA), RISC and CISC, Characteristics of CISC.
Unit V
Control Unit: Micro-Operations - Control of Processors - Hardwired Implementation - Micro Programmed
Control Concepts -- Microinstruction Sequencing - General Microinstruction Execution.
( Qualifying Course )
Unit-I Course Introduction - Need, Basic Guidelines, Content and Process for Value Education(6)
1. Understanding the need, basic guidelines, content and process for Value Education.
2. Self Exploration-what is it? - its content and process; ‘Natural Acceptance’ and Experiential Validation-as the
mechanism for self exploration
3. Continuous Happiness and Prosperity-A look at basic Human Aspirations
4. Right understanding, Relationship and Physical Facilities-the basic requirements for fulfillment of aspirations
of every human being with their correct priority
5. Understanding Happiness and Prosperity correctly-A critical appraisal of the current scenario
6. Method to fulfill the above human aspirations: understanding and living in harmony at various levels.
Unit-III Understanding Harmony in the Family and Society -Harmony in Human-Human Relationship
(6)
13. Understanding harmony in the Family- the basic unit of human interaction
14. Understanding values in human - human relationship; meaning of Nyaya and program for
its fulfillment to ensure Ubhay-tripti;
Trust (Vishwas) and Respect (Samman) as the foundational values of relationship
15. Understanding the meaning of Vishwas; Difference between intention and competence.
16. Understanding the meaning of Samman, Difference between respect and differentiation;
the other salient values in relationship
17. Understanding the harmony in the society (society being an extension of family):
Samadhan, samridhi, Abhay, Sah-astitva as comprehensive Human Goals
18. Visualizing a universal harmonies order in society-Undivided Society (Akhand Samaj),
Universal Order (Sarvabhaum Vyawastha) - from family to world family.
-Practice Exercise and Case Studies will be taken up in Practice Sessions.
Unit-IV Understanding Harmony in the Nature and Existence - Whole existence as Co-existence(5)
19. Understanding the harmony in the Nature
20. Interconnectedness and mutual fulfillment among the four orders of nature-recyclability and self-regulations
in nature
21. Understanding existence as Co-existence (Sah-astitva) of mutually interacting unites in all-pervasive space.
22. Holistic perception of harmony at all levels of existence
-Practice Exercise and Case Studies will be taken up in Practice Sessions.
Unit-V Implications of the above Holistic Understanding of Harmony on Professional Ethics (5)
23. Natural acceptance of human values
24. Definitiveness of Ethical Human Conduct
25. Basis of Humanistic Education, Humanistic Constitution and Humanistic Universal Order
26. Competence in professional ethics;
a. Ability to utilize the professional competence for augmenting universal human order.
b. Ability to identify the scope and characteristics of people friendly eco-friendly production systems
c. Ability to identify and develop appropriate technologies and management patterns for above production
systems.
27. Case studies of typical holistic technologies, management models and production systems
28. Strategy for transition from the present state to universal Human Order;
a. At the level of individual: as socially and ecologically responsible engineers, technologies and mangers.
b. At the level of society: as mutually enriching institutions and organizations.
9. Solve the initial value problem using Euler’s method and compare the result with the exact solutions.