Site Search

Community Search

Google Search

Site Search

Community Search

Google Search

Site Search

Community Search

Google Search

Course Catalogue

-- All Departments --Computer Science and EngineeringBusiness AdministrationEnglish and HumanitiesElectronics and Telecommunication EngineeringMedia Studies and JournalismMasters of Business AdministrationExecutive Masters of Business AdministrationGeneral Education ProgramInstitute for Sustainable Development

Course Code: CSE 101 Course Name: Introduction to Computer Studies Prerequisite: None Credit Hours: 3.00 Detailed Syllabus: Introduction: brief history and types of computers, application areas. Working principle of a computer system. Single and multi-user systems. Hardware: Organization and architecture, CPU, Motherboards & Microprocessors, Memory units: Primary memory, Secondary memory, Input & output (I/O) Devices, peripheral devices, AT/XT, ISA, FISA, PCI Bus Architecture. Software: Classifications, System software, Operating system concepts, importance, components and basic functions of DOS, Windows and UNIX operating systems. Application software, database, spreadsheet and word-processing software. Applications: Multimedia systems, computer networks: basic concepts on LAN, WAN rind Internet systems, Internet services, E-mail and WWW. Selection of computers, hardware, software and cost consideration.

Course Code: CSE 103 / CSE 103L Course Name: Structured Programming Prerequisite: CSE 101 Credit Hours: 3.00 + 1.00 Detailed Syllabus: Introduction to Computer Programming, Problem solving techniques, algorithm specification and development. Programming style, debugging and testing, documentation. Program design methodologies, structured and modular program design. Introducing computer language: Machine language, Assembly language, High-level language. Programming Languages and Paradigms: Classification, assembler and translators, source and object programs. Structured language. Procedural and non-procedural programming, (nodular programming, object oriented programming. Programming Language in C: Data types operators and conversions, Statements. Control structures, array of pointers, Structure, union and bit-field, External files.

Course Code: CSE 201 / CSE 202 Course Name: Object Oriented Programming Prerequisite: CSE 103 Credit Hours: 3.00 Detailed Syllabus: Introduction to object oriented programming: C++ as an object oriented language. Introduction to C+ + , Comparison of C and C+ + , Declaration and constants, expression and statements, data type:;, operator, Functions, Objects: Properties, events, methods, messages, data members, member functions, constructor & distracter functions, friend functions. Classes: Base, Derived and virtual class, inheritance, encapsulation. Operator and function, over-loading (Run time and compile time polymorphism) Template, streams, files, C-M- Library functions; Introduction to JAVA programming language.

Course Code: CSE 203 Course Name: Computer Organization and Architecture Prerequisite: CSE 201, CSE 207 Credit Hours: 3.00 Detailed Syllabus: Study of architectural concepts in computer systems. Computer arithmetic and arithmetic logic unit design. Memories, memory hierarchies and dynamic address translation. CPU characteristics, performance factors. Control unit design: hardware and micro-program, microprogramming. Interrupt mechanism. DMA. Pipelining. The course includes lab works based on theory taught.

Course Code: CSE 204 Course Name: Operating Systems Prerequisite: CSE 103, CSE 201 Credit Hours: 3.00 Detailed Syllabus: Introduction evolution goals and components of OS: types of OS. Process management, process states and state transition, process control blocks, job and process scheduling, scheduling levels, objective and criteria. CPU scheduling algorithms, process coordination, critical section problems, semaphores, language constructs classical problems of process coordination. Interposes communication, message and mailbox etc.. I/O programming: Device management techniques. Interrupt processing. Parallel processing. Deadlock, deadlock prevention, avoidance detection and recovery. Memory management, memory avocation schemes, paging and segmentation , virtual memory, page replacement strategies, working sets, demand paging. Secondary storage management, disk-scheduling algorithms. File management: file system functions, Hie organization, logical and physical file maps, tree structured file systems, space allocation, file catalogs, file access control mechanism, operating systems security. Time-sharing and virtual machines. Main Features of Windows NT, UNIX, VMS and VSE. Systems programming concepts: general machine structures, machine and assembly language, concepts of translation oriented system programs; Assemblers: design procedure of assembler; Table processing: searching and sorting; macro processors, preprocessors; Compilers: features of high level languages data types and data structures, storage allocation, functional modularity, programming language grammar; Loaders ft Linkers; Loaders: Loader scheme; Linkers. Design of linkage- editor.

Course Code: CSE 205 Course Name: Discrete Mathematics Prerequisite: MAT 101 Credit Hours: 3.00 Detailed Syllabus: Mathematical logic: propositional calculus, predicate calculus. Permutations, Combinations and Discrete Probability. Set theory: sets, relations, partial ordered sets, functions. Graph theory: graphs, paths, trees. Recurrence Relations and Recursive Algorithms. Algebraic structures: binary operations, semi groups, groups, permutation groups, rings and fields, lattices.

Course Code: CSE 207 / CSE 208 Course Name: Data Structures Prerequisite: CSE 103, CSE 201 Credit Hours: 3.00 Detailed Syllabus: Data structures: Concept of data types, abstract data types Arrays: Maximization ordered lists, sparse matrix representation of arrays. Stacks, Queues and Recursion: Fundamentals, Different types of Stack and Queues, Recursion: Direct and indirect recursion; simulation of recursion; depth of recursion; removal of recursion; Linked lists: Different types of Linked list and their operations. Trees: Basic terminology, binary trees, binary tree representation, binary tree traversal; Extended binary trees: 2-trees, internal and external path lengths, Huffman codes; algorithm; threaded binary trees, binary tree representation of trees; Application of Trees: Set representation, decision trees, game trees; counting binary trees. Graphs: Introduction, definitions and terminology, graph representations, traversals, connected components and spanning trees, shortest path and transitive closure, activity networks, topological sort and critical path, enumerating nil path. Internal Sorting: Searching, bubble sort, shell sort, insertion sort, selection sort, quick sort, heap sort, 2-way merge sort. How fast can we sort? Sorting on several keys, practical considerations for internal sorting. External Sorting: General idea: Sorting with disks: K-way merging, buffer handling (or parallel operation, run generation, Sorting with Tapes: Balanced merge sorts, polyphase merge, sorting with fewer than 3 tapes. Symbol Tables: Static tree tables, dynamic tree tables; Hash Tables: Hashing functions, overflow handling, theoretical evaluation of overflow techniques. Files: File, queries and sequential organizations; Indexing Technique: Cylinder-surface indexing, hashed indexes, tree indexing- B- trees; Tree indexing.

Course Code: CSE 211 Course Name: Digital Logic Design Prerequisite: None Credit Hours: 3.00 Detailed Syllabus: Review of Binary number system, Boolean algebra, Simplification of Boolean Functions, Logic gates, Combinational Logic, Arithmetic and Comparator Circuits, Encoders and Decoders, Multiplexers and Demultiplexers, Flip-Flops, Sequential Logic, Registers, Counters, Programmable Logic devices. The course includes lab works based on theory taught.

Course Code: CSE 303 Course Name: Database Management System Prerequisite: CSE 103, CSE 201 Credit Hours: 3.00 Detailed Syllabus: Overview: Definition of DMBS, types of DBMS, advantage & disadvantages, applications. Data Model: ER Model, Relational Model Integrates Constraints. FD Constraints. Assertions, figures. Database Design: Logical database design, physical database design; data storage device & data format. File organization: Sequential file organization, Indexed file organization, direct file organization; hashing methods searching: sequential search, indexed search; reporting: Simple and complex report. Relational Database design: Relational model, normalization, relational database design; relational query language: SQL. Query Processing, Query optimization, Database Administration: Functions: Standards, Security integrity, recovery; Concurrency control; coordination's ; quality control: tuning and performance. Multiple file databases: General considerations, designing the files, data entry and consistency data updating, tools for complex database manipulations. Object oriented database design. Other types of DBMS: Network database, hierarchical database, text-oriented database, graphic-oriented database. Real time database intelligent database. Programming: Common programming applications, important programming attributes: access to database records and fields; sorting searching, transactions among files, procedures and functions, reporting: Standard, complex, customized etc, structured aspects, variables and arrays; Handling database based on relations, network, hierarchical model; Programming projects: Create projects using menu builder, screen builder, form builder, report builder etc. Object oriented database programming.

Course Code: CSE 305 / CSE 306 Course Name: Algorithms Prerequisite: CSE 207 Credit Hours: 3.00 Detailed Syllabus: Algorithm and complexity, asymptotic notations, orders, designing worst case and average-case. Basic Technique divide and conquer, dynamic programming, backtracking, greedy method, branch and bound, randomization. Data structure search trees, Fibonaaci heaps, union-find problems. Application-string matching, sorting and scorching, combinatorial problems, optimization problems, computational geometric: problems. Graph algorithms, spanning trees, shortest paths, matching, rnin flow, max-flow. NP- completeness. Approximation algorithms.

<<  <  Pages :  1  2  3  4  5  6  7  8  9  10   >    >>