NTRCA college written syllabus

E:\NTRCA\Exam\17th Exam'20\Written\Syllabus\Written_College level_17th Exam-2020 (1-52 code) (Main).doc    83 
পলদর িাম: প্রভাষক  
Subject: Information and Communication Technology (ICT) 
Code: 452 
Marks: 100 
 
Structured and Object Oriented Programming (OOP) Concept (Answer 02x10=20): 
Fundamentals of C programming; Introducing C’s Program Control Statements; Data types, Variables 
and Expressions; Exploring Arrays and Strings; Understanding Pointers and Functions; Console and 
File I/O; Structures and Unions. 
 
Topics include object-oriented programming concepts, such as classes, objects, methods, interfaces, 
packages, inheritance, encapsulation, and polymorphism. 
 
Introduction to Software Engineering (Answer 01x10=10): history, nature, relation of software 
engineering to other discipline, software development life cycle, Programming language; Software 
nature and qualities: product qualities, project qualities, correctness, robustness, usability, 
maintainability, portability, quality measurements; Software development life cycle: requirement, 
design, development, testing, maintenance; Software development model: waterfall, agile, spiral, RDD, 
V model; Software engineering principles: modularity, abstraction, generality, object oriented, 
component oriented, structured.; Specification and Verification: requirement specification, descriptive 
specification, testing, analysis, debugging; Modeling and Design: basics of modeling diagram, UI 
design. Software Project Management: concepts, project metrics, estimation, risks management. 
 
Data Structure and Algorithm & Combinatorial Optimization (Answer 02x10=20): 
Introduction - Data Structures and Complexity of Algorithms, Time Space Tradeoff, Searching 
Techniques- Linear and Binary Searching; Sorting and Recursion - Discussion of Common Sorting 
Techniques: Insertion Sort, Selection Sort, Bubble Sort, Quick Sort, Merge Sort, Radix Sort; Factorial 
and Tower of Hanoi Problem; Linked Lists - Abstract Data Types, List ADTs, and Linked Lists: Singly, 
Two Way and Circular Linked Lists; Stacks and Queues - Stacks and Queues and their Implementation 
Strategies; Prefix, Infix and Postfix Expressions, their Transformation and Evaluation Algorithms; 
Hashing - Hash Indices and Hash Functions, Static and Dynamic Hashing, Collisions in Hash Indices 
and Collision Resolving Techniques; Trees - Tree Concepts, Binary Tree, BST, Heaps, Heap Sort, 
Huffman Encoding Technique, AVL Tree, B Tree and B+ Tree; Graphs - Graph Terminologies, 
Representing Graphs, Graph Searching: BFS and DFS, Shortest Path Problems, Minimum Spanning 
Tree, Minimum Spanning Tree Algorithms, and Topological Sorting; Problem Solving Strategy - 
Greedy Algorithms, Divide and Conquer Strategy, Dynamic Programming and Backtracking. 
Introduction - Algorithms, Analyzing & Designing Algorithms, Correctness of Algorithms; Greedy 
Algorithms - Introduction to Greedy Algorithms, Greedy Choice Property, Greedy vs. Dynamic 
Programming, Fractional Knapsack Problem, Activity Selection Problem, Huffman Encoding, Task 
Scheduling Problem, Coin Changing Problem, Kruskal’s and Prim’s Minimum Spanning Tree 
Algorithms; Divide and Conquer Algorithms - Introduction to Divide and Conquer Design Technique, 
Quick Sort, Merge Sort, Proof of Correctness, and Run Time Analysis; Dynamic Programming - 
Introduction to Dynamic Programming Technique, Principle of Optimality, Optimal Substructure 
Property, Assembly Line Scheduling, Matrix Chain Multiplication, LCS, Viterbi Algorithm, Bitonic 
Euclidean Traveling Salesperson Problem and Runtime Analysis; Graph Searching and Shortest Path 
Problems - Breadth First Search, Depth First Search, Flow Networks, Single Source and All Pair 
Shortest Path Algorithms 
 
Web Technology (Answer 01x10=10): Introduction to Html, Java Script & CSS, Server Side 
Programming: HTTP Server, Application Server, MVC Web Framework, Web Services, Database 
Access: Object Relational Mapping, Lambda Expression, Language Integrated Query, Data Reader, 
Writer, Web Security: Denial of Service, Buffer Overflow, Cross Site Scripting, Authentication and 
Access Control 
 
Operating System (Answer 01x10=10): Overview of operating systems, functionalities and 
characteristics of OS. Hardware concepts related to OS, CPU states, I/O channels, memory hierarchy, 
and microprogramming. The concept of a process, operations on processes, process states, concurrent 
processes, process control block, process context. UNIX process control and management, PCB, 
signals, forks and pipes. Interrupt processing, operating system organization, OS kernel FLIH, 
dispatcher. Job and processor scheduling, scheduling algorithms, process hierarchies. Problems of 
concurrent processes, critical sections, mutual exclusion, synchronization, deadlock. Mutual exclusion, 
process co-operation, producer and consumer processes. Semaphores: definition, init, wait, signal 
operations. Use of semaphores to implement mutex, process synchronization etc., implementation of 
semaphores. Critical regions, Conditional Critical Regions, Monitors, Ada Tasks. Interprocess 
Communication (IPC), Message Passing, Direct and Indirect, Deadlock: prevention, detection, 
avoidance, banker's algorithm. Memory organization and management, storage allocation. Virtual 
memory concepts, paging and segmentation, address mapping. Virtual storage management, page 
replacement strategies. File organization: blocking and buffering, file descriptor, directory structure, 
File and Directory structures, blocks and fragments, directory tree, inodes, file descriptors, UNIX file 
structure. 
 
Database Management System (Answer 02x10=20): Introduction to Database Systems: Evolution 
of file processing systems, role of databases in organizations, core components of a database