BS (CS) Course Outline

BS (Computer Science) Course Contents Semester 1

Course Code / Name: NS – 111 / Calculus and Analytical Geometry Course Outline: Complex Numbers  DeMoivre’s Theorem and its Applications  Simple Cartesian Curves  Functions and Graphs  Symmetrical Properties  Curve Tracing, Limit and Continuity  Differentiation of Functions  Derivative as Slope of Tangent to a Curve and as Rate of Change: Application to Tangent and Normal, Linearization, Maxima/Minima and Point of Inflexion  Taylor and Maclaurin Expansions and their convergence  Integral as Anti-derivative  Indefinite Integration of Simple Functions  Methods of Integration: Integration by Substitution, by Parts, and by Partial Fractions, Definite Integral as Limit of a Sum  Application to Area, Arc Length, Volume and Surface of Revolution

Course Code / Name: CS – 111 / Introduction to Computing Course Outline: History of Computers  Generations of Computer: Numbers Systems, Binary, Octal, Decimal, Hexadecimal, Arithmetic Operation, Numbers systems conversions  Computer Hardware: Input & Output CPU & Storage, Data, Information, record, Types of computers  Internet and World Wide Web : Narrowband, Broadband, & Access Providers ,POPs, NAPs, Backbone & Internet2  Problem Analysis & Solving : Analysis, Coding, Execution Cycle  Introduction to Programming: Basic of C++ Program, Data Types, Variables , Arithmetic Operators  Input : Allocation of memory with constants & variables , Putting data into variables Output : Preprocessor Directives, Namespaces and using cin and cout in a program , Creating C++ Program  Debugging: Using Pseudo Codes to debug a program, Identify and Fix errors  Logical (Boolean) Operators : Selection of IF-Then and IF-Else For-Next and Do-While looping Course Code / Name: HS – 111 / Functional English Course Outline: Principles of writing good English  understanding the composition process: writing clearly; word, sentence and paragraph.  Comprehension and expression  Use of grammar and punctuation  Process of writing, observing, audience analysis, collecting, composing, drafting and revising, persuasive writing, reading skills, listening skills and comprehension, skills for taking notes in class, skills for exams Course Code / Name: CS – 112 / Basic Electronics Course Outline: Semiconductor Physics  Diodes  Special purpose diodes: Zener, LED, photo diode, Varactor, schottky  Diode based clipper, clamper, voltage multiplier  Half, full and Bridge Rectifiers  Voltage regulators  Bipolar Junction Transistor (BJT) DC and AC analysis  BJT basic inverter/switch  Op-Amp  Emitter Bias analysis & design  Voltage divider bias analysis & design  Computer simulation of BJT circuit  Voltage gain ,current gain and power gain  CB amplifier ac and dc Equivalent  OPAMP using transistor, OPAMP modes

1

Hamdard University Karachi, Pakistan

BS (CS) Course Outline

Course Code / Name: HS – 112 / Pakistan Studies Course Outline: Foreign invasions  The Mughals  The British  World Wars  Independence & Partition  Discussions on National Issues  Constitution-making Efforts  Foreign Policies  The Military Culture  Dismemberment of Pakistan  Pakistan’s Geographic Situation  Pakistan’s Economic Situation  Strengths and Weaknesses of Pakistan Course Code / Name: HS – 113 / Islamic Studies / Ethical Behavior Course Outline: The Five Dimensions of Islam  Comparative Study of World Religions  Prophet Muhammad (SAW) as a Role Model  Islamic Political System: Rightly-guided Caliphate, Imamate  Sources of Islamic Legislation: Compilation of Quran, Compilation of Ahadith

Semester 2

Course Code / Name: NS – 121 / Multivariable Calculus Course Outline: Complex Numbers: Properties of Complex Number, Polar form and conversation  DeMoivre’s Theorem and its Applications  Simple Cartesian Curves: Functions and Graphs  Curve Tracing  Differentiation of Functions  Applications (Related rates, Maxima and minima  Integral as Anti-derivative: Indefinite Integration of Simple Functions  Methods of Integration: Integration by Substitution, by Parts, and by Partial Fractions  Definite Integral as Limit of a Sum  Volume and Surface of Revolution Course Code / Name: CS– 121 / Programming Fundamentals Course Outline: Overview of computers and programming  Overview of language for e.g. C language  Basics of structured and Modular programming  Basic Algorithms and problem solving: development of basic algorithms, analyzing problem, designing solution, testing designed solution  Fundamental programming constructs: translation of algorithms to programmes  data types  control structures  functions  arrays  records  files  testing programmes. Course Code / Name: CS – 122 / Discrete Structures Course Outline: Logic: truth table, propositional logic, logical equivalence, predicates & quantifiers, and logical reasoning  Sets: basics, set operations  Functions: one-to-one, onto, inverse, composition, graphs  Sequences and Summations  Mathematical reasoning and induction: Proof strategies, Mathematical Induction, Recursive definitions, Structural Induction  Counting: basic rules, Pigeonhole principle, Permutations and Combinations, Binomial coefficients and Pascal triangle.  Probability: Discrete probability. Expected values and variance  Relations: Properties, Combining relations, Closures, Equivalence, Partial ordering  Graphs: directed, undirected graphs  Trees: Introduction to trees, trees traversal, spanning trees Course Code / Name: HS – 121 / Communication Skills Course Outline: Principles of writing good English  understanding the composition process: writing clearly; words, sentence and paragraphs Use of grammar and punctuation  Process of writing: observing, audience collecting, composing, drafting and revising, persuasive writing, reading skills, 2

Hamdard University Karachi, Pakistan

BS (CS) Course Outline listening skills and comprehension, skills for taking notes in class, skills for exams  Business communications: planning messages, writing concise but with impact  Letter formats, mechanics of business, letter writing, letters, memo and applications, summaries, proposals, writing resumes, styles and formats, oral communications, verbal and nonverbal communication conducting meetings, small group communication, taking minutes  Presentation skills; presentation strategies: defining the objective, scope and audience of the presentation  material gathering material organization strategies, time management, opening and concluding, use of audio-visual aids, delivery and presentation.

Semester 3

Course Code / Name: NS – 211 / Linear Algebra Course Outline: Introduction to Linear Algebra and Linear Equations  System of Linear Equations (unique, infinite and no solution)  Matrices: Operation in Matrices, Properties and Matrix Arithmetic, transpose  Cofactor, Minors, Homogenous, Non-homogenous systems, trivial solution  Augmented matrix: Symmetric, Skew Symmetric, Singular and Non singular Matrix  Gaussian elimination (REF)  Inverse Matrices using Gauss-Jordan (RREF)  Solution of equations using Cramer’s rule  Vector space : Subspace of Vector Spaces, Dimension of Null Spaces, Dimension of Row Spaces  Electrical circuits solution using matrices Course Code / Name: CS – 211 / Digital Logic Design Course Outline: Binary numbers  Logic gates  Construction of truth tables  Boolean equations: CSOP and MSOP  Design equations: Boolean algebra rules, Karnaugh maps  Combinational v/s sequential circuits  Design of a full adder: N-bit binary adder/ subtractor  Design of multiplexers, Encoders, Decoder, Parity circuits  Design of parity generator, Word comparator, controlled inverter  Shift registers. Quine-McCluskey method. PXOP algorithm  D-type and JK-type flip-flops. Design of sequential circuits  Modern methods of designing combinational and sequential circuits. FPGA, PLD and HDL etc.

Course Code / Name: CS – 212 / Object Oriented Programming Course Outline: Evolution of Object Oriented Programming (OOP)  Object Oriented concepts and principles problem solving in Object Oriented paradigm OOP design process: classes, functions/methods, objects and encapsulation  constructors and destructors, operator and function/method overloading  association aggregation  composition  generalization  inheritance and its types: derived classes  function/method overriding  abstract and concrete classes: abstract functions  polymorphism, exception handling  Input/output Streams Swing API and event handling Course Code / Name: NS – 212 / Probability and Statistics Course Outline: Introduction: Collection of Data (Primary and Secondary data), Variable’s Types  Data Description: Measure of Central Tendency (for un-grouped & grouped data)  Measure of Variation  Graphical Presentation of Data (Histogram, Frequency Polygons and Ogive)  Frequency definition of Probability  Conditional Probability  Discrete random variables, Distribution functions, Probability mass function  Mean, expected value, variance of discrete distributions  Variance and 3

Hamdard University Karachi, Pakistan

BS (CS) Course Outline standard deviation of random variable, Marginal probabilities in bi-Variate cases  Linear Regression: Least Square method for Regression Line  Correlation

Semester 4

Course Code / Name: CS – 221 / Data Structure and Algorithms Course Outline: Introduction to Data Structures and Algorithms Complexity Analysis  Arrays  Sorting Algorithms: Insertion Sort, Selection Sort, Bubble Sort, Shell Sort, Heap Sort, Quick Sort, Merge Sort, Radix Sort, Bucket Sort  Linked Lists: Singly Linked Lists, Doubly Linked Lists, Circular List  Stacks, Queues, and Priority Queue Recursion: Function call and Recursion Implementation, Tail Recursion, Non-tail Recursion, Indirect Recursion, Nested Recursion, Backtracking  Trees: Binary Trees, Binary Heap, Binary Search. Tree Traversal, Insertion, Deletion, and Balancing a Tree  Heap. B-Tree, B+ Tree, Spanning Tree, Splay Trees  Graphs: Representation, Traversal, Shortest Path, and Cycle Detection  Isomorphic Graphs. Graph Traversal Algorithms  Hashing. Memory Management and Garbage Collection. Course Code / Name: CS – 222 / Data Communication and Computer Networks Course Outline: An overview of data communications and networking  Network categories and models  Signals: analog & digital  Analog versus digital  Data rate limits  Transmission impairment  Digital transmission: line coding and sampling  Analog transmission  Transmission media  Data communication interface  High speed digital access digital subscriber line DSL  Data link control  Data link protocols  Internet protocol addresses  LAN systems  Internetworking  Internetworking devices Course Code / Name: CS – 223 / Microprocessor and Assembly Language Course Outline: Microprocessor Bus Structure: Addressing, Data and Control  Introduction to Registers and Flags  Addressing Modes, Instruction sets including Data Movement  Arithmetic and Logic  Program Control, Stack and its operation  Peripheral Control Interrupts  Introduction to the Assembler and Debugger  Manipulate and translate machine and assembly code  Describe actions inside the processing chip Course Code / Name: NS – 221 / Differential Equation Course Outline: Ordinary Differential Equations of the First Order: Geometrical Considerations, Isoclines, Separable Equations, Equations Reducible to Separable Form, Linear First-Order Differential Equations, variation of Parameters  Ordinary Linear Differential Equations  Homogeneous Linear Equations of the Second Order  Homogeneous Second-Order Equations with Constant Coefficients  General Solution  Real Roots, Complex Roots, Double Root of the Characteristic Equation  Differential Operators, Homogeneous Linear Equations of Arbitrary Order  Homogeneous Linear Equations of Arbitrary Order with Constant Coefficients  Non-homogeneous Linear Equations  Modelling of Electrical Circuits  Systems of Differential Equations  Series Solutions of Differential Equations  Partial Differential Equations: Method of Separation of variables, wave, Heat & Laplace equations and their solutions by Fourier series method.

4

Hamdard University Karachi, Pakistan

BS (CS) Course Outline

Semester 5

Course Code / Name: CS – 311 / Database Systems Course Outline: Basic database concepts  Database Architecture  Logical database Modeling and design: Entity Relationship diagram (ERD)  Enhanced ERD Relational data model: mapping ERD to relational model  Functional dependencies and Normalization: 1st -3rd Normal Form and BCNF,  Relational Algebra  Structured Query language (SQL); Fundamental knowledge about Transaction processing  concurrency control recovery techniques and query optimization concepts. Course Code / Name: CS – 312 / Introduction to Software Engineering Course Outline: Overview of SE, Practice & Myths  the Software Processes  Generic Process Models: Framework Activity  Task Set, Process Patterns  Process Improvement, CMM Prescriptive, Process Models: Waterfall Model, Incremental Process Model, Evolutionary Process Model; Specialized Process Models: Component Based Development, the Formal Methods Models, Agile Development; Business Information Systems: Components, Types, and Evaluating methods. SDLC: Phases, System Planning, Preliminary Investigation, SWOT Analysis  Requirements Engineering  Difference between Structured Analysis and Object Oriented Analysis  Data & Process Modeling; Diagrams: Data Flow, Context, Conventions, Detailed Level DFD’s; Leveling and Balancing  Logical Versus Physical Models.  The Design Process; Architecture Design Elements, Interface Design Elements, Component-Level Design Elements, Deployments Design Elements  System Architecture, Architectural Styles. User Interface Design. WebApps Interface Design  Validation Testing, System Testing  Internal and External View of Testing  Project Management  Maintenance and Reengineering. Course Code / Name: CS – 313 / Operating System Course Outline: Operating Systems Introduction: History of Operating System  Concepts of process  Operating system Objectives and Functions  Process and CPU management, Multithreading, Kernel and User Modes, Protection  Problems of cooperative processes, Synchronization  Deadlocks  Memory management and virtual memory  Relocation, External Fragmentation  Paging and Demand Paging Secondary storage  Security and Protection  File systems  I/O systems  Scheduling and dispatch, Introduction to concurrency  Introduction to distributed operating systems and its advantages Course Code / Name: CS – 314 / Numerical Computing Course Outline: Theory of Differences, Difference Operators  Introduction to MATLAB, Some basic problems using MATLAB  Difference Tables, Forward Differences, Backward Differences, Central Differences  Mathematical Preliminaries  Interpolation and Polynomial Approximation  Bisection method  Regular falsi method  Newton’s Method, Different problems  Different problems, Lagrange interpolation  Numerical Integration  Trapezoidal Rule for Integration  Initial Value Problems for Ordinary Differential Equations  Iterative Techniques in Matrix Algebra  Taylor Series Expansion  Iterative Techniques in Matrix Algebra Semester 6

5

Hamdard University Karachi, Pakistan

BS (CS) Course Outline Course Code / Name: CS – 321 / Theory of Automata Course Outline: Finite State Models: Language definitions preliminaries  Regular expressions/Regular languages  Finite automata (FAs), Transition graphs (TGs), NFAs, Kleene’s theorem, Transducers (automata with output), Pumping lemma and non regular derivation trees and ambiguity  language Grammars and PDA: Context free grammars, Derivations,  Simplifying CFLs  Normal form grammars and parsing  Decidability  Chomsky’s hierarchy of grammars Turing Machines Theory: Turing machines, Post machine, Variations on TM, TM encoding  Universal Turing Machine  Context sensitive Grammars  Defining Computers by TMs. Course Code / Name: CS – 322 / Design and Analysis of Algorithm Course Outline: Introduction to Algorithm  Insertion Sort Algorithm: Analysis and Design of Insertion Sort Algorithm  Growth of Functions: Asymptotic Notation  Divide and Conquer Approach  Recursion  Recurrence  Heap Sort  Binary Search Trees  Red Black Trees  Hashing  Dynamic Programming  Greedy Approach and Algorithm  Disjoints Sets  Graph Algorithm  Network Flow  Matrix Operation  Polynomials  String Matching  NP – Completeness  Approximation Algorithm Course Code / Name: CS – 323 / Computer Architecture and Organization Course Outline: Organization and Architecture  Structure and Function  Designing for Performance  Architecture Evolution  A Top-Level View of Computer Function and Interconnection: Computer Components, Computer Function, Interconnection Structures and Bus Interconnection  Cache Memory Principles  Elements of Cache Design  Semiconductor Main Memory  Advanced DRAM Organization  External Memory  Programmed I/O, Interrupt-Driven I/O  External Interface: InfiniBand, FireWire  Memory Management: Instruction Sets, Addressing Mode, Instruction Formats, Process and Register Organization  Instruction Execution Characteristics Course Code / Name: HS – 323 / Technical Report Writing Course Outline: Elements Of Technical Paper: Title, Abstract; Keywords, Literature Review, Methodologies, Results and Discussion  Reference Management by EndNote and Mendeley  Intellectual Property Rights  Writing Patents  Understanding Plagiarism and its consequences  Writing Research Papers and Reports  Writing Cover letters: Request, Reply, Preparation, Delivery  Writing Quotation Letters: Contents, Request, Reply office  Memorandums  Technical Proposals.

Semester 7

Course Code / Name: CS – 411 / Human Computer Interaction Course Outline: Human and Human Capabilities  The interaction  The paradigms  Interaction design basics  HCI in the software process  UI Software Architecture  Conceptual Models and Metaphors  Communication and collaboration models  Evaluation techniques  Heuristic Evaluation  Predictive Evaluation  Information Visualization  Modeling rich interaction  Pen-based UI  Weird Modalities  Zooming and Transparent UI Course Code / Name: CS – 412 / Compiler Construction 6

Hamdard University Karachi, Pakistan

BS (CS) Course Outline Course Outline: Introduction to interpreter and compiler  Compiler techniques and methodology: Organization of compilers, Lexical and syntax analysis, Parsing techniques  Types of parsers, top-down parsing, bottom-up parsing, Type checking, Semantic analyzer  Object code generation and optimization, detection and recovery from errors  Intermediate Representation, code generation  Error Detection and Recovery  Error Repair, Compiler Implementation  Compiler design options and examples, Compilers C++, Java, and YACC Compilers. Course Code / Name: CS – 413 / Artificial Intelligence Course Outline: AI Paradigm  Objective and Scope of  AI Problem Solving: Searching Algorithm and techniques  Knowledge Representing and Reasoning  Human-Machine understandings  Semantic Networks  Decision making: Simple and complex  Hill Climbing Algorithm  Prolog Programming  LISP Programming  Soft Computing  Expert Systems  Artificial Neural Networks  Fuzzy Logic and Fuzzy Set  Binary Fuzzy Relation, Fuzzy Complement  Fuzzy Operations [Max-Min, Max-Product Compositions]. Semester 8

Course Code / Name: HS – 421 / Professional Practices Course Outline: Ethics: The Importance of Ethics, Ethics in IT, Ethical Theory, Professional Ethics, Ethics Model for Decision Making  Ethics For IT Professional and IT User: Professional Relationships, Codes of Ethics of Professional Conduct  Professional Codes of Ethics: Professional Societies, Alternative of Ethic Codes for IT Professional  Computer and Internet Crime: Computer Crime/Net Crime/ Cyber Crime, Cyberstalking, Concepts, methodologies and Codes of Cyberethics  Information and The Law: Legal issue Related to Information, Data Privacy and Protection, Right of Data Subject  Software Piracy: Types of Software Piracy, Anti Piracy Organization/Enforcement  Intellectual Property: Copyright, Paten, Trademark, IP Issues  Software Quality : External and Internal Quality Course Code / Name: CS – 421 / Information Security Course Outline: Basic notions of confidentiality : integrity, availability authentication models  protection models  security kernels  Encryption, Hashing and Digital 33 Signatures; audit  intrusion detection and response  database security, host- based and network-based security issues operational security issues physical security issues; personnel security  policy formation and enforcement access controls  information flow  legal and social issues  identification and authentication in local and distributed systems  classification and trust modeling  risk assessment

University Electives Course

Course Code / Name: MG – 121 / Financial Accounting Course Outline: Introduction to Accounting  Accounting : Information of decision making  Basic Accounting Concepts  Basic Financial Statements  The Accounting Cycle : Capturing Accounting Events  The Accounting Cycle : Preparing Annual reports, Accounting for Merchandising Activities, Inventory Costing Methods  Merchandising and the Accounting Cycle: GL and Subsidiary Ledgers, Perpetual and Periodic Inventory systems  Posting  Trial Balance  Financial Statements  Accounting for Property  Plant and Equipment  Accounting for Debtors and Stock. 7

Hamdard University Karachi, Pakistan

BS (CS) Course Outline Course Code / Name: MG – 211 / Financial Management Course Outline: Meaning and Scope of Financial Management  Financial Statements; IS, BS, Statement of RE  The Finance manager and the financial environment)  Understanding financial statements Analyzing the financial statements  Time Value of Money  Debt Management, Profitability and Market Value Ratios  The Cost of Capital  The Basics of Capital Budgeting  Comparison on Capital Budgeting Methods  Profitability Index. Course Code / Name: MG – 221 / Principles of Management and Economics Course Outline: Introduction to Management and Organization Managerial functions  The Global Environment  Managing Diversity  Planning: Strategy & Change, Tools and Techniques;  Organizational Control and Culture Leadership & Management  Motivation; Management by Objective  Project Management  IT Management  Introduction to Economics  Macro and Micro Economics  Graphs in Economics  Demand & Supply: Market Equilibrium  Changes in Price & Quantity  Consumer Theory  Elasticity  Production  Cost  Introduction to Market Structures. Course Code / Name: MG – 312 / Entrepreneurship Course Outline: Entrepreneurial Mind  Entrepreneurial Perspective  Entrepreneurial Process  Effectuation and its principles  Entrepreneurial Strategy: Generating and Exploiting New Entries  Creativity and the business data  The business plan : Creating and starting the Venture  The Marketing Plan The Organizational Plan  Opportunity Recognition and Evaluation  The Financial Plan  Sources of Capital  Strategy  Execution and Managing Ventures  Planning for Change Course Code / Name: SS – 3312 / Organizational Behavior Course Outline: Course Outline: Understanding Organizational Behavior Trends and Changes  Structure and control in organization  Individual and work learning  Stress  Individual differences Motivation and job satisfaction  Group and work  Group and inter-group behavior  Leadership  Patterns of work  Conflict and consent in work  Organizational culture  Effective Communication  Contemporary Approaches to Leadership Characteristics of Organizational Culture

CS Electives Course

Course Code / Name: CS – 351 / Web Engineering Course Outline: Web Application Development Approach: process model  Introduction to internet programming  Communication  domains  Web Servers  Working of www  Internet Protocols  Web Browsers  HTML: Attributes  Web Pages  URI  URL  URN  HTML Tags  HTML Page Structure  DOM  CSS: Syntax, Layers, Styles and Properties  JavaScript: operator, function, arrays  PHP: Syntax, Security and form validation with java script  MySql: database connectivity, joins, DML and DDL  AJAX  Error handling  Cookies  Session  Emailing in PHP

Course Code / Name: CS – 352 / Mobile Application Development

8

Hamdard University Karachi, Pakistan

BS (CS) Course Outline Course Outline: Android Application platform  Application fundamental  Review of java concepts  Activity class  Intents and permission  Fragments  User Interface class  Event handling  Broadcast Receiver  Content Providers  Graphics  Themes and Styles  Drag and Drop  Notifications  Location and Maps  Publishing Android Applications Course Code / Name: CS – 353 / Semantic Web Course Outline: Introduction to semantic web  Structured web documents in XML: XML Language, Structuring, process  Describing Web Resources: RDF Language and RDF Schema, Query in SPARQL, Semantic of SPARQL  Web ontology language: Three sublanguages of OWL, Layering of OWL  Logics and inference : Semantic rule language, DLP, SWRL , Rule Markup language  Ontology Engineering: Reusing existing ontology, ontology mapping  Introduction to tools: Basic idea, entity, class, object property, data property , annotation property  Application: Web Services Course Code / Name: CS – 363 / Cryptography and Network Security Course Outline: Introduction to information and data security Basic concepts: attacks, risks, security functions and mechanisms, vulnerabilities  Cryptography: basic concepts, cryptanalytic attacks  classical techniques and its cryptanalysis  symmetric algorithms, basic concepts and principles, block cipher modes of operation, DES, AES  Hash function, MAC  Digital signature, DSS. Certificates, certificate authority  Firewalls, electronic mail security (PEM, PGP, S/MIME), SSL  Standards (ITSEC, ITSEM, Common Criteria

Course Code / Name: CS – 381 / Software Requirement Engineering Course Outline: Software Requirements Engineering: Non Functional Requirements, Functional Requirements  Process Models and Requirement Engineering Process  Requirements Elicitation – Stages, Basics of Knowledge Acquisition Specific  Elicitation Techniques Including: Interviewing, Scenarios, Prototyping  Requirements Analysis - Incomplete Requirements, Inconsistent Requirements  Requirements Errors: Impact of Requirements Errors, Error Prevention in Requirements  Requirements Management: Stable and Volatile Requirements  Change Management; Requirements Traceability  Software Modeling: Object-Oriented Modeling Using UML  Requirements Engineering for Agile Methods, Web-Based Systems, Product Lines  Requirements Prioritization Course Code / Name: CS – 383 / Software Project Management Course Outline: Project Management Concepts: Management Activities, System Engineering, Software development process  Project Integration Management: Project Plan Development, Execution, Integrated change control  Software Project Planning: Planning objectives, Project estimation, Decomposition Technique  Project Schedule: Task allocation, Network Diagram, CPM, PERT  Project Monitoring and Controlling: Software Project Tracking, Controlling progress, controlling quality  Software Configuration Management: Source code control and management, source code processing  People Management: Teamwork issues, Team motivation and development  Risk Management : Identification, justification, projection.

Course Code / Name: CS – 454 / Mobile Database 9

Hamdard University Karachi, Pakistan

BS (CS) Course Outline Course Outline: Review of RDBMS concepts, why Mobile Databases? Requirements of a mobile database, Introduction to SQLite, Working with SQLite, commands, Schema creation commands, Storage classes, Like, GLOB, Order By, Group By, Joins, subquery, Constraints, SQLite Advanced, Pragma, auto increment. XML, DTD/XML Schema, XPath, SQLite with mobile application, Service Oriented Architecture, Web Services. Course Code / Name: CS – 456 / Computer Graphics Course Outline: Application of computer graphics: Vector and bitmapped Graphics, Vector Display (Bitmapped Approach)  Cartesian, Polar and Homogeneous Coordinate Systems  Vectors in a 2-D Space  Transformation: Transformation between coordinate system  Translation: 2-D Rotation, Fixed point Scaling  Visible surface algorithms  Warping and Morphing  Animation principal  Clipping  Ray Casting  Rendering  Sampling: Aliasing and MIP Mapping Course Code / Name: CS – 474 / Next Generation Network Course Outline: • Traditional networks (fixed and cellular) • IP addressing and subnetting • Software defined networking (SDN) • Cognitive radio networks (CRN) • Internet of thing (IoT) • Big data and networks • Fifth generation of wireless systems (5G) • Ubiquitous computing and networks • Artificial intelligence (AI) and its application in networks Course Code / Name: CS – 486 / Software Quality Assurance Course Outline: Connotations of the Word Quality  Quality and Reliability  Total Quality Management  Four Dimensions of Quality: Specification Quality, Design Quality, Development (Software Construction) Quality, Conformance Quality  Ensuring Quality in Specifications  Ensuring Quality in Development  Ensuring Conformance Quality  Software Verification: Verification Process, Audit  Software Testing: Testing types, Test Levels , SQA Process  Testing Cycle: Result Analysis , Bug Tracking, Reporting, Test planning, Test Cases, Text Execution

10

Hamdard University Karachi, Pakistan