ICT 334, JAVA and .NET Technology

Course Title: JAVA and Dot Net Technology                     Full marks:  80 + 20

Course No:  Comp Sc Ed 334                                                Pass marks:  28 + 8

Nature of course:  Theory and Practical                                 Period per week:  4 + 4

Level: B. Ed.                                                                           Time per period: 55 minutes

Year: Third                                                                              Total periods:  200

 

 

 

  1. 1.      Course Description

The goal of the course is to help students gain knowledge in the basic concepts of object-oriented programming and build skills to develop modern software programs using the language Visual Basic. The goal of course is to provide application developers easy and complete understanding of the Microsoft® .NET using VB.NET. It provides you with the basic skills required to develop functionally sound Visual Basic .NET applications. Another course offers an introduction to the Java programming language for those students who have had little or no background in programming

 

  1. 2.      General Objectives

The general objectives of this course are as follows:

  • have gained a good understanding of the basic concepts of object orientation concept
  • have a good understanding of the Visual Basic language structure and language syntax
  • have developed the ability to design and develop interactive applications using the object-oriented principals, encapsulation, inheritance and to some extents polymorphism
  • be able to effectively develop applications with full functionality and a graphical user interface using the language Visual Basic
  • Write programs using the Java language with program structure in general, and Java syntax, data types, flow of control, classes, methods, objects, arrays, exception handling, recursion, and graphical user interfaces (GUIs).
  • Create Java technology applications that leverage the object-oriented features of the Java language, such as encapsulation, inheritance, and polymorphism

 

3.   Specific Objectives and Contents

Part I: Theory

Specific Objectives

Contents

  • Describe the .NET framework structure.
  • Understands the outline of IDE of VB .net
Unit I: Introduction to .NET                          (6)1.1           .NET framework and Architecture

1.2           Common Language Runtime (CLR)

1.3           Microsoft Intermediate Language (MSIL)

1.4           Assemblies and Class Libraries

1.5           Namespace

1.6           Introduction of Visual Studio

1.7           Types of project in .NET

1.8           IDE of VB.NET:  Menu bar, Toolbar, Solution Explorer, Toolbox properties, From Designer, Output Window, Object Browser.

1.9           Environment: Editor Tab, Format Tab, General Tab, Docking tab,

1.10       Visual Development and Events Driven programming: Methods and Events

  • Describe the basic properties of .NET language.
  • Design the software using Visual Basic.
Unit II: Visual Basic .NET Language                    (12)2.1           Variables and Data Types

2.2           Variable Declaration, Scope and Life time

2.3           Constants

2.4           Array: Types of array and Control array

2.5           Function: Passing variable Number of Arguments, Returning value from the function

2.6           Control flow statement: Conditional Statement, Loop Statement

2.7           Msgbox and Inputbox

  • Explain the operation of forms.
  • Design the software using GUI Programming tools
Unit III: Working With Forms                          (6)3.1         Control of Form

3.2         GUI Programming with Windows form: Textbox, Label, Button, ListBox, ComboBox, CheckBox, Picture Box, RadioButton, Panel, ScrollBar, Timer, ListView, Toolbar, Statusbar and Properties

3.3         Methods and Events

3.4         Dialog. OpenFileDilog, SaveFileDilog, FontDilog, ColorDilog, PrintDialog

3.5         Designing Menu: Context Menu, access And shortcut Key

  • Describe the classes, methods, and messages.
  • Explain/ Define implementation of varieties of classes.
  • Explain and implementation of methods and message passing systems.

 

Unit IV: Object Oriented Programming            (8)4.1           Classes and Objects

4.1           Properties, Methods and Events

4.1           Constructor

4.1           Inheritance

4.1           Access Specifiers

4.1           Overviews of OLE

4.1           Accessing the WIN32 API from .NET and Interfacing

4.1           COM  Technology

4.1           Create User Control, Register User Control.

4.1           Access COM  components in .NET application

  • Identify basic of database. connection
  • State the application with database.
Unit V: Database Programming                       (10)                                       5.1            Overviews of ADO .NET

5.2            Accessing Data using Server Explorer

5.3            Creating Connection, Command, Data adapter and Data Set With OLEDB and SQLDB

5.4            Display Data on Data bound controls, display data on grid

5.5            Generate the reports using Crystal Report Writer

  • Understanding the fundamental concepts of C#.
Unit VI: Introduction to C#                               (8)                                       6.1  Overviews of C#

6.2  C# and .NET

6.3  Similarity and Difference from JAVA, and C++

6.4  Structure of C# program

  • Understand fundamentals of programming such as variables, conditional and
  • iterative execution, methods, etc.
Unit VII: Introduction to Java                       ( 12)                          7.1 Overview : Java Features, Java Tools(javac, java, appletviewer, javadoc, jar)

7.2 Introduction to the JVM, JRE, JDK

7.3 Introduction to the Java landscape

7.4 What is J2SE, J2EE, J2ME, JMX, Java Web Service.

7.5 java Program structure: Tokens, statements, JVM,

7.6 Constants variable and Data types

7.7 Scope and Variable

7.8 Operators

7.9 Control Statements: If , Loop

7.10           Loops

7.11           java Class Library

  • Understand fundamentals of object-oriented programming in Java, including defining classes, invoking methods, using class libraries, etc.
Unit VIII: Introducing Classes                                (10)8.1   Class Fundamentals

8.2  Declaring Objects

8.3  Methods

8.4  Constructor

8.5  This Key Word

8.6  Inheritance: member access and inheritance

8.7  Using Super class

8.8  Methods Overriding

8.9  Abstract Methods and classes

8.10          Using Final With inheritance

  • Describe the operation of package and interface.
  • Design system uing package and interface.
Unit IX: Package and Interface                     (8)                           9.1      Defining the package

9.2     Access Protection

9.3     Importing Package

9.4     using System package

9.5    adding a class to package

9.6     Defining the interface

9.7     Implement and Apply interface

  • Explain the operation and applications of exception handling
  • Create a program for exception handling.
 Unit X: Exception Handling                       (6)

10.1Exception types

10.2Uncaught Exception

10.3Using Try and Catch

10.4Throw and Throws

10.5Finally

10.6Java built in Exception

10.7Java Thread model

10.8Creating a thread

10.9Life cycle of thread

10.10      Thread synchronization

  • Familiar with Applets
Unit XI: I/O and Applets                               (6)11.1I/O Stream

11.2Reading Console input

11.3Writing Console output

11.4Fundament of Applets

11.5Writing applets, Create executable Applets

11.6Applet  Tag

11.7Adding Applet to HTML file

11.8Running the applet

11.9Passing the parameter to applet

11.10      Aligning the display

11.11      Getting input form the user

Note: The figure in the parenthesis indicate approximate number of periods allocated for respective units.

 

Part II: Practical   (100 Periods)

Laboratory Work:

There shall be 20 exercises in minimum, as decided by the faculty. The exercises shall encompass a broad spectrum of real-life and scientific problems, development of small program to the development of fairly complex subroutines, programs for practical applications and problem solving situations. Laboratory assignments will be offered in groups of two to four for evaluation purpose. In general, the Laboratory Work must cover assignments and exercises from the following areas:

  1. Visual Studio 2010 IDE
  2. Variables, Data types
  3. Array
  4. Function
  5. Control Statements
  6. Msgbox, Inputbox
  7. GUI window form create
  8. Design Dialog
  9. Design Menu
  10. Class and Objects
  11. Methods and Events
  12. Constructor
  13. Inheritances
  14. OLEDB Connection
  15. Display data on Grid
  16. Crystal Report
  17. JAVA: Data Types
  18. Control Structure
  19. Strings
  20. Arrays
  21.  Date & Time
  22.  Methods
  23. Threading
  24. Applets

 

4.   Instructional Techniques

The instructional techniques for this course are divided into two groups. First group consists of general instructional techniques applicable to most of the units. The second group consists of specific instructional techniques applicable to specific units.

        4.1 General Instructional Techniques

  • Providing the reading materials to the students to familiarize the units.
  • Lecture, question-answer, discussion, brainstorming, practical, and buzz session.

4.2 Specific Instructional Techniques

Unit I to IX :

  • Lecture
  • Practical
  • Discussion
  • Group work

 

  1. 5.      Evaluation

5.1 Evaluation of Theory Part:

Students will be evaluated on the basis of the class test during academic session, classroom participation, presentation of the reports and other practical activities.  The scores obtained will be used for feedback purposes. The students will be evaluated through the annual examination held by the Office of the Controller of Examinations on the basis of objective questions, short and long questions. The types and number of questions to be asked in the annual examination is mentioned below:

 

Types of questions

Total questions to be asked

Number of questions to be answered and marks allocated

Total marks

Group A: Multiple choice items 14 questions

14 x 1 mark

14

Group B: Short questions 6 with 3 or questions

6 x 7 marks

42

Group C: Long question 2 with 1 or question

2 x12 marks

24

 

 

5.2 Evaluation of Practical Part:

Students will be internally evaluated on the basis of the laboratory works.           Marks  

  1. Variables, Data types, Array                                                                           2
  2.  Function                                                                                                         2
  3.  if , switch and loop                                                                                        2
  4. From, Menu and Dialog                                                                                  2
  5. Class, Objects, Methods and Events                                                              2
  6. Database Connectivity                                                                                    2
  7. JAVA: String and  Array                                                                                2
  8. JAVA: Methods                                                                                             2
  9. Threading                                                                                                        2
  10. Applets                                                                                                            2

 

 

 

  1. 6.                              Recommended Books and References

Recommended Books

Holzner Steven (2002), VB.Net Programming Black Book, New Delhi, Dream Tech Publication (For Units I to VI)

Schildt Herbert (2011), Java The Complete Reference, 8th Edition (For Units VII to XI)

References

Petroutsos Evangelos (2002),  Mastering VB.NET, New Delhi, BPB Publications.

E. Balaguruswamy(2010), Programming in JAVA, New Delhi, TMH Publication

Deitel Harvey M. , Deitel Paul J.(2009) , Java How to Program, 8th Edition, New Delhi, Prentice Hall

Norton Peter (1996), Peter Norton  Guide to  Java Programming, New Delhi, Pearson Sams Publishing Sharp, John (2002), Microsoft Visual C# .NET step by step, New Delhi , Prentice-Hall

David McAmis(2004), Professional crystal reports for Visual Studio .NET, ; New Delhi, Wiley Dreamtech

www. msdn.microsoft.com/ net/

http://www.gotdotnet.com

ICT 333, E-Learning

 

Course Title: E-Learning                                                       Full marks:  80 + 20

Course No:  Comp Sc Ed 333                                                Pass marks:  28 + 8

Nature of course:  Theory and Practical                                 Period per week:  4 + 4

Level: B. Ed.                                                                           Time per period: 55 minutes

Year: Third                                                                              Total periods:  200

 

  1. 1.      Course Description

This course provides the exploration and integration of a broad range of information and communication technologies (ICT) into learning and teaching to improve student learning outcomes. e-Learning is now an essential component of education. Globalization, the proliferation of information available on the Internet and the importance of knowledge-based economies have added a whole new dimension to teaching and learning. As more tutors, students and trainees, and institutions adopt online learning there is a need for resources that will examine and inform this field. Student learns a systematic approach to e-learning development, covering all the issues that professional developers consider: validating a educational need, developing content and setting up quality user service. The focus of the course is on developing the broader educational knowledge that designers need for working on Learning Management System. MySQL and PHP are two of the most popular open source technologies to emerge during the past decade. PHP is a powerful language for writing server-side Web applications. MySQL is the world’s most popular open source database. Together, these two technologies provide a powerful platform for building database-driven Web applications.

 

  1. 2.      General Objectives

The general objectives of this course are as follows:

  • To gain an understanding of the theories and concepts underlying e-learning
  • To improve familiarity with current challenges and issues in LMS
  • To build database driven LMS web application.

3.   Specific Objectives and Contents

Part I: Theory

Specific Objectives

Contents

  • Describe the Concept of e-learning.
  • Explain e-learning technology
  • Explain the case study of different types of e learning system
Unit I: Introduction e-Learning                        (10)1.1           Concept of e- learning1.2           Types of  e-learning

1.3           E-Learning Paradigm

1.4           e-learning framework

1.5           LMS, LCMS, LTS

1.6           Web 2.0 and E-learning 2.0

1.7           Instructional Systems Design

1.8           Constraints in E-Learning

1.9           Current Status and Trends of E-Learning

1.10       Novice and Tech-Savvy Educators  (Weblogs, Wikis, RSS, Social bookmarking, Facebook, MySpace,Twitter, Second Life)

1.11       Future of E-Learning

  • Understand basic client-side scripting structure
  • Integrate JavaScript within HTML documents
  • Build interactive site components
  • Use existing contemporary UI components
Unit II: Java Script                                            (12)2.1           Java Script Overviews2.2           Java Script and WWW

2.3           Java Script elements

2.4           Functions

2.5           Variables and Expressions

2.6           Statements; if, for, while

2.7           Array

2.8           Events handlers

2.9           Objects and Events

2.10       Getting data from form

  • Explore the different levels and abilities of style sheets.
  • CSS can format and position the elements in your Web page.
Unit III: Cascading Style Sheet                      (10)3.1   Web page and CSS3.2  CSS implementation

3.3  Basic Elements of CSS Design

3.4  CSS Building Blocks

3.5  Text properties

3.6  Colors, backgrounds and images

3.7  Lists

3.8  Links

3.9  Basic Design of layout

3.10        Types of layouts

 

  • To teach attendees the PHP programming skills they need to successfully build interactive, data-driven sites
  • To teach students enough MySQL database skills to build the databases that will power their sites
Unit IV: Introduction PHP, MySQL, Apache        (4)                   4.1      Introduction of   static and Dynamic Web Site4.2  Concept of server site scripting language and Web server

4.3  Introduction of  Apache, PHP, MySQL

4.4  Introduction to WAMP

4.5  Installing Apache, PHP, MySQL

  • To teach attendees the PHP programming skills they need to successfully build interactive, data-driven sites
  • To teach students enough MySQL database skills to build the databases that will power their sites
Unit V: Configuration of Apache   and PHP        (4)                5.1      Apache Version and installation5.2  Apache configuration file structure

5.3  Apache Log file

5.4  Apache related commands

5.5  Troubleshooting in Apache Server

5.6  Installation and Configuration of PHP

5.7  php.ini basic

5.8  Basic PHP Scripts

5.9  Integrating PHP with HTML

  • To teach attendees the PHP programming skills they need to successfully build interactive, data-driven sites
  • To teach students enough MySQL database skills to build the databases that will power their sites
Unit VI: Programming Structure of  PHP           (8)             6.1      Data types, Variables, Operators and Expression6.2  Flow Control in PHP: if statement, switch statement, ? operator, loops

6.3  Code block and Browser output

6.4  Working with function : Define and Call Function

6.5  Returning Value from user define function

6.6  variable Scope

6.7  Setting Default Value for arguments, passing value reference to function

6.8  Create an Array

6.9  Create an Object

6.10          Working with String, Date and Time

6.11          String Manipulation

 

  • to explain the importance of form.
  • to create form and manipulate it.
Unit VII: Working With Form                    (10)       7.1      Creating a user Form7.2  Hidden filed for save state

7.3  Redirecting user

7.4  Sending mail on form submission

7.5  Working with file uploading

7.6  Working with Session

  • to describe basics of MySQL and PHP.
  • to design a system using MySQL and PHP.
Unit VIII: MySQL and PHP                       (12)   8.1     Connecting to MySQL with PHP8.2  Working with MySQL Data

8.3  File Uploading & Emails

8.4  Making a Contact Us Form on a website

8.5   PHP and AJAX

8.6  Creating Images on the Fly

8.7  Image Captcha

8.8  Restrict Viewing on the website

  • To create a learning management system and building a website from scratch.
  • By using templates modules and plugins allow to easily bolt on new features and functionality quickly for learning environment
Unit IX: LMS for  E-Learning                           (20)9.1       Introduction LMS9.2  Installation and configuration  of LMS tools

9.3  Working Contents and Users

9.4  Working with Components, Modules and Plugins

9.5  Customizing and Extending the System

9.6  Creating Categories and Courses

9.7  Create and Manage static and dynamic learning materials

9.8  Manage the students

9.9  Site Maintenance and Management

9.10          E-learning tools

  • Learn the issue of security, integrity and availability, threats, vulnerability, control and attacks, encryption and decryption digital certificate
Unit X: Security Management                                    (10)10.1Potentials threats10.2Security policy

10.3counter measures

10.4e-learning site security

10.5point of attacks weakness in network

10.6Network Security

Unit XII: Mini Project on LMS

Note: The figure in the parenthesis indicate approximate number of periods allocated for respective units.

 

Part II: Practical   (100 Periods)

Laboratory Work:

There shall be 20 exercises in minimum, as decided by the faculty. The exercises shall encompass a broad spectrum of real-life and scientific problems, development of small program to the development of fairly complex subroutines, programs for practical applications and problem solving situations. Laboratory assignments will be offered in groups of two to four for evaluation purpose. In general, the Laboratory Work must cover assignments and exercises from the following areas:

  1. Java Script – Declaration, function, control statements, array and events handlings
  2. CSS- CSS block, text properties, images, list , links, layouts
  3. PHP, MySQL and Apache installation and Configuration
  4. Data types, variables and operator
  5. flow control in PHP: if , switch, loop statements
  6. function call and value passing
  7. Working with array and objects
  8. String Date and Time Function
  9. Working with form
  10. Data Base Connection
  11. Installation and Customization of LMS tools
  12. Working with contents, modules and plug in

4.   Instructional Techniques

The instructional techniques for this course are divided into two groups. First group consists of general instructional techniques applicable to most of the units. The second group consists of specific instructional techniques applicable to specific units.

        4.1 General Instructional Techniques

  • Providing the reading materials to the students to familiarize the units.
  • Lecture, question-answer, discussion, brainstorming, practical, and buzz session.

4.2 Specific Instructional Techniques

Unit I:

  • Lecture
  • Discussion

 

Unit II to XII:

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit X

  • Lecture
  • Discussion
  • Group work

 

  1. 5.      Evaluation

5.1 Evaluation of Theory Part:

Students will be evaluated on the basis of the class test during academic session, classroom participation, presentation of the reports and other practical activities.  The scores obtained will be used for feedback purposes. The students will be evaluated through the annual examination held by the Office of the Controller of Examinations on the basis of objective questions, short and long questions. The types and number of questions to be asked in the annual examination is mentioned below:

Types of questions

Total questions to be asked

Number of questions to be answered and marks allocated

Total marks

Group A: Multiple choice items 14 questions

14 x 1 mark

14

Group B: Short questions 6 with 3 or questions

6 x 7 marks

42

Group C: Long question 2 with 1 or question

2 x12 marks

24

 

 

5.2 Evaluation of Practical Part:

Students will be internally evaluated on the basis of the laboratory works.           Marks  

  1. Java Script                                                                                                        2
  2. CSS                                                                                                                       2
  3. PHP, MySQL and Apache installation and Configuration                  2
  4. flow control in PHP: if , switch, loop statements                                                 2
  5. Function call and value passing                                                                            2
  6. Array, String and Function                                                                                   2
  7. Form                                                                                                                      2
  8. Data Base Connection                                                                                          2
  9. Installation and Customization of LMS tools                                                      2
  10. Working with contents, modules and plug-in                                                       2
  1. 6.                              Recommended Books and References

 

Recommended Books

Bryn Holmes, John Gardner(2006) , E-learning: concepts and practice , Sage Publications Ltd (For Units I and X )

Moncur Michael (2000), SAMS Teach Yourself Java Script in 24 Hrs., New Delhi, Sams  (For Unit II )

Meloni Julie C(2010).,Teach Yourself  PHP, MySQL and Apache, New Delhi, Pearson Education Pvt. Ltd. Delhi  (For Units IV to VIII )

Shreves Ric(2010),  Joomla!, New Delhi, Wiley India Pvt. Ltd. (For Unit IX)

Jason Cole & Helen Foster, Using Moodle; Teaching with the Popular Open Source Course Management System, O Reilly Community Press (For Unit IX)

References

 

Ronald Brad Ford , Partick Galbraith(2010), PHP and MySQL, New Delhi , Wiley India Pvt. Ltd.

Holzner, Steven(2008),  PHP : the complete reference, New Delhi ,Tata McGraw-Hill

Converse, Tim(2003),  PHP bible, New Delhi ,Wiley Dreamtech

Moulding, Peter(2002), PHP black book , New Delhi, Dreamtech

Yehada Shiran(2010), Learn advanced java Script Programming, New Delhi, BPB

Kalakota , Ravi (2000) ,Frontiers of Electronic Commerce , New Delhi, Andrew Winston

Robert Liguori; Patricia Liguori(2008) , Java Pocket Guide , O’Reilly Media, Inc.

P.T.Joseph(2000) , E-Commerce- A Managerial perspective, New Delhi

Mehta Nirav(2009), Choosing an Open Source CMS Beginner’s Guide, Packt Publishing,

india

Mark Dexter; Louis Landry(2011), Joomla! Programming, new Delhi,  Addison-Wesley

Stephanie Leary(2010) , Beginning WordPress 3, Apress

William Rice(2008), Moodle 1.9: E-Learning Course Development: A complete guide to successful learning using Moodle 1.9, Packt Publishing, ISBN-10: 1-84719-353-6

Khan, B. H. (2001). A framework for Web-based learning. Englewood Cliffs, NJ: Educational Technology Publications.

http://www.businesscatalyst.com/

http://www.magentocommerce.com/

http://www.joomlalms.com/

www.php.net/

www.java.com/

http://moodle.org/

www.joomla.org/

www.mambo-foundation.org/

 

 

 

 

 

ICt 331, Graphics, Numerical Methods and Software Project Management

Course Title: Graphics, Numerical Methods, and Software Project Management

Course No:  Comp Sc Ed 331 (CSE 331) (VIth Paper)           Full marks:  75 + 25

Nature of course:  Theory and Practical                                 Pass marks:  35% + 40%

Level: B. Ed.                                                                           Period per week:  4 + 4

Year: First                                                                               Total periods:  100 + 100

Time per period: 55 minutes

 

 

  1. 1.      Course Description

This course deals with computer graphics consisting of introduction of graphical system, different hardware used in the graphical system, implementation of two dimensional algorithms, different types of graphical languages, and understanding in three dimensional graphics and their implementation. This course also deals with numerical methods which lay out the principles of solution of nonlinear equations, interpolation and approximation, numerical differentiation and integration, application of ordinary and partial differential equations, and their solution for practical purposes. The course in software project management discusses the software engineering approach to modern software development process (Unified Process). The project enables the student to develop computer package for practical use independently.

 

 

  1. 2.      General Objectives

The general objectives of this course are as follows:

  • to be familiar with the basic techniques used in computer graphics systems,
  • to be familiar with the theory of numerical analysis for solving algebraic and transcendental equations, solution of ordinary and partial differential equations related to practical problems, numerical differentiation and integration,
  • to be familiar with the software engineering approach to modern software development process (Unified Process).

 

3.   Specific Objectives and Contents

 

Specific Objectives

Contents

  • Understand the history of computer graphics.
  • Identify the applications.
Unit I: Introduction                                                           (2)1.1           History of computer graphics

1.2           Applications of computer graphics

  • Explain the hardware used in the graphical terminals.
Unit II: Hardware Concepts                                             (5)2.1        Input hardware: keyboard, mouse, light pen, touch screen and tablet

2.2        Raster and vector display architecture

2.3        Architecture of simple non-graphical display terminals

2.4        Architecture of graphical display terminals including frame buffer and color manipulation techniques

2.5        Advanced raster graphic architecture

  • Understand two dimensional algorithms
  • Formulate the development of programs.
Unit III: Two-Dimensional Algorithms                           (8)3.1           Direct and incremental line drawing algorithms

3.2           Bresenham algorithms

3.3           Two-dimensional object to screen viewing transforms

3.4           Two-dimensional rotation, scaling and translation transforms

3.5           Recent transform concepts and advantages

3.6           Data structure concepts and CAP packages.

  • Identify different graphical languages.
Unit IV: Graphical Languages                                         (3)4.1           Need for machine independent graphical languages

4.2           Discussion of available languages and file formats

4.3           Detailed discussion of graphical languages to be used in projects

  • Understand three dimensional algorithms
  • Formulate the development of programs.
Unit V: Three-Dimensional Graphics                            (10)5.1          Three- dimensional object to screen perspective viewing transforms

5.2          Extension of two-dimensional transforms to three dimensions

5.3          Methods of generating non-planar surfaces

5.4          Hidden line and hidden surface removal techniques

5.5          Need for shading in data visualization

5.6          Algorithms to simulate ambient, diffuse and specular reflections

5.7          Constant, Gouraud and Phong shading models

5.8          Specialized and future three dimensional display architectures

  • Understand basics of numerical methods.
  • Formulate the development of programs for the solution of non-linear equations.
Unit VI: Solution of Nonlinear Equations                      (5)6.1           Review of calculus and Taylor’s theorem

6.2           Errors in numerical calculations

6.3           Trial and error method

6.4           Bisection method

6.5           Newton’s method

6.6           Secant method and their convergence

6.7           Fixed point iteration and its convergence.

  • Identify the different techniques of interpolation and approximation and apply them.
Unit VII: Interpolation and Approximation                   (5)7.1           Lagrange’s polynomials

7.2           Newton’s interpolation using difference and divided differences

7.3           Cubic spline interpolation

7.4           Least squares method for linear and nonlinear data

  • Understand the practical application of numerical differentiation and integration.
  • Formulate the development of the program.
Unit VIII: Numerical Differentiation and Integration (4)8.1           Newton’s differentiation formulas

8.2           Maxima and minima of tabulated function

8.3           Newton-Cote’s quadrature formulas

8.4           Gaussian integration algorithm

8.5           Romberg integration formulas

  • Perform the development of program for the solution of linear algebraic equations.
Unit IX: Solution of Linear Algebraic Equations           (5)9.1          Review of the existence of solutions and properties of matrices

9.2          Gaussian elimination method

9.3          Pivoting, ill-conditioning

9.4          Gauss-Jordan method

9.5          Inverse of matrix using Gauss elimination method

9.6          Method of factorization

9.7          Dolittle algorithm

9.8          Cholesky’s factorization

9.9          Iterative solutions

9.10      Solving eigen value problems using power method

  • Identify different techniques used in the software project management.
Unit X: Software Management Practice and Software Economics                                                                           (7)10.1      Conventional Software Management Theory and Practice

10.2      Software Economics and Cost Estimation

10.3      Improving Software Economics

10.4      Software Process

10.5      Team Effectiveness and Software Environment

10.6      Quality Target

10.7      Principles of Conventional Software Engineering

10.8      Principles of Modern Software Management

10.9      Iterative Process

  • Perform the development of program for the solution of partial differential equations.
Unit XI: Software Process Primitives and Process Management Framework                                                  (9)11.1      Software Process Life-Cycle Phases

11.2      Various Elements of the Software Process (Management, Engineering and Pragmatic)

11.3      Technical and Management Perspective of Software Architecture

11.4      Software Process Workflow and Iteration Workflow

11.5      Status Monitoring – Software Process Checkpoints and Milestones

  • Understand different process of planning, and estimation processes.
Unit XII: Techniques of Planning, Controlling and Automating Software Process                                        (10)12.1      Iterative Process Planning (Process Work Breakdown Structure, Planning Guidelines, Cost and Schedule Estimation Process, Iteration Planning Process)

12.2      Project Organization and Responsibilities

12.3      Process Automation – Tools and Environment

12.4      Project Control and Process Automation

12.5      Process Customization.

  • Understand modern approach to the software project management with respect to economical analysis.
Unit XIII: Modern Approach to Software Project and Economics                                                                           (2)13.1      Elements of Modern Software Projects and Management Principles

13.2      Next-Generation Software Economics and Cost Models

13.3      Modern Process Transition – Paradigm Shifts.

  • Formulate the development of individual projects.
Unit XIV: Project                                                             (25)The project should be based on the subjects studied earlier and the students should develop a complete package.

 

Laboratory:

Develop a graphical project. The topic could be either initiated by the student or selected form a list provided by the instructor. An oral presentation with a demonstration should be part of the laboratory project report.

The laboratory experiments in the numerical methods will consist of program development and testing of non-linear equations, Interpolation, numerical integration and differentiation, linear algebraic equations, ordinary and partial differential equations.

 

4.   Instructional Techniques

The instructional techniques for this course are divided into two groups.  First group consists of general instructional techniques applicable to most of the units. The second group consists of specific instructional techniques applicable to specific units.

        4.1 General Instructional Techniques

  • Providing the reading materials to the students to familiarize the units.
  • Lecture, question-answer, discussion, brainstorming, practical, and buzz session.

4.2 Specific Instructional Techniques

Unit I

  • Lecture
  • Discussion
  • Group work

Unit II

  • Lecture
  • Discussion
  • Group work

Unit III

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit IV

  • Lecture
  • Discussion
  • Group work

Unit V

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit VI

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit VII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit VIII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit IX

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit X

  • Lecture
  • Discussion
  • Group work

Unit XI

  • Lecture
  • Discussion
  • Group work

Unit XII

  • Lecture
  • Discussion
  • Group work

Unit XIII

  • Lecture
  • Discussion
  • Group work

Unit XIV

  • Lecture
  • Practical
  • Discussion
  • Group work

 

5.   Evaluation

Students will be evaluated on the basis of the class test during academic session, classroom participation, presentation of the reports and other practical activities.  The scores obtained will be used for feedback purposes. The students will be evaluated through the annual examination held by the Office of the Controller of Examinations on the basis of objective questions, short and long questions. The types and number of questions to be asked in the annual examination is mentioned below:

 

Types of questions

Total questions to be asked

Number of questions to be answered and marks allocated

Total marks

Group A: Multiple choice items 8 questions

8 x 1 mark

8

Group B: Short questions 5 with two or questions

5 x 6 marks

30

Group C: Long question 1 with one or question

1 x 12 marks

12

 

  1. 6.                              Recommended Books and References

Recommended Books

Hearn and Baker, “Computer Graphics, C Version”, Second Edition, Prentice- Hall of India Private Limited, 2003. (For Units I to V)

E. Balagurusamy, “Numerical Methods”, Tata McGraw-Hill Publishing Company Limited, New Delhi, 1999. (For Units VI to IX)

Royce, W., “Software Project Management – A Unified Framework”, Addison-Wesley, 2000, ISBN: 81-7808-013-3. (For Units X to XIII)

 

References

C.F. Gerald and P.O. Wheatley, “Applied Numerical Analysis”, 4th Edition, Addison Wesley Publishing Company, New York

W. Chency and D. Kinciad, “Numerical Mathematics and Computing”, 2nd edition, Brooks/Cole Publishing Co., 1985

W.H. Press, B.P. Flannery et. al., “Numerical Recipes in C”, 1st Edition, Cambridge Press, 1998.

S. Yakwitz and F. Szidarovszky, “An Introduction to Numerical Computations”, 2nd Edition, Macmillan Publishing Co., New York.

ICT 323, Communication and Cyber Law

Course Title: Communication and Cyber Law

Course No:  Comp Sc Ed 323 (CSE 323) (Vth Paper)            Full marks:  75 + 25

Nature of course:  Theory and Practical                                 Pass marks:  35% + 40%

Level: B. Ed.                                                                           Period per week:  4 + 4

Year: First                                                                               Total periods:  100 + 100

Time per period: 55 minutes

 

 

  1. 1.      Course Description

The communication system consists of introduction to telephone network, different types of transmission system and media, concepts of multiplexing and multiple access techniques, principles of pulse code modulation, and different types of switching techniques and systems. The course in networking lays out the principles of basics of networking, understanding of network topologies and network architecture, study of network software and reference model. It also deals with physical layers and its design issues, data link layers, transmission control protocol/ internet protocol reference model, network layer and internet layer, principles of network server and protocols, network management and security, and study of information and communication technology and cyber law with respect to Nepal’s context.

 

  1. 2.      General Objectives

The general objectives of this course are as follows:

  • to provide students with broad knowledge of principles of transmission, switching, signaling and networking aspects of modern telecommunication systems,
  • to develop meaningful understanding of  different kinds of networking topologies and their structure and design,
  • to explain telephone system, electronic email, data flows, networking protocols, and organization around ISO-OSI seven-layer architecture, with review of each layer.

 

3.   Specific Objectives and Contents

 

Specific Objectives

Contents

  • Understand basic of telephone network and its application.

 

Unit I: Introduction                                                           (2)1.1           Public-switched telephone network (PSTN)

1.2           Network topology, central office switch

1.3           Subscriber telephone, subscriber loop, telephone conversation

1.4           Hierarchical networks

  • Identify different data transmission model.
  • Understand different types of transmission media.
Unit II: Transmission                                                        (4)2.1           Comparison between analog and digital transmission

2.2           Transmission media (twisted pair, coaxial cable, optical fiber, radio and microwave)

2.3           Transmission impairments (distortion, noise, interference, crosstalk, echo, singing, jitter)

  • Understand multiplexing techniques.
  • Classify different types of multiple access techniques.
Unit III: Multiplexing and multiple access techniques  (5)3.1           Multiplexing and concentration, space-division multiplexing (SDM)

3.2           Time-division multiplexing (TDM)

3.3           Frequency division multiplexing (FDM)

3.4           Wavelength-division multiplexing (WDM)

3.5           Frequency division multiple access (FDMA)

3.6           Time-division multiple access (TDMA)

3.7           Code-division multiple access (CDMA)

3.8           Space-division multiple access (SDMA)

3.9           ALOHA, slotted-ALOHA, CSMA/CD

  • Identify the current digital communication system.
  • Understand the basic principle and application of pulse code modulation.
Unit IV: Pulse code modulation (PCM)                           (7)4.1           PCM generation, companding in PCM,

4.2           μ-law and A-law

4.3           PCM transmission format (T1, and E1 lines)

4.4           Frame and multiframe, frame and multiframe alignment strategy

4.5           Line codes (AMI, HDB3 and B8ZS)

4.6           Higher order PCM, plesiochronous digital hierarchy (PDH), synchronous digital hierarchy (SDH) and SONET

  • Explain data sending techniques.
  • Identify different types of switching process and techniques.

 

Unit V: Switching techniques and system                       (7)5.1           Message switching

5.2           Packet switching

5.3           Circuit switching

5.4           Manual switching

5.5           Electro mechanical switching

5.6           Electronic switching

5.7           Stored control program

5.8           Space-division switching

5.9           Time-division switching

5.10       Space-time division switching

5.11       Multiple stage switching

5.12       Digital cross connect

5.13       Private branch exchange

  • Identify different techniques in the networking system.
Unit VI: Background Study                                              (3)6.1           Introduction and necessity of computer networking

6.2           Different types of multiplexing: Simplex, Duplex, Half Duplex

  • Understand different types of network topologies and their applications.
Unit VII: Introduction to Network Topologies               (4)7.1           Definition, use and prospect of LAN;

7.2           Types of networking: LAN, WAN, MAN, Extra-Net, Intra-Net and Inter-Net

  • Understand different types of network architecture and their applications.
Unit VIII: Network Architecture                                     (4)8.1          Star, Clustered Star

8.2          Bus, Ring: Logical and Physical

8.3          Client Server Network Model;

8.4          Peer-to-peer Network architecture model

8.5          Wireless LAN

  • Explain network software and reference model.
Unit IX: Reference Model                                                 (8)8.1           Network software

8.2           Protocol hierarchy and its need

8.3           Interfaces and services

8.4           Introduction of OSI Reference Model

  • Justify the physical layer in the networking system.
Unit X: Physical layers and its Design issues                  (7)10.1      Twisted Pair Cable

10.2      Co-axial Cable

10.3      Base-band Cable

10.4      Broad-band Cable

10.5      Fiber Optics

10.6      Wireless Networking

10.7      Physical Layer Devices (Hub, Repeaters)

10.8      Introduction of Frame Relay, ATM, ISDN, PSTN and X.25.

  • Understand the process of data linking.
  • Explain different protocols.
Unit XI: Data Link Layers                                                (8)11.1      Services and Data Link Layer devices (Switch, Bridge)

11.2      Framing

11.3      Flow Control and Error Control

11.4      Elementary Data link Protocols

11.5      Sliding Window Protocols; HDLC, SLIP and PPP; Media Access Control Layer (Carrier Sense Multiple Access/Collision Detection)

  • Understand the transmission control protocol and internet protocol and their interdependency.
Unit XII: TCP / IP Reference Model                               (8)12.1      Introduction of TCP / IP Model

12.2      Comparison with OSI Reference Model

12.3      IPV4 Frame Format

12.4      IP Addresses and Classes

12.5      Subnet and Subnet mask

12.6      Introduction of IPV6

  • Identify different types of algorithms in the case of network layer and internet layer.
  • Explain routing system and its importance.
Unit XIII: Network Layer and Internet Layer               (8)13.1      Network Layer and Design Issues

13.2      Virtual Circuit and Data grams Subject

13.3      Introduction of Routing

13.4      Shortest path Routing Algorithm

13.5      Flow Based Routing Algorithm

13.6      Distance Vector Routing Algorithm

13.7      Spanning Tree Routing

13.8      Congestion Control

13.9      Traffic Shaping and Leaky Bucket Algorithm

  • Understand different types of network servers.
  • Identify and application of different protocols.
Unit XIV: Network Severs and Protocols                        (4)14.1      HTTP, DHCP; SMTP, DNS, PROXY, FTP, POP and IMAP

14.2      Examples of Clients, Servers Tools and Virtual private Networks

  • Develop understanding of the importance of network management.
  • Explain the basic principle and perform the application of cryptology.

 

Unit XV: Network Management and Security                (4)15.1      Introduction to Network management

15.2      Internet Network-Management framework (SMI & HIB) & SNMP protocol

15.3      Data encryption, Data Encryption standard

15.4      Principles of Cryptography (Symmetric Key & public key Encryption)

15.5      Integrity & firewalls

  • Explain information technology.
  • Discuss the cyber law in the context of Nepal.
Unit XVI: Information Communication Technology and Cyber Law                                                                        (17)16.1      Social Impact of the ICT

16.2      Digital Divide

16.3      Computer Ethics

16.4      Intellectual Properties Right

16.5      Privacy, Anonymity

16.6      Computer Crime

16.7      Concept of Cyber Law

16.8      Area of Cyber Law

16.9      Cyber Law in Nepal

16.10  IT Policy in Nepal

 

Laboratory:

  1. 1.         Setting up Client /Server Architecture system using Microsoft product and Linux
  2. 2.         Understanding Route interface and Basic Router using Route simulator.
  3. 3.         Understanding the socket Interface and window Socket API.

 

4.   Instructional Techniques

The instructional techniques for this course are divided into two groups.  First group consists of general instructional techniques applicable to most of the units. The second group consists of specific instructional techniques applicable to specific units.

        4.1 General Instructional Techniques

  • Providing the reading materials to the students to familiarize the units.
  • Lecture, question-answer, discussion, brainstorming, practical, and buzz session.

4.2 Specific Instructional Techniques

Unit I

  • Lecture
  • Discussion

Unit II

  • Lecture
  • Discussion
  • Group work

Unit III

  • Lecture
  • Discussion
  • Group work

Unit IV

  • Lecture
  • Discussion
  • Group work

Unit V

  • Lecture
  • Discussion
  • Group work

Unit VI

  • Lecture
  • Discussion
  • Group work

Unit VII

  • Lecture
  • Discussion
  • Group work

Unit VIII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit IX

  • Lecture
  • Discussion
  • Group work

Unit X

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XI

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XIII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XIV

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XV

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XVI

  • Lecture
  • Discussion
  • Group work

 

5.   Evaluation

Students will be evaluated on the basis of the class test during academic session, classroom participation, presentation of the reports and other practical activities.  The scores obtained will be used for feedback purposes. The students will be evaluated through the annual examination held by the Office of the Controller of Examinations on the basis of objective questions, short and long questions. The types and number of questions to be asked in the annual examination is mentioned below:

 

Types of questions

Total questions to be asked

Number of questions to be answered and marks allocated

Total marks

Group A: Multiple choice items 8 questions

8 x 1 mark

8

Group B: Short questions 5 with two or questions

5 x 6 marks

30

Group C: Long question 1 with one or question

1 x 12 marks

12

 

  1. 6.                              Recommended Books and References

Recommended Books

W. Stallings, “Data Communication and Computer Networks”, Seventh Edition, Prentice-Hall of India Limited, 2004. (For Units I, and III to V)

Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, Prentice-Hall of India Limited, 2004. (For Units II, and VI to XV)

 

References

Uyless D. Black, “Data Communications and Distributed Networks”, Third Edition, Prentice-Hall of India Limited, 2002.

J. Bellamy, Digital Telephony

B. Carson, Communication Systems.

J. E. Flood, Telecommunication switching, networks and traffic

Computer networking by James F. kurose, keith W. Ross.

Internet programming by KNJ Jamsa and ken cope.

Computer networking by RS Rajesh, KS Easwarakumar, R Balasubramaian.

Unit Network Programming by Stevens W.R- Vol.I and II.

TCP/IP Protocol by Behrouz A Foruldzan.

LAN by Gerd . E. keiser.

ICT 322, MIS, Data Strucure and Recent Technologies

Course Title: MIS, Data Structure and Recent Technologies

Course No:  Comp Sc Ed 322 (CSE 322) (IVth  Paper)         Full marks:  75 + 25

Nature of course:  Theory and Practical                                 Pass marks:  35% + 40%

Level: B. Ed.                                                                           Period per week:  4 + 4

Year: First                                                                               Total periods:  100 + 100

Time per period: 55 minutes

 

 

  1. 1.      Course Description

The management information system deals with the introduction to information system, different basic components of information system, idea of conceptual and detailed system design, implementation, evaluation, and maintenance of information system, application of database management, design and implementation of management information system, process for system design methodology, and finally the basic concepts of internet and intranet. The course in data structure and algorithm lays out the principles data structuring, use of stack, queue, list, linked lists, recursion, trees, sorting, searching, graphs and their implementations. This course also deals with the comparison of different algorithms. It also introduces the concept of computer science teaching methodology.

 

  1. 2.      General Objectives

The general objectives of this course are as follows:

  • to introduce and apply the knowledge of computer based information systems,
  • to help designing and setting up complex information system to the student,
  • to provide fundamental knowledge on date structure designing and implementation for storing information,
  • to provide the knowledge of various algorithms used in computer science.

 

3.   Specific Objectives and Contents

 

Specific Objectives

Contents

  • Understand basic of information system and Planning.

 

Unit I: Introduction to Information System                 (5)1.1           Definition

1.2           Sources and types of IS

1.3           Manual and Computer based IS

1.4           Planning and Design

1.5           Feasibility Assessment

1.6           Implementation

  • Identify and understand different hardware and communication system. used in the information system.
Unit II: Basic components of Information system       (5)2.1           Hardware

2.2           Multi-Protocol Networks

2.3           Communication media

2.4           Standard User Interface

2.5           Markup Languages

  • Define a problem and constraints.
Unit III: Conceptual and Detailed System Design       (4)3.1           Definition of Problems

3.2           Constraints

3.3           Alternative Design

  • Implementation, control, and maintenance of information system.
Unit IV: Implementation, Evaluation, and Maintenance of IS                                                                                  (5)4.1           Implementation Alternatives

4.2           Plan for Implementation

4.3           Evaluation of implemented system

4.4           Control and Maintenance

  • Implement the database concept in the design of information system.
Unit V: Parts of Information System                            (5)5.1           Database Management System

5.2           Management Information System

5.3           Automation Process

5.4           Geographical Information System

  • Design and implementation of management information system
Unit VI: Management of Information system              (5)6.1           MIS Planning

6.2           Design, and Implementation

  • Understand and implement the steps in the design
Unit VII: System Design Methodology                         (4)7.1           Check list methodology

7.2           Process Oriented Methodology

7.3           Application Generation

7.4           Structured Design

  • Get familiarization of internet system and addressing techniques.
Unit VIII: Internet and Intranet                                   (5)8.1           Internet versus Intranet

8.2           TCP/IP standard

8.3           E-mail, Internet and external

8.4           SMTP/POP, WWW and Hypermedia

8.5           Proxy servers and their configuration

8.6           Resource sharing

8.7           IP addressing, routing and sub-netting

  • Understand the basics of data structure.
Unit IX: Introduction to Data Structure                      (4)9.1           Concept of data structure

9.2           Abstract date type

9.3           Implementation of data structure

  • Use of stack and its implementation.
Unit X: The Stack                                                           (4)10.1       Definition

10.2       Stack as an ADT

10.3       POP and PUSH operation

10.4       Stack application: Evaluation of Infix Postfix and prefix expressions

  • Understand and implement queue.
Unit XI: Queue                                                                (4)11.1       Definition

11.2       Queue as an ADT

11.3       Primitive operations in queue: Linear and circular queue and their application

11.4       Enqueue and Dequeue

11.5       Priority queue.

  • Understand and implement list.
Unit XII: List                                                                   (5)12.1       Definition

12.2       Static and dynamic list structure

12.3       Array implementation of lists

12.4       Queues as list

  • Understand and implement linked list.
Unit XIII: Linked lists                                                    (5)13.1              Definition and link list as an ADT

13.2              Dynamic implementation

13.3              Basic operations in `linked list: node insertion deletion, insertion and deletion after and before nodes linked stacks and Queues

13.4              Doubly linked lists and its advantages

  • Understand and implement recursive process with reference to Tower-of- Hanoi problem.
Unit XIV: Recursion                                                       (4)14.1       Principle of recursion

14.2       Comparison between recursion and iteration, recursion example

14.3       TOH and Fibonacci sequence

14.4       Applications of recursion

14.5       Search tree

  • Understand the concept and implementation of tree structure.
Unit XV: Trees                                                                (5)15.1       Concept and definitions

15.2       Basic operation in binary tree

15.3       Tree search and insertion /deletions binary tree traversals (preorder , post order and in order ) tree height level and depth

15.4       Balanced trees : AVL balanced trees , Balancing algorithm

15.5       The Huffman algorithm

15.6       Game tree, B- Tree

  • Identify different sorting algorithm and implement it.
Unit XVI: Sorting                                                           (5)16.1       Internal and external sort

16.2            Insertion and selection sort

16.3       Exchange sort Bubble and quick sort Merge and Radix  sort Shall sort , Binary sort, Heap sort as priority queue

16.4       Efficiency of sorting big ‘O’ notation

  • Identify different searching algorithm and implement it.
Unit XVII: Searching                                                     (5)17.1       Search technique essential of search

17.2       Sequential search binary search, tree search general search tree

17.3       Hashing : Hash function and hash tables

17.4       Collision resolution technique

17.5       Efficiency comparisons of different search technique

  • Represent and implement graphs.
Unit XVIII: Graphs                                                        (5)18.1       Representation and applications

18.2       Graphs as an ADT

18.3       Transitive closure

18.4       Wars hall’s Algorithm

18.5       Graphs types, Graphs traversal and spanning forests

18.6       Kruskal ‘s and Round Robin algorithms

18.7       Shortest-path algorithm: Greedy algorithm , Dijkstra’s Algorithm

  • Understand different types of algorithms and demonstrate its applications.
Unit XIX: Algorithms                                                     (4)19.1       Deterministic and non-deterministic algorithm

19.2       Divide and conquer algorithm

19.3       Series and Parallel algorithm

19.4       Heuristic and Approximate algorithm

  • Get familiar with multimedia techniques and its applications.
Unit XX: Multimedia                                                      (4)20.1       Introduction to Multimedia

20.2       Component of Multimedia: Text, Graphics, Audio, Video and Animation

20.3       Application of Multimedia

  • State artificial intelligence techniques and perform its applications.
Unit XXI: Artificial Intelligence                                    (4)21.1       Concept of AI

21.2       Component of AI

21.3       Uses of AI

21.4       Ethical Aspect of AI

  • Identify contemporary technology and perform its applications.
Unit XXII: Contemporary Technology                        (4)22.1   e- Business

22.2   e-Learning

22.3   e-Governances

22.4   e-Medicine

22.5   Virtual Reality

22.6   Robotics

 

Laboratory:

The laboratory exercises shall include projects on designing of Information system using Object oriented methodology. Case study shall be included. The data structure and algorithms should include following laboratory exercises based on C or C++:

  1. Implementations of stack.
  2. Implementations of linear and circular queues.
  3. Solutions of TOH and Fibonacci Recursion.
  4. Implementation of linked list: singly and double linked.
  5. Implementation of trees : AVL tree Balancing of ALV
  6. Implementation of merge sort.
  7. Implementation of search: sequential tree and binary.
  8. Implementation of Graphs: Graph traversals.
  9. Implementation of hashing.
  10. Implementation of heap.

 

4.   Instructional Techniques

The instructional techniques for this course are divided into two groups. First group consists of general instructional techniques applicable to most of the units. The second group consists of specific instructional techniques applicable to specific units.

        4.1 General Instructional Techniques

  • Providing the reading materials to the students to familiarize the units.
  • Lecture, question-answer, discussion, brainstorming, practical, and buzz session.

4.2 Specific Instructional Techniques

Unit I

  • Lecture
  • Discussion

Unit II

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit III

  • Lecture
  • Discussion
  • Group work

Unit IV

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit V

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit VI

  • Lecture
  • Discussion
  • Group work

Unit VII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit VIII

  • Lecture
  • Discussion
  • Group work

Unit IX

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit X

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XI

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XIII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XIV

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XV

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XVI

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XVII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XVIII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XIX

  • Lecture
  • Discussion
  • Group work

Unit XX

  • Lecture
  • Discussion
  • Group work

Unit XXI

  • Lecture
  • Discussion
  • Group work

Unit XXII

  • Lecture
  • Discussion
  • Group work

 

5.   Evaluation

Students will be evaluated on the basis of the class test during academic session, classroom participation, presentation of the reports and other practical activities.  The scores obtained will be used for feedback purposes. The students will be evaluated through the annual examination held by the Office of the Controller of Examinations on the basis of objective questions, short and long questions. The types and number of questions to be asked in the annual examination is mentioned below:

 

Types of questions

Total questions to be asked

Number of questions to be answered and marks allocated

Total marks

Group A: Multiple choice items 8 questions

8 x 1 mark

8

Group B: Short questions 5 with two or questions

5 x 6 marks

30

Group C: Long question 1 with one or question

1 x 12 marks

12

 

  1. 6.                              Recommended Books and References

Recommended Books

J. Kanter, “Managing with Information System“, Fourth edition, Prentice Hall of India Limited, 2004. (For Units I to IV, and VI to VII)

V. Rajaraman, “Analysis and design of Information Systems”, Prentice Hall of India, 1998. (For Units V)

G. S. Baluja, “Data structure Through C, A Practical Approach”, Dhanpat Rai & Co., 2003. (For Units IX to XIX)

Ralf Steinmetz and Klara Nahrstedt, “Multimedia: Computation, Communication and Application”, Pearson Education, 2001. (For Units XX)

Russel and Peter Norvig, “Artificial Intelligence, A Modern Approach”, Pearson Education, 2006. (For Units XXI)

www.wikipedia.com (For Units XXII)

 

References

Y Langsam , MJ , Augenstein and A.M , Tanenbaum  Data Structures using C and C++ , Prentice HallIndia.

G.W Rowe , Introduction to Data Structure and Algroithms with C and C++ , prentice Hall  India .

Lippman, S.B., Lajoie. J., C++ Primer, 3rd Ed., Addison Wesley, 1998.

Eckel, B., Thinking in C++, 2nd Edition, Prentice Hall, 2000.

R.L Kruse, B.P. Leung, C.L. Tondo, data structure and program Design in C Prentice-Hall India.

G. Brassard and P. Bratley fundamentals of Algroithms, Prentice-Hall India.

ICT 321, Teaching ICT and Object Oriented Programming and Database

Course Title: Teaching ICT and Object Oriented Programming & Database

Course No:  Comp Sc Ed 321 (CSE 321) (3rd paper)             Full marks:  75 + 25

Nature of course:  Theory and Practical                                 Pass marks:  35% + 40%

Level: B. Ed.                                                                           Period per week:  4 + 4

Year: First                                                                               Total periods:  100 + 100

Time per period: 55 minutes

 

 

  1. 1.      Course Description

Object-oriented programming is an approach to thinking about computation and problem solving in Object Oriented Paradigms. This course lays out the principles of object-oriented programming in C++ Programming Language. The course helps the students to discover the basic concepts of object-oriented programming in C++. The database management system consists of introduction, data models, relational model, relational languages, relational database design, security issues, query processing, filing and files structure, crash recover, concurrency control, and advanced database model. It also introduces the concept of computer science teaching methodology.

 

  1. 2.      General Objectives

The general objectives of this course are as follows:

  • to introduce the fundamentals of C/C++ programming,
  • to present the defensive programming style required by the C/C++ programming language,
  • to explore the facilities offered by C++ for object-oriented programming,
  • to provide fundamental concept, theory and practices in design and implementation of DBMS,
  • to equip with the detail aspects of computer science teaching methodology interacting computer science education in the secondary level.

 

3.   Specific Objectives and Contents

 

Specific Objectives

Contents

  • Familiarization of the oriented programming system.
  • Development of the program.
  • Case study of different types of systems related to object oriented programming.
Unit I: Introduction to Object Oriented Paradigm   (10)1.1           Object-Oriented Programming as a New Paradigm

1.2           A Way of Viewing the World-Agents

1.3           Computation as Simulation

1.4           Coping with Complexity

1.4.1 The Nonlinear Behavior of Complexity

1.4.2 Abstraction Mechanisms

1.4.3 Reusable Software

1.5           Object-Oriented Design

1.5.1 Responsibility Implies Noninterference

1.5.2 Programming in the Small and Programming in the Large

1.5.3 Reusable Software

1.5.4 Role of Behavior in OOP

1.5.5 Case Study

1.6           Responsibility-Driven Design

1.7           CRC Cards

1.8           Components and Behavior

1.9           Software Components

1.10       Formalize the Interface

1.11       Design the Representation for Components

1.12       Implementing Components

1.13       Integration of Components

1.14   Maintenance and Evolution

  • Understand the classes, methods, and messages.
  • Explain/ Define implementation of varieties of classes.
  • Implementation of methods and message passing systems.

 

Unit II: Classes, Methods and Messages                    (12)2.1           Encapsulation

2.2           Varieties of Classes

2.3           Interface and Implementation

2.4           Classes and Methods in C++

2.5           Message-Passing Formalism

2.6           Message Passing Syntax in C++

2.7           Issues in Creation and Initialization

2.8           Stack Versus Heap Storage Allocation

2.9           Memory recovery, Pointers

2.10       Mechanisms for Creation and Initialization in C++,

2.11       Case Study: The Eight Queen Puzzle in C++.

  • Identify different types of inheritances.
  • Develop the program for different inheritance system.
Unit III: Inheritance and Software Reusability           (7)3.1         Introduction to Inheritance

3.2         Subclass, Subtype, and Substitutability

3.3         Forms of Inheritance

3.4         Inheritance in C++

3.5         Inheritance- Its merit and demerits

3.6         Inheritance and Substitutability

3.7         The is-a rule and the has-a rule

3.8         Composition and Inheritance

3.9         Software reusability

  • Understand polymorphism and its importance.
  • Comprehend varieties of polymorphic variables and its applications.

 

Unit IV: Polymorphism                                                  (8)4.1           Polymorphism in Programming languages

4.2           Varieties of Polymorphism

4.3           Polymorphic Variables, Overloading, Overriding

4.4           Deferred Methods, Pure Polymorphism

4.5           Generic and Templates, Polymorphism in C++

4.6           Case Study: Container Classes and The Standard Template Library

  • Understand basic of database.
  • Application of database.
Unit V: Introduction                                                       (3)5.1           Concept and applications, Motivation

5.2            Objectives and Evolution

5.3            Needs and organizations of database

5.4            Data abstraction, Data independence, Schema and Instances

5.5            Concept of DDL and DML

5.6            Database Manager and users, Needs of DBMS.

  • Identify different data model
Unit VI: Data Models                                                     (4)6.1      Logical, Physical and Conceptual Model

6.2      E-R Model

6.3      Network Data Model

6.4      Hierarchical Data Model

  • Understand and apply relational algebra.
  • Understand and apply relational calculus.
Unit VII: Relational Model                                            (4)7.1           Definitions and terminology

7.2           Structure of relational databases

7.3           The relational algebra

7.4           The relational calculus

7.5           Schemas and Views

  • Define and carry out implementation of different relational languages.
Unit VIII: Relational languages                                    (4)8.1           SQL

8.2           DDL and DML

8.3           QBE

  • Identify different types of relational database design.
  • Understand the use of normalization for reducing redundancy.
Unit IX: Relational Database Design                            (8)9.1           Introduction

9.2           Integrity constraints

9.3           Referential Integrity, Multi-valued and Join Dependencies

9.4           Normalization, Normal Forms

9.5           User schema or views design

9.6           Decomposition of relation schemes

  • Determine security principle in the database design.
Unit X: Security                                                              (3)10.1        Needs of security

10.2        Security and integrity violations

10.3        Access control, Authorization

10.4        Security and Views

10.5        Encryption and decryption

  • Extraction of required information from database.
  • Implementation of query processing system.
Unit XI: Query Processing                                             (3)11.1       Introduction to query processing

11.2       Query interpretation

11.3       Equivalence of expressions

11.4       Query Optimization

11.5       Join strategies

11.6       Query decomposition

  • Understand the need of filing system.
  • Implementation of the different types of filing system.
Unit XII: Filing and File Structure                                (4)12.1        Needs of filing, Overview of storage devices

12.2        Organization of records into blocks,

12.3        File organizations,

12.4        The sequential and the indexed sequential file organizations.

  • Recover data during crash.
  • Implementation of different recovery system
Unit XIII: Crash Recovery                                            (3)13.1       Introduction to crash recovery and its importance

13.2       Failure classification

13.3       Backup-recovery

13.4       Storage hierarchy, Transaction model, Log-based recovery, Shadow paging

  • Familiarization of different transaction processing.
  • Handling of the system during deadlock.

 

Unit XIV: Concurrency Control                                   (4)14.1       Introduction

14.2       Transaction and Transaction processing

14.3       Scheduling and Serializability

14.4       Locking and Lock based protocols

14.5       Time-stamping-based protocols

14.6       Deadlock handling

14.7       Multiple Granularity

  • Understand the recent database techniques.
Unit XV: Advanced Database Model                            (3)15.1       Extended Relational Model

15.2       Object-Oriented Model

15.3       Distributed Model

  • Deals with the teaching methodology in the case of computer science teaching.
Unit XVI: Computer Science Teaching Methodology   (20)

 

Laboratory:

There shall be 20 exercises in minimum, as decided by the faculty. The exercises shall encompass a broad spectrum of real-life and scientific problems, development of small program to the development of fairly complex subroutines, programs for practical applications and problem solving situations. Laboratory assignments will be offered in groups of two to four for evaluation purpose. In general, the Laboratory Work must cover assignments and exercises from the following areas:

 

  1. Data types – control structures, functions and scoping rules.
  2. Composite data types, C++ strings, use of keyword, pointers and references
  3. Classes and data abstraction
  4. Inheritance, abstract classes and multiple inheritance
  5. Friend functions, friend classes and operator overloading.
  6. Static class members
  7. Polymorphism, early binding and late binding
  8. C++ type conversion
  9. Exception handling
  10. Function templates, class templates and container classes.

 

For database management system, there shall be 12 laboratory exercised based on database package to cover theoretical part studied. An individual project should be given to each student.

 

4.   Instructional Techniques

The instructional techniques for this course are divided into two groups.  First group consists of general instructional techniques applicable to most of the units. The second group consists of specific instructional techniques applicable to specific units.

        4.1 General Instructional Techniques

  • Providing the reading materials to the students to familiarize the units.
  • Lecture, question-answer, discussion, brainstorming, practical, and buzz session.

4.2 Specific Instructional Techniques

Unit I

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit II

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit III

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit IV

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit V

  • Lecture
  • Discussion

Unit VI

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit VII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit VIII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit IX

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit X

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XI

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XII

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XIII

  • Lecture
  • Discussion
  • Group work

Unit XIV

  • Lecture
  • Practical
  • Discussion
  • Group work

Unit XV

  • Lecture
  • Discussion
  • Group work

Unit XVI

  • Lecture
  • Discussion
  • Group work

 

5.   Evaluation

Students will be evaluated on the basis of the class test during academic session, classroom participation, presentation of the reports and other practical activities.  The scores obtained will be used for feedback purposes. The students will be evaluated through the annual examination held by the Office of the Controller of Examinations on the basis of objective questions, short and long questions. The types and number of questions to be asked in the annual examination is mentioned below:

 

Types of questions

Total questions to be asked

Number of questions to be answered and marks allocated

Total marks

Group A: Multiple choice items 8 questions

8 x 1 mark

8

Group B: Short questions 5 with two or questions

5 x 6 marks

30

Group C: Long question 1 with one or question

1 x 12 marks

12

 

  1. 6.                              Recommended Books and References

Recommended Books

R. Lafore, Object Oriented Programming in Turbo C++, Galgotia Publications Ltd. India, 2001. (For Units I to IV)

A.K Majumdar and P. Bhattacharaya, Database Management Systems, Tata McGraw Hill, India, 2003. (For Units V to XV)

 

References

Lippman, S.B., Lajoie. J., C++ Primer, 3rd Ed., Addison Wesley, 1998

Eckel, B., Thinking in C++, 2nd Edition, Prentice Hall, 2000

Budd, T., An Introduction to Object Oriented Programming, Second Edition, Addison-Wesley, Pearson Education Asia, ISBN: 81-7808-228-4.

Savitch, W, Problem Solving with C++ – The Object of Programming, 2nd Edition, Addison – Wesley, Pearson Education Asia (LPE), 2001, ISBN: 81-7808-173-3.

H.F. Korth and A. Silberschatz, Database System Concepts, McGraw Hill.

R.E. Mani and S.C Nevathe, Fundamentals of Database Systems, Benjamin/Cummings Publishing Co. Inc.

G.C Everest, Database Management, McGraw Hill.

ICT 312, Basic Hardware, Sotware and C-Programming

Course TitleBasic Hardware, Software & C-Programming       Full mark: 100 (50T+50P)

Course No: ICT Ed. 312                                                                     Pass mark: (18T+20P)

Nature of the course: Theory +Practical                                             Periods per week: (4T+4P)

Level: B.Ed.                                                                                        Total periods: 200

Year: First                                                                                                                         Time per period: 55 minutes

 

 

 

1.   Course Description

This course is designed for those students who specialize in Information and Communication Technology (ICT). It intends to provide broader knowledge of basic hardware, software and c-programming. This is a very basic and foundation ICT course. This course contains the digital logic, microprocessor, computer operating system and C- Programming language. In this course, students will learn the basic hardware, software and c-programming in details.

 

2.   General Objectives

 

The general objectives of this course are as follows.

  • To provide the knowledge of the basic principles of the digital logical tables.
    • To familiarize the students with the definition and use of the Boolean algebra and its laws.
    • To enable the students to understand the concept of AND, OR, NOR, NAND etc.
    • To acquaint the students with the definition of the working procedure inside the computer system.
    • To give the knowledge of the concept of the structural computer programming language and its tools.
    • To help the students in understanding the concept of the computer operating system, its types, its role and principles.

 

3. Specific Objectives and Contents

 

 

Specific Objectives

Contents

  • Explain the logic functions.
  • Define Boolean algebra & its laws.
  • Explain the concept of logic gates.
  • Use Venn diagram.
  • Explain De Morgan’s Theorem.
Unit I:  Digital Logic                                           (38)1.1  Logic functions and Boolean Algebra

1.2  Digital logic

1.3  Simple features using Boolean Algebra (K Map)

1.4 Introductions of truth tables, operators & operands

1.5 Logic Gates – AND, OR, NOT, NAND, NOR, XOR, AND XNOR – its definition, use, truth table logic symbols

1.6 Laws of Boolean Algebra

1.7 De Morgan’s Theorem: Statement & Logic

1.8 Venn diagram

  • Explain the processing steps of the microprocessor.
  • Describe the register organization.
  • Describe the general concepts of the Assembly Language.
  • Explain the addressing steps.
  • Describe the formats.
  • Explain the general concepts of the control unit, Memory unit, I/O system and general architecture of the microprocessor.
  • Explain storage system.
UNIT II: Microprocessor                                 (58)2.1  Introduction to microprocessor

2.2  Types of the microprocessor

2.3  Processing organization

2.4  Register organization

2.5  General Assembly Language System

2.6  Addressing and formats

2.7  Control unit

2.7.1 Hardware

2.7.2 Software

2.8     Memory organization, types, memory devices, static and dynamic RAM, ROM, EPROM’S, high-speed and optic memory

2.9  I/O system

2.9.1 I/O types

2.9.2 I/O processor

2.9.3 Bus system

2.10 Architecture

2.10.1 RISC

2.10.2 CISC concept

2.11 Introduction to storage system

  • Explain the general concept of the computer operating system.
  • Describe the file concept, CPU scheduling concept and allocation.
  • Differentiate between multiprocessing and multitasking.
  • Explain the types and functions of  OS.
UNIT III: Operating System                           (22)3.1 General introduction to operation system (OS)

3.2 Type of OS

3.3 Functions of OS

3.4  Terminologies and services of  OS

3.5 File concept

3.6 Allocation of resources

3.7 CPU scheduling concept

3.8 Memory management

3.9  Translator

3.10  Linkers

  • Explain the general concept of the programming.
  • Write the detail idea about C-programming language.
  • Write, edit and test the self made C-programs.
UNIT IV: Programming                                   (82)4.1  Introduction to C-programming language

4.2  Idea of software and programming

4.3  Algorithm development, flowchart, pseudo codes, requirement analysis, system design, implementation and execution

4.4  Review of structured programming principles

4.5  Data types in C

4.6  Variables and constants

4.7  Simple statements and compound statements

4.8  Structured statements

4.9  Logical and conditional expressions

4.10 Arrays type and definitions

4.11 Functions: recursive and non recursive

4.12 String function  and  I/O functions

4.13 Structures and unions

4.14 Pointers

4.15 Bit oriented instructions

4.16 C-preprocessors and C libraries

4.17 Error and debugging

4.18 Syntax

4.19 Run time errors and debugging

4.20 File handling

4.21 Library functions

4.22 Overflow/under overflow

4.23 User interfaces

4.24 Introduction to data structure

4.25 Programming project and software management

4.25.1 Bottom up and top down design

4.25.2 Testing sub programs, test of module

Boundaries and test of boundary  conditions

4.25.3 Documentation – Structure charts and program

descriptions sheets

4.26     Project work on C-programming

Note: The figures within the parentheses indicate the approximate periods for respective units.

 

4.    Instructional Techniques Theory Class

The instructional techniques for this course are divided into two groups. They are general and specific instructional techniques.

4.1    General Instructional Techniques

  • Lecture
  • Discussion
  • Group Work
  • Class Exercise
  • Power Point Presentation

4.2        Specific Instructional Techniques

Units I and II:

  • Demonstrate the physical parts of microprocessor (8085 and 8086 kits) and logical gates (AND OR and INVERTOR gates).
  • Use more pictures to demonstrate the internal part of the equipments (Logic patch boards).
  • Use the parts of the microprocessor, logical gates and use the displaying diagrams.

4.3    Instructional Techniques in the Practical Class

         The following procedures techniques will be used in the practical class.

 

4.3.1 Before starting the practical class

For Unit:

  • Explain the objectives, meaning of the symbols, uses of the microprocessor and logic gates.
  • Describe the meaning and reasons of data flow, data tables and according to the outputs in the diagram.
  • Provide the basic concept of the logic board, gate arrays and memory based circuits.
  • Use the simulation program to demonstrate the concept of input, process and output. Explain the reasons.

4.3.2 During the practical class

  • Run the practical works regarding microprocessor and logic gates to prove the above said reasons.

 

Theory part

The performance of the students in first part of this course will be assessed through the annual examination held by the Office of the Controller of Examinations. The types and number of questions included in the annual examination are given in the following table:

Types of questions

Total questions

to be asked

Number of questions

to be answered and marks allocated

Total marks

Group A: Multiple choice items

10 questions

10 x 1 mark

10

Group B: Short questions

4 with 2 ‘or’    questions

4 x 7 marks

28

Group C: Long questions

1 with 1  ‘or’   question

1 x 12 marks

12

 

Practical part

The performance of the students will be assessed through practical examination. The practical examination will be conducted within the campus by external and internal examiners. Marks distribution for the practical examination is given as follows.

Contents

Total questions

to be asked

Number of questions

to be answered and marks allocated

Total marks

Time in minutes

Digital Logic circuits

1

1×6 mark

6

20

Micro processor

1

1×9 mark

9

25

C- Programming

5

5×6 mark

30

65

Viva (question to be asked)

10

5 mark

5

10

 

6. Recommended books and References

 

Recommended Books

Kelly &  Pohl. (1984). A book on C. Benjamin Cummings. India: Publisher (For unit IV)

Raman, R. (1984). Computer programming in C-PHI. India: Publisher  (For unit IV)

Morris, M. (Latest Edition). Digital logic and computer design.  New DelhiPrintice Hall of India Pvt. (For unit I)

Kant, K. (Latest Edition). Microprocessor and micro controllers: Architecture, programming and system design.  New Delhi: Printice Hall of India (PHI) Pvt Ltd. [For unit 2]

Tanenbaum, A. & Woodhull, A. (Second Edition). Operating System Design and Implementation (2nd edition).  New Delhi: PHI India. (For unit II)

 

References

Hughes, C. J. & Michtom, I.  (Latest Edition). Structured approach to programming. City: Prentice Hall International.

Baral, D.S., Baral, D. & Ghimire S. K. (Latest Edition). The secretes of C programming language. City:

Balaguruswamy, E. (2000). Programming in ANSI CNew Delhi: Tata Mc Graw Hill Publishing Company.

Gurung J. B., et al. (Second Edition). A Textbook on computer science Part A (2nd edition).Kathmandu: Bhundipuran Prakashan

URL:http://en.wikipedia.org/