Embed Size (px)
Citation preview
الخطة الدراسية لقسم علوم الحاسب بكليات العلوم
بكلياتعلوم الحاسب اآللي قسم في الخطة الدراسية بناء وقد تم،الكلية في في األقسام األخرى مماثلة لتلك التي أن تكون ،العلوم على
ثمانية) فصول دراسية ثمانية على موزعة( معتمدةساعة ) وحدة130 ( مبينة في الجدول أدناهمستويات
امنه واحد اختيار يستطيع الطالب، تخصصات فرعية ثالثة ويتضمن البرنامج : على النحو التاليالمستوى الرابع( )رابع ال الفصل الدراسي منبداءً
الحاسب اآلليات شبك -- 1 ..تطوير البرمجيات -- 2
نظم المعلومات -- 3
المتطلباتالساعات المعتمدةمتطلبات الجامعة25متطلبات الكلية21الساعات الحرة 4
متطلبات القسم اإلجبارية60المتطلبات االختيارية20الساعات اإلجمالية130
Bachelor's Degree program1
In Computer Science Structure Plan of the Bachelor's Degree in computer science program
The study plan for undergraduate studies in the department of computer science have been built to be, similar to that in other departments in the college, 130 Units (credit hours) distributed over eight semesters (eight levels)
The program includes three majors, the student can choose one of them starting from the fourth semester (fourth Level):
1- Computer Network.
2- Software Development.
3- Information Systems.
The following table shows the detailed plan:
RequirementsCredit hours
University requirements25College requirements21Free hours 4Departmental (obligatory)60 Optional 20 Total130
Foundation Year, first semester, (Level 1)
2
UnitsPrerequisitesCourse TitleCourse Code
8 (6+0+0) -English Language (1)130ENGL
3 (2+2+0) - Fundamental of Mathematics 130MATH
3 (2+0+2) -Computer skills (1)130CS
2 (2+0+0) -introduction to Islamic culture 101IC
16 units
Foundation Year, second semester, (Level 2)
UnitsPrerequisitesCourse TitleCourse Code
4 (3+1+2)MATH 130General Physics101PHYS
2(2+0+0)Arabic language skills101ARB
2 (1+0+2)CS 130Computer skills (2)140CS
2(2+0+0)MATH 130Statistics 101STAT
3 (2+0+2)ENGL 130 English Language (2)140ENGL
3 (2+2+0)Calculus 140MATH
16 units
3
Level 3
UnitsPrerequisitesCourse TitleCourse Code
2 (2+0+0)Islamic and building of community102IC
3 (2+0+2)Discrete Math. For computer application
204CS
3 (2+0+2) CS140Programming Language (1)202CS
2 (2+0+0)Digital Logic Design203CS
4(3+1+2)Introduction to General Chemistry101CHEM
2Free course
16 units
Level 4
UnitsPrerequisitesCourse TitleCourse Code
2 (2+0+0)Arabic basic writing103Arab
3 (2+0+2)Data structure 201CS
3(2+0+2)CS140Computer Networks 205CS
2(2+0+0)Programming Language (2)206CS
4(3+0+2) CS140Introduction to Database Systems207CS
3(2+0+2)Elective Course (Free to choose any one course from Table A, B, C)
CS
17 units
4
Level 5
UnitsPrerequisitesCourse TitleCourse Code
2 (2+0+0) the economical (system ) regulation in Islam
103IC
3 (2+0+2)Introduction to software engineering 305CS
3(2+0+2)Operating System 302CS
3 (2+0+2)Web programming 303CS
2 (2+0+0)Terminology and scientific writing230ENG
3(2+1)Elective Course (Free to choose any one course from Table A, B, C)
CS
16 units
Level 6
PrerequisitesCourse TitleCourse Code
2 (2+0+0) The political regulation in Islam104IC
3 (2+0+2)System Analysis and Design 301CS
3 (2+0+2)CS 207Computer Architecture & Assembly language
306CS
2 (2+0+0)CS 202Compilers and Interpreters307CS
3 (2+0+2)System Administration and System Programming
308CS
3(2+0+2)Elective Course (Free to choose any one course from Table A, B, C)
CS
16 units
5
Level 7
UnitsPrerequisitesCourse TitleCourse Code
3(2+0+2)CS 301Multi-media information system 400CS
3(2+0+2)CS 202Artificial intelligence401CS
2(2+0+0)Graduate project(1) CS
3(2+0+2)CS 202Digital Image Processing402CS
2(2+0+0)CS 305Computer security403CS
3(2+0+2)Elective Course (Free to choose any one course from Table A, B, C)
16 units
Level 8
UnitsPrerequisitesCourse TitleCourse Code
3(2+0+2)CS 305Parallel distributed system 404CS
2(2+0+0)Elective Course (Free to choose any one course from Table 2)
CS
2(2+0+0)Elective Course (Free to choose any one course from Table A, B, C)
CS
2 (2+0+2)Free courseCS
2 (2+0+0)Graduate project(2)CS
3 (2+0+2)Elective Course (Free to choose any one course from Table A, B, C)
CS
3 (2+0+2)Elective Course (Free to choose any one course from Table A, B, C)
17 units
130 Units
6
Table A: Elective Courses for levels 5,6,7 and 8 ( Computer Network)
Curse code Curse title Prerequisites UnitsCS 405 Mobile Communications 2 (2+0+0)
CS 308 Graphical User Interfaces CS202 3 (3+0+0)
CS 406 Neural Network 2 (2+0+0)
CS 419 Introduction to cryptography 3 (2+0+2)
CS 407 Mobile and Wireless Network CS 205 2(2+0+0)
CS 408 Pattern Recognition CS 202 3 (2+0+2)
CS 409 Building E-Commerce CS 303 3 (2+0+2)
CS 309 Advanced Computer Network CS 205 3(2+0+2)
CS 310 Digital Communication 3(3+0+0)
CS 411 Digital Signal Processing CS 202 3(2+0+2)
CS 311 Computer Graphics 3(2+0+2)
CS 208 Computer ethics 2(2+0+0)
CS 209 Introduction to theory of computation 3(3+0+0)
7
Table B: Elective Courses for levels 5,6,7 and 8 (Software Development)
Curse code Curse title Prerequisites
Units
CS 210 Operation research MATH130 3(2+0+2)
CS 412 Logic Programming 2(2+0+0)
CS 413 Signals and Systems 2(2+0+0)
CS 414 Software Tools 3(2+0+2)
CS 415 Software Quality Assurance 2(2+0+0)
CS 311 Computer Graphics 3(2+0+2)
CS 419 Introduction to Cryptography 3(2+0+0)
CS209
Introduction to theory of computation
2(2+0+2)
CS 313 modeling and Simulation 3(2+0+2)
CS 312 Software testing and evaluation 3(2+0+2)
CS 317 Software project managements CS 305 3(3+0+0)
CS 212 Human computer interface 3(2+0+2)
CS 418 Data mining 3(3+0+0)
8
Table C : Elective Courses for levels 5,6,7 and 8 (Information Systems)
Curse code Curse title Prerequisites
Units
CS 210 Operation Research MATH 130 3(2+0+2)
CS 419 Introduction to Cryptography 3(3+0+0)
CS 309 Advanced Computer network CS 205 3(3+0+2)
CS 420 Performance Evaluation of Computer Systems
2(2+0+2)
CS 314 Graphic information system 3(2+0+2)
CS 421 Advanced Database management systems 3(2+0+2)
CS 316 Management information systems 3(3+0+0)
CS 315 Decision support systems CS 210 3(3+0+0)
CS 418 Data mining CS 207 3(2+0+2)
CS 422 Data communication systems 2(2+0+0)
CS 423 Business intelligence 2(2+0+0)
CS 209 Web and Database Systems CS207 3(2+0+2)
9
Courses specificationCS 130 Computer skills (1) 3 (2+0+2) credit-hours.
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours Basic Concepts of Information Technology: Computer Hardware; Memory and Storage; Software. Using Information Technology - Networks; The Internet and Email. Computers in Everyday Life - Computers for Home, Work and Education; Working Safely with Computers; Protecting your Work; Protecting your PC. Legal Issues - Copyright; The Data Protection Act. Using the Computer and Managing Files: Desktop Icons; Desktop Settings. Finding Out More - Using Help; Viewing System Information; Changing Date/Time and Volume Settings. Managing your Files , Programs and Printing - Using Applications; Printing. Word Processing: Getting Started with Word, Formatting Text - Working with Long Documents Tables, Using Graphics in Word, Working with Files, Mail Merge, Printing
Schaum's Outline of Introduction to Computer Science, Ramon Mata-Toledo 2002
Peter Norton's Introduction To Computers Fifth Edition Student Edition, 2002
CS 140 Computer skills (2) 2(2+0+0) credit-hours.
Theoretical : 2 Practical: 2 Pre-request: CS 101 Credit: 3 hours Spreadsheets: Selecting Cells; Adding Numbers up with AutoSum; Editing a Worksheet-; Symbols and Special Characters; Sorting. Functions and References Margins; Page Setup; Creating Headers and Footers. Formatting Worksheets Charts , Saving in Other File Formats . Databases: Creating a Simple Database ,Opening and Closing a Database; The Parts of an Access Database; Using a Table; Using Help in Access; Using Toolbars. Queries, Forms, Reports. Presentations: Adding, Deleting and Moving Slides, Masters and Templates, Drawing, Graphs and Charts, Adding Pictures to Slides, Spell-checking, Using Slide Show View - Importing Information and Communication: Changing the Display; Web Addresses )URLs(. Using Search Engines - Favorite Web Site, Getting Started with Outlook , Working with Email, Organizing Email
Peter Norton's Introduction To Computers Fifth Edition Student Edition,2002 Schaum's Outline of Introduction to Computer Science, Ramon Mata-Toledo
2002
CS 206 Design and Analysis of Algorithms (2+0+0) credit-hours.
Theoretical : 2 Practical: - Pre-request: -- Credit: 2 hours Sorting and order statistics: heapsort and priority queues, randomised quicksort and its average case analysis, decision tree lower bounds, linear-
10
time selection. Divide-and-conquer: binary search, quicksort, mergesort, polynomial multiplication, arithmetic with large numbers . Dynamic Programming: matrix chain product, scheduling, knapsack problems, longest common subsequence, some graph algorithms . Greedy methods: activity selection, some graph algorithms . Amortisation: the accounting method, e.g., in Graham's Scan convex hull algorithm . Graph algorithms: depth-first search, breadth-first search, biconnectivity and strong connectivity, topological sort, minimum spanning trees, shortest paths. Theory of NP-completeness
T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, 2nd edition, McGraw-Hill and The MIT Press, 2001.
Jeff Edmonds’ notes: “How to Think about Algorithms”. Available Online <http://www.cse.yorku.ca/%7Ejeff/notes/3101/notes.html>
CS202 Programming Language C++ 3 (2+0+2) credit-hours.
Theoretical : 2 Practical: 2 Pre-request: CS 102 Credit: 3 hours Control structures (if/else, while, for, switch, break, continue) . Operator overloading, Arrays, strings, Exception handling, Classes, methods, namespaces, parameter passing, method and constructor overloading, inheritance, polymorphism, interfaces, abstract classes.
The C++ Programming Language B. Stroustroup 2004
CS203 Digital Logic Design 2 (2+0+0) credit-hours.
Theoretical : 2 Practical: - Pre-request: -- Credit: 3 hours Number systems, Boolean algebra, logic gates and their electrical characteristics. Analysis and design of Combinational Circuits including arithmetic units, multiplexers, data selectors, parity checkers etc. Hardware Description Languages (HDL). Use of VHDL in logic circuit design and simulation. Analysis and design of Sequential Circuits. Flip flops, synchronous and asynchronous circuits. Design using Algorithmic State Machines. Memory systems, programmable logic and their applications. Register transfer techniques, Bus concepts. Design examples.
Digital Logic Design, Fourth Edition by Brian Holdsworth and Clive Woods 2002
CS205 Computer Networks 3(2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours Distinction between information and data, between signal and data, between symbol and data, and between analogue and digital data. Transmission media; time domain and frequency domain. Fundamental limits due to Shannon and Nyquist. Protocol hierarchies; the OSI model. Encoding of analogue/digital data as analogue/digital signals . Data link protocols; error and flow control . Medium access; Ethernet and token passing systems in LANs. Routing of packets in networks, congestion control. Internetworking.
11
Transport services and protocols . High-level applications and their protocols, e.g. WWW(HTTP), e-mail (SMTP), Internet names (DNS)
Computer Networks, (4th Edition), by Andrew S. Tanenbaum ( 2002(
CS201 Data structure 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 202 Credit: 3 hours Data types, arrays, stacks, queues and lists . Searching and sorting; a mixture of review and new algorithms . Priority queues . Trees: threaded, balanced (AVL-, 2-3-, and/or B-trees), tries . Graphs: representations; transitive closure; graph traversals; spanning trees; minimum path; flow problems
Data Structures and Algorithms in C++ by Adam Drozdek (2004)
CS207 Introduction to Database Systems 4(3+0+2) credit-hours
Theoretical : 3 Practical: 2 Pre-request: CS 102 Credit: 3 hours Overview of Database Management Systems . Relational Model. Entity-Relational Model and Database Design . SQL. Integrity Constraints . Crash Recovery. Concurrency Control
Introduction to Database Systems by Stephane Bressan and Barbara Catania (Jan 2005)
CS209 Web and Database Systems 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours Introduction to Information Technology and the WWW - introduction to information and database systems, internet information systems (web pages and HTML and web servers). Designing and Specifying Information Systems - data models, entity-relationship diagrams . Designing and Creating Relational Databases - developing relational models, defining relational databases in MS Access, improving designs. Manipulating Relational Information - using MS Access, using SQL. Creating Interactive Web Sites- presenting information with HTML, introduction to ASP and JavaScript, database applications for the web. Web Database Systems: AND Database Design & Programming by Barry Eaglestone
(2003)
CS212 Human Computer Interaction 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours Introduction (Goals, Motivation, Human Diversity). Theory of Human-Computer Interaction (Golden Rules, Basic Principles, Guidelines). The Design Process (Methodologies, Scenario Development). Expert Reviews, Usability Testing, Surveys and Assessments. Software Tools (Specification Methods, Interface-Building Tools). HCI Techniques. Interaction Devices
12
(Keyboards, Pointing Devices, Speech Recognition, Displays, Virtual Reality Devices) . Windows, Menus, Forms and Dialog Boxes. Command and Natural Languages (Command Line and Natural Language Interfaces). Direct Manipulation and Virtual Environments . Manuals, Help Systems, Tutorials. Hypermedia and the World Wide Web (Design, Creation, Maintenance of Documents). Human Factors—Response Time and Display Rate; Presentation Styles—Balancing Function and Fashion (Layout, Colour); Societal Impact of User Interfaces (Information Overload); Computer Supported Cooperative Work (CSCW, Synchronous and Asynchronous); Information Search and Visualisation (Queries, Visualisation, Data Mining)
Designing the User Interface: Strategies for Effective Human-Computer Interaction (5th Edition) by Ben Shneiderman, Catherine Plaisant, Maxine Cohen, and Steven Jacobs (Mar 8, 2009)
302 Operating systems 3(2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours Multiprogramming, concurrent processes, CPU scheduling, deadlocks, memory management, file systems, protection and security. Many examples from real systems are given to illustrate the application of particular concepts.
Operating System Concepts by Abraham Silberschatz, Peter B. Galvin, and Greg Gagne (Jul 28, 2008)
CS309 Advanced Computer Networks 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 206 Credit: 3 hours Networking Basics. Queuing Fundamentals. Network Layer Protocols, Including ICMP, DHCP, and ARP Multicasting. Transport Layer, UDP, and TCP. Sockets and Socket Programming. Application Layer Protocols, Including HTTP and DNS. Multimedia. Security . VOIP
The TCP/IP Guide: A Comprehensive, Illustrated Internet Protocols Reference by Charles M. Kozierok
(Oct 1, 2005)
CS204 Discrete Mathematics for Computer Application 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours Introduction to abstraction; use and development of precise formulations of mathematical ideas; informal introduction to logic; introduction to naïve set theory; induction; relations and functions; big-O notation; recursive definitions, recurrence relations and their solutions; graphs and trees.
Discrete Mathematics for Computer Scientists (Alternative eText Formats) by Cliff Stein, Robert Drysdale, and Kenneth Bogart ( 2010)
CS 305 Advanced Database Management Systems 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 Pre-request: CS 208 Credit: 3 hours
13
Query Processing. Transactions. Concurrency Control . Recovery. Database System Architectures . Distributed Databases . Object-Oriented Databases
Database Management Systems by Raghu Ramakrishnan and Johannes Gehrke, (2002).CS30 Computer Architecture 3(2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 207 Credit: 3 hours Fundamentals of computer design. Performance and cost. Instruction set design and measurements of use . Basic processor implementation techniques. Pipeline design techniques. Memory-hierarchy design. Input-output subsystems. Future directions
Digital Design and Computer Architecture by David Harris and Sarah Harris, (2007).
CS307 Compilers and Interpreters 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 302 Credit: 3 hours Compiler architecture: single-pass vs. multiple-pass translation. Lexical analysis (scanning): design of scanners using finite automata; tabular representations; tools for building scanners. Parsing (syntax analysis): top-down vs. bottom-up parsing; parse trees and abstract syntax trees; tabular representations for parsers; parser generators. Symbol tables: efficient algorithms and data structures; representing data types in symbol tables. Type checking: scope control; static vs. dynamic type checking. Memory management: static allocation; register allocation; stack allocation; heap allocation; garbage collection. Code generation: translating imperative programming constructs; function and procedure calls; branching code; translating object-oriented constructs and modules. Optimisation: local and global optimisations; dead code removal; control flow analysis
Compiler Construction by Evelyn Duesterwald ( 2004)
CS 310 Digital Communication 3 (3-0+0) credit-hours
Theoretical : 3 Practical: - Pre-request: Credit: 3 hours Review of Probability and Random Variables. Introduction to Stochastic Processes and Noise. Introduction to Information theory: Shannon’s Source Coding and Channel Coding theorems. Source Coding: Lossless Coding (Huffman, Arithmetic, and Dictionary Codes) versus Lossy Coding (Predictive and Transform Coding). Analog to Digital Conversion: Sampling and Quantisation. Baseband Transmission. Binary Signal Detection and Matched filtering. Intersymbol Interference (ISI), Channel Capacity. Digital Bandpass Modulation and Demodulation Schemes . Error Performance Analysis of M-ary schemes. Channel Coding: Linear Block, Cyclic, and Convolutional Codes. Decoding Techniques for Convolutional Codes, Viterbi Algorithm. Application of Convolutional codes to Compact Disc (CD). Synchronisation Techniques . Spread Spectrum Modulation: Direct Sequence and Frequency Hopping Digital Communications by John G. Proakis and Massoud Salehi (2008).
14
CS406 Neural Network 2(2+0+0) credit-hours
Theoretical : 2 Practical: - Pre-request: Credit: 3 hours Supervised Learning: Single-Layer Networks Perceptrons ,Adalines, supervised Learning: Multi-Layer Networks ,Multi-Layer Perceptrons (MLPs) , Backpropagation, Conjugate Gradient method , Levenberg-Marquardt (LM) method, Madalines , Radial-Basis Networks, Cascade-Correlation Networks , Polynomial Networks, Recurrent Networks, Time series , Back propagation through time , Finite Impulse Response (FIR) MLP, Temporal Differences method (TD) , Unsupervised Learning , Simple Competitive Networks: Winner-take-all | Hamming network, Learning Vector Quantization (LVQ), Counter propagation Networks (CPN), Adaptive Resonance Theory (ART), Kohonen Self-Organizing Maps (SOMs), Principal Component Analysis networks (PCA) , Associative Models, Linear Associative Memory (LAM), Hopfield Networks Fundamentals of Neural Networks: Architectures, Algorithms And Applications by Laurene V. Fausett
(Paperback - Dec 19, 1993
CS303 Web programming 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 206 Credit: 3 hours Basic design and development principles pertaining to the creation of interactive dynamic websites. Provides the student hands-on opportunities to extend their knowledge of markup languages (e.g., XHTML, XML) and web application languages (e.g., Perl, JavaScript, Ruby). Provides the student specific applied skill opportunities in the selection and use of appropriate website technologies.
Internet & Intranet Engineering, Daniel Minoli, Computing Mcgraw-Hill; 1st edition (January 15, 1997)
HTML 3.2 for the Internet and Intranets Quick start Richard Scott, Sue Reber
, Tim Poulsen (Author), 1997
CS-402 Digital Image Processing 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 302 Credit: 3 hours Introduction – steps in image processing, Image acquisition, representation, sampling and quantization, relationship between pixels. – color models – basics of color image
processing. Image enhancement in spatial domain – some basic gray level transformations – histogram processing – enhancement using arithmetic , logic
operations – basics of spatial filtering and smoothing. Image enhancement in Frequency domain – Introduction to Fourier transform: 1- D, 2 –D DFT and its
inverse transform, smoothing and sharpening filters. Image restoration: Model of degradation and restoration process – noise models – restoration in the presence of
noise- periodic noise reduction.. Image segmentation: Thresholding and region based segmentation. Image compression: Fundamentals – models – information theory –
error free compression –Lossy compression: predictive and transform coding. JPEG standard.
TEXT BOOKS:
15
1.Rafael C. Gonzalez & Richard E. Woods, “Digital Image Processing”, 2nd Ed, Pearson Edu, 2004
2.A.K. Jain, “Fundamental of Digital Image Processing”, PHI. 2003REFERENCES:
Rosefield Kak, “Digital Picture Processing”, 19992 .W.K. Pratt, “Digital Image Processing”, 2000
Martin Reiser , 2000 .
CS403 Computer security 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 302 Credit: 3 hours Access Control - Identification, authentication, and authorization; trust management. Network Security - attacks, intrusion detection, auditing and forensics, firewalls, malicious software, packet monitoring and other tools/techniques for finding network security related problems.. Operating System Security - threats, vulnerability, and control, password management, accounts and privileges. Application Software Security - design of secure systems, evaluation, Java security, buffer overflows, database security, client-side and server-side securities, tamper resistant software and hardware, finding vulnerabilities, developing patches, patch distribution. Thinking Evil (understand the enemy so that you can design better software and systems) - how to build a virus, trojan, worm, (how to detect them and break them); real-world vulnerability detection.
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws by Dafydd
Stuttard and Marcus Pinto (2007).
CS 404 Parallel distributed system 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 305 Credit: 3 hours An introduction to distributed systems, emphasizing the multiple levels of software in such systems. Specific topics include fundamentals of data communications, network architecture and protocols, local-area networks, concurrency control in distributed systems, recovery in distributed systems, and clock synchronization.
Parallel and Distributed Simulation Systems (Wiley Series on Parallel and Distributed Computing) by Richard M. Fujimoto (2000)
CS409 Building E-Commerce 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 403 Credit: 3 hours Basic e-commerce concepts. Examples of e-commerce stores. Internet as the infrastructure for e-commerce; network layers and protocols; network and transport layer; TCP/IP; web server design; DNSs, URLs, and HTTP; proxies, caching. Security and encryption; basic concepts of computer cryptography; symmetric and asymmetric cryptosystems; DES; public key cryptosystems; RSA; Diffie-Hellmann; elliptic codes; PGP; breaking computer cryptography with massive parallelism. Electronic store content and presentation; HTML, CGI, Dynamic HTML, JavaScript. Applets; push and pull content; MIME and
16
cookies; future representations — XML, WAP . Intelligent e-commerce; data mining in e-commerce; agents; product and merchant brokerage; mobile agents; negotiations.
Building the E-Service Society: E-Commerce, E-Business, and E-Government by Winfried Lamersdorf, Volker Tschammer, and Stephane Amarger ( 2004).
CS - 408 Mobile and wireless Network (2+0+0) credit-hours
Theoretical : 2 Practical: - Pre-request: Credit: 2 hours
Communications networks, Evolution of wireless networks , Satellite networks Personal Communication Services ,Access Technologies ,FDMA and TDMA ,CDMA
,Channel characteristics ,Dynamic and fixed channel allocation, Cellular Networks ,Cellular network design, Handoff methods ,Location Management ,Call
control and routing, Standards (GSM and IS-95) ,Wireless LANs and Local Loop ,Wireless LAN Technology ,IEEE 802.11 Wireless LAN
Standard ,Bluetooth ,Fixed wireless ,Wireless Data Services ,Cellular Digital Packet Data (CDPD) ,Generalized Packet Radio Service (GPRS) ,Mobile-IP ,Transport
protocols for mobile networks ,Next Generation Wireless Networks and Applications ,3G Networks ,Wireless ATM ,Wireless Application Protocol
(WAP) ,Adhoc networks Textbooks:
Y-B. Lin and I. Chlamtac, Wireless and Mobile Network Architectures, Wiley & Sons, 2001T.S. Rappaport, Wireless Communications: Principles & Practice, Prentice Hall 1996
CS405 Mobile Communications 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 401 Credit: 3 hours Overview of wireless transmission. Wireless local area networks: IEEE 802.11, Bluetooth. 2.5G/3G wireless technologies. Mobile communication: registration, handoff support, roaming support, mobile IP, multicasting, security and privacy. Routing protocols in mobile ad-hoc networks: destination-sequence distance vector routing (DSDV), dynamic source routing (DSR), ad-hoc on-demand distance vector routing (AODV), and a few others. TCP over wireless: performance in and modifications for wireless environment. Wireless sensor networks: applications; routing. Satellite systems: routing, localisation, handover, global positioning systems (GPS). Broadcast systems: digital audio/video broadcasting. Applications to file systems, world wide web;Wireless Application Protocol and WAP 2.0; i-mode; SyncML. Other issues such as wireless access technologies, quality of service support, location management in mobile environments, and impact of mobility on performance.
Mobile Phones and Mobile Communication (Digital Media and Society) by Rich Ling and Jonathan Donner ( 2009).
17
CS 401 Artificial Intelligence 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours Differing definitions of artificial intelligence and go on to examine fundamental concepts in AI. Machine learning: deduction, induction, and abduction, explanation-based learning, learning k-DNF. Statistical learning: reinforcement learning, genetic learning algorithms, and connectionist learning systems, supervised and unsupervised. Statistical and structural pattern recognition. Speech recognition. Artificial intelligence programming paradigms: search, pattern-directed inference, logic- and object-oriented programming, symbolic mathematics, constraint satisfaction and symbolic relaxation, building problem solvers, efficiency issues. Sensor-based robotics: path planning, position estimation, map building, object recognition, robotic sensor and actuator hardware, software, and interfacing
Computational Intelligence: Concepts to Implementations , (2007) by Russell C. Eberhart and Yuhui Shi
CS 419 Computer Organization 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours programming in assembly language, machine instructions and their encoding formats, translating and loading high-level programs, computer organization and performance issues, CPU structure, single/multi-cycle datapath and control, pipelining, and memory hierarchy. The course presents theoretical concepts as well as concrete implementations on a modern RISC processor.
Computer Organization and Design: The Hardware/Software Interface. Third Edition, Revised by David A. Patterson and John L. Hennessy (2007) .
CS 418 Data Mining 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours fundamental concepts of data mining. various data mining algorithms, models and applications. data pre-processing, association rule mining, sequential pattern mining, decision tree learning, decision rule learning, neural networks, clustering and their applications.
Data Mining with R: Learning with Case Studies (Chapman & Hall/CRC Data Mining and Knowledge
Discovery Series) by Luís Torgo (2010).
CS210 Logic Programming 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours recursive, polymorphic and higher-order functions; recursive types and type inference. Topics on logic programming may include backtracking, resolution and unification.
Starting Out with Programming Logic and Design (2nd Edition) by Tony Gaddis (2009).
CS 413 Signals and Systems 2 (2+0+0) credit-hours 18
Theoretical : 2 Practical: - Pre-request: Credit: 3 hours Continuous and discrete time signals . Linear time-invariant systems . Fourier analysis in continuous time . Fourier analysis in discrete time. Sampling . Laplace transform. Z transform. Linear feedback systems. Design of Continuous and discrete time frequency selective filters .
Signals and Systems (2nd Edition) by Alan V. Oppenheim, Alan S. Willsky, and with S. Hamid (1996).
CS414 Software Tools 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 311 Credit: 3 hours ANSI-C (stdio, pointers, memory management, overview of ANSI-C libraries). Shell programming . Filters and pipes (shell redirection, grep, sort & uniq, tr, sed, awk, pipes in C). Version control systems and the "make" mechanism. Debugging and testing. All the above tools will be applied in practical programming assignments and/or small-group projects.
Managing the Testing Process: Practical Tools and Techniques for Managing Hardware and
Software Testing by Rex Black ( 2009).
CS 311 Advanced Topics in 3D Computer Graphics 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: CS 315 Credit: 3 hours Introduction (Goals, Motivation, Human Diversity). Theory of Human-Computer Interaction (Golden Rules, Basic Principles, Guidelines). The Design Process (Methodologies, Scenario Development). Expert Reviews, Usability Testing, Surveys and Assessments. Software Tools (Specification Methods, Interface-Building Tools). HCI Techniques. Interaction Devices (Keyboards, Pointing Devices, Speech Recognition, Displays, Virtual Reality Devices) . Windows, Menus, Forms and Dialog Boxes. Command and Natural Languages (Command Line and Natural Language Interfaces). Direct Manipulation and Virtual Environments . Manuals, Help Systems, Tutorials. Hypermedia and the World Wide Web (Design, Creation, Maintenance of Documents). Human Factors—Response Time and Display Rate; Presentation Styles—Balancing Function and Fashion (Layout, Colour); Societal Impact of User Interfaces (Information Overload); Computer Supported Cooperative Work (CSCW, Synchronous and Asynchronous); Information Search and Visualisation (Queries, Visualisation, Data Mining).
Math For 3D Game Programming & Computer Graphics, 2nd Edition by Eric Lengyel (2003).
19
CS419 Introduction to Cryptography 3 (3+0+0) credit-hours
Theoretical : 3 Practical: - Pre-request: Credit: 3 hours Cryptography and Information Security - terminology, information integrity, confidentiality, authentication, non-repudiation. Symmetric Key Cryptography - classical ciphers, encryption standards, and modern symmetric ciphers. Public Key Infrastructure - asymmetric cryptography, hash functions, certificate authorities, digital signatures, cryptanalysis. Cryptographic Protocols - IP, transport and application layer security (SSL, IPSec, VPN), authentication protocols (Kerberos, single sign-on, biometrics), electronic mail (PGP, S/MIME), XML and WS Security, wireless and broadband security, cryptanalysis 101. How can secure systems (that use crypto) be broken?. Trusted computing – hardware and software aspects.
Cryptography: A Very Short Introduction (Very Short Introductions) by Fred Piper and Sean Murphy (2002).
CS -434 Pattern Recognition 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: -- Credit: 3 hours
Basics of pattern recognition, Bayesian decision theory: Classifiers, Discriminant functions, Decision surfaces, Normal density and discriminant functions, Discrete features. Parameter estimation methods: Maximum-Likelihood estimation, Gaussian mixture models, Expectation-maximization method, Bayesian estimation. Hidden Markov models for sequential pattern classification: Discrete hidden Markov models, Continuous density hidden Markov models, Dimension reduction methods, Fisher discriminant analysis, Principal component analysis. Non-parametric techniques for density estimation: Parzen-window method, K-Nearest Neighbor method. Linear discriminant function based classifiers: Perceptron,Support vector machines.Non-metric methods for pattern classification:Non-numeric data or nominal data, Decision trees.Unsupervised learning and clustering:Criterion functions for clustering, Algorithms for clustering: K-means, Hierarchical and other methods, Cluster validation.
Text Books: 1. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, John Wiley, 2001 2. S.Theodoridis and K.Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009 3. C.M.Bishop, Pattern Recognition and Machine Learning, Springer, 2006
20
CS -415 Software Quality Assurance 2 (2+0+0) credit-hours Theoretical : 2 Practical: - Pre-request: -- Credit: 2 hours
Definition of Software quality, Quality framework and ISO 9126. Quality Assurance: Defect prevention, Defect reduction, Defect Containment. Quality Assurance activities in software processes, verification and validation prospective. Quality Engineering activities and process, quality planning, quality assessment and improvement. Software testing concepts, issues and techniques. Test activities, management and automation. Quality assurance beyond testing: Defect prevention and process improvement. Software inspection, formal verification, fault tolerance and containment
Text Book: Daniel Galin, Software Quality Assurance : From Theory to Implementation, Addison Wesley, 2003. Stephen Kan, Metrics and Models in Software Quality Engineering (2nd Edition), Addison Wesley, 2002.
CS 204 Discrete Mathematics For Computer Application 3 (2+0+2) credit- hours
Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Basic concepts of elementary logic statements and statement forms, connectives, logical equivalence, truth tables ; converse, inverse and contra positive of a conditional statement. Tautologies and contradictions. Arguments and argument forms, valid and invalid arguments. Universal and existential quantifier. Methods of proof : direct proof, indirect proofs, proof by cases, proof by contrapositive, proof by contradiction, mathematical induction, Strong induction, well-ordering principle ,Recursive definition and structural Induction, Sequence and summation. Relations : Matrix, general Relations and their properties, reflexive, symmetric, ant symmetric and transitive relations, Combining relation Composition of relation. Equivalence relations and partitions. Order relations. Boolean algebras : general definitions, Boolean functions, complete sum of products ,complete product of sums form. Karnaugh maps, minimal sum of products form and minimal product of sums form. Gates and design of logic circuits. Graph theory : basic definitions and examples, paths, cycles, connected graphs, subgraphs. Regular, complete and bipartite graphsPlanar graphs, non-planarity of some basic graphs. Eulerian and Hamiltonian graphs breadth-first search and depth-first search Tress, introduction to trees, application of trees. Binary tree, binary search tree, traversal of tree,
Text Book:
Discrete Mathematics and its applications by Kenneth H. Rosen, 5th Edition or 6th Edition.
Reference Book:21
Discrete and combinatorial mathematics : an applied introduction, R.P. Grimaldi ; Addison-Wesley.1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Fifth Edition, Tata McGraw – Hill Pub. Co. Ltd., New Delhi, 2003.3. Richard Johnsonbaugh, “Discrete Mathematics”, Fifth Edition, Pearson Education Asia, New Delhi, 2002.
CS 301 System Analysis and Design 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Project-planning Activities, including, Elements, Resources, Risk, Project Documentation, and Some Tools e.g. Gantt charts and PERT. Succeeding as System Analyst, Interpersonal kills, Management skills, Analytical skills and Technical skills. Systems Analysis Techniques: Requirements analysis. System investigation. Process analysis. Data analysis. Documentation: graphical tools, e.g. DFDs, E-R models, decision tables and trees; non-graphical tools, e.g. structured English, data dictionaries. Concept of logical modeling and the transition to design. Business/system specifications. System design: Concepts of logical and physical design. Files, Processes, Human-machine interface: screens/dialogues, presentation of information, Forms and Reports design. Data Validation and Audit features. New System Specifications. Database design and Module design. Evaluating quality of design, e.g. cohesion, coupling. Text books
1. Essentials of Systems Analysis and Design (3rd Edition)By: Joseph S. Valacich, Joey F. George and Jeffrey A. Hoffer ,
2. Modern Systems Analysis and DesignBy: Jeffrey A. Hoffer, Joey F. George and Joseph S. Valacich
Reference books:
1. Systems Analysis & Design (3rd Edition)By: Alan Dennis, Barbara Haley Wixom, Roberta M. Rogh
2. Systems Analysis and Design (5th Edition)By: Kenneth Kendall and Julie Kendall.
CS 305 Introduction to Software Engineering 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
The software problem: Cost, schedule and quality, scale and change – Software process: Process and project , Component Software processes, Software development process, Project management process Software Requirements Analysis and Specification- Value of a Good SRS, Requirements Specification, Components of an SRS, Structure of a Requirements Document, Functional Specification with Use cases, Other Approaches for analysis, validation. Planning a Software Project - Effort
22
estimation, project schedule and staffing, quality planning, risk management planning, project monitoring plan, Detailed scheduling Software Architecture- Role of software architecture, Architecture views, component and connector view, Architecture styles for C&C view, Documenting architecture design , Evaluating Architectures. Design – Functional oriented Design, Object oriented design, Detailed design Coding and Unit Testing – Programming principles and Guidelines, Incrementally developing code, Managing Evolving code, unit testing, code inspection, metrics. Testing – process, Black box testing, white box testing, metrics.Text books:
A Concise Introduction to Software Engineering )Undergraduate Topics in Computer Science( by Pankaj JaloteExperimentation in Software Engineering: An Introduction )International Series in Software Engineering( by Claes Wohlin, Per Runeson and Martin HöstReference books:
Introduction to Software Engineering Design: Processes, Principles and Patterns with UML2 by Christopher John FoxIntroduction to Software Engineering by Ronald J. Leach
CS 400 Multi-media Technology 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
The multimedia revolution: Origins of multimedia, Second – Generatin innovators, Legacy of the multimedia pioneer, multimedia today. Digital Data: Symbols, Data and information, Digital data, Digital files, Digitization and Digital encoding of media, File compression. Computer Hardware: Computer systems, Computer platforms, networks. Computer Software: Categories of software and operating systems.: Text: The text tradition, computer text, font technologies, multimedia text. Graphics – Traditional graphics, 2-D computer graphics, vector drawn graphics, Bitmapped and vector graphics.: Sound – The nature of sound, Traditional sound reproduction, digital sound, sampled and synthesized sound comparison, Advantages of digital sound.: Video – Moving pictures, analog video formats, Digital television, digital video, sources of digital video. Animation- Basics, Traditional animation, Digital animation. Authoring- Authoring process, choosing an authoring application.: Multimedia development – The Development team, Team members, The development plan. Professional issues in multimedia development.
CS 405 Mobile Communications 2 (2+0+0) credit-hours
Theoretical : 2 Practical: - Pre-request: - Credit: 3 hours
CELLULAR CONCEPT AND SYSTEM DESIGN FUNDAMENTALS Introduction to wireless communication: Evolution of mobile communications, mobile radio systems- Examples, trends in cellular radio and personal communications .
Cellular Concept: Frequency reuse, channel assignment, hand off, Interference and system capacity, tracking and grade of service, Improving Coverage and capacity in Cellular systems. MOBILE RADIO PROPAGATION Free space propagation model, reflection, diffraction, scattering, link budget design, Outdoor Propagation models, Indoor propagation models, Small scale Multipath propagation, Impulse model, Small 23
scale Multipath measurements, parameters of Mobile multipath channels, types of small scale fading, statistical models for multipath fading channels. Modulation techniques and equalization Modulation Techniques: Minimum Shift Keying, Gauss ion MSK, M-ary QAM, M-ary FSK, Orthogonal Frequency Division Multiplexing, Performance of Digital Modulation in Slow-Flat Fading Channels and Frequency Selective Mobile Channels. Equalization: Survey of Equalization Techniques, Linear Equalization, Non-linear Equalization, Algorithms for Adaptive Equalization. Diversity Techniques, RAKE receiver. Coding and multiple access techniques Coding: Vocoders, Linear Predictive Coders, Selection of Speech Coders for Mobile Communication, GSM Codec, RS codes for CDPD. Multiple Access Techniques: FDMA, TDMA, CDMA, SDMA, Capacity of Cellular CDMA and sdma. wireless systems and standards Second Generation and Third Generation Wireless Networks and Standards, WLL, Blue tooth. AMPS, GSM, IS-95 and DECT
TEXT BOOKS 1 .T.S.Rappaport, "Wireless Communications: Principles and Practice, Second
Edition, Pearson Education/ Prentice Hall of India, Third Indian Reprint 2003 .
REFERENCES 1 .R. Blake, " Wireless Communication Technology", Thomson Delmar, 2003 .
2 .W.C.Y.Lee, "Mobile Communications Engineering: Theory and applications, Second Edition, McGraw-Hill International, 1998.
CS 400 Introduction to Cryptography 3 (2+0+2) credit-hoursTheoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Introduction - Overview of course-Classical cryptography. Secret Key Encryption - Perfect Secrecy - One time pads - Stream ciphers and the Data Encryption Standard (DES) - The Advanced Encryption Standard (AES) - adopted September 2000. Public Key Encryption - Factoring and the RSA encryption - Discrete log. Diffie-Hellman Key Exchange - ElGamal encryption. Digital Signatures - One-time signatures - Rabin and ElGamal signatures schemes - Digital Signature Standard (DSS) - Hashing - Motivation and applications. Cryptographically Secure Hashing - Message Authentication Codes (MAC) HMAC. Network Security - Secure Socket Layer (SSL) – Ipsec - Secret Sharing Definition. Shamir's threshold scheme - Visual secret sharing schemes.
Text books:
Mobile Communications )2nd Edition( by Jochen H. Schiller
Reference books:
Mobile Phones and Mobile Communication )Digital Media and Society( by Rich Ling and Jonathan Donner
Handbook of Mobile Communication Studies by James E. Katz and Manuel Castells
24
CS 411 Digital Signal Processing 3 (2+0+2) credit-hours
Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Fast Fourier Transform Introduction to DFT – Efficient computation of DFT Properties of DFT – FFT algorithms – Radix-2 FFT algorithms – Decimation in Time – Decimation in Frequency algorithms –Use of FFT algorithms in Linear Filtering and correlation. DIGITAL FILTERS DESIGN Amplitude and phase responses of FIR filters – Linear phase filters – Windowing techniques for design of Linear phase FIR filters – Rectangular, Hamming, Kaiser windows – frequency sampling techniques – IIR Filters – Magnitude response – Phase response – group delay - Design of Low Pass Butterworth filters (low pass) - Bilinear transformation – prewarping, impulse invariant transformation.FINITE WORD LENGTH EFFECTS Quantization noise – derivation for quantization noise power – Fixed point and binary floating point number representation – comparison – over flow error – truncation error – co-efficient quantization error - limit cycle oscillation – signal scaling – analytical model of sample and hold operations. Power spectrum estimation Computation of Energy density spectrum – auto correlation and power spectrum of random signals. Periodogram – use of DFT in power spectrum estimation – Non parametric methods for power spectral estimation: Bartlett and Welch methods – Blackman and Tukey method. Digital signal processors Introduction to DSP architecture – Harvard architecture - Dedicated MAC unit - Multiple ALUs, Advanced addressing modes, Pipelining, Overview of instruction set of TMS320C5X and C54X.
TEXT BOOKS1 .John G Proakis, Dimtris G Manolakis, Digital Signal Processing Principles,
Algorithms and Application, PHI, 3rd Edition, 2000 ,2 .B.Venkataramani & M. Bhaskar, Digital Signal Processor Architecture,
Programming and Application, TMH 2002. (UNIT – V)REFERENCES
1 .Alan V Oppenheim, Ronald W Schafer, John R Back, Discrete Time Signal Processing, PHI, 2nd Edition 2000 ,
2 .Avtar singh, S.Srinivasan DSP Implementation using DSP microprocessor with Examples from TMS32C54XX -Thamson / Brooks cole Publishers, 2003
3 .S.Salivahanan, A.Vallavaraj, Gnanapriya, Digital Signal Processing, McGraw-Hill / TMH, 2000
4 .Johny R.Johnson :Introduction to Digital Signal Processing, Prentice Hall, 1984.5 .S.K.Mitra, “Digital Signal Processing- A Computer based approach”, Tata
McGraw-Hill, 1998, New Delhi.
CS 400 Advanced Computer Network 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Introductions, Internet history and architecture, OSI layering, The end-to-end principle - MAC and LLC Issues: Techniques for multiple access, Adaptive LLC mechanisms for wireless links Internet Routing Architecture: Internet Service Providers and Peering - Border Gateway Protocol (BGP) - Open Shortest Path FirstBorder Gateway Protocol , BGP instability, Fair queuing . TCP congestion control, TCP variants , Random Early Detect (RED) ,TCP RTT estimation, Fast retransmit, Fast recovery, Integrated Services, Resource ReSerVation Protocol 25
(RSVP),Differentiated Services, Wireless TCP, Mobile IP, Multicast routing, Scalable Multicast routing, Core Based Trees (CBT),Scalable Multicast routing, Protocol Independent Multicast (PIM) ,
Scalable Reliable Multicast, Overlay Networks, Peer-to-Peer Networks, ChordBasics in Cryptography and Security, Distributed Denial of Service,IP Traceback, Domain Name System (DNS),Using DNS for System Break-insSimulation and modeling issues, Wide-Area Traffic Modeling, How to evaluate TCP? End-to-end Internet Packet Dynamics, Why we don't know how to simulate the Internet.Web-server redirection mechanisms,Web cache sharing: Summary-Cache, Traffic Engineering, Multi-Protocol Label Switching (MPLS),IP Next generation, IPv6,IP Next Layer (IPNL).Text books:
Internetworking Computer Systems: Interconnecting Networks and Systems )Prentice Hall Advanced Reference Series( by John McConnell
Reference:Enabling Optical Internet with Advanced Network Technologies )Computer Communications and Networks( by Javier Aracil and Franco Callegati
Computer-Aided Design of Communication Networks )Advanced Series in Circuits and Systems( by Yi-Sheng Zhu and Wai-Kai Chen
CS 212 Human Computer Interface 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Introduction: Importance of user Interface – definition, importance of good design.Benefits of good design. A brief history of Screen design The graphical user interface – popularity of graphics, the concept of direct manipulation,graphical system, Characteristics, Web user – Interface popularity, characteristics-Principles of user interface. Design process – Human interaction with computers, importance of humanncharacteristics human consideration, Human interaction speeds, understanding business junctions. Screen Designing:- Design goals – Screen planning and purpose, organizing screen elements, ordering of screen data and content – screen navigation and flow – Visually pleasing composition – amount of information – focus and emphasis – presentation - information simply and meaningfully – information retrieval on web – statistical graphics – Technological consideration in interface design. Windows – New and Navigation schemes selection of window, selection of devices based and screen based controls. Components – text and messages, Icons and increases – Multimedia, colors, uses problems, choosing colors.Software tools – Specification methods, interface – Building Tools.Interaction Devices – Keyboard and function keys – pointing devices – speech recognition digitization and generation – image and video displays – drivers.
TEXT BOOKS:The essential guide to user interface design, Wilbert O Galitz, Wiley DreamTech.Designing the user interface. 3rd Edition Ben Shneidermann , Pearson EducationAsia
26
REFERENCE BOOKS:1 .Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd,
RussellBealg, Pearson Education
2 .Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech,3 .User Interface Design, Soren Lauesen , Pearson Education.
CS 312 Software Testing and Validation 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Software Testing Fundamentals, Testing objectives, How test information flows,Testing lifecycle, Test Cases – What it is?, Test Case, Designing(Concept & introduction should be covered here. Detailed techniques Levels of Testing, Unit Testing, Integration Testing, System Testing, Acceptance Testing, Alpha testing & Beta testing, Static vs. Dynamic testing, Manual vs. Automatic testingTesters workbench,steps of testing process Different types of Testing,Installation Testing, Usability testing, Regression testingPerformance Testing, Load Testing, stress testing, Security testing, Static & Dynamic Testing , Static Testing Techniques,Review types: Informal Review, Technical or peerreview, Walkthrough, Inspection, static analysis, Review Meeting, Review Reporting & Record keeping,Review guidelines & Review checklist,Data flow analysis Control flow analysis. Cyclometric Analysis,Dynamic testing – need & Advantages.Black Box & White Box Testing (Test Case Design Techniques), Functional Testing (Black Box),Equivalence partitioning, BVA, Cause-Effect graphing, Syntax testing (Concept & Test case generation only), Structural Testing (White Box),Coverage testing, Statement coverage,Branch & decision coverage, Path coverage, Domain Testing,Non functional testing techniques, Validation testing Activities,Low level testing, High level testing, Black box vs. White Box. Testing specialized Systems and Applications, Testing object oriented softwareTesting Web based Applications, Computer Aided Software testing tools (CAST) (only type & their purpose
Text books:1 .Software Engineering R. Pressmen – 6th Ed
2 .Software Engineering Sommerville3 .Introducing Software Testing Louise Tamres
Reference books:
1 .Effective Methods for software Testing William Perry2 .Software Testing in Real World Edward Kit
3 .Software Testing Techniques Boris Beizer4 .Software quality assurance: Principles and Practices by Nina Godbole,
27
CS 317 Software Maintenance and Evaluation 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Maintenance Issues and Related Management approaches – Introduction, Issues in software maintenance,Software maintenance body of knowledge, Definition, Maintenance measurement, Service measurement.Maturity models in software Engineering - Difference between maturity model, quality standards and evaluation method, Initial validation of a maturity model.Foundation of Software maintenance process – Operations and support. Process Management Domain – Overview – maintenance process focus KPA, maintenance processes / services definition KPA. Event / Request management Domain – overview , Maintenance planning and SLA and supplier agreement management KPA Evolution engineering domain – predelivery and transition services KPA – operational support services KPA - Verification and validation. Support for the evolution Engineering domain - Exemplary practices – process management , Event / Request Management domain, Evolution engineering domain.
Text books:1. Software Maintenance Management: Evaluation and Continuous Improvement (Practitioners) Alain april,Alain Abran 2. Practical Software Maintenance: Best Practic... by Thomas M. PigoskiReference books: Software Maintenance: Concepts and Practice by Penny Grubb
CS 313 Software Process and Modeling 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
Socio – Technical interaction networks in free / open source software development processes - Open source software development process modeling. Limitations and constraints of STINs on F/ OSS development processes – Open source projects – SPEM meta model description. OSSDP modeling – Software Dependability – Managing organizational change for software process improvement. A workshop – oriented approach for defining electronic process guides – A case study.
Text books:Software Process Modeling (International Series in Software Engineering) by Silvia T. Acuna, Natalia Juristo
Reference books:Software Process Change: International Software Process Workshop and International Workshop on Software Process Simulation and Modeling, SPW/ProSim ... / Programming and Software Engineering( by Qing Wang, Dietmar Pfahl, David M. Raffo and Paul Wernick
CS 421 Advanced Database Management Systems 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
This course provides students with advanced skills in the development of medium to very large database applications in a multi-user environment using relational database. It includes topics such as multi-user database issues, database application tuning and 28
optimization. Query optimization, data warehousing, data mining, transaction processing, concurrency control and recoveryText books:
Advanced Database Systems )The Morgan Kaufmann Series in Data Management Systems( by Carlo Zaniolo, Stefano Ceri, Christos Faloutsos and Richard T. SnodgrassReference books:
1 .Database Management Systems by Raghu Ramakrishnan and Johannes Gehrke2 .Database Systems: Design, Implementation, and Management )with Bind-In Printed Access
Card( by Carlos Coronel, Steven Morris and Peter Rob
CS 316 Management Information Syste ms 3 (2+0+2) credit-hoursTheoretical : 2 Practical: 2 Pre-request: - Credit: 3 hours
MANAGEMENT INFORMATION SYSTEM (MIS),Organisation and Information SystemsChanging Environment and its impact on Business - The IT/IS and its influence - The Organisation: Structure, Managers and activities - Data, information and its attributes - The level of people and their information needs - Types of Decisions and information - Information System, categorisation of information on the basis of nature and characteristics.kinds of information systems - Transaction Processing System (TPS) - Office Automation System (OAS) -Management Information System (MIS) - Decision Support System (DSS) and Group Decision Support System (GDSS) - Expert System (ES) -Executive Support System (EIS or ESS).Computer Fundamentals, Telecommunication and Networks,Computer System – Introduction - Generation of Computers – Classification of Computers - Input and output devices - Software – System s/w and Application s/w - O/S – Functions and Features.Communication, Media, Modems & Channels - LAN, MAN & WAN -Network Topologies, Internet, Intranet and Extranet. Wireless technologies like Wi-Fi, Bluetooth and Wi-Max. System Analysis and Development and Models - Need for System Analysis - Stages in System Analysis - Structured SAD and tools like DFD, Context Diagram Decision Table and Structured Diagram. System Development Models: Water Flow, Prototype, Spiral, RAD – Roles and responsibilities of System Analyst, Database Administrator and DatabaseDesigner.Manufacturing and Service Systems, Information systems for Accounting, Finance, Production and Manufacturing, Marketing and HRM functions - IS in hospital, hotel and bank Enterprise System - Enterprise Resources Planning (ERP): Features, selection criteria, merits, issues and challenges in Implementation - Supply Chain Management (SCM): Features, Modules in SCM - Customer Relationship Management (CRM): Phases.Knowledge Management and e-governance Choice of IT, Nature of IT decision - Strategic decision - Configuration design and evaluation, Information technology implementation plan. Security and Ethical Challenges, Ethical responsibilities of Business Professionals – Business, technology, Computer crime – Hacking, cyber theft, unauthorized use at work. Piracy, software and intellectual property. Privacy – Issues and the Internet Privacy.Challenges – working condition, individuals. Health and Social Issues,Ergonomics and cyber terrorism.
Text BOOKS:1“ .Management Information Systems”, Kenneth J Laudon, Jane P.
Laudon, Pearson/PHI,10/e, 2007
29
2“ .Management Information Systems”, W. S. Jawadekar, TataMcGraw Hill Edition, 3/e, 2004
3 .MIS by Ralph Stair
REFERENCE BOOKS:1“ .Introduction to Information System”, James A. O’ Brien, Tata
McGraw Hill, 12th Edtion.2“ .Management Information Systems”, S.Sadagopan, PHI, 1/e, 2005
3“ .Management Information Systems”, Effy Oz, Thomson CourseTechnology, 3/e, 2003
4 .Corporate Information Strategy and Management”, Lynda MAppleGate, Robert D Austin et al, Tata McGraw Hill, 7th Edition.
CS 315 Enterprise Resource Planning 3 (3+0+0) credit-hours Theoretical : 3 Practical: - Pre-request: - Credit: 3 hours
INTRODUCTION
ERP: An Overview, Enterprise – An Overview, Benefits of ERP, ERP and Related Technologies, Business Process Reengineering (BPR), Data Warehousing, Data Mining, OLAP, SCM ERP IMPLEMENTATION
ERP Implementation Lifecycle, Implementation Methodology, Hidden Costs, Organizing the Implementation, Vendors, Consultants and Users, Contracts with Vendors, Consultants and Employees, Project Management and Monitoring THE BUSINESS MODULES Business modules in an ERP Package, Finance, Manufacturing, Human Resources, Plant Maintenance, Materials Management, Quality Management, Sales and Distribution THE ERP MARKET ERP Market Place, SAP AG, Peoplesoft, Baan, JD Edwards, Oracle, QAD, SSA ERP – PRESENT AND FUTURETurbo Charge the ERP System, EIA, ERP and e-Commerce, ERP and Internet, Future Directions
TEXT BOOK
1. Alexis Leon, “ERP Demystified”, Tata McGraw Hill, New Delhi, 2000
REFERENCES
1. Joseph A Brady, Ellen F Monk, Bret Wagner, “Concepts in Enterprise Resource Planning”, Thompson Course Technology, USA, 2001.
2. Vinod Kumar Garg and Venkitakrishnan N K, “Enterprise Resource Planning – Concepts and Practice”, PHI, New Delhi, 200
30
CS 424 Information Systems Project Management 3 (3+0+0) credit-hours
Theoretical : 3 Practical: - Pre-request: - Credit: 3 hours
The project management context – What is a successful project – Why do projects fail? – The project control environment – The role of a project management office - Managing and participating. Understanding the project Project justification – Project initiation. Defining the project – Defining the Deliverables – Project objective – Review and Approval – Systems Development life cycle. Planning the project – Managing Risk – Project Assumptions and constraints – planning for quality – Preparing the schedule – Resource leveling – Planning for implementation – Planning for completion. Running the Project – Building the team – Tracking progress – Earned value Negotiating for resources – controlling action items – Managing risks – Team meetings – Reporting status – Reflection – Closing the project – Project completion.
Text books:Information Systems Project Management: How to Deliver Function and Value in Information Technology Projects by Jolyon Hallows
Reference books:Information Technology Project Management )with Microsoft Project 2007 CD-ROM( )6th ed( by Kathy Schwalbe
Information Technology Project Management, Revised )with Premium Online Content Printed Access Card( by Kathy Schwalbe
CS 422 Data Communication Systems 2 (2+0+0) credit-hours Theoretical : 2 Practical: - Pre-request: - Credit: 3 hours
INTRODUCTION TO DATA COMMUNICATIONS AND NETWORKING: modulation, and demodulation :Signal Analysis, Electrical Noise and Signal-to-Noise Ratio, Analog Modulation Systems, Information Capacity, Bits, Bit Rate, Baud, and M-ary Encoding, Digital Modulation.metallic cable transmission media :Metallic Transmission Lines, Transverse Electromagnetic Waves, Characteristics of Electromagnetic Waves, Transmission Line Classifications Optical fiber transmission media :Advantages of Optical Fiber Cables, Disadvantages of Optical Fiber Cables, Electromagnetic spectrum, Optical Fiber Communications System Block Diagram, Optical Fiber construction, The Physics of Light, Velocity of Propagation, Propagation of Light Through an Optical fiber Cable, Optical Fiber Modes and Classifications, Optical Fiber Comparison, Losses in Optical Fiber Cables, Light sources, Light Detectors, Lasers. digital transmission Pulse Modulation, Pulse code Modulation, Dynamic Range, Signal Voltage –to-Quantization Noise Voltage Ration, 31
Linear Versus Nonlinear PCM Codes, Companding, PCM Line Speed, Delta Modulation PCM and Differential PCM. Multiplexing and t carriers :Time- Division Multiplexing, T1 Digital Carrier System, North American Digital Multiplexing Hierarchy, Digital Line Encoding, T Carrier systems, European Time- Division Multiplexing, Statistical Time – Division Multiplexing, Frame Synchronization, Frequency- Division Multiplexing, Wavelength- Division Multiplexing, Synchronous Optical NetworkWireless Communications Systems :Electromagnetic Polarization, Rays and Wavefronts, Electromagnetic Radiation, Spherical Wavefront and the Inverse Square Law, wave Attenuation and Absorption, Optical Properties of Radio Waves, Terrestrial Propagation of Electromagnetic Waves, Skip Distance, Free-Space Path Loss, Microwave Communications Systems, Satellite Communications Systems.Telephone Instruments and Signals:The Subscriber Loop, Standard Telephone Set, Basic Telephone Call Procedures, Call Progress Tones and Signals, Cordless Telephones, Caller ID, Electronic Telephones, Paging systems.THE TELEPHONE CIRCUIT The Local Subscriber Loop, Telephone Message- Channel Noise and Noise Weighting, Units of Powers Measurement, Transmission Parameters and Private-Line Circuits, Voice-Frequency Circuit Arrangements, Crosstalk. cellular telephone systems:First- Generation Analog Cellular Telephone, Personal Communications system, Second-Generation Cellular Telephone Systems, N-AMPS, Digital Cellular Telephone, Interim Standard, North American Cellular and PCS Summary, Global system for Mobile Communications, Personal Communications Satellite System.Data communications codes, error control, and data formats:Data Communications Character Codes, Bar Codes, Error Control, Error Detection, Error Correction, Character Synchronization.TEXT BOOKS:
1 .Introduction to Data Communications and Networking, Wayne Tomasi, Pearson Education.Reference books:
1 .Data Communications and Networks: An Engineering Approach by James Irvine and David Harle
2 .Data Communications: From Basics to Broadband )4th Edition( by William J. Beyda
32
CS 423 Business Intelligenc e 2 (2+0+0) credit-hours Theoretical : 2 Practical: - Pre-request: - Credit: 3 hours
Introduction to Business Intelligence and Data Warehousing, Launching and
managing DW/BI project/program. Requirements collection, Architecture,
Dimensional modeling, Designing physical database and planning for performance.
ETL design and techniques, Business Intelligence applications, Deploying and
supporting DW/BI system Expanding DW/BI system, Master data management,
unstructured data and other trends in DW/BI.
Text books:
1. Business Intelligence )2nd Edition( by Efraim Turban, Ramesh
Sharda, Dursun Delen and David King
2. Successful Business Intelligence: Secrets to Making BI a Killer App by Cindi Howson
Reference books:
1. Business Intelligence Roadmap: The Complete Project Lifecycle for Decision-Support Applications by Larissa T. Moss and
Shaku Atre
2. Business Intelligence For Dummies by Swain Scheps
CS 210 Operations Research 3 (2+0+2) credit-hours Theoretical : 2 Practical:2 Pre-request: - MATH 130 Credit: 3 hours
Linear programming: Formulations and graphical solution. Algebraic solution: the simplex method and dual-simplex method. Sensitivity analysis. Transportation and assignment problems. Integer programming: cutting-plane algorithms, branch and bound method. Dynamic programming: Examples of the dynamic programming. Models and computations, solution of linear programs by dynamic programs. Project scheduling by PERT-CPM.
CS 313 Modeling and Simulation 3 (2+0+2) credit-hours Theoretical : 2 Practical: 2 - Pre-request: - Credit: 3 hoursBasic simulation modeling. Nature of simulation. System models & simulation, discrete event simulation. Simulation of a single-server queuing system. Simulation of an inventory system. List processing in simulation. Simulation languages. Simulation of time sharing systems. Simulation output data and stochastic processes. Building 33
valid and credible simulation models. Principles of valid simulation modeling. Verification of simulation computer programs. An approach for developing valid & credible simulation models. Statistical procedures for computing real-world observation & simulation output data. Some practical considerations: Selecting input probability distributions. Random number generators. Generating random variables. Output data analysis for a single system.
CS 315 Decision Support Systems 3 (2+0+2) credit-hours Theoretical : 2 Practical:2 - Pre-request: - Credit: 3 hours
An overview of decision support systems (DSS), a definition of decision support systems, decision support systems characteristics, a brief example of a decision support system, some differences between MIS and decision support systems, the impetus for decision support systems, decision support systems levels, institutional and ad hoc decision support systems, the decision support systems, operating and evolving a decision support systems, application of decision support systems, hardware selection of decision support systems, software selection of decision support systems.
3) 3+0+0 ( credit-hours Software Project Management CS 313 . Theoretical : 3 Practical: - Pre-request: - Credit: 3 hours
Outlining the "traditional" waterfall approach to software development, Changes for management when it comes to today's iterative software processes, Project Planning, Project Scheduling and Tracking, An eye towards management (with emphasize on project estimation and planning), principles to managing software, Hints for all facets of development, Detailed project milestones and other deliverables to help one manage software better, Breakdown of tasks for project team that helps to maximize efficiency, Risk Analysis and management, Common pitfalls of managing software, Return On Investment (ROI), Control of software costs, Improvement of team efficiency, Introduction to Software Quality Assurance (SQA) and Configuration Management.
CS400 Multimedia Information Systems 3 (2+0+2) credit-hours Theoretical : 2 Practical:2 - Pre-request: - Credit: 3 hours
The Multimedia Information Systems Revolution: The Unfolding of a Reality, Architectures of Multimedia Information Systems, Networked Multimedia Information Systems, Multimedia on the Information Superhighway, Application Frameworks for Multimedia Information Systems, Organizational Impacts of Multimedia Information Systems, Multimedia Authoring Systems, and the Challenge of Multimedia Information Systems to the MIS Manager.
34
CS 206 Java 3 (2+0+2) credit-hours
Theoretical : 2 Practical:2 - Pre-request: - Credit: 3 hours
This course covers the history, theory, and practice of modern programming languages, with emphasis on markup languages and their associated scripting languages. The markup languages of SGML, XML, and HTML along with the standard scripting language ECMAScript (JavaScript) are included along with the Document Object Model. This course has the objective of introducing the student to graphical user interface (GUI) systems using the most current version of Java. Students will learn to implement a series of interactive stand-alone or web-based interfaces. Event handling and multi-threaded Java programs will be studied. Image and data transmission via the Internet will be presented. Prerequisite: ECO 201
CS 314 Graphic Information System (GIS): 3 (2+0+2) credit-hours
Theoretical 2 Practical:2 - Pre-request: - Credit: 3 hoursGeographic Information Systems (GIS) allow individuals and organizations topose, explore and answer a variety of public- and private-sector questions using spatial data. In this course the student will learn to identify, manipulate and analyze spatial data using state-of-the-art software. The course is project-driven and hands-on: students will define and address real problems using real data. The course will also cover selected topics in information visualization as they relate to the use of GIS.
CS 488 Graduation Project (1) 2(2+0+0) credit-hours .
Student should have a case study in his specialized topic and at the end he will write an essay in an English language. There are no specific guidelines concerning the length of an essay but not to exceed 60 pages, but students are reminded that an accurate and concise essay usually indicates a better understanding of the topic. The organization of the essay should follow that of a typical research paper, as outlined below
Title page Abstract Introduction Materials & Methods Results Discussion Conclusions Acknowledgements References
The Abstract should be brief and to the point, no more than half a page. The Introduction The student should conduct a literature survey of the case he chooses for his study. He should clearly identify the purpose of the work, especially focusing on the study case problems and questions being addressed. Other researcher idea should be addressed and criticized. The student approach to solve the problem should be justified. 35
The other sections of the theses should have appropriate sub-headings to make the story readable and easy to follow. There is a trend in modern papers for these headings to be in the form of very short (e.g. 2-5 words) statements giving the main point of the section, a trend you may wish to follow.The Materials & Methods, the results and the discussion should be completed. The Conclusions should refer back to the introduction, showing how the completed work relates to the original objectives. The References section should be accurate and in the style of one of the leading journals in the field.
Students are reminded to consult the Senate document relating to academic honesty. Paraphrasing sentences or larger sections of research articles or reviews will constitute plagiarism.
Finally student at the end of the semester should write a draft report on the work he did in his project. His report will be marked on the basis of completing the above requirements. Finally he should submit the report and give at least couple of seminars on that topics.
CS 499 Graduation Project (2) 2(2+0+0) credit-hours .
The student should submit the essay and give at least couple of seminars on his work then he has to set a viva-voice. Traditionally, the viva-voice or oral examination occurs after submitting an essay on the topics that he had chosen.Oral presentations are a very good measure of student understands of a subject and their ability to verbally explain the subject to someone else. Finally student should sit for oral examination. Oral examinations may be conducted preferable by one external or one internal examiner. Oral examinations typically have two main purposes. Firstly, the oral exam allows an examiner to ascertain the comparability of a degree grade amongst different educational institutions. Secondly, it allows the examiner to confirm or improve the appropriate degree grade classification for a student that may be just under the borderline for a higher degree grade. Oral examinations are not just an assessment of the student's performance- oral exams are usually an opportunity for the examiner to get feedback from the students on the performance of the department and university.
36
