MCA 1 Syllabus PDF

Department of Computer Applications Choice Based Credit System Scheme- MCA Batch 2024-2026 First Year - Semester I (Odd Sem) Course Sr. No. Courses L T P Credit Code...

Department of Computer Applications Choice Based Credit System Scheme- MCA Batch 2024-2026 First Year - Semester I (Odd Sem) Course Sr. No. Courses L T P Credit Code 1 CA5BS04 Mathematics of Computer Applications 4 0 0 4 2 CA5CO33 Advanced C Programming 4 0 0 4 3 CA5CO34 Data Structures and Algorithm 4 0 0 4 4 CA5CO35 Modern Operating System 4 0 0 4 5 CA5CO38 Advanced Database Management System 3 0 0 3 6 CA5CO23 Programming Lab I 0 0 2 1 7 CA5CO24 Database Lab 0 0 2 1 8 CA5CO10 Data Structures Lab 0 0 4 2 9 CA5MC02 Technical Communication and Soft Skills 2 0 0 0 Total 21 0 8 23  Hours per Week Course Code Course Name L T P Credits Mathematics of Computer CA5BS04 4 0 0 4 Application Course Learning Objectives (CLOs): CLO 01 To understand the concepts of sets and functions and to distinguish different types of functions and identify & describe various types of relations and their graphs. CLO 02 To understand Boolean algebra and its applications to Computer Sciences including Mathematical Logic and to describe Lattices and Posets and their uses. CLO 03 Equip the students with the knowledge of group theory and its application in computer science as coding theory. CLO 04 To study the concepts of various graphs and apply Graph theory and trees in Computer Science and formulate computational problems. CLO 05 To develop the ability to solve the recurrence relations by using various methods. Unit- I: Methods of Proof and Combinatorics: Methods of Proof-Direct Proofs, Indirect Proofs, Mathematical Induction, Method of Contradiction. Combinatorics: Permutations and Combinations, Pigeon Hole Principle and simple applications. Unit – II Graph Theory-I: Basic definitions of Graphs, Isomorphism, Walk, Path, Circuit, connectivity of a graph, cut points, cycles, Hamiltonian graphs, sub graphs, spanning sub graphs, isomorphic graphs, Digraphs(basic definitions of digraphs), Matrix Representation of Graphs (Adjacency, Incidence Matrices and Circuit Matrix). Unit - III Graph Theory-II :Weighted graph, Shortest Path in a weighted graph: Dijkstra's Algorithm, Tree, Properties of Tree, Binary Tree, Fundamental Circuit, Minimal Spanning Tree: Kruskal's Algorithm, Prim’s Algorithm. Unit – IV Group Theory: Definition and basic properties of group, Order of an element of a group, Abelian groups, Subgroups, Algebra of subgroups, Cyclic groups and their simple properties, Coset decomposition and related theorems, Lagrange's theorem and its consequences. Unit- V Recurrence relation and generating function: Introduction to Recurrence relation and Recursive algorithms, Linear recurrence relation with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions, Generating functions, Solution by method of generating function. Text Books: 1. C. L. Liu; Elements of Discrete Mathematics, Tata McGraw-Hill Edition. 2. Kenneth H. Rosen; Discrete Mathematics and Its Applications, Tata McGraw-Hill Edition. 3. Eric Lehman , Tom Leighton; Mathematics for Computer Science , MIT. Reference Books: 1. Narsingh Deo; Graph Theory with Applications to Engineering and Computer Science. 2. J.P. Tremblay and R. Manohar; Discrete Mathematical Structures with Applications to Computer Science, Tata Mc-Graw-Hill. Web Source: 1. nptel.ac.in/courses/111106050 2.nptel.ac.in/courses/106106094/32 Open Learning Source: 1. https://swayam.gov.in/courses/public 2. http://nptel.ac.in/course.php List of Practicals: Not Applicable. Course Outcomes (COs): After completion of this course the students shall be able to: CO01 Understand the fundamental knowledge of theorem proving techniques. CO02 Use various types of graphs for solving complex problems. CO03 Apply their knowledge in solving problems of group theory. CO04 Students will get exposed to group theory. CO05 Analyze the strong background of recurrence relation and generating function which has diverse applications in the areas of computer science.  Hours per Week Course Code Course Name L T P Credits CA5CO33 Advanced C Programming 4 0 0 4 Course Learning Objectives (CLOs): CLO01 To obtain in depth knowledge of C Language. CLO02 To understand advanced features of C Programming Language. CLO03 Designing of any software according to users requirements. Unit- I: Function, Recursion, and Strings Functions basics, application of functions. Recursion and its types, comparison of recursion and loops. Declaring and initializing strings, different ways of string I/O, operations on strings using user defined and in- built Functions, array of strings. Unit-II: Pointers What are pointers and its applications?, pointer variables, pointer operators, pointer and arrays, pointer to pointer, call by value and call by reference, array of pointers, pointer to an array, pass array to a function, pointers and strings, array of pointers to strings and its limitations, passing strings to functions, pointers to functions and its uses, array of function pointers, function returning pointers, dynamic memory allocation. Unit- III: Aggregate Data Types Structures-declaring and initializing, array of structure, array within structures, structures within structures, structure pointer, passing structure to functions, uses of structures. Unions, union of structures, structure within union, union within Structure. Enum, enum within structure. UNIT-IV: Files and Preprocessor Directives Application of file handling, file operations, text and binary files, file modes, file functions, small application of database management. C preprocessor directives, execution steps of C program, creating and implementing user defined header files. Unit-V: Advance Topics Typedef, command line arguments, variable number of arguments, self-referential structures, Career opportunities for C programming. Text Books: 1. Kernighan & Ritchie “The C programming language”, PHI 2. Schildt “C:The Complete reference” TMH. 3. Kanetkar Y. “Let us C”, BPB. 4. Kanetkar Y.: “Pointers in C” , BPB Problem and Assignments Book: 1. Kanetkar Y. “Let us C”, BPB. Reference Books: 1. Stephen Parata “C Primer Plus” 2. Paul Deitel and Harvey Deitel “C How to Program”. Web Resources · http://www.learn-c.org/ · https://www.dyclassroom.com/  · https://www.tutorialspoint.com/cprogramming/index.htm · https://fresh2refresh.com/c-programming/ · https://www.studytonight.com/c/ Course Outcomes (COs): After completion of this course the students shall be able to: CO01 Understand the basics of functions, recursion, strings, pointers, aggregate data type, file handling, and preprocessor directives. CO02 Recognize advanced programming concepts. CO03 Apply the knowledge of programming to solve complex problems. CO04 Evaluate the concepts of C programming. CO05 Create C programs that demonstrate a clear understanding of programming concepts  Hours per Week Course Code Course Name L T P Credits CA5CO34 Data Structure and Algorithm 4 0 0 4 Course Learning Objectives(CLOs): CLO 01 To impart the basic concepts of data structures. CLO 02 To understand concepts about searching and sorting techniques CLO 03 To understand basic concepts about stack, queues, lists, trees and graphs Unit- I: Stacks: Contiguous implementation of stack, Operations on Stack, Array and linked representations of stacks, stack applications-infix to postfix conversion, postfix expression evaluation, recursion implementation. Unit-II: Queue: Contiguous implementation of queue: Linear queue, its drawback; circular queue; various operations on queue; linked implementation of stack and queue- operations Unit- III: List: Singly linked list implementation, insertion, deletion and searching operations on linear list, circular linked list implementation, Doubly linked list implementation, insertion, deletion and searching operations. Applications of linked lists. UNIT-IV: Searching and Sorting: Sorting- selection sort, bubble sort, insertion sort, quick sort, merge sort, shell sort, radix sort. Searching: Linear and binary search methods, comparison of sorting and searching methods Unit-V Tree: definitions-height, depth, order, degree, parent and child relationship etc; Binary Trees, Tree traversals, expression tree- evaluation; linked representation of binary tree-operations. Graphs: related definitions: graph representations- adjacency matrix, adjacency lists, adjacency multi list; traversal schemes- depth first search, breadth first search; Minimum spanning tree; shortest path algorithm; Kruskals & Dijkstras algorithm. Text Books: 1. Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft. Data Structures and Algorithms 2. Tenebaum, Langsam & Augenstein, Data Structures Using C, Pearson Reference Books: 1. Horowitz and Sahani, Fundamentals of data Structures, University Press 2. Trembley and Sorenson, Data Structures, TMH Publications 3. Venkatesan, Rose, Data Structures, Wiley India Pvt. Ltd Web Resources 1. https://www.studytonight.com/data-structures/introduction-to-data-structures 2. https://www.tutorialspoint.com/data_structures_algorithms/data_structures_basics.htm 3. https://www.javatpoint.com/data-structure-tutorial 4. toolsqa.com/data-structures/ 5. https://www.hackerearth.com/practice/data-structures/arrays/1-d/tutorial/ Course Outcomes (COs): After completion of this course the students shall be able to: CO01 Recall the basic concept of Array. CO02 Describe stack, queue, linked list, and Graph Concepts. CO03 Apply the concept of Stack, Queue, Link list, Tree, and Graph for solving complex problems CO04 Examine the techniques of searching & sorting. CO05 Compare Stack & Queue, Tree & Graph.  Hours per Week Course Code Course Name L T P Credits CA5CO35 Modern Operating System 4 0 0 4 Course Learning Objectives(CLOs) CLO 01 To know purpose, structure and functions of operating systems CLO 02 To study various process scheduling algorithms CLO 03 To know process synchronization CLO 04 To provide hardware and software issues in modern distributed systems Unit-I Introduction to Operating Systems: Operating Systems Overview- Overview and Functions of operating systems, protection and security, distributed systems, operating systems structures, services, system calls and their working. History and generation of operating system. Unit-II Process and Threads: Process concepts, threads, scheduling-criteria, algorithms, and their evaluation. Process Scheduling; Thread scheduling, case studies UNIX. Linux. Windows Unit-III Concurrency Control (IPC):Process synchronization, critical- section problem. classic problems of synchronization, Software Solutions for synchronization problem. Hardware Solutions for synchronization problem. Synchronization and their applications. Understanding of Semaphore – Mutex – Monitor – Event Counters Unit-IV Advanced Operating Systems: Distributed Operating system: architecture, Design issues, Distributed mutual exclusion, distributed deadlock detection, shared memory, Distributed scheduling. Multiprocessor operating systems: architecture, operating system design issues, threads, process synchronization, process scheduling, memory management, reliability and fault tolerance. Unit-V Distributed Resource Management: Distributed File systems, Architecture, Mechanisms, Design Issues, Distributed Shared Memory, Architecture, Algorithm, Protocols – Design Issues. Distributed Scheduling, Issues, Components, Algorithms. Text Books 1. Abraham Silberchatz, Peter B. Galvin, Greg Gagne -Operating System Concepts 2. Andrew S Tanenbaum, PHI, Modern Operating Systems. 3. D. M. Dhamdhere. TMH ,Operating systems- A Concept based Approach Reference Books 1. Stallings, Pearson education, Operating Systems - Internals and Design Principles. 2. B. L. Stuart. Cengage learning, India Edition, Principles of Operating Systems 3. Mukesh Singhal and N. G. Shivaratri, McGraw Hill Advanced Concepts in Operating Systems. 4. A. S. Godbole, TMH, Operating Systems.  Web Resources: · http://williamstallings.com/OS/Animation/Animations.html · http://nptel.ac.in/courses/106106144/ · http://nptel.ac.in/courses/106108101/ · http://codex.cs.yale.edu/avi/os-book/OS9/slide-dir Course Outcomes (COs): After completion of this course the students shall be able to: CO01 Understand the basic concept of operating systems, Distributed operating system, CPU scheduling, Inter-process Communication, Semaphore – Mutex – Monitor – Event Counters. CO02 Understand the architecture and design issues of Distributed Operating Systems. CO03 Analyze the case study of UNIX, LINUX, and Windows. CO04 Comparing different deadlock detection algorithms. CO05 Explain the theory of: processes, threads, resource control and scheduling.  Hours per Week Course Code Course Name L T P Credits Advanced Database CA5CO38 3 0 0 3 Management System Course Learning Objectives (CLOs): CLO01 To understand the basic concepts and terminology related to DBMS and Relational Database Design CLO02 To the design and implement Parallel and Distributed Databases. CLO03 To understand advanced DBMS techniques to construct tables and write effective queries, forms, and reports. Unit- I: Database Concepts: File System v/s Database System, Users of Database System, Data Independence, DBMS system architecture Entity-Relationship (ER) Model: Entity Types, Entity Sets, Attributes & Keys, Relationships, Roles and Structural Constraints, E-R Diagrams, Reduction of an E-R Diagram to Tables Extended Entity-Relationship (EER) Model: Generalization, Specialization and Aggregation. Unit-II: Normalization: The Purpose of Normalization, How Normalization Supports Database Design, Data Redundancy and Anomalies, Functional Dependencies, Characteristics of Functional Dependencies, The Process of Normalization, First Normal Form (1NF), Second Normal Form (2NF), Third Normal Form (3NF), Boyce—Codd Normal Form (BCNF), Fourth Normal Form (4NF), Multi- Valued Dependency, Fifth Normal Form (5NF), Lossless-Join Dependency. Unit-III: Transactions and Concurrency Control : Basic concept; ACID properties; transaction state; implementation of atomicity and durability; concurrent executions; basic idea of serializability; view and conflict serializability Recovery Techniques Failure Classification, Storage Structure, Recovery and Atomicity Log Based Recovery; deferred database modification, immediate database modification, checkpoints. UNIT-IV: Parallel and Distributed Databases: Architectures for Parallel Databases, Parallel Query Evaluation, Parallelizing Individual Operations, Bulk Loading and Scanning, Sorting, Joins. Distributed Databases: Types of Distributed Databases, Distributed DBMS Architectures, Client- Server Systems, Collaborating Server Systems, Middleware Systems, Storing Data in a Distributed DBMS, Fragmentation, Replication. Unit-V Object Relational Database Systems: Introduction, Database Design for an ORDBMS, New Challenges in Implementing an ORDBMS, OODBMS, Comparing RDBMS with OODBMS and ORDBMS. Enhanced Data Models for Advanced Applications: An overview of Active Databases, Temporal database, Spatial Databases, Deductive Databases, Mobile Database, Multimedia Databases. Database Design Case Study: Online Retail Shopping, Airline Reservation System etc. Text Books: 1. R. Ramakrishnan, J. Gehrke, Database Management Systems, McGraw Hill. 2. Silberschatz, H. Korth, S. Sudarshan, Database system concepts, McGraw Hill. 3. R Elmarsi, & S B Navathe, Fundamental of Database System, Pearson Education. Reference Books: 1. F. R. Mcfadden, J. Hoffer and M. Prescott, Modern Database Management, Addison Wesley. 2. B.C. Desai, An introduction to Database Systems, BPB. 3. Raghurama Krishnan, Database Systems, TMH. Web Resources Not Applicable. List of Practical Not Applicable. Course Outcomes (COs): After completion of this course the students shall be able to: CO01 Understand the basic principles of database management systems and ER Models. CO02 Apply various normalization techniques for removing data redundancy. CO03 Analyze transaction processing and concurrency control concepts. CO04 Understand the basics of parallel and distributed databases.. CO05 Assess the basics of Object relational databases and enhanced data models.  Hours per Week Course Code Course Name L T P Credits CA5CO24 Database Lab 0 0 2 1 Course Learning Objectives (CLOs): Not Applicable List of Practical Lab Assignment – 1 SQL The following tables form part of a database held in a relational DBMS: Hotel (hotelNo, hotelName, city) Room (roomNo, hotelNo, type, price) Booking (hotelNo, guestNo, dateFrom, dateTo, roomNo) Guest (guestNo, guestName, guestAddress) Where Hotel contains hotel details and hotelNo is the primary key; Room contains room detals for each hotel and (roomNo, hotelNo) forms the primary key; Booking contains details of bookings and (hotelNo, guestNo, dateFrom) forms the primary key; Guest contains guest details and guestNo is the primary key. Simple Queries 1. List full details of all hotels. 2. List full details of all hotels in London. 3. List the names and addresses of all guest living in London, alphabetically ordered by name. 4. List all double or family rooms with a price below $40.00 per night, in ascending order of price. 5. List the names for which no dateTo has been specified. 6. List all single rooms with a price below $40.00 per night. 7. List the name and cities of all guests. 8. List the price and type of all rooms at the Grosvenor Hotel. 9. List the guests currently staying at the Grosvenor Hotel. 10. List the details of all rooms at the Grosvenor Hotel, including the names of the guest staying in the room, if the room is occupied. 11. List the guest details (guestNo, guestName, and guestAddress) of all guests staying at the Grosvenor Hotel. Grouping 1. List the number of rooms in each hotel. 2. List the number of rooms in each hotel in London. 3. What is the average number of bookings for each hotel in August? 4. What is the most commonly booked room type for each hotel in London? What is the lost income from unoccupied rooms at each hotel today? Lab Assignment – 2 SQL The following tables form part of a database held in a relational DBMS: Figure: The supplier-parts-project database (Sample Values) Write SQL Queries for the above database: 1 Get Full details of all projects. 2 Get Full details of all projects in London. 3 Get supplier numbers for suppliers who supply projects J1. 4 Get all shipments where the quantity is in the range 300 to 750 inclusive. 5 Get all part-color/part-city pairs. Note : Here and subsequently, the terms “all” means “all currently represented in the database, “ not “all possible”. 6 Get all supplier -number/part- number/project- number triples such that the indicated supplier, part and project are all collocated (i.e. all in the same city). 7 Get all supplier -number/part- number/project- number triples such that the indicated supplier, part and project are not all collocated. 8 Get all supplier -number/part- number/project- number triples such that no two of the indicated supplier, part and project are collocated. 9 Get full details for parts supplied by the supplier in the London. 10 Get part numbers for parts supplied by a supplier in London to a project in London.  11 Get all pairs of city names such that a supplier in the first city supplies a project in the second city. 12 Get part numbers for parts supplied to any project by a supplier in the same city as that project. 13 Get project numbers for projects supplied by at least one supplier not in the same city. 14 Get all pairs of part numbers such that some supplier supplies both the indicated parts. 15 Get the total number of projects supplied by supplier S1. 16 Get the total quantity of part P1 supplied by supplier S1. 17 For each part being supplied to a project, get the part number, the project number, and the corresponding total quantity. 18 Get part numbers of parts supplied to some project in an average quantity of more than 350. 19 Get project names for projects supplied by supplier S1. 20 Get colors of parts supplied by supplier S1. 21 Get part numbers for parts supplied to any project in London. 22 Get project numbers for projects using at least one part available from supplier S1. 23 Get supplier numbers for suppliers supplying at least one part supplied by at least one supplier who supplies at least one red part. 24 Get supplier numbers for suppliers with a status lower than that of supplier S1. 25 Get project numbers for projects whose city is first in the alphabetic list of such cities 26 Get project numbers for projects supplied with part P1 in an average quantity greater than the greatest quantity in which any part is supplied to project J1 27 Get supplier numbers for suppliers supplying some project with part P1 in a quantity greater than the average shipment quantity of part P1 for that project. 28 Get project numbers for project not supplied with any red part by any London supplier. 29 Get project numbers for projects supplied entirely by supplier SI. 30 Get part numbers for parts supplied to all projects in London. 31 Get supplier numbers for suppliers who supply the same part to all projects. 32 Get project numbers for projects supplied with at least all parts available from supplier SI. 33 Get all cities in which at least one supplier. Part. Or project is located. 34 Get part numbers for parts that are supplied either by London supplier or to a London project. 35 Get supplier-number/part-number pairs such that the indicated supplier does not supply the indicated part. 36 Get all pairs of supplier numbers, Sx and Sy say. Such that Sx and Sy supply exactly the same set of parts each. Note: For simplicity, you might want to use the original suppliers- and-part data-base for this exercise, instead of the expanded suppliers-partprojects database. 37. Get a “grouped” version of all shipment showing, for each suppliers-number/partnumber pair, the corresponding project numbers and quantities in the form of a binary relation. Course Outcomes (COs): After completion of this course the students shall be able to: CO 01 Understand how to transform an information model into a relational database schema and use a data definition language and/or utilities to implement the schema using a DBMS. CO 02 Determine how to use an SQL interface of a multi-user relational DBMS package to create, secure, populate, maintain, and query a database. CO Illustrate the methods to develop applications using basic and modern database 03 techniques as per organization requirements. CO Study how to test various database techniques in developing data-intensive applications. 04 CO Simulate various database systems using available tools. 05  Hours per Week Total Course Code Course Name L T P Hrs. Credits CA5CO23 Programming Lab I 0 0 2 2 1 List of Practical Programs on functions 1. Find factorial of a number using function 2. Find a number is prime or not using function 3. Find the sum of series 1+x+x2/2! +x3/3!+…+xn/n! Use functions to calculate power and factorial 4. Find the sum of series x-x3/3!+x5/5! … Use functions to calculate power and factorial Programs on strings. 1. Find length of a string using in-built function and using user defined function 2. Copy one string to another using in-built function and using user defined function 3. Concat two strings using in-built function and using user defined function 4. Reverse a string using in-built function and using user defined function 5. Find a name is present in a set of strings or not. Programs on pointers 1. Add two numbers using pointer 2. Access elements of One –dimension and two-dimension array using pointers 3. Swap two numbers using call by reference 4. Find largest number in a array using dynamic memory allocation 5. Swap two names in a set of strings using array of pointers to strings. 6. Call a function using function pointer 7. Find addition, subtraction, multiplication and division of two numbers using array of function pointers. Programs on structure 1. Create a structure to specify data on students given below: Roll number, Name, Department, Course, Year of joining. Assume that there are not morethan 450 students in the college.  a. Write a function to print names of all students who joined in Particularyear. b. Write a function to print the data of a student whose roll number isgiven. c. Write a function to sort data of a student in alphabetical order ofnames. 2. Create a structure to specify data of customers in a bank. The data to be storedis: Account number, Name, Balance in account. Assume maximum of 200 customers in the bank. a. Write a function to print the Account number and name of eachcustomerwith balance below Rs.100. b. If a customer request for withdrawal or deposit, it is given in theform: Acct.no, amount, code (1 for deposit, 0 for withdrawal) c. Write a program to give a message, “The balance is insufficient for the specifiedwithdrawal”. Programs on File Handling 1. Read and write character by character in a text file. 2. Write a program to copy one file to another. While doing so replace alllowercase characters to their equivalent uppercase characters. 3. Add content of one file at the end of another Suppose a file contains student’s records with each record containing name and age of a student. Write aprogram to read these records and display them in sorted order by name. Course Outcomes (COs): After completion of this course the students shall be able to: CO 01 Understand the basics of functions, recursion, strings, pointers, aggregate data type, file handling, and pre- processor directives. CO 02 Recognize advanced programming concepts. CO 03 Apply the knowledge of programming to solve complex problems. CO 04 Evaluate the concepts of C programming. CO 05 Create C programs that demonstrate a clear understanding of programming concepts.  Hours per Week Total Course Code Course Name L T P Hrs. Credits CA5CO10 Data Structures Lab 0 0 4 4 2 List of Practical 1. Find sum of elements of an array and reverse an array 2. Search an element using Linear search and Binary Search 3. Insert and remove an element from an array 4. Copy one array to another. 5. Addition, subtraction and multiplication of two matrices 6. Find factorial of a number using function 7. Find a number is prime or not using function 8. Find the sum of series 1+x+x2/2! +x3/3!+…+xn/n! using function 9. Use functions to calculate power and factorial 10. Find the sum of series x-x /3!+x5/5! … using function 3 11. Find factorial of a number using recursion 12. Find a to the power b using recursion 13. Print fibonacci series using recursion 14. Sum of digits of a number using recursion 15. Add two numbers using pointer 16. Access elements of One –dimension and two-dimension array using pointers 17. Find largest number in a array using dynamic memory allocation 18. Swap two names in a set of strings using array of pointers to strings. 19. Write a program for push and pop on Stack using array 20. Write a program for insert and delete on Queue using array 21. Write a program for insert and delete on Circular Queue using array 22. Write a program for insert and delete on Dequeue Queue using array 23. Write a program for insert and delete on priority queue using array 24. Write a Menu-Driven program for following on singly link – list a. Insert a node at end b. Insert a node at beginning c. Insert a node at some location d. Delete a node at end e. Delete a node at beginning f. Delete a node from a position  g. Searching h. Display 25. Write program no. 24 for circular link list, doubly link list, doubly circular link list. 26. Write a program for push and pop on Stack using link list 27. Write a program for insert and delete on Queue using link list 28. Write a program for binary tree operations -Addition new nodes into the tree, Deletion nodes from the tree, Searching a node and Display 29. Write a program for Sequential Search 30. Write a program for Binary Search 31. Write a program for Bubble Sort 32. Write a program for Selection Sort 33. Write a program for Insertion Sort 34. Write a program for Shell Sort 35. Write a program for Merge Sort 36. Write a program for Quick Sort 37. Write a program for Radix Sort Course Outcomes (COs): After completion of this course the students shall be able to: CO01 Recall the basic concept of Array. CO02 Describe stack, queue, linked list, tree and Graph Concepts. CO 03 Apply the concept of Stack, Queue, Linked list, Tree, and Graph in real-life computer science applications CO 04 Examine the techniques of searching & sorting. CO 05 Compare Stack & Queue, Tree & Graph  Hours per Week Total Total Course Code Course Name L T P Hrs. Credits CA5MC02 Technical Communication and Soft Skills 2 0 0 2 0 Unit-I Developing effective communication skills; Process, characteristics and principles, channels, verbal and non- verbal types, barriers to effective communication, importance of effective communication, Importance of Feedback in communication Unit-II Listening Skills Listening: meaning, process, difference between hearing and listening, types, barriers, importance. Developing Listening Skills Unit-III Developing speaking skills: Oral Presentation –Delivery using Audio – Visual Aids with stress on body language and voice modulations. (Topics to be selected by the Instructor for presentations), speeches, extempore, JAM, Interview skills, Group discussion skills. Unit-IV Developing Writing Skills and Business Correspondence - Business Letters, Parts & Layouts of Business Letters, Writing job application and Resume, Calling/ Sending Quotations/ Orders/ Complaints and E-mails Unit-V Report writing- types of reports, format, Presenting Diagrams/Graphs/Charts/Tables, Searching, Organizing, Presenting, Submitting. Technical description, Writing abstracts/Summary/Synopsis, Text Books: 1. Rai U S, Rai SM. Effective Communication. Himalaya Publishing House. 2. Korlahalli J.S. ,Rajendra Pal. Essentials of Business Communication All Courses.Sultan Chand & Sons 3. Krishna Mohan, Sharma R C. Business Correspondence and Report Writing. Mc Graw Hill Education, New Delhi. Fourth Edition. Reference Books: 1. Thompson A.J, A. V. Martinet. A Practical English Grammar. Oxford UP. New Delhi. 2. Kumar Sanjay, PushpaLata. English for Effective Communication. Oxford UP. New Delhi. 3. Kumar Sanjay, PushpaLata Communication Skills. Oxford UP. New Delhi. II Edition Course Outcomes (COs): After completion of this course the students shall be able to: CO01 Understand various channels of communication. CO02 Develop listening skills by understanding types and avoiding barriers CO 03 Analyze their own presentation skills and improve it. CO 04 Write letters and emails in proper formats CO 05 Presenting ideas in the written format systematically in the form of reports.