Skip to content
Study Notes Nepal Posted in BCA, BIM, BIT, BSc.CSITTagged A-Buffer method, Areas, Bresenhams line drawing algorithm, Concept of Three Dimension viewing devices, Concept of Virtual reality & simulation, Conversion between HSV and RGB color models, depth buffer (z-buffer) method, Depth sorting method (Painter’s Algorithm), Hardware and Software Concept, Illumination models and surface rendering methods, Introduction of Computer Graphics, Morphing and simulating accelerations., Random Scan System, Scan line method, Simple Architecture on Raster, Text and Colors, Text in Java 2D, Three Dimensional Graph, Trends in Computer Graphics, Two Dimensional Algorithm, Visible surface detection method
Study Notes Nepal Posted in BCA, BIM, BIT, BSc.CSITTagged congestion, Congestion control algorithm, DCCP (datagram congestion control protocol), Dynamic IP Address assignment, error control, File sharing:-FTP, flow control, Fragmentation-MTU, Functions (addressing, Gnutella/KaZaa/direct, header Translation), ICMP, ICMP error reporting, ICMP error restrictions, Internet Routing tables, IP Forwarding, IP header in detail, IP router model, IPv6, IRC, Issues in IP, Longest prefix matching, Multicast and Multicast routing, Multicast routing, Multimedia networking, Napster, New Transport Layer protocols, Next hop Routing, ordered\unordered delivery, Overview of IPv4 (Addressing schemes IPV4), Peer to Peer network, Reverse Path, Reverse Path Multicasting, SCTP (stream control transmission protocol), Source-Based tree (DVMRP (overview, Techniques to achieve good QoS, Transition from IPv4 to IPv6, Transition strategies (Dual stack, tunneling, VC forwarding table, VC signaling protocols, Virtual Circuits (VC)
Study Notes Nepal Posted in BCA, BIM, BIT, BSc.CSITTagged Binary Trees, Complexity Analysis, data structure and algorithm, dsa, Graphs, Hashing, Linked Lists, Multiway Trees, Recursion, Sorting, Stacks and Queues
error:
