Course Title: Applied Logic
Course no: CSC-306 Full Marks: 70+10+20
Credit hours: 3 Pass Marks: 28+4+8
Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)
Course Synopsis: This course contain the main feature of different logics.
Goal: The course objective is to provide the basic concepts and techniques of the logics used in computer science.
Course Contents:
Unit 1. Introduction 4 Hrs.
Introduction to Logic, Nature of Argument, Truth and Validity, Symbolic Logic, Statements, Conditional Statements, Statement Forms
Unit 2. Deduction and Deductive Systems 6 Hrs.
Formal Proof of Validity, The Rule of Replacement, The Rule of Conditional Proof, The Rule of Indirect Proof, Proofs of Tautologies, Formal Deductive Systems, Attribute of Formal Deductive Systems, Logicist Systems
Unit 3. Propositional Logic 6 Hrs.
Syntax of Propositional Logic, Semantics of Propositional Logic, Calculations, Normal Form, Applications
Unit 4. Predicate Logic 8 Hrs.
Predicate Logic, Order of Predicate Logic, Syntax of Predicate Logic, Semantics of Predicate Logic, Consequences, Calculations, Normal Form
Unit 5. Resolution & Proofs 10 Hrs.
Resolution, Resolution in Propositional Logic, Unification of Clauses, Resolution in Predicate Logic, Horn Clauses, Proof in Propositional Logic and Predicate Logic, Axiomatic Systems, Adequacy, Compactness, Soundness.
Unit 6. Program Verification 5 Hrs.
Issue of Correctness, Partial Correctness, Hoare Proof, Total Correctness.
Unit 7. Some Other Logics 6 Hrs.
Intuitionistic Logic, Lukasiewicz Logic, Probabilistic Logic, Fuzzy Logic, Default Logic, Autoepistemic Logic.
Laboratory works: Laboratory exercises should be conducted in any logic programming language like LISP or PROLOG.
Text / Reference books:
1. Arindama Singh, Logics for Computer Science, Prentice Hall of India
2. Irving M. Copi, Symbolic Logic, 5th Edition, Prentice Hall of India
Computer Hardware Design
Course no: CSC-312 Full Marks: 90+10
Computer Networks
Course Title: Computer Networks
Course no: CSC-301 Full Marks: 70+10+20
Credit hours: 3 Pass Marks: 28+4+8
Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)
Course Synopsis: Discussion on types of networking techniques, Internet, IPV.
Goal: This course introduces concept of computer networking and discuss the different layers of networking model.
Course Contents:
Unit 1. 33 Hrs.
1.1 Computer Network: Introduction to networking, computer network, Internet, the network edge: end system, clients, server, connection oriented and connectionless service, network core, network access and physical media, ISPs and back bone.
1.2 Protocol Layers: Introduction, layered architecture, The Internet protocol stack, network entities and layers.
1.3 Application Layer: Introduction, principles of application layer protocols, the web and HTTP, file transfer, Domain Name Service [DNS]: Working of DNS, DNS records, DNS messages.
1.4 Transport Layer : Introduction, relationship between transport layer and network layer, transport layer in the Internet, multiplexing and demultiplexing, connectionless transport, reliable data transfer: Building a reliable data transfer protocol, pipelined reliable data transfer protocol, Go-Back-N ( GBN ), selective repeat ( SR ), connection oriented transport : TCP , TCP connection, TCP segment structure, time estimation and time out, flow control, Principle of congestion control: Tha causes and costs of congestion, approaches to congestion control.
1.5 Network Layer : Introduction, network service model, datagrams and virtual circuit service, routing principles: A link state routing algorithm, the distance vector routing algorithm, hierarchical routing, The Internet protocol ( IP ): IPV4 addressing, datagram format, IP datagram fragmentation, Internet Control Message Protocol [ ICMP], Network address translator, routing in the Internet, IPV6, Multicasting routing.
Unit 2. 12 Hrs.
2.1 Link Layer and Local Area Networks: Introduction, Data link layer: the services provided by the link layer, error detection and error correction techniques, multiple access protocols, LAN addresses and Address Resolution Protocol, Ethernet, Wireless Links: IEEE 802.11b, Bluetooth, point to poin protocol (PPP), Asynchronous Transfer Mode (ATM), frame relay.
2.2 Multimedia Networking: Introduction, multimedia networking application, streaming audio and video.
2.3 Network Management: Introduction, The infrastructure for network management.
Text Books: Computer Networking; A Top Down Approach Featuring The
Internet, 2nd Edition, Kurose James F., Ross W. Keith PEARSON
EDUCATON ASIA
Homework Assignment: Assignment should be given from the above units in throughout the semester.
Computer Usage: No specific
Prerequisite: C, Digital logic
Category Content: Science Aspect: 50%
Design Aspect: 50%
Concepts of Wireless Networking
Course Title: Design and Analysis of Algorithms
Course no: CSC-303 Full Marks: 90+10
Credit hours: 3 Pass Marks: 36+4
Nature of course: Theory (3 Hrs.)
Course Synopsis: Methods and tools for analyzing different algorithms. Different approaches of designing efficient algorithms like divide and conquer paradigm, greedy paradigm, dynamic programming. Algorithms pertainig various problems like sorting, searching, shortest path, spanning trees, geometric problems etc. NP-complete problems.
Goal: Competency in analyzing different algorithms encountered. Ability to conquer the problem with efficient algorithm using the algorithm development paradigms.
Course Contents
Unit 1. 10 Hrs.
1.1 Algorithm Analysis: worst, best and average cases, space and time complexities. Mathematical background: asymptotic behavior, solving recurrences.
1.2 Data Structures Review: linear data structures, hierarchical data structures, data structures for representing graphs and their properties. Search structures: heaps, balanced trees, hash tables.
Unit 2. 14 Hrs.
2.1 Divide and Conquer: Concepts, applications, sorting problems(quick, merge), searching (binary), median finding problem and general order statistics, matrix multiplications.
2.2 Greedy Paradigm: Concepts, applications, Knapsack problem, job sequencing, Huffman
codes.
2.3 Dynamic Programming: Concepts, applications, Knapsack problem, longest common subsequence, matrix chain multiplications.
Unit 3 21 Hrs.
3.1 Graph Algorithms: breadth-first and depth-first search and their applications, minimum spanning trees (Prim's and Kruskal's algorithms), shortest path problems (Dijkstra's and flyod's algorithms), algorithm for directed acyclic graphs (DAGs).
3.2 Geometric Algorithms: Concepts, polygon triangulation, Convex hull computation.
3.3 NP Completeness: Introduction, class P and NP, cooks theorem, NP complete problems: vertex cover problem.
3.4 Introductions: Randomized algorithms concepts, randomized quick sort, approximation
algorithms concepts, vertex cover problem.
Textbook: T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press, 2001 ISBN: 0-262-530-910.
Reference: G. Brassard and P. Bratley, Fundamentals of Algorithmics, Prentice- Hall, 1996 ISBN: 0-13-335068-1.
Prerequisites: Good programming concepts (any language), Data structures and their properties, mathematical concepts like methods of proof, algorithmic complexity, recurrences, probability.
Assignments: This course deals with wide range of problem domain so sufficient number of assignments from each unit and subunit should be given to the students to familiarize the concepts in depth.
Lab: The motive of this course is to provide good theoretical and mathematical background of algorithms and their analysis, however it is advisable to provide programming assignments that aid the students learn the behavior of the algorithms
Course Title: E-Governance
Course no: CSC-307 Full Marks: 70+10+20
Credit hours: 3 Pass Marks: 28+4+8
Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)
Course Synopsis: This course contains concepts of E-Governance policies and data warehousing / data mining.
Goal: To provide the knowledge of good governance using information and communication technologies and case studies of different countries.
Course Contents:
Unit 1. Introduction 4 Hrs.
E-Governance: Needs of E-Governance, Issues in E-Governance applications and the Digital Divide; Evolution of E-Governance, Its scope and content; Present global trends of growth in E-Governance: Other issues.
Unit 2. Models of E-Governance 10 Hrs.
Introduction; Model of Digital Governance: Broadcasting/ Wilder Dissemination Model, Critical Flow Model, Comparative Analysis Model, Mobilization and Lobbying Model, Interactive-service Model/Government-to-Citizen-to-Government Model (G2C2G); Evolution in E-Governance and Maturity Models: Five Maturity Levels, Characteristics of Maturity Levels, Key areas, Towards Good Governance through E-Governance Models.
Unit 3. E-Governance Infrastructure and Strategies 6 Hrs.
E-readiness: Digital System Infrastructure, Legal Infrastructural Preparedness, Institutional Infrastructural Preparedness, Human Infrastructural Preparedness, Technological Infrastructural Preparedness; Evolutionary Stages in E-Governance.
Unit 4. Data Warehousing and Data Mining in Government 5 Hrs.
Introduction; National Data Warehouses: Census Data, Prices of Essential Commodities; Other areas for Data Warehousing and Data Mining: Agriculture, Rural Development, Health, Planning, Education, Commerce and Trade, Other Sectors.
Unit 5. Case Studies 20 Hrs.
Nepalese Context: Cyber Laws, Implementation in the Land Reform, Human Resource Management Software; India: NICNET, Collectorate, Computer-aided Administration of Registration Department (CARD), Smart Nagarpalika, National Reservoir Level and Capacity Monitoring System, Computerization in Andra Pradesh, Ekal Seva Kentra, Sachivalaya Vahini, Bhoomi, IT in Judiciary, E-Khazana, DGFT, PRAJA, E-Seva, E-Panchyat, General Information Services of National Informatics Centre; E-Governance initiative in USA; E-Governance in China; E-Governance in Brazil and Sri Lanka.
Text / Reference books:
1. E-Governance: Concepts and Case Studies, C.S.R. Prabhu, Prentice-Hall of India Private Limited, 2004.
2. Backus, Michiel, e-Governance in Developing Countries, IICD Research Brief, No. 1, March 2001
Course Title: International Business Management
Course no: MGT-309 Full Marks: 90+10
Credit hours: 3 Pass Marks: 36+4
Nature of course: Theory (3 Hrs.)
Course Synopsis: Examination and analysis of international business in its historical, theoretical, environmental, and functional dimensions. Topics include the nature and scope of international business; the institutional, socio-cultural, political, legal, ethical, and economic environments; trade, foreign investment, and development; transnational management, including global operations, strategic planning, human resources, marketing, and finance; and international business diplomacy and conflict resolution.
Goal: To develop the student's understanding of international business and the globalization of the economy. Students will learn fundamental concepts and procedures, which will help them analyzing the international opportunities.
Unit 1. Introduction to International Business 4 Hrs.
Unit 2. Global business Environment 7 Hrs.
The cultural environment, The political and legal environment, The economic environment
Unit 3. Global Trade and Investment 8 Hrs.
International trade theory, Government influence on trade, Regional economic integration, Foreign direct investment, International business negotiations and diplomacy
Unit 4. Financial Environment 4 Hrs.
Foreign exchange market, Determination of exchange rates
Unit 5. Choosing Where to Operate 4 Hrs.
Country evaluation and selection, Collaborative strategies, Control strategies
Unit 6. Management of Business Functions 8 Hrs.
Marketing, Export and import strategies, Global manufacturing, Global supply chain management
Unit 7. International Finance, Accounting and Taxation 6 Hrs.
Basic concepts of multinational companies, Multinational finance function, Multinational accounting and tax functions
Unit 8. International Human Resource Management 4 Hrs.
Textbooks: Daniels, John D., Radebaugh, Lee H. and Sullivan, Daniel P., International Business Environments and Operations, Pearson Education (Singapore), India, 2004 ISBN: 81-297-0411-0
References: Czinkota, Ronkainen, and Moffett, International Business, 4th Edition, Dryden 1996.
Hill, Charles, International Business: Competing in the Global Marketplace, 3rd Edition, Irwin.
Bennett, Roger, International Business, 2nd Edition, Pearson Education
Sharan, Vyuptakesh, International Business: Concept, Environment and Strategy, Pearson Education
Homework Assignments: Home works shall be given to the students with emphasis on small cases
Course Title: Microprocessor Based Design
Course no: CSC-305 Full Marks: 70+10+20
Credit hours: 3 Pass Marks: 28+4+8
Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)
Goal: The course objective is to apply the knowledge of microprocessor with other digital/analog system and interfacing to design a complete system.
Course Contents
Unit 1. Interfacing Concept 4 Hrs.
Interfacing, Interfacing Types, Address Decoding, I/O Mapping, Memory Mapping, I/O Memory Mapping, Registers and Input/output Registers, PC Interfacing Techniques.
Unit 2. Digital Interfacing 12 Hrs.
Input/output and Microcomputer, Simple input, Simple output, Programmable Parallel Ports, Handshaking, Single handshaking IO, Double handshaking IO, Introduction to Programmable Peripheral Interface 8255 A, Functional Block Diagram, Different Modes of Operations, Introduction to Programmable Interval Timer 8253 and Difference between 8253 and 8254, Functional Block Diagram, Different Modes of Operation, Keyboard Interfacing, Alphanumeric Display Interfacing, Microcomputer ports Interfacing to high-power devices.
Unit 3. Interrupts & Interrupt Controller 6 Hrs.
Interrupt Vector Tables, Types of Interrupts, Assembly Language program and Interrupt Procedure Hardware interrupts and Applications, Examples of Various ISR, Introduction to Programmable Interrupt Controller 8259, Functional Block Diagram, Operations of Interrupt, Programming of 8259
Unit 4. Analog Interfacing 5 Hrs.
Operational Amplifier Basics, Sensors and Transducers, Digital to Analog Conversion and Analog to Digital Conversion – Basics, Operations, Specification, Applications and Interfacing, A Microcomputer Based Industry-Process Control System.
Unit 5. Serial and Parallel Data Communication 6 Hrs.
Synchronous and Asynchronous Data Communication, Parity and other error control, Baud rates, Serial Interface Device, Serialization, RS 232 Interface Pin Description, Simplex Connection, Duplex Connection, Full Duplex Connection, Connection Between DTE to DTE, Connection to Printers and Zero Modem.
Unit 6. Microcontroller & Interfacing 8 Hrs.
General Microcontroller Concept, Pin Configuration, I/O Port Structure, Memory Organization, Special Function Registers, External Memory, Reset Operations, Instruction Set, Timer Operation, Serial Port Operation, Interrupt Design and Processing, Assembly Instructions and Programming.
Unit 7. Grounding and Shielding 4 Hrs.
Outline for grounding and shielding, Single point grounding and grouped loop, Noise, noise coupling mechanism and prevention, Filtering and smoothing, Different kinds of shielding mechanism, Protecting against electrostatic discharge, Line filters, isolators and transient suppressors
Laboratory works: Assembly language based programming. PPI, ADC and various interfacing with RS232, Printer Port should be experimented. At the semester end, individual project work based on microcontroller for industry process control should be done.
Lab exercise may comprise some of the followings:
1. Assembly language programming
2. Simple data transfer using PPI
3. Handshake transfer using PPI
4. Interfacing of A/D converter using PPI
5. Interfacing of A/D using Micro controller
6. Interfacing of A/D converter using Printer port
7. Demonstration of other interfacing techniques and devices
8. Writing an interrupt Service Routine
Text / Reference books:
1. D. V. Hall, Microprocessors and Interfacing - Programming and Hardware, McGraw Hill
2. K. J. Ayala, The 8051 Microcontroller: Architecture, Programming and Applications, West Publishing
3. K.R. Fowler, "Electronic Instrument Design", New York Oxford, Oxford University Press.
4. E.O. Duebelin, "Measurement System Application and Design" Tata McGraw Hill, New Delhi
Helpful Content.
ReplyDeletenice
ReplyDeleteThanks for the very useful content for students preparing for PSC examinations. It requires a thorough knowledge of computer software and a little bit of hardware also. The syllabus of 'Design and Analysis of Algorithms' you shared here needs a strong foundation for mathematics concepts. Students must pay attention to H1 maths tuition for not only a better understanding of maths concepts but it is also helpful in their higher studies. Engineering and computer courses need a good foundation in mathematics. Thanks for sharing such a beneficial post.
ReplyDelete