NOTE BAHADUR - SEE NOTES | NEB NOTES | BACHELOR NOTES AND MANY MORE

BCA first Semester Examination Schedule Published

Tribhuvan University has published the examination schedule for BCA (Bachelors in Computer Application) first semester. The examination starts from 2079-05-21 to 2079-05-30. Examination time: 1PM to 4PM Date (BS) Subjects2079-05-21 CACS 101: Computer Fundamental and Application2079-05-23 CACS 102: Society and Technology2079-05-26 CAEN 103: English2079-05-28 CAMT 104: Mathematics I2079-05-30 CACS 105: Digital Logic You can find…

5 Dec

BCA Entrance Form 2078

BCA Entrance form for the year 2078 has just opened from today. Students can now start filling forms from any college that has a BCA program affiliated with TU. Apply online: https://www.entrance.tufohss.edu.np Official notice link: https://drive.google.com/file/d/1BVc_KUR9N_M8pfGRdZ-QG6qhlAuLMU3N/view?fbclid=IwAR2MfKrCXy6B9WCaWvTt_oR2oHyUMiDz76_FAE1qwzvxJ1zeZ_SHyYa1_x0 Exam Form Link: https://drive.google.com/file/d/1JaAZS0Dzwwuo_DiqSqK_NywZaMF2k9rw/view?fbclid=IwAR0mqeSrv0vlfKCDJAT2GD28IqBSu9gcYMaLNuA-kPBB28HaU4BtSbGN0P8 Reference link: https://www.tufohss.edu.np If you have any queries related to this notice, you can reach…

12 Nov

Revised Examination Schedule : BCA I, III, V & VII Semester

Tribhuvan University – Faculty of Humanities and Social Sciences has revised Examination Schedule of BCA I, III, V & VII Semester. Exam was going to held on Mangsir 1st but TU revised the schedule due to some technical reason. Exam will start from Mangsir 15th 2078. To download full notice CLICK HERE

9 Nov

EXAMINATION SCHEDULE OF BCA First, Third, Fifth & Seventh Semester (Regular & Partial)

Tribhuvan University – Faculty of Humanities and Social Sciences has officially published the examination schedule for First, Third, Fifth & Seventh Semester (Regular & Partial). Examination will start from 2078 Mangsir 1.

25 Feb

BCA exam start from Baishakh 2077

BCA 4th semester will probably held on 3rd week of Baishakh as per source. Viva and other internal marking will start from last week of Chaitra. TUFOHSS has officially published notice regarding submit of exam registration form till chaitra 10.This notice is for 6th semester, 4th semester and 2nd semester. More info: Click Here !!

12 Aug

TU – No exam to be held amidst Pandemic, online classes to begin

TU Online classes – No Exams to be held amidst the pandemic Tribhuvan Universities – Faculty of Humanities and Social Sciences (TU – FOHSS) have taken their decision back regarding conducting examinations amidst the pandemic situation.

28 Oct

BCA Result Published ( First Semester 2023 Batch | Third Semester 2022 Batch | Fourth Semester 2021 Batch )

The result for Bachelor in Computer Application BCA ( First Semester 2023 Batch | Third Semester 2022 Batch | Fourth Semester 2021 Batch ) has been published successfully. After an unexpectedly long wait, the result has been published which lists the roll numbers of the passed students only. The mark-sheets shall be provided by the…

16 Aug

BCA first Semester Examination Schedule Published

18 Nov

TU-BCA 7TH SEMESTER Electives

There are 8 electives to choose from in TU BCA 8th semester Electives. From the offered eight, students are allowed to choose two.

18 Nov

TU-BCA 8th Semester: Internet of Things

The course, Internet of Things, introduces basics of IoT. It covers introductions of IoT, Devices and platfo1m for developing IoT Systems, Design methodology, Data Analytics for IoT, Servers & Cloud offering and IoT system security.

18 Nov

TU-BCA 8th Semester: Information Security

The course, Information Security, introduces the theoretical as well as practical concepts of computer and information security. The course includes concepts of cryptographic algorithms, authentication systems, access controls, malicious logics, network security and security audits.

18 Nov

TU-BCA 8th Semester: Knowledge Engineering

Knowledge Engineering offers detailed concept about knowledge representation, logic, reasoning and principles. It includes introduction, knowledge acquisition, knowledge representation and reasoning. It does not entirely focus on theoretical concept but also strongly focuses on practical skill-based learning.

13 Jul

Recursion

Recursion is an essential programming and mathematical technique where a function calls itself, either directly or indirectly, to solve a computational task. The core principle of recursion relies on the “Divide and Conquer” philosophy: a large, complex problem is decomposed into smaller sub-problems of the exact same type until they become simple enough to be…

13 Jul

Unit 2: The Physical Layer

2.1 Functions of Physical Layer Important definition (2-mark) Common mistake ASCII diagram — Physical layer in OSIApplication────────────────────Presentation────────────────────Session────────────────────Transport────────────────────Network────────────────────Data Link────────────────────Physical (bits, cables, radio) <– focus layerExplanation: This shows physical layer is the bottom layer handling bits and media parameters. 2.2 Data and Signals: Analog and Digital signals, Transmission Impairment, Data Rate Limits, Performance Memory trick 2.3 Data…

13 Jul

Linked List

A Linked List is a linear data structure where elements are not stored in adjacent or contiguous memory locations. Instead, elements are dynamically linked using memory pointers. As an Abstract Data Type (ADT), a linked list defines a set of clear structural operations—such as insertion, deletion, and traversal—without specifying the exact lower-level implementation. This logical…

13 Jul

List Structures

A List is an ordered set of elements where each item occupies a specific position. Unlike mathematical sets, the order of elements in a list is significant, and data points are accessed based on their relative position to one another. Static vs. Dynamic List Structures Computer science curricula distinguish lists primarily by how memory is…

13 Jul

Queue Data Structure

A Queue is a linear data structure characterized by the First-In, First-Out (FIFO) protocol. This means the first element added to the structure will always be the first one to be removed, mimicking a physical queue of people waiting for a service. Unlike a stack, which restricts access to a single end, a queue maintains…

13 Jul

Stack Data Structure: ADT, Operations, and Applications

The Stack is one of the most fundamental and ubiquitous linear data structures in computer science. It serves as a primary tool for managing sequential data with specific access constraints. In a linear data structure, elements are arranged sequentially where each element (except the first and last) connects to its immediate predecessor and successor. However,…

Post Views: 16,548

Recent Posts