Course image Compiler Design (BSc) - 2023
BSc - CS

Objective: The objective of the theory of computing is to introduce and study abstract, mathematical models of computation (such as finite state, push down & Turing machines), and to use the abstract machines models to study the ability to solve computational problems. One such application is a compiler. It is important to understand the process by which programs written in high-level languages are translated and executed. After completing the course, students will be able to use regular expression effectively and appropriately, construct derivations and parse trees, understand the equivalence of grammars, languages & automata and translate between grammars, languages & automata.


Course image CSC-100: PROGRAMMING IN C AND INTRODUCTION TO DATA STRUCTURES
BSc - CS

Course Objectives

The course is designed to introduce programming concepts using C language to students and to introduce basic data structures and their uses. The aim of this course is to prepare the students to be able to write C programs using suitable data structures to solve real-world problems.Learning Outcome

On successful completion of the course, students will be able to:

 Solve real-life problems of reasonable complexity using suitable and efficient programming constructs in C

 Understand and apply the concepts of arrays, pointers, structures to implement efficient algorithms

 Understand the fundamentals of data structures such as linked lists, stacks, and queues, and be able to implement them in C.

 Use pointers in C to manipulate memory and pass parameters to functions.

 Implement sorting and searching algorithms in C

Course image Database Management System (MDJ)
BSc - CS

This course covers introduction to DBMS, functional dependencies and normalization.

Course image CS101-Introduction to Data Structures Using C-FJJ
BSc - CS

The objective of the course is to introduce the fundamentals of C programming language and develop the skills for solving problems using computers. The topics covered in the paper will be to: In this part of the paper covered by me, we will see:

  • Linear Linked list: Creation and Related Operations
  • Trees: Creation and Related Operations and various types of trees
  • Graph: Creation and Related Operations
  • Searching and Hashing: Linear and Binary Search. Hashing Methods and related issues.