Download machinne learning's note and more Assignments Machine Learning in PDF only on Docsity!
Purbanchal University
MCA Syllabus
Year: I Semester: I
Subject Code
Subject Name Credit Lecture Tutorial Lab Total
MCA111 Discrete Mathematical Structures 3 3 1 - 4 MCA112 Web Programming 3 3 1 2 6 MCA113 Operating System 3 3 1 2 6 MCA114 Advanced Database Management System
MCA115 Organizational Behavior & Human Resource Management
Total Credits 16 16 5 6 27
Discrete Mathematical S tr u ct u res
Semester: I Full Marks: 100 Credit Hr: 3 Internal: 20 Final Exam: 80
Course Objective: The basic objective of the course is to impart knowledge to student on
mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and
application and modeling so that students are able to learn a particular set of mathematical facts and
how to apply them.
Course Contents:
1. Fundamentals: Sets and Subsets, Operations on sets, Sequences, Division in the integers
[5 h rs]
2. Logic: Propositions and logical operations, Conditional statements, Predicate and Quantifiers,
Methods of proof, Mathematical induction. [4 hrs]
3. Counting: Permutations and combinations, Pigeonhole Principle, Recurrence relation, Solving recurrence relation by substitution **[4 hrs]
- Relations and Digraphs:** Product sets and Partitions, Relations and Digraphs, Paths in relations
and diagraphs, Properties of relations, Equivalence relations, Computer representation of relations
and diagraphs, Manipulation of relations [6 hrs]
5. Functions: Functions, Composition of functions, Permutation functions **[4 hrs]
- Graph Theory:** Graphs, Special families of graphs, Matrix representation of graphs, Euler
paths and circuits, Hamiltonian paths and circuits [5 hrs]
7. Trees: Trees, Tree searching, Minimal spanning trees **[5 hrs]
- Algebraic Structures:** General properties, Semi-groups, monoids groups, permutation
groups, subgroups; homomorphism and isomorphism, group codes, error correcting codes
[8 h rs]
9. Boolean Algebra: Definition and properties, Boolean functions, representing Boolean
functions, logic gates, minimization of circuits [4 hrs]
Reference Books:
1. Kolman, Busby & Ross, “Discrete Mathematical Structures”, PHI 2. Trembly J. P. & Manohar P., “Discrete Mathematical Structures with Applications to Computer
Science”, McGraw Hill
3. John Truss, "Discrete Mathematical Structures for Computer Science", Addison Wesley 4. Seymour Lipchutz, Marc Lipson, "Discrete Mathematics", Tata McGraw Hill
Operating System
Course Objective: This course is to introduce both the fundamental principles and the advance concepts for the development of multiprogramming and multiprocessing Operating Systems. It starts from history, concepts of processes and threads and incorporates basic concepts of distributed systems and real time systems towards the end.
Course Contents:
- Introduction of Operating System 4 Hrs Functions of operating system Types of operating system History of operating system Structure of operating system
- Process management 8 Hrs Thread and process concept Inter process communication (Critical-section problem, solving critical- section problem with busy-waiting and sleep and wakeup strategies, Semaphores, Monitors) Process scheduling algorithms
- Deadlock 4 Hrs Principles of Deadlock Resource status modeling Conditions for deadlock Methods for handling deadlocks (Prevention, Avoidance, Detection and Recovery)
- Memory Management 8 Hrs Introduction of memory management Basic memory management mechanism Memory allocation Swapping and paging Virtual memory Page replacement algorithm Segmentation with paging
- File System 4 Hrs Introduction to files Directories File system implementation
- Input/Output 5 Hrs Principles of I/O hardware Principles of I/O software Disks structure and scheduling Clocks Terminals
- Protection and Security 4 Hrs Protection mechanism (Access control list, capability list) User authentication Frauds and attacks Trusted system
- Distributed Operating System 8 Hrs Concept, advantages and types of distributed operating system Design issues in distributed operating system Communication and synchronization Client-server computing System state and event precedence Algorithms for distributed control (Mutual exclusion, deadlock) Distributed file system Security
Case Study: LINUX, Windows and Mac (History, design principle, Kernel model, inter-process communication, Process management, scheduling, memory management, file system, Input and output, security)
Reference Books: Modern Operating System, Andrew S. Tanenbaum, PHI Operating System Design & Implementation, Andrew S. Tanenbaum, PHI Operating System, Silberschatz, Galvin, Gagne, WILLY Operating Systems, William Stallings, 4th Edition, Pearson Education Operating Systems - Modern Perspective, Gary Nutt, 2nd Ed., Pearson Education The C Odyssey Unix - The Open, Boundless C, M. Ghandi, T. Shetty, Rajiv Shah, BPB Publications Operating System Projects using Windows NT, Gary Nutt, Pearson Education Advanced Unix Programming Environment, R. L. Stevens, Pearson Education Beginning Linux Programming, Stones Richard, Matthew Neil, Wrox Publications
Laboratory Work:
- Installing database software (Oracle/MSQL/MYSQL) and practice on following topics: SQL Statements (DML, DDL, DTL and DCL) SQL Clauses (WHERE, ORDER BY, GROUP BY, HAVING) SQL Operators (Logical Operators, Comparison Operators, LIKE, IN, IS NULL, BETWEEN....AND) SQL Integrity Constraints (Primary/Foreign/Unique Key Constraint, Check/Not NULL Constraints) Other SQL concepts (Aliases, Group Functions, JOINS, VIEWS, Sub-query, Index, GRANT, REVOKE)
- Analyze query plan in database
- Query optimization (indexing, partitions, and parallelism)
- Query in distributed database environments using concept of link server in homogeneous and heterogeneous environments (e.g. query oracle tables from MSSQL and vice versa)
- Practice concurrency control and transaction management in database
Organizational Behavior & Human Resource Ma n a g eme n t
Semester: I Full Marks: 100 Credit Hr: 4 Internal: 20 Final Exam: 80 Course Contents:
I. Human Resource Management (HRM)
1. Concept, roots, human resource management and personnel management, changing HRM environmental forces, new mandate for human resource management, staff vs line function in management, organization of HRM functions. 4Hrs 2. HRM system, international model of HRM, concept and framework for strategic HRM, line management responsibility for HRM, HRM and organizational performance. 3Hrs 3. Job analysis and human resource planning: Concept, purposes of job analysis, collecting job analysis information, methods of job analysis, concept of HR planning methods and techniques of determining HR requirements. 5Hrs. 4. Recruitment, selection and socialization: concepts, sources and methods of recruitment, selection and its process, socialization in organization. 5 Hrs 5. Training and development: Concept of training and development, determining training needs, methods of training and development--on-the-job and off-the-job training development, evaluation of training programs. 6 Hrs 6. Performance evaluation: concept and purposes, process, methods and feedback of evaluation. 3Hrs 7. Compensation: Concept, considerations, establishing pay plan, job evaluation system, steps and methods, incentives and benefit system in organization. 4 Hrs
II. Organizational Behavior (OB)
1. Concept, importance and assumptions of OB, five conceptual anchors of organizational
behavior, emerging trends in organizational behavior. 3 Hrs
2. Understanding individual behavior: concept, behavior as an input output system, emotions,
beliefs, attitudes, values, needs, motives and behavior at work. 3 Hrs
3. Perception and personality: concepts, perceptual process, attribution theory and errors,
perception and decision making, personality traits and characteristics, personality ad behavior,
major personality attributes influencing organizational behavior. 5 Hrs
4. Motivation and job satisfaction: concepts, theories of motivation – hierarchy of needs,
hygiene- motivation theory, McClelland’s theory, equity theory, goal setting and reinforcement
theory. 5Hrs
5. Leadership: concept, perspective of leadership, emerging approaches of leadership. 2 Hrs
Year: I Semester: II Subject Code
Subject Name Credit Lecture Tutorial Lab Total
MCA121 Research Methodology 3 3 1 - 4 MCA122 Visual Programming Language & .Net .NET
MCA123 Software Engineering 3 3 1 - 4 MCA124 Accounting & Financial Management 3 3 1 - 4 MCA 125 Electives 3 3 - - MCA126 Project-I 3 - - 4 4 Total Credits
Note: The syllabus of Elective subjects will be provided during the beginning of this semester.
Research Methodology
Semester: II Full Marks: 100 Credit Hr: 3 Internal: 20 Final Exam: 80
General Objective: State and explain the concept of research methods which can be applied to any research studies.
Specific Objective: Provide knowledge to the students about different type of research, their process and applications. Familiarize the students with different types of data collection techniques and their applications. Develop an understanding of ethical issues and required consideration for their research studies. Provide skills for the selection of sampling technique, errors and proper planning different sampling methods. Enable the research students in developing the most appropriate methodology for their research study.
**Course Contents:
- Introduction 4 Hrs** Meaning and Importance of Research, Classification of Research ,Research in Engineering Functions , The Research Process, Research as a scientific Process, Issues governing Research Function, Listing and description of Steps of research. 2. Research Design 4 Hrs Meaning and Importance of Research Design, Classification of Research Design, The Research Process, Variables, Hypothesis, Errors Affecting Research Design, Measurements and Scaling, Reliability and validity test of research, Pilot test, field study, Issues Governing Research Design 3. Development of Research 9 Hrs Selection of research topics, Research problem vs. research question, Meaning and Importance of Research Proposal, Classification of Research Proposals, Components of a Research Proposal, Manager-Researcher Contribution in Developing a Research Proposal, Evaluation a Research Proposal, The Development of Research Issues Governing Proposal 4. Sampling Decisions 4 Hrs Sampling Vs. Census, Sampling Techniques, Issues Governing Sampling Decisions 5. Data Collection Methods 8 Hrs Meaning, Importance and Types of Data, Methods of Data Collection, Steps of Data processing and Presentation, Various Methods of Data Collection 6. Data Reduction and Analysis 5 Hrs Meaning and Importance of Data Reduction, Data Reduction Process, Selected Techniques of Data Analysis 7. Formatting the report 4 Hrs Formatting a Report, Developing the Final Draft, Preparing for Citation and Referencing Making an Oral Presentation of a Report 8. Development of Research Proposal 3 Hrs Meaning and Importance of research proposal ; the Development of Research Issues Governing Proposal; Writing a research report - Developing an outline; Key elements of research proposal- Objective, Introduction, Design or Rationale of work, Experimental Methods, Procedures, Measurements, Results, Discussion, Conclusion, Referencing and various formats for reference writing of books and research papers; Publications in Research journals 9. Socio-Ethical Issues in Research 4 Hrs Issues governing Research Function, Incorporating Socio-Ethical Issues in Research Impact of Social Issues in Research
. Reference Books: 1. Cooper & Schindler ( 2004 ), Business Research Methods, New Delhi, Tata McGraw Hill Publishing Co.
Visual Programming Language & .Net
Semester: II Full Marks: 100 Credit Hr: 3 Internal: 20 + 20 Final Exam: 60
Course Objective : To develop an understanding of how to design an effective graphical user interface (GUI), how to analyze a problem and design a program structure to solve the problem using an event driven programming language, Visual Basic and Visual Basic .Net.
Course Contents:
1. Introduction : Character based system, Graphical User Interface, Visual Programming, Visual Interface components, Event Driven Programming **[ 3 hrs]
- Models of Interface design:** Conceptual model, Implementation model, the manifest model, modeling from users point of view **[ 3 hrs]
- The Form** : Interface paradigms (Metaphor, Idioms and branding, Affordances), Child forms (Usage of window space, Windows pollution), Platform dependence (Development platform, Multi- Platform development, Interoperability) **[ 5 hrs]
- User-Computer Interaction:** Mouse (Indirect manipulation, Mouse events Focus and cursor hints), Selection (Indicating selection, Insertion and replacement, Additive selection, Group selection), Gizmos Manipulation (Repositioning, Resizing, Reshaping, Visual feedback of manipulation), Drag and Drop (Source and target, Problems and solutions, Drag and Drop mechanism) **[ 6 hrs]
- The Cast:** Menu Design Issue (Drop Down menus, Pop-up menus, Hierarchy of menu), Menus and its types (Standard menus, Optional menus, System menu, Menu item variation), Dialog Boxes (Dialog box basics, Suspension of interaction, Modal and Modeless dialog boxes, Problems in Modeless dialog boxes, Different types of dialog boxes), Dialog box conventions (Caption bar, Attributes, Terminating dialog boxes, Expanding dialog boxes, Cascading dialog boxes), Toolbars (Advantages over menus, Momentary button and latching button, Customizing toolbars) **[ 6 hrs]
- .Net Programming [ 22 hrs]** Language Syntax, Data types, operators, Conditional Statements, Control Structures Concept of OOP (E.g. class, objects, methods, properties, encapsulation, inheritance, overloading) ASP. Net Controls and Presentation Techniques Working with Forms and Control Validation Controls Web Site Navigation, Menu and View Controls Data Grid and Repeater Emailing Concepts Error Handling, Debugging and Tracing ASP.NET Application Managing State in ASP.NET Application Enhancing Web Sites using Master Pages and Theme Deploying Application
Reference Books:
- Alan Cooper, The Essential of User Interface Design, Comdex Computer Publishing
- Evangelos Petroutsos, Mark Ridgeway, Visual Basic .NET Developer’s Handbook, BPB Publications
- Evangelos Petroutsos, Mastering Visual Basic 6, BPB Publications
- Tony Gaddis, Kip Irvine, Bruce Denton, Starting Out With Visual Basic .NET Programming, Dreamtech Press
- Wiley,Beginning Visual C# 2008, Wrox
- Fergal Grimes, Microsoft .Net for Programmers, (SPI)
- Balagurusamy, Programming with C#, (TMH)
- Mark Michaels, Essential C# 3. 0 : For .NET Framework 3 .5, 2/e, Pearson Education
Accounting & Financial Management
Semester: II Full Marks: 100 Credit Hr: 3 Internal: 20 Final Exam: 80
Course Objective: The objective of the course is to provide the students with an understanding of the concepts, principles, and techniques of Accounting and Financial Management and their application in real life situations. It specifically aims at imparting the students with necessary knowledge and skills required for understanding accounting and making financial decisions.
Course Contents: Nature of Financial Management, financial statements and cash flows, financial analysis, time value of money, valuation of bonds, valuation of stocks, cost of capital, capital budgeting, working capital management, and dividend policy.
1. Introduction of Accounting and Financial Management 3 Hrs Meaning of accounting and finance, difference between finance and accounting, Importance of managerial finance, finance functions, finance in the organizational structure of the firm, goals of the firm. 2. Financial Statements and Cash Flows 5 Hrs Understanding financial statements: the balance sheet, the income statement, and analysis of cash flows. 3. Financial Analysis 5 Hrs Meaning of financial statement analysis, types and method of financial statement analysis. Financial ratio analysis: Liquidity ratios, efficiency ratios, profitability rations, activity ratio. 4. Time Value of Money 4 Hrs Meaning and importance of time value of money. Future value and compounding, present value and discounting, finding out the discount rate, finding out the number of periods, and amortization. 5. Valuation of Bonds 4 Hrs Meaning and nature of bond, key features of bond, financial asset valuation, valuation of bond, yield to maturity, current yield, capital gains yield, and semiannual bonds. 6. Valuation of Stocks 5 Hrs Features of common stock, common stock valuation, and normal growth, zero growth, and super normal growth, Corporation, valuation of preferred stock. 7. Cost of Capital 4 Hrs Cost of capital components, cost of debt, preferred stock, and equity, and weighted average cost of capital. 8. Capital Budgeting 6 Hrs Ranking investment proposals: payback, discounted payback, net present value, internal rate of return, and modified IRR. 9. Working Capital Management 5 Hrs Concept and importance of working capital, working capital cash flow cycle. 10. Dividend Policy 4 Hrs Dividend payments, payment procedure, factors influencing dividend policy, stock dividends, and stock splits.
Reference Books:
- Radhe Shyam Pradhan, Financial Management, Buddha Academic Publishers, Kathmandu
- Eugene F. Brigham, Louis C. Gapenski & Michael C. Ehrhardt, Financial Management: Theory & Practice, Harcourt Asia PTE. Ltd., Delhi
- James C., Van Horne, Financial Management & Policy, Prentice Hall of India, New Delhi
- Radhe S. Pradhan, Research in Nepalese Finance, Buddha Academic Publishers & Distributors, Kathmandu
Kantipur City College
Putalisadak, Kathmandu
Affiliated to Purbanchal University
School of Science and Technology
Year: II Semester: III
Note: The syllabus of Elective subjects will provide during the beginning of this semester.
Subject Code
Subject Name Credit Lecture Tutorial Lab Total
MCA211 Optimization Technique 3 3 1 - 4 MCA212 Design & Analysis of Algorithm 3 3 1 - 4 MCA213 Software Project Management 3 3 1 - 4 MCA214 Marketing Management 3 3 1 - 4 MCA215 Elective-II 3 MCA216 Project-II 3 - - 4 4 Total Credits 18
Question Pattern: Group-A: Long Answer-Type Questions: (Attempt 2 out of 3) [2 × 16=32] Group-B: Short Answer-Type Questions: (Attempt 6 out of 8) [6 × 8=48]
Design & Analysis of Algorithm
Semester: III Full Marks: 100 Credit Hr: 3 Internal: 20 Final Exam: 80
Course Objective: After completing this subject, students will be able to explore techniques for the design and analysis of algorithms. This course covers the topics such as asymptotic analysis, divide and conquer, greedy, dynamic, backtracking, number theory and introduction to NP-Complete problems.
Course Contents:
1. Introduction: Definition of an algorithm, characteristics of an algorithm, asymptotic notations, RAM model, common mathematical functions, introduction to algorithm design and analysis. **[3 Hrs]
- Elementary Data Structures:** Stacks, queues, tree, binary tree, linked list, graph, graph representations. **[4 Hrs]
- Divide and Conquer:** The general method, binary search, finding the maximum and minimum, merge sort, quick sort, selection in worst case linear time. **[7 Hrs]
- The Greedy Method:** The general method, Knapsack problem, job sequencing, minimum cost spanning tree: Prim’s algorithm, Kruskal algorithm, single source shortest paths. **[6 Hrs]
- Dynamic Programming:** The general method, 0/1 Knapsack problem, matrix chain multiplication, multistage graph, all pairs shortest paths, Traveling Salesman Problem. **[7 Hrs]
- Backtracking:** The general method, the 8-Queens problem, graph coloring, Knapsack problem. **[6 Hrs]
- Number-Theoretic Algorithms:** Elementary number-theoretic notions, greatest common divisor, modular arithmetic, solving modular linear equations, the Chinese remainder theorem. **[6 Hrs]
- NP-Completeness:** Introduction to NP-complete problems, classes P and NP, Cook’s theorem, coping intractability by approximation algorithms. [6 Hrs]
Reference Books:
- "Introduction to Algorithms", Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Prentice Hall of India
- "Fundamental of Computer Algorithms", Ellis Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran, Galgotia
- "Algorithms in C++", R. Sedgewick, Addison-Wesley
Question Pattern: Group-A: Long Answer-Type Questions: (Attempt 2 out of 3) [2 × 16=32] Group-B: Short Answer-Type Questions: (Attempt 6 out of 8) [6 × 8=48]
