Computer Networks - Syllabus
Embark on a profound academic exploration as you delve into the Computer Networks course () within the distinguished Tribhuvan university's CSIT department. Aligned with the 2065 Syllabus, this course (CSC-301) seamlessly merges theoretical frameworks with practical sessions, ensuring a comprehensive understanding of the subject. Rigorous assessment based on a 60+20+20 marks system, coupled with a challenging passing threshold of , propels students to strive for excellence, fostering a deeper grasp of the course content.
This 3 credit-hour journey unfolds as a holistic learning experience, bridging theory and application. Beyond theoretical comprehension, students actively engage in practical sessions, acquiring valuable skills for real-world scenarios. Immerse yourself in this well-structured course, where each element, from the course description to interactive sessions, is meticulously crafted to shape a well-rounded and insightful academic experience.
Units
Key Topics
-
Compiler Structure
UN-1.1Analysis and Synthesis Model of Compilation, including different sub-phases within analysis and synthesis phases.
-
Compiler Concepts
UN-1.2Basic concepts related to Compiler, including interpreter, simple One-Pass Compiler, preprocessor, macros, symbol table, and error handler.
-
Institutional Infrastructural Preparedness
UN-1.3Institutional infrastructural preparedness refers to the readiness of government agencies and institutions to adopt and implement e-governance systems.
-
Human Infrastructural Preparedness
UN-1.4Human infrastructural preparedness involves the development of skills and capacities of public officials and citizens to effectively use e-governance systems.
-
Technological Infrastructural Preparedness
UN-1.5Technological infrastructural preparedness refers to the availability and quality of technology infrastructure, including computers, internet connectivity, and other digital tools.
Key Topics
-
Lexical Analysis
UN-2.1The process of breaking the source code into a series of tokens. It involves the specification and recognition of tokens, input buffer, and finite automata relevant to compiler construction.
-
Syntax Analysis
UN-2.2The process of analyzing the syntax of the source code. It involves basic parsing techniques, problem of left recursion, left factoring, ambiguous grammar, top-down parsing, bottom-up parsing, and LR parsing.
-
Semantic Analysis
UN-2.3The process of analyzing the meaning of the source code. It involves static and dynamic checks, typical semantic errors, scoping, type checking, syntax directed definitions, and translation.
-
Context-Free Grammar
UN-2.1.1Study of context-free grammar, including parse trees, derivation, and ambiguity. Normal forms of context-free grammar, such as CNF and GNF, are also explored.
-
Regular Grammars
UN-2.1.2Introduction to regular grammars and their properties, including closure properties of context-free languages.
-
Proving a Language to be Non-Context-Free
UN-2.1.3Techniques for proving that a language is not context-free, including pumping lemma and other methods.
-
Ethernet and Wireless Links
UN-2.1.4Introduction to Ethernet and wireless link technologies, including IEEE 802.11b, Bluetooth, point-to-point protocol (PPP), asynchronous transfer mode (ATM), and frame relay.