B Sc Computer Science Tech - Semester 3 & 4 Curriculum 2023-24 PDF

# Curriculum for Semester III ## CMP-311: Data Structure **Course Code:** CMP-311 **Course Title:** Data Structure **Total Credits:** 02 **Contact Hours:** 30 (Clock Hours) **Marks:** 50 **Periods:** 45 (45 minutes each) **Objective:** * To provide fundamental knowledge of data structures and ho...

# Curriculum for Semester III ## CMP-311: Data Structure **Course Code:** CMP-311 **Course Title:** Data Structure **Total Credits:** 02 **Contact Hours:** 30 (Clock Hours) **Marks:** 50 **Periods:** 45 (45 minutes each) **Objective:** * To provide fundamental knowledge of data structures and how they are organized/arranged in computer memory. * To provide knowledge on how data structures are implemented and processed. * To familiarize with basic techniques of algorithm analysis. * To equip with the implementation techniques of complex algorithms of insertion, deletion and modification of data stored in various data structures. * To provide knowledge of the basic functioning of searching and sorting algorithms. ### Unit 1: Introduction to Data Structures and Algorithm Analysis (10 Period) * Introduction, Need of Data Structure, Definitions Data and information, Data type, Data object, ADT, Data Structure, Types of Data Structures * Algorithm analysis: Space and time complexity, Graphical understanding of the relation between, different functions of *n*, examples of linear loop, logarithmic, quadratic loop etc. Best, Worst, Average case analysis, Asymptotic notations (Big O, Omega 2, Theta ) ### Unit 2: Array (10 Period) * Operations of array, ADT * Applications - Searching, Sequential search, variations - Sentinel search, Probability search, ordered list search, Binary Search, Comparison of searching methods, Sorting Terminology- Internal, External, Stable, In-place Sorting * Comparison Based Sorting Lower bound on comparison based sorting, Methods- Bubble Sort, Insertion Sort, Selection Sort, Algorithm design strategies - Divide and Conquer strategy, Merge Sort, Quick Sort, complexity analysis of sorting methods ### Unit 3: Linked List (10 Period) * List as a Data Structure, differences with array. Dynamic implementation of Linked List, internal and external pointers, Types of Linked List - Singly, Doubly, Circular * Operations on Linked List - create, traverse, insert, delete, search, sort, reverse, concatenate, merge, time complexity of operations. * Applications of Linked List - polynomial representation, Addition of two polynomials * Generalized linked list - concept, representation, multiple-variable polynomial representation using generalized list ### Unit 4: Stack and Queue (10 Period) * Introduction of Stack: Operations - *init()*, *push()*, *pop()*, *isEmpty()*, *isFull()*, *peek()*, time complexity of operations. * Implementation- Static and Dynamic with comparison, Applications of stack * Expression types - infix, prefix and postfix, expression conversion and evaluation (implementation of infix to postfix, evaluation of postfix) * Introduction of Queue: Operations - *init()*, *enqueue()*, *dequeue()*, *isEmpty()*, *is Full()*, *peek()*, time complexity of operations, differences with stack. * Types of Queue - Linear Queue, Circular Queue, Priority Queue, Double Ended Queue ### Unit 5: Tutorial and Assignment (05 Period) ## References 1. Classic Data Structures-D. Samanta, Prentice Hall India Pvt. Ltd. 2. Fundamentals of Data Structures in C- Ellis Horowitz, SartajSahni, Susan Anderson-Freed, 2nd Edition, Universities Press. 3. Data Structures using C and C++-Yedidyah Langsam, Moshe J. Augenstein, Aaron M.Tenenbaum, Pearson Education 4. Data Structures: A Pseudo code approach with C, Richard Gilberg, Behrouz A. Forouzan, Cengage Learning. 5. Introduction to Data Structures in C-Ashok Kamthane, Pearson Education 6. Algorithms and Data Structures, Niklaus Wirth, Pearson Education # CMP-312: Advance C Programming **Course Code:** CMP-312 **Course Title:** Advance C Programming **Total Credits:** 02 **Contact Hours:** 30 (Clock Hours) **Marks:** 50 **Periods:** 45 (45 minutes each) **Objective:** * The students would be able to obtain in depth knowledge of C language. * The students would be able to understand advanced features of C Programming Language. ### Unit 1: Functions (10 Period) * User Defined Functions: Introduction, Elements of UDF * Categories of UDF: No argument no return value, Arguments but no return value, No argument but returns a value, Arguments with return value * Recursion, Nesting Function, Variable Scope, Visibility and lifetime in function, Storage Classes ### Unit 2: Structures, Unions (10 Period) * Structures: Defining a structure, Accessing a structure variable, Operations on structure members, Copying and comparing variables, Arrays of structure, Arrays within Structures * Unions: introduction, example. ### Unit 3: Pointer (10 Period) * Definition and Concept: Advantage of using pointer, Pointer arithmetic * Pointer: Array of pointers, Pointers and Functions * Dynamic Memory Allocation: Memory Allocation Function, *malloc()*, *calloc()*, *realloc()*, *free()* ### Unit 4: Files and Preprocessors (10 Period) * Files: Concepts of File Management, Files functions - *fopen()*, *fclose()*, *fprintf()*, *fscanf()*, *fseek()*, *ftell()*, *rewind()*, *putc()*, *getc()*, *putw()*, *getw()*, Error handling functions. Command line argument * Preprocessors: Types of Preprocessors, Macro substitution directives * File inclusion directives, Compiler control directives ### Unit 5: Tutorial and Assignment (05 Period) ## References 1. Simplifying C (First Edition 2010), Publication: Dreamtech, by Harshal Arolkar and Sonal Jain 2. Programming in ANSI C (Fifth Edition 2011), Publication: Mc Graw Hill, by Balagurusamy 3. Programming in C (First Edition 2011), Publication: Oxford Higher Education, by Reema Thareja 4. Programming In C (Second Edition), Publication: Pearson Education, by Ashok N. Kamthane # CMP-321: Lab Course 3 (Based on CMP-311) **Course Code:** CMP-321 **Course Title:** Lab course 3 (based on CMP-311) **Total Credits:** 1.5 **Contact Hours:** 03 Hours (Week) **Marks:** 50 1. Write a program to store the elements in 1-D array and perform the operations like searching, sorting and reversing the elements. 2. Read the two arrays from the user and merge them and display the elements in sorted order 3. Write a program to perform the Matrix addition, Multiplication and Transpose Operation. 4. Write a program to implement the concept of Stack with Push, Pop, Display and Exit operations. 5. Write a program to convert an infix expression to postfix and prefix conversion 6. Write a program to implement Tower of Hanoi problem. 7. Write a program to implement the concept of Queue with Insert, Delete, Display and Exit operations. 8. Write a program to implement the concept of Circular Queue 9. Write a program to implement the concept of Deque. 10. Write a program to create the tree and display the elements. 11. Write a program to construct the binary tree 12. Write a program for inorder, postorder and preorder traversal of tree 13. Write a program to create a single linked list and display the node elements in reverse order 14. Write a program to search the elements in the linked list and display the same * Minimum three practical on each unit # CMP-322: Lab Course 4 (Based on CMP-312) **Course Code:** CMP-322 **Course Title:** Lab course 4 (based on CMP-312) **Total Credits:** 1.5 **Contact Hours:** 03 Hours (Week) **Marks:** 50 1. Write a program to calculate average temperature of five days. Create *temp()* function. 2. Write a program that uses recursive function *fibo()* that generates a Fibonacci series containing N elements. 3. Write a program that uses a recursive function *fact()* that finds the factorial of a given number N. 4. Program to find if the given no. is prime or not. The function should accept the number as argument and return if the no. is prime or not. 5. Write a function which accepts a character array as argument from the user. The function should print the ASCII equivalent of all the characters in the string. 6. Write a program to define structure with tag state with fields state name, number of districts and total population. Read and display the data. 7. Write a program to create a list of books details. The details of a book include title, author, publisher, publishing year, number of pages, and price. 8. Define a structure called Item with members: Item_code, Item_name, Price. Create an array of five Items. Create a function which accepts the Item array and modifies each element with an increase of 10% in the price. 9. Define a structure to represent a date. Use your structures that accept two different dates in the format mm dd of the same year. Write a C program to display the month names of both dates. 10. Define a structure that can describe a Hotel. It should have members that include name, address, grade, room charges, grade and no of rooms. Write a function to print out all hotel details with room charges less than a given value 11. Write a program to display contents of file on the screen. The program should ask for file name. Display the contents in capital case. 12. Write a program to find size of the file. 13. Write a program to combine contents of two files in a third file. Add line number at the beginning of each line. 14. Write a program to display number 1 to 100. Redirect the output of the program to text file. 15. Write a program to write contents of one file in reverse into another file * Minimum three practical on each unit # CMP-313(A): Office Automation **Course Code:** CMP-313(A) **Course Title:** Office Automation **Total Credits:** 02 **Contact Hours:** 30 (Clock Hours) **Marks:** 50 **Periods:** 45 (45 minutes each) **Objective:** * The students would be able to obtain in skill regarding the office tool and its related applications. * The students would be able to understand advanced features office tool. ### Unit 1: DOS and Windows Environment (10 Period) * DOS organization, DOS commands, Operating System: Batch, multi-programming, Time sharing, Networks operating system, On-line and Real time operating system, Distributed operating system, Multi-processor, Multi-tasking. * Graphical OS: Fundamentals of windows, Types of windows, Anatomy of windows, Windows explorer, Customizing windows, Control panel, Taskbar setting, Open Network and sharing centre. ### Unit 2: Word Processor (10 Period) * Applications of word processor, Common packages, Creating and saving documents, Editing documents, Formatting text and paragraphs, Use of header footer, Insert table, Edit table, Mail merge, Macros ### Unit 3: Spread Sheet (10 Period) * Concept of worksheets and workbooks, Creating workbook, Editing a work sheet, Formatting data, Doing basic calculations using formulae, Using simple statistical functions, Inserting charts, Printing workbook. ### Unit 4: Power Point (10 Period) * Templates, Views, Formatting slide, Slides with graphs, Animation, using special features, presenting slide shows ### Unit 5: Tutorial and Assignment (05 Period) ## References 1. R.K. Taxali: Introduction to Software Packages, Galgotia Publicaions. 2. MS-Office 2003, Compiled by SYBIX. 3. MS-Office 2003, BPB Publications. 4. Introduction to Computer, P.K. Sinha. 5. Fundamental of Computers - By V. Rajaraman B.P.B. Publications # CMP-313(B): HTML Programming **Course Code:** CMP-313(B) **Course Title:** HTML Programming **Total Credits:** 02 **Contact Hours:** 30 (Clock Hours) **Marks:** 50 **Periods:** 45 (45 minutes each) **Objective:** * The students would be able to obtain in skill regarding the web development and its related applications. * The students would be able to understand advanced features HTML. ### Unit 1: Introduction (10 Period) * Basic Concept, Internet, Internet Domains world wide web, Protocols definition, Overview of TCP/IP, Telnet. * Web page, Web site, web browser, Web server,web, Client, Communication between browser and web server, Web site architecture. * Structure of HTML program HTML paired tags, Text formatting: paragraph, line break, headings, drawing lines. Text styles: Bold, italics, underline. Lists: types of lists viz. unordered, ordered, definition lists ### Unit 2: Links and Image (10 Period) * Linking documents (Links): External document references, internal document references. * Introduction to frames: frameset and frame tag. Putting an Image on a Page, Using Images as Links, Putting an Image in the Background ### Unit 3: Tables and Forms (10 Period) * Creating a Table, Table Headers, Captions, Spanning * Multiple Columns, Styling Table. * Introduction to forms, form design and form tag. ### Unit 4: Introduction to DHTML (10 Period) * Overview of dynamic HTML. Cascading Style Sheets, font ,color,background ### Unit 5: Tutorial and Assignment (05 Period) ## References 1. Web Enabled commercial Application Development Using HTML, DHTML, JavaScript by -Ivon Bayross. 2. Complete reference HTML, Narosa Publication 3. Cassidy Williams, Camryn Williams Introduction to HTML and CSS, O'Reilly, 2015