CSIT Nepal

BSc. CSIT Third Semester Data Structures And Algorithms Course Overview

2022-07-05T18:44:00.011+05:45

Title	Data Structures and Algorithms
Course code	CSC 206
Nature of course	Theory + Lab
Semester	Third-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

This course includes the basic foundations in of data structures and algorithms. This course covers concepts of various data structures like stack, queue, list, tree and graph. Additionally, the course includes idea of sorting and searching.

Course Objectives:

To introduce data abstraction and data representation in memory
To describe, design and use of elementary data structures such as stack, queue, linked list, tree and graph
To discuss decomposition of complex programming problems into manageable sub-problems
To introduce algorithms and their complexity

Course Contents:

Introduction to Data Structures & Algorithms
Teaching Hours : 4 hrs
1.1. Data types, Data structure and Abstract date type
1.2. Dynamic memory allocation in C
1.3. Introduction to Algorithms
1.4. Asymptotic notations and common functions
Stack
Teaching Hours : 4 hrs
2.1. Basic Concept of Stack, Stack as an ADT, Stack Operations, Stack Applications
2.2. Conversion from infix to postfix/prefix expression, Evaluation of postfix/ prefix expressions
Queue
Teaching Hours : 4 hrs
3.1. Basic Concept of Queue, Queue as an ADT, Primitive Operations in Queue
3.2. Linear Queue, Circular Queue, Priority Queue, Queue Applications
Recursion
Teaching Hours : 3 hrs
4.1. Principle of Recursion, Comparison between Recursion and Iteration, Tail Recursion
4.2. Factorial, Fibonacci Sequence, GCD, Tower of Hanoi(TOH)
4.3. Applications and Efficiency of Recursion
Lists
Teaching Hours : 8 hrs
5.1. Basic Concept, List and ADT, Array Implementation of Lists, Linked List
5.2. Types of Linked List: Singly Linked List, Doubly Linked List, Circular Linked List
5.3. Basic operations in Linked List: Node Creation, Node Insertion and Deletion from Beginning, End and Specified Position
5.4. Stack and Queue as Linked List
Sorting
Teaching Hours : 8 hrs
6.1. Introduction and Types of sorting: Internal and External sort
6.2. Comparison Sorting Algorithms: Bubble, Selection and Insertion Sort, Shell Sort
6.3. Divide and Conquer Sorting: Merge, Quick and Heap Sort
6.4. Efficiency of Sorting Algorithms
Searching and Hashing
Teaching Hours : 6 hrs
7.1. Introduction to Searching, Search Algorithms: Sequential Search, Binary Search
7.2. Efficiency of Search Algorithms
7.3. Hashing : Hash Function and Hash Tables, Collision Resolution Techniques
Trees and Graphs
Teaching Hours : 8 hrs
8.1. Concept and Definitions, Basic Operations in Binary Tree, Tree Height, Level and Depth
8.2. Binary Search Tree, Insertion, Deletion, Traversals, Search in BST
8.3. AVL tree and Balancing algorithm, Applications of Trees
8.4. Definition and Representation of Graphs, Graph Traversal, Minimum Spanning Trees: Kruskal and Prims Algorithm
8.5. Shortest Path Algorithms: Dijksrtra Algorithm

Laboratory Works:

The laboratory work consists of implementing the algorithms and data structures studied in the course. Student should implement at least following concepts;

Dynamic memory allocation and deallocation strategies
Stack operations and Queue operations
Array and Linked List implementation of List
Linked List implementation of Stack and Queues
Sorting, Searching and Hashing algorithms
Binary Search Trees and AVL Tress
Graph Representation, Spanning Tree and Shortest Path Algorithms

Text Books:

Y Langsam , MJ Augenstein and A.M , Tanenbaum Data Structures using C and C++ , Prentice Hall India, Second Edition 2015

Reference Books:

Leen Ammeral, Programmes and Data Structures in C, Wiley Professional Computting
G.W Rowe, Introduction to Data Structure and Algroithms with C and C++ , prentice Hall India
R.L Kruse, B.P. Leung, C.L. Tondo, Data Structure and Program Design in C Prentice Hall India

BSc. CSIT Second Semester Discrete Structures Course Overview

2022-07-05T18:12:00.005+05:45

Title	Discrete Structures
Course code	CSC 160
Nature of course	Theory + Lab
Semester	Second-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

The course covers fundamental concepts of discrete structure like introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science

Course Objectives:

The main objective of the course is to introduce basic discrete structures, explore applications of discrete structures in computer science, understand concepts of Counting, Probability, Relations, and Graphs respectively.

Course Contents:

Basic Discrete Structures
Teaching Hours : 7 hrs
1.1. Sets: Sets and Subsets, Power Set, Cartesian Product, Set Operations, Venn Diagram, Inclusion-Exclusion Principle, Computer Representation of Sets
1.2. Functions: Basic Concept, Injective and Bijective Functions, Inverse and Composite Functions, Graph of Functions, Functions for Computer Science (Ceiling Function, Floor Function, Boolean Function, Exponential Function), Fuzzy Sets and Membership Functions, Fuzzy Set Operations
1.3. Sequences and Summations: Basic Concept of Sequences, Geometric and Arithmetic Progression, Single and Double Summation
Integers and Matrices
Teaching Hours : 6 hrs
2.1. Integers: Integers and Division, Primes and Greatest Common Divisor, Extended Euclidean Algorithm, Integers and Algorithms, Applications of Number Theory (Linear Congruencies, Chinese Remainder Theorem, Computer Arithmetic with Large Integers)
2.2. Matrices: Zero-One Matrices, Boolean Matrix Operation
Logic and Proof Methods
Teaching Hours : 6 hrs
3.1. Logic: Propositional Logic, Propositional Equivalences, Predicates and Quantifiers, Negation of Quantified Statements, Proof of quantified statements, Nested Quantifiers, Rules of Inferences
3.2. Proof Methods: Basic Terminologies, Proof Methods (Direct Proof, Indirect Proof, Proof by Contradiction, Proof By Contraposition, Exhaustive Proofs and Proof by Cases), Mistakes in Proof
Induction and Recursion
Teaching Hours : 5 hrs
4.1. Induction: mathematical Induction, Strong Induction and Well Ordering, Induction in General
4.2. Recursive Definitions and Structural Induction, Recursive Algorithms, Proving Correctness of Recursive Algorithms
Counting and Discrete Probability
Teaching Hours : 9 hrs
5.1. Counting: Basics of Counting, Pigeonhole Principle, Permutations and Combinations, Two Element Subsets, Counting Subsets of a Set, Binomial Coefficients, Generalized Permutations and Combinations, Generating Permutations and Combinations
5.2. Discrete Probability: Introduction to Discrete Probability, Probability Theory, Probability Calculation in Hashing, Expected Value and Variance, Randomized Algorithms
5.3. Advanced Counting: Recurrence Relations, Solving Recurrence Relations (Homogeneous and Non-Homogeneous equations), Introduction to Divide and Conquer Recurrence Relations
Relations and Graphs
Teaching Hours : 12 hrs
6.1. Relations: Relations and their Properties, N-ary Relations with Applications, Representing Relations, Closure of Relations, Equivalence Relations, Partial Ordering
6.2. Graphs: Graphs Basics, Graph Types, Graph Models, Graph Representation, Graph Isomorphism, Connectivity in Graphs, Euler and Hamiltonian Path and Circuits, Matching Theory, Shortest Path Algorithm (Dijkstra’s Algorithm), Travelling Salesman Problem, Graph Coloring
6.3. Trees: Introduction and Applications, Tree Traversals, Spanning Trees, Minimum Spanning Trees (Kruskal’s Algorithm)
6.4. Network Flows: Graph as Models of Flow of Comodities, Flows, Maximal Flows and Minimal Cuts, The Max Flow-Min Cut Theorem

Laboratory Works:

The laboratory work consists of implementing the algorithms and concepts discussed in the class. Student should implement problems with following concepts;

Set Operations and Boolean Matrix Operations
Primility Testing, Number Theory Algorithms, and Operations on Integers
Counting and Some Recursive Algorithms
Algorithms for Relations, Graphs

Text Books:

Kenneth H. Rosen, Discrete mathematics and its applications, Seventh Edition McGrawHill Publication, 2012.
Bernard Kolman, Robert Busby, Sharon C. Ross, Discrete Mathematical Structures, Sixth Edition Pearson Publications, 2015
Joe L Mott, Abraham Kandel, Theodore P Baker, Discrete Mathematics for Computer Scientists and Mathematicians, Printice Hall of India, Second Edition, 2008

Reference Books:

Ken Bogart, Scot Drysdale, Cliff Stein, Discrete Mathematics for Computer Scientists, First Edition Addison-Wesley, 2010

BSc. CSIT Second Semester Object Oriented Programming (OOP) Course Overview

2022-07-05T17:36:00.000+05:45

Title	Object Oriented Programming
Course code	CSC 161
Nature of course	Theory + Lab
Semester	Second-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

The course covers the basic concepts of object oriented programming using C++ programming language.

Course Objectives:

The main objective of this course is to understand object oriented programming and advanced C++ concepts such as composition of objects, operator overloads, inheritance and polymorphism, file I/O, exception handling and templates.

Course Contents:

Introduction to Object Oriented Programming
Teaching Hours : 3 hrs
Overview of structured programming approach, Object oriented programming approach, Characteristics of object oriented languages
Basics of C++ programming
Teaching Hours : 5 hrs
C++ Program Structure, Character Set and Tokens, Data Type, Type Conversion, Preprocessor Directives, Namespace, Input/Output Streams and Manipulators, Dynamic Memory Allocation with new and delete, Control Statements.

Functions: Function Overloading, Inline Functions, Default Argument, Pass by Reference, Return by Reference, Scope and Storage Class.

Pointers: Pointer variables declaration & initialization, Operators in pointers, Pointers and Arrays, Pointer and Function.
Classes & Objects
Teaching Hours : 8 hrs
A Simple Class and Object, Accessing members of class, Initialization of class objects: (Constructor, Destructor), Default Constructor, Parameterized Constructor, Copy Constructor, The Default Copy Constructor, Objects as Function Arguments, Returning Objects from Functions, Structures and Classes, Memory allocation for Objects, Static members, Member functions defined outside the class.
Operator Overloading
Teaching Hours : 7 hrs
Fundamental of operator overloading, Restriction on operator overloading, Operator functions as a class members, Overloading unary and binary operator, Data Conversion (basic to basic, basic to user-defined, user-defined to basic, user-defined to user-defined)
Inheritance
Teaching Hours : 7 hrs
Introduction to inheritance, Derived Class and Base Class, Access Specifiers (private, protected, and public), Types of inheritance, Public and Private Inheritance, Constructor and Destructor in derived classes, Aggregation
Virtual Function, Polymorphism, and miscellaneous C++ Features
Teaching Hours : 5 hrs
Concept of Virtual functions, Late Binding, Abstract class and pure virtual functions, Virtual Destructors, Virtual base class, Friend function and Static function, Assignment and copy initialization, Copy constructor, This pointer, Concrete classes, Polymorphism and its roles.
Function Templates and Exception Handling
Teaching Hours : 4 hrs
Function templates, Function templates with multiple arguments, Class templates, templates and inheritance, Exceptional Handling (Try, throw and catch), Use of exceptional handling.
File handling
Teaching Hours : 6 hrs
Stream Class Hierarchy for Console Input /Output, Unformatted Input /Output, Formatted Input /Output with ios Member functions, Formatting with Manipulators, Stream Operator Overloading, File Input/output with Streams, Opening and Closing files, Read/Write from File, File Access Pointers and their Manipulators, Sequential and Random Access to File, Testing Errors during File Operations

Laboratory Works:

Students should be able to implement the concepts of Object Oriented Programming using C++ language.

Text Books:

Robert Lafore, Object Oriented Programming in C++, Fourth Edition, SAMS publications
Herbert Schildt, C++ The Complete Reference, Fourth Edition, Tata McGraw Hill Publication

Reference Books:

Deitel and Deitel, C++ How to Program, Third Edition, Pearson Publication
Joyce Farrell, Object-oriented programming using C++, Fourth Edition, Cengage Learning.

BSc. CSIT Second Semester Microprocessor Course Overview

2022-07-05T17:16:00.001+05:45

Title	Microprocessor
Course code	CSC 162
Nature of course	Theory + Lab
Semester	Second-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

This course contains of fundamental concepts of computer organization, basic I/O interfaces and Interrupts operations.

Course Objectives:

The course objective is to introduce the operation, programming and application of microprocessor.

Course Contents:

Introduction
Teaching Hours : 4 hrs
Introduction to Microprocessor, Components of a Microprocessor: Registers, ALU and control & timing, System bus (data, address and control bus), Microprocessor systems with bus organization
Basic Architecture
Teaching Hours : 7 hrs
Microprocessor Architecture and Operations, Memory, I/O devices, Memory and I/O operations, 8085 Microprocessor Architecture, Address, Data And Control Buses, 8085 Pin Functions, Demultiplexing of Buses, Generation Of Control Signals
Instruction Cycle
Teaching Hours : 3 hrs
Fetch Operation and Timing Diagram; Execute Operation and Timing Diagram, Instruction Cycle, Machine Cycle, T-States, T-States, Memory Interfacing
Assembly Language Programming
Teaching Hours : 10 hrs
Assembly instruction format, Instruction Types, Mnemonics, Operands, Macro assemblers, Linking, Assembler directives, Addressing Modes, Simple sequence programs, Flags, Branch, Jumps, While-Do, Repeat-Until, If-Then-Else and Multiple If-then Programs, Debugging
Basic I/O, Memory R/W and Interrupt Operations
Teaching Hours : 6 hrs
Memory Read, Memory Write, I/O Read, I/O Write, Direct Memory Access, Interrupt, Types, Interrupt Masking
Input/ Output Interfaces
Teaching Hours : 6 hrs
Interfacing Concepts, Ports, Interfacing Of I/O Devices, Interrupts In 8085, Programmable Interrupt Controller 8259A, Programmable Peripheral Interface 8255A
Advanced Microprocessors
Teaching Hours : 9 hrs
8086: logical block diagram and segments, 80286: Architecture, Registers, (Real/Protected mode), Privilege levels, descriptor cache, Memory access in GDT and LDT, multitasking, addressing modes, flag register 80386: Architecture, Register organization, Memory access in protected mode, Paging

Laboratory Works:

The laboratory work includes Assembly language programming using 8085/8086/8088 trainer kit. The programming should include: Arithmetic operation, base conversion, conditional branching etc. The lab work list may include following concepts:

Assembly language program using 8085 microprocessor kit.
Use of all types of instructions and addressing modes.
Arrays and the concept of Multiplications and Division operations on Microprocessor.
Assembly language programming, using any types of Assembler, including the different functions of Int 10h, and 12h

Text Books:

Ramesh S.Gaonkar, Microprocessor Architecture, Programming, and Applications with 8085, Prentice Hall

Reference Books:

A.P.Malvino and J.A.Brown, Digital Computer Electronics, 3rd Edition, Tata McGraw Hill D.V.Hall, Microprocessors and Interfacingv – Programming and Hardware, McGraw Hill
8000 to 8085 Introduction to 8085 Microprocessor for Engineers and Scientists, A.K.Gosh, Prentice Hall

BSc. CSIT Second Semester Mathematics II Course Overview

2022-07-05T16:59:00.002+05:45

Title	Mathematics II
Course code	MTH 163
Nature of course	Theory
Semester	Second-Semester
Full marks	80 + 20
Pass marks	32 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

The course contains concepts and techniques of linear algebra. The course topics include systems of linear equations, determinants, vectors and vector spaces, eigen values and eigenvectors, and singular value decomposition of a matrix.

Course Objectives:

The main objective of the course is to make familiarize with the concepts and techniques of linear algebra, solve system of linear equation with Gauss-Jordon method, to impart knowledge of vector space and subspace, eigenvalues and eigenvectors of a matrix and get the idea of diagonalization of a matrix, linear programming, Group, Ring, and Field.

Course Contents:

Linear Equations in Linear Algebra
Teaching Hours : 5 hrs
System of linear equations, Row reduction and Echelon forms, Vector equations, The matrix equations Ax = b, Applications of linear system, Linear independence
Transformation
Teaching Hours : 4 hrs
Introduction to linear transformations, the matrix of a linear Transformation, Linear models in business, science, and engineering
Matrix Algebra
Teaching Hours : 5 hrs
Matrix operations, The inverse of a matrix, Characterizations of invertible matrices, Partitioned matrices, Matrix factorization, The Leontief input output model, Subspace of Rn , Dimension and rank.
Determinants
Teaching Hours : 4 hrs
Introduction, Properties, Cramer’s rule, Volume and linear transformations.
Vector Spaces
Teaching Hours : 5 hrs
Vector spaces and subspaces, Null spaces, Column spaces, and Linear transformations, Linearly independent sets: Bases, Coordinate systems
Vector Space Continued
Teaching Hours : 4 hrs
Dimension of vector space and Rank, Change of basis, Applications to difference equations, Applications to Markov Chains
Eigenvalues and Eigen Vectors
Teaching Hours : 5 hrs
Eigenvectors and Eigenvalues, The characteristic equations, Diagonalization, Eigenvectors and linear transformations, Complex eigenvalues, Discrete dynamical systems, Applications to differential equations
Orthogonality and Least Squares
Teaching Hours : 5 hrs
Inner product, Length, and orthoganility, Orthogonal sets, Orthogonal projections, The GramSchmidt process, Least squares problems, Application to linear models, Inner product spaces, Applications of inner product spaces
Groups and Subgroups
Teaching Hours : 5 hrs
Binary Operations, Groups, Subgroups, Cyclic Groups.
Rings and Fields
Teaching Hours : 4 hrs
Rings and Fields, Integral domains

Text Books:

Linear Algebra and Its Applications, David C. Lay, 4th Edition, Pearson Addison Wesley
Linear Algebra and Its Applications, Gilbert Strang, 4th Edition, Addison, CENGAGE Learning.

BSc. CSIT Second Semester Statistics I Course Overview

2022-01-20T17:49:00.007+05:45

Title	Statistics I
Course code	STA 164
Nature of course	Theory + Lab
Semester	Second-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

This course contains basics of statistics, descriptive statistics, probability, sampling, random variables and mathematical expectations, probability distribution, correlation and regression.

Course Objectives:

The main objective of this course is to impart the knowledge of descriptive statistics, correlation, regression, sampling, theoretical as well as applied knowledge of probability and some probability distributions.

Course Contents:

Introduction
Teaching Hours : 4 hrs
Basic concept of statistics; Application of Statistics in the field of Computer Science & Information technology; Scales of measurement; Variables; Types of Data; Notion of a statistical population
Descriptive Statistics
Teaching Hours : 6 hrs
Measures of central tendency; Measures of dispersion; Measures of skewness; Measures of kurtosis; Moments; Steam and leaf display; five number summary; box plot

Problems and illustrative examples related to computer Science and IT
Introduction to Probability
Teaching Hours : 8 hrs
Concepts of probability; Definitions of probability; Laws of probability; Bayes theorem; prior and posterior probabilities

Problems and illustrative examples related to computer Science and IT
Sampling
Teaching Hours : 3 hrs
Definitions of population; sample survey vs. census survey; sampling error and non sampling error; Types of sampling
Random Variables and Mathematical Expectation
Teaching Hours : 5 hrs
Concept of a random variable; Types of random variables; Probability distribution of a random variable; Mathematical expectation of a random variable; Addition and multiplicative theorems of expectation

Problems and illustrative examples related to computer Science and IT
Probability Distributions
Teaching Hours : 12 hrs
Probability distribution function, Joint probability distribution of two random variables; Discrete distributions: Bernoulli trial, Binomial and Poisson distributions; Continuous distribution: Normal distributions; Standardization of normal distribution; Normal distribution as an approximation of Binomial and Poisson distribution; Exponential, Gamma distribution

Problems and illustrative examples related to computer Science and IT
Correlation and Linear Regression
Teaching Hours : 7 hrs
Bivariate data; Bivariate frequency distribution; Correlation between two variables; Karl Pearson’s coefficient of correlation(r); Spearman’s rank correlation; Regression Analysis: Fitting of lines of regression by the least squares method; coefficient of determination

Problems and illustrative examples related to computer Science and IT

Laboratory Works:

The laboratory work includes using any statistical software such as Microsoft Excel, SPSS, STATA etc. whichever convenient using Practical problems to be covered in the Computerized Statistics laboratory.

Computation of measures of central tendency (ungrouped and grouped data) Use of an appropriate measure and interpretation of results and computation of partition Values
Computation measures of dispersion (ungrouped and grouped data) and computation of coefficient of variation.
Measures of skewness and kurtosis using method of moments, Measures of Skewness using Box and whisker plot.
Scatter diagram, correlation coefficient (ungrouped data) and interpretation. Compute manually and check with computer output.
Fitting of lines of regression (Results to be verified with computer output)
Fitting of lines of regression and computation of correlation coefficient, Mean residual sum of squares, residual plot.
Conditional probability and Bayes theorem
Obtaining descriptive statistics of probability distributions
Fitting probability distributions in real data (Binomial, Poisson and Normal)

Text Books:

Michael Baron (2013). Probability and Statistics for Computer Scientists. 2nd Ed., CRC Press, Taylor & Francis Group, A Chapman & Hall Book.
Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers, & Keying Ye (2012). Probability & Statistics for Engineers & Scientists. 9th Ed., Printice Hall

Reference Books:

Douglas C. Montgomery & George C. Ranger (2003). Applied Statistics and Probability for Engineers. 3rd Ed., John Willey and Sons, Inc.
Richard A. Johnson (2001). Probability and Statistics for Engineers. 6th Ed., Pearson Education, India

BSc. CSIT Syllabus and Micro-Syllabus

2022-01-16T14:04:00.019+05:45

BSc. CSIT Syllabus

First Semester

Second Semester

Third Semester

Fourth Semester

Fifth Semester

Sixth Semester

Seventh Semester

Eighth Semester

BSc. CSIT Course Overview

First Semester

Introduction To Information Technology (IIT)

C Programming

Digital Logic

Mathematics I (Calculus)

Physics

Second Semester

Discrete Structures

Object Oriented Programming

Microprocessor

Mathematics II

Statistics I

Third Semester

Data Structures and Algorithms

Numerical Method

Computer Architecture

Computer Graphics

Statistics II

Fourth Semester

Theory of Computation

Computer Networks

Operating Systems

Database Management System

Artificial Intelligence

Fifth Semester

Design and Analysis of Algorithms

System Analysis and Design

Cryptography

Simulation and Modelling

Web Technology

Multimedia Computing (elective)

Wireless Networking (elective)

Image Processing (elective)

Knowledge Management (elective)

Society and Ethics in Information Technology (elective)

Microprocessor Based Design (elective)

Sixth Semester

Software Engineering

Compiler Design and Construction

E-Governance

NET Centric Computing

Technical Writing

Applied Logic (elective)

E-commerce (elective)

Automation and Robotics (elective)

Neural Networks (elective)

Computer Hardware Design (elective)

Cognitive Science (elective)

Real Time System (old-course)

Seventh Semester

Advanced Java Programming

Data Warehousing and Data Mining

Principles of Management

Project Work

Information Retrieval (elective)

Database Administration (elective)

Software Project Management (elective)

Network Security (elective)

Digital System Design (elective)

International Marketing (elective)

Advanced Database Management System (old syllabus)

Internet Technology (old syllabus)

Network and System Administration (old syllabus/elective)

Eighth Semester

Internship

Advanced Networking with IPv6 (elective)

Distributed Networking (elective)

Multimedia Database (elective)

Distributed and Object Oriented Database (elective)

Cloud Computing (elective)

Geographical Information System (elective)

Decision Support System (elective)

BSc. CSIT First Semester Introduction To Information Technology (IIT) Course Overview

2022-01-16T13:48:00.006+05:45

Title	Introduction to Information Technology
Course code	CSC109
Nature of course	Theory + Lab
Semester	First-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

This course covers the basic concepts of computers and information technology including introduction, hardware, software, memory, input/output, data representation, database, networks and data communication, Internet, multimedia, and computer security.

Course Objectives:

The main objective of this course is to provide students, knowledge of fundamental concepts of computers and information technology.

Course Contents:

Introduction to Computer
Teaching Hours : 3 hrs
Introduction; Digital and Analog Computers; Characteristics of Computer; History of Computer; Generations of Computer; Classification of Computer; The Computer System; Application of Computers
The Computer System Hardware
Teaching Hours : 3 hrs
Introduction; Central Processing Unit; Memory Unit; Instruction Format; Instruction Set; Instruction Cycle; Microprocessor; Interconnecting the Units of a Computer; Inside a Computer; Cabinet
Computer Memory
Teaching Hours : 4 hrs
Introduction; Memory Representation; Memory Hierarchy; CPU Registers; Cache Memory; Primary Memory; Secondary Memory; Access Types of Storage Devices; Magnetic Tape; Magnetic Disk; Optical Disk; Magneto-Optical Disk; How the Computer uses its memory
Input and Output Devices
Teaching Hours : 4 hrs
Introduction; Input-Output Unit; Input Devices; Human Data Entry Devices; Source Data Entry Devices; Output Devices; I/O Port; Working of I/O System
Data Representation
Teaching Hours : 6 hrs
Introduction; Number System; Conversion from Decimal to Binary, Octal, Hexadecimal; Conversion of Binary, Octal, Hexadecimal to Decimal; Conversion of Binary to Octal, Hexadecimal; Conversion of Octal, Hexadecimal to Binary; Binary Arithmetic; Signed and Unsigned Numbers; Binary Data Representation; Binary Coding Schemes; Logic Gates
Computer Software
Teaching Hours : 6 hrs
Introduction; Types of Software; System Software; Application Software; Software Acquisition; Operating System (Introduction, Objectives of Operating System, Types of OS, Functions of OS, Process Management, Memory Management, File Management, Device Management, Protection and Security, User Interface, Examples of Operating Systems)
Data Communication and Computer Network
Teaching Hours : 5 hrs
Introduction; Importance of Networking; Data Transmission Media; Data Transmission across Media; Data Transmission and Data Networking; Computer Network; Network Types; Network Topology; Communication Protocol; Network Devices; Wireless Networking
The Internet and Internet Services
Teaching Hours : 4 hrs
Introduction; History of Internet; Internetworking Protocol; The Internet Architecture; Managing the Internet; Connecting to the Internet; Internet Connections; Internet Address; Internet Services; Uses of the Internet; Introduction to the Internet of Things (IoT), Wearable Computing, and Cloud Computing, Introduction to E-commerce, E-governance, and Smart City, and GIS
Fundamentals of Database
Teaching Hours : 4 hrs
Introduction; Database; Database System; Database Management System; Database System Architectures; Database Applications; Introduction to Data Warehousing, Data mining, and BigData
Multimedia
Teaching Hours : 3 hrs
Introduction; Multimedia - Definition; Characteristics of Multimedia; Elements of Multimedia; Multimedia Applications
Computer Security
Teaching Hours : 3 hrs
Introduction; Security Threat and Security Attack; Malicious Software; Security Services; Security Mechanisms (Cryptography, Digital Signature, Firewall, Users Identification and Authentication, Intrusion Detection Systems); Security Awareness; Security Policy

Laboratory Works:

After completing this course, students should have practical knowledge of different hardware components of computer, operating systems, Word Processors, Spreadsheets, Presentation Graphics, Database Management Systems, and Internet and its services.

Text Books:

Computer Fundamentals, Anita Goel, Pearson Education India

Reference Books:

Introduction to Computers, Peter Norton, 7th Edition, McGraw Hill Education
Computer Fundamental, Pradeep K. Sinha and Priti Sinha
Data Mining Concepts and Techniques, Third Edition, Jiawei Han, Micheline Kamber and Jian Pei
Cloud Computing Bible, Barrie Sosinsky, Wiley

BSc. CSIT First Semester C Programming Course Overview

2022-01-16T13:45:00.005+05:45

Title	C Programming
Course code	CSC110
Nature of course	Theory + Lab
Semester	First-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

This course covers the concepts of structured programming using C programming language.

Course Objectives:

This course is designed to familiarize students to the techniques of programming in C.

Course Content:

Problem Solving with Computer
Teaching Hours : 2 hrs
Problem analysis, Algorithms and Flowchart, Coding, Compilation and Execution, History of C, Structure of C program, Debugging, Testing and Documentation
Elements of C
Teaching Hours : 4 hrs
C Standards( ANSI C and C99), C Character Set, C Tokens, Escape sequence, Delimiters, Variables, Data types (Basic, Derived, and User Defined), Structure of a C program, Executing a C program, Constants/ Literals, Expressions, Statements and Comments
Input and Output
Teaching Hours : 2 hrs
Conversion specification, Reading a character, Writing a character, I/O operations, Formatted I/O
Operators and Expression
Teaching Hours : 4 hrs
Arithmetic operator, Relational operator, Logical or Boolean operator, Assignment Operator, Ternary operator, Bitwise operator, Increment or Decrement operator, Conditional operator, Special Operators(sizeof and comma), Evaluation of Expression, Operator Precedence and Associativity
Control Statement
Teaching Hours : 4 hrs
Conditional Statements, Decision Making and Branching, Decision Making and Looping, Exit function, Break and Continue
Arrays
Teaching Hours : 6 hrs
Introduction to Array, Types of Array (Single Dimensional and Multidimensional), Declaration and Memory Representation of Array, Initialization of array, Character Array and Strings, Reading and Writing Strings, Null Character, String Library Functions( string length, string copy, string concatenation, string compare)
Functions
Teaching Hours : 5 hrs
Library Functions, User defined functions, Funciton prototype, Function call, and Function Definition, Nested and Recursive Function, Function Arguments and Return Types, Passing 4 Arrays to Function, Passing Strings to Function, Passing Arguments by Value, Passing Arguments by Address, Scope visibility and lifetime of a variable, Local and Global Variable
Structure and Union
Teaching Hours : 5 hrs
Introduction, Array of structure, Passing structure to function, Passing array of structure to function, Structure within structure ( Nested Structure), Union, Pointer to structure
Pointers
Teaching Hours : 6 hrs
Introduction, The & and * operator, Declaration of pointer, Chain of Pointers, Pointer Arithmetic, Pointers and Arrays, Pointers and Character Strings, Array of Pointers, Pointers as Function Arguments, Function Returning pointers, Pointers and Structures, Dynamic Memory Allocation
File Handling in C
Teaching Hours : 4 hrs
Concept of File, Opening and closing of File, Input Output Operations in File, Random access in File, Error Handling in Files
Introduction to Graphics
Teaching Hours : 3 hrs
Concepts of Graphics, Graphics Initialization and Modes, Graphics Function

Laboratory Works:

This course requires a lot of programming practices. Each topic must be followed by a practical session. Some practical sessions include programming to:

Create, compile and run simple C programs, handle different data types available in C, perform arithmetic operations in C, perform formatted input and output operations, perform character input and output operations.
Perform logical operations, create decision-making programs, create loops to repeat task.
Create user-defined functions, create recursive functions, work with automatic, global and static variables, create, manipulate arrays and matrices (single and multi-dimensional), work with pointes, dynamically allocate de-allocate storage space during runtime, manipulate strings (character arrays) using various string handling functions.
Create and use structures and files to keep record of students, employees etc.

Text Books:

Byron Gottfried: "Programming with C", Second Edition, McGraw Hill Education.
Herbert Schildt, C The Complete Reference, Fourth Edition, Osborne/McGrawHill Publication.

Reference Books:

Paul Deitel, Harvey Deitel, C: How to Program, Eighth Edition, Pearson Publication.
Al Kelley, Ira Pohl: "A Book on C", Fourth Edition, Pearson Education.
Brian W. Keringhan, Dennis M. Ritchiem, The C programming Language, Second Edition, PHI Publication.
Ajay Mittal, Programming in C: A Practical Approach, Pearson Publication
Stephen G. Kochan, Programming in C, CBS publishers & distributors.
E. Balagurusamy, Programming in ANSI C, Third Edition, TMH publishing

BSc. CSIT First Semester Digital Logic Course Overview

2022-01-16T13:33:00.004+05:45

Title	Digital Logic
Course code	CSC111
Nature of course	Theory + Lab
Semester	First-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

This course covers the concepts of digital logic and switching networks. The course includes the fundamental concepts of boolean algebra and its application for circuit analysis, multilevel gates networks, flip-lops, counters logic devices and synchronous and asynchronous sequential logic and digital integrated circuits.

Course Objectives:

The main objective of this course is to introduce the basic tools for the design of digital circuits and introducing methods and procedures suitable for a variety of digital design applications.

Course Content:

Binary Systems
Teaching Hours : 6 hrs
Digital Systems, Binary numbers, Number base conversion, Octal and hexadecimal numbers, compliments, Signed Binary numbers, Decimal codes (BCD, 2 4 2 1,8 4 -2 -1,Excess 3, Gray Code), Binary Storage and Registers, Binary logic
Boolean algebra and Logic Gates
Teaching Hours : 5 hrs
Basic and Axiomatic definitions of Boolean algebra, Basic Theorems and properties of Boolean Algebra, Boolean Functions, Logic Operations, Logic Gates, Integrated Circuits
Simplification of Boolean Functions
Teaching Hours : 5 hrs
K-map, Two and Three variable maps, Four variable maps, product of sum simplification, NAND and NOR implementation, Don't Care conditions, Determinant and selection of Prime Implicants
Combinational Logic
Teaching Hours : 5 hrs
Design Procedure, Adders, Subtractors, Code Conversions, Analysis Procedure, Multilevel NAND and NOR Circuits, Exclusive-OR Circuits
Combinational Logic with MSI and LSI
Teaching Hours : 8 hrs
Binary Parallel Adder and Subtractor, Decimal Adder, Magnitude Comparator, Decoders and Encoders, Multiplexers, Read-only-Memory (ROM), Programmable Logic Array (PLA), Programmable Array Logic (PAL)
Synchronous and Asynchronous Sequential Logic
Teaching Hours : 10 hrs
Flip-Flops, Triggering of flip-flops, Analysis of clocked sequential circuits, Design with state equations and state reduction table, Introduction to Asynchronous circuits, Circuits with latches
Registers and Counters
Teaching Hours : 6 hrs
Registers, Shift registers, Ripple Counters, Synchronous Counters, Timing Sequences, The memory

Laboratory Works:

Students should be able to realize following digital logic circuits as a part of laboratory work.

Familiarizations with logic gates
Combinatorial Circuits
Code Converters
Design with Multiplexers
Adders and Subtractors
Flip-Flops
Sequential Circuits
Counters
Clock Pulse Generator

Text Books:

M. Morris Mano, “Digital Logic & Computer Design”

Reference Books:

Brain Holdsworth, “Digital Logic Design”, Elsevier Science.
John Patrick Hayes, “Introduction to Digital Logic Design”, Addison-Wesley.
M. Morris Mano and Charles Kime, “Logic and Computer Design Fundamentals”, Pearson New International.

BSc. CSIT First Semester Mathematics I (Calculus) Course Overview

2022-01-16T13:11:00.004+05:45

Title	Mathematics I (Calculus)
Course code	MTH112
Nature of course	Theory
Semester	First-Semester
Full marks	80 + 20
Pass marks	32 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

The course covers the concepts of functions, limits, continuity, differentiation, integration of function of one variable; logarithmic, exponential, applications of derivative and antiderivatives, differential equations, vectors and applications, partial derivatives and Multiple Integrals.

Course Objectives:

The objective of this course is to make students able to:

understand and formulate real-world problems into mathematical statements.
develop solutions to mathematical problems at the level appropriate to the course.
describe or demonstrate mathematical solutions either numerically or graphically.

Course Contents:

Function of One Variable
Teaching Hours : 5 hrs
Four ways of representing a function, Linear mathematical model, Polynomial, Rational, Trigonometric, Exponential and Logarithmic functions, Combination of functions, Range and domain of functions and their Graphs
Limits and Continuity
Teaching Hours : 4 hrs
Precise definition of Limit, Limits at infinity, Continuity, Horizontal asymptotes, Vertical and Slant asymptotes
Derivatives
Teaching Hours : 4 hrs
Tangents and velocity, Rate of change, Review of derivative, Differentiability of a function, Mean value theorem, Indeterminate forms and L’Hospital rule
Applications of Derivatives
Teaching Hours : 4 hrs
Curve sketching, Review of maxima and minima of one variable, Optimization problems, Newton’s method
Antiderivatives
Teaching Hours : 5 hrs
Review of antiderivatives, Rectilinear motion, Indefinite integrals and Net change, Definite integral, The Fundamental theorem of calculus, Improper integrals
Applications of Antiderivatives
Teaching Hours : 5 hrs
Areas between the curves, Volumes of cylindrical cells, Approximate Integrations, Arc length, Area of surface of revolution
Ordinary Differential Equations
Teaching Hours : 6 hrs
Introduction, Introduction to first order equations Separable equations, Linear equations, Second order linear differential equations, Non homogeneous linear equations, Method of undetermined coefficients
Infinite Sequence and Series
Teaching Hours : 5 hrs
Infinite sequence and series, Convergence tests and power series, Taylor’s and Maclaurin’s series
Plane and Space Vectors
Teaching Hours : 4 hrs
Introduction, Applications, Dot product and cross Product, Equations of lines and Planes, Derivative and integrals of vector functions, Arc length and curvature, Normal and binormal vectors, Motion in space
Partial Derivatives and Multiple Integrals
Teaching Hours : 3 hrs
Limit and continuity, Partial derivatives, Tangent planes, Maximum and minimum values, Multiple integrals

Text Books:

Calculus Early Transcendentals, James Stewart, 7E, CENGAGE Learning.

Reference Books:

Calculus Early Transcendentals, Thomas, 12th Editions, Addision Wesley.

BSc. CSIT First Semester Physics Course Overview

2022-01-16T12:34:00.008+05:45

Title	Physics
Course code	PHY113
Nature of course	Theory + Lab
Semester	First-Semester
Full marks	60 + 20 + 20
Pass marks	24 + 8 + 8
Credit Hrs	3
Elective/Compulsory	Compulsory

Study Materials:

Notes

Books

Old Questions

Course Description:

This course covers the fundamentals of physics including oscillations, electromagnetic theory, and basics of quantum mechanics, band theory, semiconductors and universal logic gates and finally physics of manufacturing integrated circuits.

Course Objectives:

The main objective of this course is to provide knowledge in physics and apply this knowledge for computer science and information technology.

Course Contents:

Rotational Dynamics and Oscillatory Motion
Teaching Hours : 5 hrs
Moment of inertia and torque, Rotational kinetic energy, Conservation of angular momentum, Oscillation of spring: frequency, period, amplitude, phase angle and energy
Electric and Magnetic Field
Teaching Hours : 5 hrs
Electric and magnetic field and potential, Force on current carrying wire, magnetic dipole moment, Force on a moving charge, Hall effect, Electromagnetic waves
Fundamentals of Atomic Theory
Teaching Hours : 8 hrs
Blackbody radiation, Bohr atom, Spectrum of Hydrogen, Franck-Hertz experiment, de Broglie’s hypothesis and its experimental verification, Uncertainty principle and its origin, matter waves and the uncertainty principle, group velocity
Methods of Quantum Mechanics
Teaching Hours : 5 hrs
Schrodinger theory of quantum mechanics and its application, Outline of the solution of Schrodinger equation for H-atom, space quantization and spin, Atomic wave functions
Fundamentals of Solid State Physics
Teaching Hours : 6 hrs
Crystal structure, Crystal bonding, Classical and quantum mechanical free electron model, Bloch theorem, Kronig-Penny model, Tight-binding approximation, conductors, insulators and semiconductors, effective mass and holes
Semiconductor and Semiconductor devices
Teaching Hours : 8 hrs
Intrinsic and extrinsic semiconductors, Electrical conductivity of semiconductors, Photoconductivity, Metal-metal junction: The contact potential, The semiconductor diode, Bipolar junction transistor (BJT), Field effect transistor (FET)
Universal Gates and Physics of Integrated Circuits
Teaching Hours : 8 hrs
Universal gates, RTL and TTL gates, Memory circuits, Clock circuits, Semiconductor purification: Zone refining, Single crystal growth, Processes of IC production, Electronic component fabrication on a chip

Laboratory Works:

Students should able to perform at least one experiment from units 1, 2 and 5, 6, 7. The details of the experiment will be provided in the manual.

Text Books:

Garcia Narciso, Damask Arthur, Physics for Computer Science Students, Springer-Verlag

Reference Books:

Heliday David, Resnick Robert and Walker Gearl, Fundamentals of Physics, 9th ed.,John-Wiley and Sons, Inc.
Francis W. Sears, Hugh D. Young, Roger Freedman, Mark Zemansky, UniversityPhysics, Volume 1 & 2, 14th ed., Pearson Publication
Knight Randall D., Physics for Scientists and Engineers: A Strategic Approach, 3rd ed.,Pearson Publication