B.Sc IT 2nd Sem Syllabus

                                                                BS201 : Data Structures
Introduction: Basic Terminology, Elementary Data Organization, Data Structure
operations, Algorithm Complexity and Time-Space trade-off. Arrays: Array Definition,
Representation and Analysis, Single and Multidimensional Arrays, address calculation,
application of arrays, Character String in C, Character string operation, Array as
Parameters, Ordered list, Sparse Matrices, and Vector. Stacks: Array Representation and
Implementation of stack, Operations and Stacks: Push and POP, Array Representation of
Stack, Linked Representation of stack, Operations Associated with Stacks, Application of
stack, Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix
expression using stack. Recursion: Recursive definition and processes.
Queues: Array and linked representation and implementation of queues, Operations on
Queue; Create, Add, Delete, Full and Empty, Circular queue, Dequeue, and Priority
Queue. Link List: Representation and implementation of Singly linked lists, Two-way
Header List, Traversing and Searching of Linked List, Overflow and Underflow,
Insertion and deletion to from Linked Lists, Insertion and deletion Algorithms, Doubly
linked list, Linked List of Array, Polynomial representation and addition, Generalized
linked list, Garbage Collection and Compaction.
Trees: Basic terminology, Binary Tree, Binary tree representation algebraic Expressions,
Complete Binary Tree, Extended Binary Tree, Array and Linked Representation of
Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing Threaded
Binary tree, Huffman algorithm. Searching and Hashing: Sequential search, comparison
and analysis, Hash Table, Hash Function, Collection Resolution Strategies, Hash Table
Implementation.
Sorting: Insertion Sort, Bubble sorting, Quick Sort, Two way Merge Sort, Trees: Binary
Search (BST), Insertion and Deletion in BST.
References:
1. Horowitz and Sahani, "Fundamentals of data Structures" Galgotia
2. R. Kruse etal, "Data Structures and Program Design in C" Person Education
3. A.M. Tenenbaum etal, "Data Structures and Program Design in C" Person Education
4. Lipschutz, "Data Structure", TMH
5. K Loudon, "Mastering Algorithms With C", Shroff Publishers and Distributors
6. Bruno R Preiss, "Data Structure and Algorithms with Object Oriented Design Pattern
in C++, Jhon Wiley & Sons, Inc.
7. Adm Frozdek, "Data Structures and Algorithms in C++" Thomson Asia
8. Pal G. Sorenson, "An Introduction to Data Structures with Application", TMH
18


                                   BS202 : Object Oriented Programming using ‘C++’
 
Introduction: Introduction to OOP, Basic Concepts of OOP, Applications of OOP.
Introduction to C++, Introduction to C++ stream I/O, declarations in C++, Creating New
data types in C++, function Prototypes, Inline functions, Reference Parameters, Const
Qualifier, Dynamic memory allocation, default arguments, Unary Scope resolution
operator, Linkage specifications.
Class, Constructors, Friend Class : Introduction, Comparing class with Structure, Class
Scope, Accessing Members of a class, Constructor, Destructor, Const objects, Const
member functions, Friend class, Friend function, This pointer, Data abstraction and
Information hiding, container classes and Iterators
Overloading & Inheritance: Operator Overloading, Fundamentals, Restrictions,
Overloading stream, Insertion and stream extraction operators, Overloading unary &
binary operators, Converting between types, Overloading ++ and --. Inheritance,
Introduction, Protected members, Casting base _class pointers to derived _class pointers
Overloading Base class members in a Derived class, Public, Protocols and Private
inheritance, Direct base classes and Indirect Base Classes, Using Constructors and
Destructors in Derived classes, Implicit Derived class object to base class object
conversion.
Virtual Functions: Introduction, Type fields and switch statements, Virtual functions,
Abstract base classes and concrete classes, Polymorphism, Dynamic binding, Virtual
destructors.
C++ Stream I/O: Streams, Stream Input, Stream Output, Unformatted I/O, Stream
manipulators, Stream format states, Stream error, States.
Files : File Operations –File pointers – error Handling during file Operations
References:
1. Deitel H.M. & Deitel P.J. – “How to Program C++” – PHI – 2003
2. Al stevenes – “C++ Programming” – Wiley dreamtech – 2003.
3. Herbert Scheldt, “Complete Reference”.
4. E. Balagurusamy “Object Oriented Programming with C++”.
5. Yashwant Kanetkar, “Let Us C++”.
6. C++ Programming by Herbert Scheldt – 2004.
19


                                                  BS203 : System Analysis and Design
System Concepts and Information System Environment: The System Concept,
Definition, Characteristics of Systems, Elements of a System, Open and Closed and
closed system, Formal & Informal Information Systems, Computer based Information
Systems, Management Information System, Decision Support System, General Business
Knowledge, and Interpersonal Communicational System.
The System Development Life Cycle: Recognition of needs, Impetus for System Change,
Feasibility Study, Analysis, Design, Implementation, Post implementation &
Maintenance.
The Role of the Systems Analyst: Historical Perspective, Academic & Personal
Qualifications, the multifaceted role of the Analyst, The Analyst/User Interface,
Behavioral issues.
Systems Planning & Initial Investigation: Strategies for Determining Information
Requirement, Problem Definition & Project initiation, Background Analysis, Fact
Analysis, Review of Written Documents, Onsite Observations, Interviews &
Questionnaires, Fact Analysis, Performance Analysis, Efficiency Analysis, Service
Analysis.
Information Gathering: Kind of Information needed. Information about the firms,
Information gathering tools, the art of Interviewing, Arranging the Interview, Guides to
Successful Interview, Types of Interviews and Questionnaires, The Structured and
Unstructured Alternatives.
The Tools of Structured Analysis: The Dataflow Diagram (DFD), Data Dictionary,
Decision Trees and Structured English.
Feasibility Study: System performance, Economic Feasibility, Technical Feasibility,
Behavioral Feasibility, Steps in Feasibility Analysis.
Input/Output and Forms Design: Input Design, CRT Screen Design, Output Design,
Requirements form Design.
References:
1. Elias M.Awad, "Systems Analysis & Design" Galgotia Publication
2. Hoffer, "Modern Systems Analysis & Design" Addision Wesley
3. Kendall, "Introduction to System Analysis & Desogm", McGraw Hill
20



                                             BS204 : Probability & Statistical Techniques
Data representation, Histogram, frequency distribution, Ogive, Arithmetic mean and
Geometric Mean, Harmonic Mean, Medium quadrates.
Probability Theory: Sample space & events, the axioms of probability, some elementary
theorem, conditional probability, Baye’s Theorem, mathematical expectation.
Probability distribution: random variables, binomial distribution, hyper geometric
distribution, chebyshev distribution, Poisson distribution, geometric distribution, Erlang
distribution.
Probability Densities: continuous random variables, normal distribution, uniform
distribution.
Example of Least square, fitting of curves. Correlation and regression.
Theory of Sampling: Sampling, sampling of attributes, Mean of standard deviation of
sample, Sampling distribution, Distribution of the means.
Chi square test as a goodness of fit, Chi square test as test of independence.
References:
1. Bernstein: “ Element of statistics”, PHI
2. Hogg:” Introduction Mathematical Statistics”, Pearson Education
3. Lipschutz, “ Introduction to Probability & Statistics” PHI