Course Catalogue

Course Code: CSE 422
Course Name:
Systems Programming
Credit Hours:
3.00
Detailed Syllabus:

This is an advanced course in UNIX system facilities. It complements the operating systems course, in that it provides hands-on experience with such facilities as signals, semaphores and file locks. Familiarity with the C language is assumed.

About 40% of the course is devoted to UNIX shell programming and some useful utilities like sed and awk. The rest of the course does the UNIX system calls in detail – unbuffered I/O, directories, process creation, signals, pipes, record locks, interprocess communication, terminal handling and some tcp/ip calls.

Course Code: CSE 423
Course Name:
Advanced Computer Architecture
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Pipelined processor design, Cache memory, Memory system design, Concurrent processors, Vector processors and multiprocessors, Array processors, Parallelism in multiprocessors and Multicomputers, Compute-intensive processors and Multicomputers, Automatic Vectorization, Hypercube systems and Key application, Data flow computation.

Course Code: CSE 424
Course Name:
Parallel Programming
Credit Hours:
3.00
Detailed Syllabus:

Parallel Models: PRAMs; machines- SIMD; architectures’ meshes, arrays, hypercubes; basic algorithms- Pointer jumping, prefix computation, Loader election; sorting- Cole’s sorting networks; Numerical methods- matrix operations. PDE solutions; Graph problems- connected components, shortest paths, spanning trees; combinatorial search; the class NP and P-completeness.

Writing distributed programs: socket related system calls (stream and datagram), Remote Procedure Calls (RPC), Writing network utilities. Using utilities for the development, of distributed programs. Demonstration/ hands-on-experience on the issues involved in managing large network systems. Study of the performance of Ethernet LAN under varying load conditions.

Process oriented versus object based Model:. Synchronization Mechanisms: Threads, the critical section problems, some important Synchronization problems, language and abstraction mechanism for synchronization, axiomatic verification of mutual exclusion.

Architecture of Distributed systems: Communications Networks, Client/server architecture etc, Logical clocks and ordering of messages. Distributed mutual exclusion and dead lock detection algorithms and their analysis. Agreement protocols’, fail stop and non-fail stop protocols. Distributed resource management and scheduling failure Recovery and Fault Tolerance: Backward and Forward error recovery, operation based and state based approach, synchronous and asynchronous check pointing; Commit protocols, Voting protocols, Resiliency through primary site and modular redundancy approaches, Reliable Communication, Case studies: Tragon/32 Fault tolerance under UNIX.

Course Code: CSE 425
Course Name:
Peripherals and Interfacing
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Organization of a Microcomputer: Design and operation of Interface between Computer and the outside world; Sensors, transducers and signal conditioning, Interfacing Memory, and 1/0 Devices such as monitors, printers, disk drives and some other smart interface cards; IEEE488 and other buses and interfacing Scientific Instruments. Study of Microcomputer’s Chips, Microprocessor Peripheral Chips. Application to peripheral subsystems-PPI, PIC, DMAC, PCI etc. Interfacing Data Converters, general-purpose programmable peripheral devices, serial I/O and data communication.

Course Code: CSE 426
Course Name:
Advanced Computer Networking
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Introduction: Network types, Network protocol hierarchy’s overview of OSI and TCP/IP model?. LAN and MAN: Topologies, Bus/ Tree and Star using metallic media, optical fiber bus, the ring topology, Medium Access control protocols CSMA/CD, Token ring and FDDI, MAC performance, LAN/MAN Standards, High Speed LANs, Fast Ethernet, 100VG- any LAN, ATM LAM, Fibre channel, wireless LAN, and Gigabit Ethernet,

WAN: Public data networks, Routing strategies and flow control in packet switch networks, and X.25 standard. Circuit switched data networks and X.21 interface.

ISDN and Broadband ISDN: ISDN-Principles, user interface and services, ISDN channels, user access and protocols, Broadband ISDN- functional architecture and protocols.

Frame Relay and Cell Relay: Frame relay services and protocols, architectures, call control and data transfer, ATM-Overview, virtual channels and paths, ATM cells, header error control, transmission of ATM cells, traffic and congestion control, ATM switches.

Satellites and Cellular Radio: Geosynchronous and low-orbit satellites, VSATs, protocols for multiple access up-link channel, cellular radio, analog and digital cellular systems, GSM, persona! communication services.

Internetworking: Network interconnection, bridges and routers, connectionless and connection oriented Internet working, routing and fragmentation, Firewalls IP protocol rind IP addresses,
Internet control protocols- ICMP, ARP, RARP, multicasting. Domain name system and Name Servers.

Distributed Applications: Simple Network management protocol, Telnet and FTP, Electronic mail, 1 SMTP and MIME. The WWW-client and servers, writing wave page in HTML and Java, locating information the on the web, video on demand.

Network Security: Type of attack, privacy with conventional encryption, Message authentication and Hash function public key encryption and digital signature.

Course Code: CSE 427
Course Name:
Multimedia Design and Development
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Analysis, design and implementation of multimedia software, primarily for e-learning courses or training. Projects emphasize user interface design, content design with storyboards or scripts, creation of graphics, animation, audio and video materials, and software development using high level authoring tools, such as Flash.

Course Code: CSE 428
Course Name:
Enterprise System Design and Development
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

This module gives an overview of some of the different tiered application architectures (1, 2, 3, N tiers) and some sample designs. The course teaches some of the foundation skills required for building medium to large scale web-based applications, with a B2B e-commerce focus. The course introduces J2EE and Microsoft .NET as two technology architectures for implementing enterprise applications. Java Servlets and Java Server Pages (JSP), Java application servers, integration of data from multiple data sources and distribution of business logic in component-based applications. Multiple application-end delivery formats are considered including web browsers and WAP phones.

Course Code: CSE 429
Course Name:
Digital Image Processing
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Introduction, Digital Image Fundamentals, Image Transform, Image Enhancement, Image Restoration, Image Compression, Image Segmentation, Representation and Description, Recognition and Interpretation.

Course Code: CSE 430
Course Name:
Neural networks and Pattern Recognition
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Introduction to Neural Network; ANN approach to recognition; ANN models, Design and development of ANN; back propagation model.

Introduction to pattern recognition. General pattern recognition concepts. Statistical pattern recognition. Supervised learning using parametric and non-parametric approaches. Linear discriminant functions and the discrete and binary feature cases. Unsupervised learning and clustering. Syntactic Pattern Recognition: Syntactic recognition via parsing and other grammars, graphical approach to syntactic pattern recognition, learning via grammatical inference. Neural Pattern Recognition: Neural pattern associators and matrix approaches, unsupervised learning in neural pattern recognition.

Course Code: CSE 431
Course Name:
Computational Geometry
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:

Problems in computational geometry, worst case complexity of geometric algorithms; expected complexity of geometric algorithms and geometric probability, geometric intersection problems, nearest neighbor searching, point inclusion problems, distance between sets, polygon decomposition, the Voronoi diagram and other planner graph, updating and deleting from geometric structures.

Pages