Category: COMPUTER SCIENCE & ENGG VIDEO

In this Video, Ms. Vishakha Mehra, Assistant Professor, Biyani international institute for engineering and technology, describes about Traversal of binary tree. Traversal of binary tree means visiting its each node exactly once. A tree consists of root node, its left sub-tree and its right sub-tree. There are three methods of traversal as: Pre-order traversal, in-order traversal and post-order traversal.

In this video Mr. Indra Kishor, Biyani International Institute of Engineering and Technology, Jaipur, explains about the Cryptography. Types of cryptography with general working mechanism of encryption and decryption. www.gurukpo.com, www.biyanicolleges.org

In this video Mr. Indra Kishor, Biyani International Institute of Engineering and Technology, Jaipur, explains about the Algorithm and Flowchart. How can we flow chart from algorithm . We all know about the Algorithm is very important for any programmer, without algorithm we can’t create any program. www.gurukpo.com

In this video Mrs. Deepika Shrivastava, Asst. professor, Biyani Group of Colleges is explaining that when multiple devices are connected together to share information, then that whole system is known as computer network. When a host on network A wants to send data to host on network B, then it sends its data to the server of network A, from there, data is being routed to server of network B through router, and then finally server of network B transfers data to destination host . There are several networking devices used at different layers of OSI model.
http://www.gurukpo.com/

n this Video, Ms. Mayanka kaushik, Asst. Professor, Biyani Group of Colleges is explaining about the Shanon-Fano Algorithm,.In this technique first of all arrange in the decreasing probability and assign the binary code to the equiprobable codes. And arrange 0 to the high probability and 1 to the lowest probability.

In this Video, Ms. Mayanka kaushik, Biyani Group of Colleges is explaining about the Gram–Schmidt Process. The Gram–Schmidt process takes a finite linearly independent set S = {v1, …, vk} for k ≤ n and generates an orthogonal set S′ = {u1, …, uk}.