BTech in Computer Science & Engineering
The department offers 4-year undergraduate degree program offering Bachelor of Technology (B.Tech.) degree in Computer Science & Engineering with an intake of 120 students. The objective of the program is to produce well-trained and professionally competent engineers imbibed with the knowledge and capability to face the dynamic and increasing challenges of the professional society. The course curriculum is a balanced mix of classical and professional courses relating to the basic and applied sciences, as well as the scientific and technological methodologies. The program also has the provision of electives, which encourage and enable the students to specialize in streams of their choice. Keeping in pace with the current technological trends and the demands, the curriculum is upgraded from time to time through the introduction of new electives and compulsory courses. Some of the obligatory courses are as following:
Fundamentals of Computers and Programming in C (6 credits)
An Overview of Computer System, Introduction to computer architecture; memory, ALU, CPU, I/O devices. Introduction to system software; operating systems, compilers and multi-user environments Basics of Operating System, introduction to Computer Networks, Concept of an algorithm; Use of high-level programming language for the systematic development of programs. Introduction to Programming Languages, An Overview of C, Functions in C, Introduction to Structure and Union in C, Overview of Pointers, Introduction of Data Structure in C.
CSL 209 Data Structures & Algorithms (5 credits)
Definition of data structures, Arrays: I Stacks: Definition of Array-based implementation of stacks. Infix, postfix and prefix examples, conversions, Recursion: Introduction, Tower Of Hanoi. Queues: Definition, Array-based implementation of queues. Circular implementation of queues, Applications Of Queues. Double-ended Queues and its Implementation, Priority Queues. Linked List: Dept. of CSE & IT Bachelor of Computer Science and Engineering Introduction, Operations (Insertion and deletion) on single linked list. Double linked List and its implementation, Definition of trees, Tree terminology and tree types. Properties of Binary trees and implementation and traversal in order, pre order and post order. Binary Search Trees and its implementation. Threaded trees, B trees (Insertion and Deletion). AVL trees and its implementation, Applications of trees. Big O notations, Comparison with omega and theta notation, Best, worst and average case, Examples. : Linear and Binary Search. Insertion Sort, Quick Sort, Heap, heap insertion, deletion, heap sort, Definition of undirected and directed graphs and networks and their types, Graph traversals and applications
CSL207 Programming Languages (3 credits)
The basic thrust of this course will be on learning the distinctive techniques in the different paradigms and what semantic and compiling issues come up in the various languages considered. Introduction, various language paradigms, Notions of syntax and semantics of programming languages; introduction to operational/natural semantics of functional and imperative languages. Data abstractions and control constructs; block-structure and scope, principles of abstraction, qualification and correspondence; Structured data objects, Subprograms and Programmer Defined Data Types, Sequence Control, Data Control, Storage Management Features of functional and imperative languages; The untyped and simply-typed Lambda calculus' type systems for programming languages including simple types and polymorphism. Comparisons of various programming languages.
About the School
Engineering is the application of physical principles to the solution of problems and requires the skills of numeracy, creativity, ingenuity and practicality. Engineering is a wide – ranging professio ... Read More