UG-SYLLABUS

B.Sc(MPCs)-I YEAR(II-SEM)

Core 2: Data Structures and File Processing 

Unit I 

Basic data Structure: Introduction to Data Structures, Types of Data Structures, and Introduction to Algorithms, Pseudocode, and Relationship among data, data structures, and algorithms, Implementation of data structures, Analysis of Algorithms.

Stacks: Concept of Stacks and Queues, Stacks, Stack Abstract Data Type, Representation of Stacks Using Sequential Organization (Arrays), Multiple Stacks, Applications of Stack, Expression Evaluation and Conversion, Polish notation and expression conversion, Processing of Function Calls, Reversing a String with a Stack, Recursion.

Memory Management: Garbage collection algorithms for equal sized blocks, storage allocation for objects with mixed size, buddy systems 

Unit II 

Recursion: Introduction, Recurrence, Use of Stack in Recursion, Variants of Recursion, Recursive Functions, Iteration versus Recursion.

Queues: Concept of Queues, Queue as Abstract Data Type, Realization of Queues Using Arrays, Circular Queue, Multi-queues, Deque, Priority Queue, Applications of Queues,

Linked Lists: Introduction, Linked List, Linked List Abstract Data Type, Linked List Variants, Doubly Linked List, Circular Linked List, Representation of Sparse Matrix Using Linked List, Linked Stack, Linked Queue, Generalized Linked List, More on Linked Lists. 

Unit III 

Trees: Introduction, Types of Trees, Binary Tree, Binary Tree Abstract Data Type, Realization of a Binary Tree, Insertion of a Node in Binary Tree, Binary Tree Traversal, Other Tree Operations, Binary Search Tree, Threaded Binary Tree, Applications of Binary Trees.

Searching and Sorting: Searching, Search Techniques, Sorting, Multiway Merge and Polyphase Merge, Comparison of All Sorting Methods, Search Trees: Symbol Table, Optimal Binary Search Tree, AVL Tree (Heightbalanced Tree).

Unit IV 

Hashing: Introduction, Key Terms and Issues, Hash Functions, Collision Resolution Strategies, Hash Table Overflow, Extendible Hashing, Dictionary, Skip List, Comparison of Hashing and Skip Lists.

Heaps: Basic Concepts, Implementation of Heap, Heap as Abstract Data Type, Heap Applications,

Indexing and Multiway Trees: Introduction, Indexing, Types of Search Trees Files: Introduction, External Storage Devices, File Organization, Sequential File Organization, Direct Access File Organization, Indexed Sequential File Organization, Linked Organization.  

1. Varsha H. Patil “ Data structures using C++” Oxford university press, 2012

2. M.T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++, John Wiley and Sons, Inc., 2011

Recommended Books 

1. Adam Drozdek “Data structures and algorithm in C++” Second edition, 2001

2. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd Ed., Prentice-Hall of India, 2006

3. Robert L. Kruse and A.J. Ryba, Data Structures and Program Design in C++, Prentice Hall, Inc., NJ, 1998.

4. B. Stroupstrup, The C++ Programming Language, Addison Wesley, 2004

5. D.E. Knuth, Fundamental Algorithms (Vol. I), Addison Wesley, 1997

 

Example programs:

 1. Write C++ programs to implement the following using an array 
a) Stack ADT 
b) Queue ADT

2. Write a C++ program to implement Circular queue using array.

3. Write C++ programs to implement the following using a single linked list.

 a) Stack ADT

 b) Queue ADT

4. Write a C++ program to implement Circular queue using Single linked list.

5. Write a C++ program to implement the double ended queue ADT using double linked list.

 6. Write a C++ program to solve tower of hanoi problem recursively

7. Write C++ program to perform the following operations: 
a) Insert an element into a binary search tree. 
b) Delete an element from binary search tree. 
c) Search for a key in a binary search tree.

8. Write C++ programs for the implementation of BFS and DFS.

9. Write a C++ program that uses non-recursive functions to traverse a binary tree. 
a)Pre-order 
b)In-order 
c)Post-order

10. Write a C++ program to find height of a tree.

11 Write a C++ program to find MIN and MAX element of a BST.

12 Write a C++ program to find Inorder Successor of a given node.

13. Write C++ programs to perform the following operations on B-Trees and AVL Trees. a)Insertion b)Deletion

14 Write C++ programs for sorting a given list of elements in ascending order using the following sorting methods. 
a)Quick sort 
b)Merge sort

15. Write a C++ program to find optimal ordering of matrix multiplication.

 16. Write a C++ program that uses dynamic programming algorithm to solve the optimal binary search tree problem

17. Write a C++ program to implement Hash Table

18. Write C++ programs to perform the following on Heap
 a)Build Heap 
b)Insertion 
c)Deletion

19. Write C++ programs to perform following operations on Skip List 
a)Insertion 
b)Deletion

 20. Write a C++ program to Heap sort using tree structure.

BA-I YEAR(II -SEM)

Core 2: Computer Programming with C 

Unit - I 

Computing Concepts: Types of Software, Programming Languages, Translator Programs, Problem Solving Techniques, Using Computer. 

Overview of C: History of C, Importance of C, Sample Programs, Basic Structure of C Programs, Programming Style, Executing a ' C ' Program.

Constants, Variables, and Data Types : Introduction, Character set, C tokens, Keywords and Identifiers, Constants, Variables, Data Types, Declaration of Variables, Declaration of Storage Class, Assigning Values to Variables, Defining Symbolic Constant, Declaring Variable as Constant and Volatile, Overlow and Underflow of Data.

Managing Input and Output Operations: Introduction, Reading a Character, Writing a Character, Formatted Input and Output. 

Operators and Expressions : Introduction, Arithmetic Operators, Relational Operators, Logical Operators, Assignment Operators, Increment and Decrement Operator, Conditional Operators, Bitwise Operators, Special Operators, Arithmetic Expressions, Evalution of expressions, Precedence of Arithmetic Operators, Some Computational Problems, Type Conversions in Expressions, Operator Precedence and Associativity, Mathematical Functions. 

Unit – II 

Decision Making and Branching: Introduction, Decision Making with IF Statement, Simple If Statement, The If....Else Statement, Nested of If....Else Statements, The else if Ladder, The Switch Statement, The?: Operator, The Goto Statement.

Decision Making and Looping: Introduction, The While statement, the do Statement, the For Statement, Jumps in Loops.

Arrays: Introduction, One-dimensional Arraays, Declaration and Initialization of One-dimensional Arrays, Two-dimensional Arrays, Initializing two-dimensional Arrays, Multi-dimensional Arrays, Dynamic Arrays.

Unit III 

Character Arrays and Strings: Introduction, Declaring and Initializing String Variables, Reading Strings from Terminal, Writing Strings to Screen, Arithmetic Operations on Characters, Putting Strings together, Comparison of Two Strings, String-handling Functions, Table of Strings, Other Features of Strings.

User-Defined Functions : Introduction, Need for User-Defined Functions, A Multifunction Program, Elements of user-defined Functions, Definition of Functions, Return Valus and their Types, Function Calls, Function Declaration, Category of Functions, No Arguments and No Return Values, Arguments but No Return Values, Arguments with Return Values, No Arguments but Returns a Value, Functions that Return Multiple Values, Nesting of Functions, Recursion, Passing Arrays to Functions, Passing Strings to Functions, The Scope, Visibility and Lifetime of Variables, Multifile Programs.

Unit- IV 

Pointers : Introduction, Understanding Pointers, Accessing the Address of a Variable, Decalring Pointer Variables, Initilization of pointer Variables, Accessing a Variable through its pointer, Chain of Pointers, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays, Pointer and Arrays, Pointers and Character Strings, Arrays of Pointers, Pointers as Function Arguments, Functions Returning Pointers, Pointers to Functions, Pointers and Structures.

Structures and Unions : Introduction, Defining a Structure, Declaring Structure Variables, Accessing Structure Members, Structure Initialization, Copying and Comparing Structure Variables, Operations on Individuals Members, Arrays of Structures, Arrays within Structures, Structures within Structures, Structures and Functions, Unions, Size of Structures, Bit Fields.

File Management in C : Introduction, Defining and Opening a File, Closing a File, Input/Output Operations on Files, Error Handling During I/O Operations, Random Access to Files, Command Line Arguments. 

Text Book: 

1. Computing Fundamentals & C Programming – McGrawHill Education.

References: 

1. Spoken Tutorial on “C”, as E-resource for Learning. http://spokentutorial.org

Practical: Computer Programming with C 

NOTE: 

• All the concepts of programs from Text Book including exercises must be practice, execute and write down in the practical record book. 
• Faculty must take care about UG standard programs it should be minimum 25 – 30. 

• In the external lab examination student has to execute at least three programs with compilation and deployment steps are necessary. 
• External Viva-voce is compulsory.

Example programs: 

1. Write a c program for electricity bill tacking different categories of users, diffrent slabs in each category.(using nested if else statement)

2. write a c program to evaluate the following using loops a. 1+x2/2!+x4/4!+...upto 5 terms b. x+x3/3!+x5/5!+...upto 5 terms

3. Write a c program to check whether the given number is a. Prime or not b. Perfect or abundant or deficient 

4. Write a c program to find the mean, mode, median, and variance of list of values by using one dimensional array.

5. Write a menu driven program to read a list of numbers and perform the following operations a. Print the list b. Delete duplicates from the list c. Reverse the list.

6. Write a program to read a list of numbers and search for given number using binary search algorithm and if found display its index otherwise display the message "element not found in the list" using functions .

7. Write a menu driven program to read two matrices and compute their sum and product using functions 

8. Write a menu driven program to read list of student names and perform the following operations using functions. 

a. To print list of names 

b. To sort them in ascending order 

c. To print the list after sorting 

9. Write a c program that consists of recursive functions to find 

a. Factorial of a given number 

b. Print the pascal triangle using bionomial theorem

10. Write a menu driven program to read list of student names and perform the following operations using array of charecter pointers. 

a. To insert a student name 

b. To delete a name 

c. To print the names 

Paper : (BCO307) PROGRAMMING WITH C

Paper: BCO307                                                                                    Max. Marks: 50UE+30P+20IA PPW: 4 (2L+2P) Credits: 4                                                                      Exam Duration: 3 Hrs.

Objectives:to gain the skills of Structured (Procedural/Functional) Programming using C Language

UNIT-I: INTRODUCTION TO C LANGUAGE, DATA TYPES AND I/O OPERATIONS:

Introduction: Types of Languages – History of C language – Basic Structure – Creating – Compiling - Linking and Executing the C Program - Pre-processors in “C”.

Types and I/O operations: Keywords & Identifiers – Constants – Variables - Scope and Life of a Variable - Data types - Storage classes - Reading a character or values - Writing a character or value - Formatted Input and Output operations.

UNIT-II: OPERATORS, EXPRESSIONS AND DECISION MAKING:

Operators: Introduction – Arithmetic – Relational – Logical – Assignment - Conditional - Special operators – Expressions: Arithmetic – Evaluation - Type conversions.

Decision Making & Looping: Introduction - If statements - If-else statements - Switch statements - Conditional statements - While statements - Do statements - For Statements.

UNIT-III: ARRAYS AND STRINGS:

Arrays: Introduction - Defining an array - Initializing an array - One dimensional array – Two dimensional array - Dynamic array.

Strings: Introduction - Declaring and initializing string variables - Reading and Writing strings - String handling functions.

UNIT-IV: BUILT-IN FUNCTIONS AND USER-DEFINED FUNCTIONS: 

Built–in functions: Mathematical functions - String functions - Character functions - Date functions. User defined functions: Introduction - Need for user defined functions - Elements of functions - Return values and their types - Function declaration - Function calls - Recursive functions.

UNIT-V: STRUCTURES AND POINTERS: 

Structures: Introduction - Declaring structures variables - Accessing structure members - Functions and Structures - Array of structures - Enumerated Data types - Introduction to Unions.

Pointers: Fundamentals - Understanding pointers - Address - Declaration of Pointers. 

LAB: PROGRAMS USING C.

 SUGGESTED READINGS:

1. Programming in ANSCI C: Balaguruswamy, McGraw Hill. 

2. Programming in C: Ashok Kamthane, Pearson. 

3. C How to Program: P.J. Deitel& H.M. Deitel, Pearson & PHI. 

4. Programming in C: K.S. Kahlon, Kalyani Publishers. 

5. Fundamental of C: Dr. N. Guruprasad, Himalaya Publishing House. 

6. C: Learning and Building Business and System Applications: Susant Rout, PHI. 

7. Mastering C: K.R. Venugopal, McGraw Hill. 

8. Programming in C: J.B. Dixit, Firewal Media. 

9. The C Programming Language: B.W.Kernighan&D.M.Ritehie, PHI. 

10. C: The Complete Reference: H.Schildt, McGraw Hill. 

11. Let Us C: Y.Kanetkar, BPB. 

12. C++ Spoken Tutorials by IIT Bombay

Paper : (BCO507) E-COMMERCE

Paper: BCO507                                                                                 Max.Marks: 50UE+30P+20IA PPW: 5 (3L+2P) Hrs                                                                                 Exam Duration: 3hrs

Credits:5 

Objective:to acquire conceptual and application knowledge of ecommerce. 

UNIT-I: INTRODUCTION:

E-Commerce: Meaning- Advantages & Limitations - E-Business: Traditional & Contemporary Model, Impact of E-Commerce on Business Models - Classification of E-Commerce: B2B- B2C - C2B - C2C - B2E - Applications of Ecommerce: E-Commerce Organization Applications - E-Marketing - EAdvertising - E-Banking - Mobile Commerce - E-Trading - E-Learning - E-Shopping.

UNIT-II:FRAMEWORK OF E-COMMERCE:

Framework of E-Commerce: Application Services - Interface Layers - Secure Messaging - Middleware Services and Network Infrastructure - Site Security - Firewalls & Network Security - TCP/IP – HTTP - Secured HTTP – SMTP - SSL.

Data Encryption: Cryptography – Encryption – Decryption - Public Key - Private Key - Digital Signatures - Digital Certificates.

UNIT-III:CONSUMER ORIENTED E-COMMERCE APPLICATIONS:

Introduction - Mercantile Process Model: Consumers Perspective and Merchant’s Perspective - Electronic Payment Systems: Legal Issues & Digital Currency - E-Cash & E-Cheque - Electronic Fund Transfer (EFT) - Advantages and Risks - Digital Token-Based E-Payment System - Smart Cards.

UNIT-IV:ELECTRONIC DATA INTERCHANGE:

Introduction - EDI Standards - Types of EDI - EDI Applications in Business – Legal - Security and Privacy issues if EDI - EDI and E-Commerce - EDI Software Implementation.

UNIT-V: E-MARKETING TECHNIQUES:

Introduction - New Age of Information - Based Marketing - Influence on Marketing - Search Engines & Directory Services - Charting the On-Line Marketing Process - Chain Letters - Applications of 5P’s (Product, Price, Place, Promotion, People) E-Advertisement - Virtual Reality & Consumer Experience - Role of Digital Marketing

Paper: (BCO507) WEB TECHNOLOGIES

Paper: BCO508                                                                                   Max. Marks: 50UE+30P+20IA PPW: 5(3L + 2P)                                                                                      Time: 3 Hrs.

Credits:5 

Objective:to gain skills of usage of Web Technologies to design Web pages.

UNIT-I: INTRODUCTION: 

Art of creating a web site - Markup language (HTML) – Hypertext - Formatting text - Forms & formulating instructions & formulation elements – Commenting code – Anchors - Back grounds – Images - Hyperlinks – Lists –Tables – Frames - Web design principles.

UNIT-II: AN OVER VIEW OF DYNAMIC WEB PAGES & DYNAMIC WEB PAGE:

An over view of dynamic web pages and dynamic web page technologies: Introduction to Dynamic HTML programing -Cascading style sheets(CSS)- Basic syntax and structure -Events handling- Changing Text and Attributes - Dynamically changing style - Text Graphics and placements- Creating multimedia effects with filters and Transactions.

UNIT-III: JAVA SCRIPT:

Introduction - Client side Java script - Server side Java script - Core features - Data types and variables – Operators - Expressions and statements – Functions – Objects – Array - Date and math related objects - Document object model- Event handling.

UNIT-IV:EVENTS AND EVENT HANDLERS:

General information about Events – Event –OnAbort –OnClick - Ondbl click - Ondrag drop – Onerror - Onfocus - Onkey Press – Onkey Up – Onload - Onmouse Down – Onmouse Move - Onmouse Out – Onmouse Over - Onmove - Onrest – Onresize - Onselect - On submit - Onunload.

UNIT-V: EXTENSIBLE MARKUP LANGUAGE (XML):

Introduction- Creating XML Documents- XML style Sheet- Hyperlinksin XML Document Object Model- XML Query Language.

LAB WORK:CREATING A WEBSITE WITH DYNAMIC FUNCTIONALITY USING CLIENT- SIDE AND SERVER SIDE SCRIPTING.