The objectives of this course are to make the student understand programming language, programming, concepts of Loops, reading a set of Data, stepwise refinement, Functions, Control structure, Arrays, Structures, Unions, and Pointers. After completion of this course the student is expected to analyze the real life problem and write a program in ‘C’ language to solve the problem. The main emphasis of the course will be on problem solving aspect i.e. developing proper algorithms.
Course Number: 20Contact Hours per Week: 4TNumber of Credits: 4Number of Contact Hours: 64 Hrs.Course Evaluation: Internal – 20 Marks + External – 80 Marks Objective • To understand internals of Microprocessor.• To learn architecture of 8085 Microprocessor• To learn instruction set of 8085 Microprocessor• To learn how to program a Microprocessor Prerequisites • Basic knowledge of Computer
Objective • To learn the basics of Computer Graphics. Prerequisites • Basic knowledge in Mathematics and Computer fundamentals.
BCS4B05 – Database Management System and RDBMS Contact Hours per Week: 7 (3T + 4L) Number of Credits: 3 Number of Contact Hours: 112 Hrs. Course Evaluation: Internal – 15 Marks + External – 60 Marks Objective• To learn the basic principles of database and database design• To learn the basics of RDBMS• To learn the concepts of database manipulation SQL• To study PL/SQL language By the end of the course, students will be able to: Understand Database Concepts: Grasp the fundamental principles of databases, including their structure, function, and importance in modern applications. Design Databases: Develop and design a well-structured database using principles of database design and normalization. Implement RDBMS: Demonstrate a solid understanding of Relational Database Management Systems (RDBMS) and how they are used to manage data efficiently. Manipulate Data with SQL: Apply SQL for database manipulation, including querying, updating, and managing databases. Employ PL/SQL: Utilize PL/SQL to create and manage complex database applications with stored procedures, functions, and triggers. Analyze and Optimize Queries: Analyze query performance and optimize SQL queries for better efficiency. Secure Databases: Understand and implement basic database security measures to protect data from unauthorized access and breaches. Troubleshoot Database Issues: Identify, analyze, and resolve common database-related issues. Collaborate on Database Projects: Work effectively in teams to design, implement, and manage databases as part of larger software development projects.
Credit:4 Lectureper week:3 Practicalper week:2 Course Outcomes (CO): CO1 Differentiate basic data structures (arrays, linked lists, stacks, queues) based on their characteristics,operations, and real-world applications. CO2 Perform basic operations (e.g., )insertion, deletion, search) on fundamental data structures using a chosen programming language. CO3 Identify the properties and applications of advanced data structures (trees,graphs). CO4 investigate the properties of various searching and sorting Techniques CO5 Demonstrate critical thinking and problem-solving skills by applying data structures and algorithms to address complex computational challenges. CO6 Implement and analyse different data structure algorithms(to solve practical problems Detailed Syllabus:ModuleUnit Content Hrs(45+30)Marks(70)I Introduction to Data Structures and Basic Algorithms 1 Overview of Data Structures: Data type Vs. Data structure, ADT,Definition of Data structure, Data structure Classification – Linear, Non- Linear (Array, Linked List, Stack, Queue, Tree, Graph) Introduction to Arrays: Definition, Types (1 Dimensional, 2Dimensional, Multi-Dimensional, Sparse matrix), Different Array Operations with Algorithm (insertion, deletion, traversal Structures and Self-referential structures Introduction to Linked list: Definition, Types (Single linked list,Doublelinked list, Circular linked list- concept only). Singly Linked List Operations with Algorithm (insertion, deletion,traversal) 2 Introduction to Stack: Definition, stack operations with Algorithm, Applications: recursion, infix to postfix - example and Algorithm Implementation of Stack: using array (overflow & underflow) and Linkedlist (with algorithm) Introduction to Queue: Definition, queue operations with Algorithm, Types: Double ended queue (Input Restricted and Output restricted), Circular queue, Applications Implementation of Queue: using array and Linked list (withalgorithm)I 3 Non- Linear Data Structures Introduction to Trees: Basic terminology, Types(Binary tree- complete,full, skewed etc., Expression Tree) Properties of Binary tree, Applications. Binary tree representations- using array and linked list 2 Operations on Binary tree- Insertion, Deletion, Traversal- inorder, preorder, postorder - (concepts with examples) Algorithm of non-recursive Binary tree traversal Introduction to Graph: Definition, Basic terminology, Types (Directed,Undirected, Weighted). Graph representation –Adjacency list and Adjacency Matrix, Applications. 4 Sorting and Searching : Introduction to Sorting: Definition, Classification (Internal, External) Internal Sorting Algorithms: Selection sort- Selection sort algorithm, Exchange sort- Bubble sort algorithm External Sorting Algorithms: Merge sort- Demonstrate with example.(NoAlgorithm needed) Advanced sorting Algorithm-: Quick sort- Demonstrate with example. Introduction to Searching: Linear search and Binary search(Algorithm needed) with example. Hashing: Hash Tables, Hash Functions, Different Hash Functions –Division method, Multiplication method, Mid square method, Folding Method, Collision and Collision resolution Techniques: Open hashing- Chaining, Closed hashing- Probing5 5 Hands-on Programming in Data Structures: Practical Implement the following: 1. Basic Operations in a single linked list (Menu driven) 2. Sort the elements in given singly linked list 3. Stack using array. 4. Stack using Linked list 5. Queue using Array 6. Queue using Linked list 7. Sorting algorithms- Selection, Bubble Sort 8. Searching Algorithms- Linear and Binary search
Credit:4 Lecturre per week:3 Practicalper week:2 Total:Hour:5 Course Summary This course provides a comprehensive overview of computing, covering historical milestones, hardware components, software systems, and computational thinking principles. Students will explore the evolution of computing systems, from early pioneers to modern processors and quantum units. The curriculum delves into hardware intricacies, software distinctions, and essential concepts in computer science, emphasizing problem-solving skills and algorithmic thinking. Practical aspects include hands-on experiences with hardware assembling, operating system installation, algorithm and flowchart visualization. Course Outcomes (CO) CO1 Develop a foundational knowledge of computing systems, encompassing their historical development, evolutionar milestones, and the notable contributions key figures in the field. CO2 Acquire familiarity with diverse hardware components constituting a computer system. CO3 Gain practical expertise by engaging in hands- on activities focused on the installation and configuration of diverse hardware components within a computer system. CO4 Explore the spectrum of software types, and actively participate in the partitioning, installation, and configuration of operating systems to cultivate a comprehensive understanding of software systems. CO5 Develop a foundational understanding of computer science as a discipline, examining problems through the lens of computational thinking and cultivating analytical skills to address challenges in the field. CO6 Represent complex problems using algorithmic approaches and enhance problem- solving skills by visualizing solutions through the utilization of various software tools.
