http://www.shashankkulal.jimdo.com/

BCA Study Material, Railway colony, Kota (2026)

23/04/2019

A file is a collection of data stored in a disk with a specific name and a directory path. When a file is opened for reading or writing, it becomes a stream. The stream is basically the sequence of bytes passing through the communication path. There are two main streams: the input stream and the output stream. The [ 322 more words ]

A file is a collection of data stored in a disk with a specific name and a directory path. When a file is opened for reading or writing, it becomes a stream. The stream is basically the sequence of…

23/04/2019

Web user controls are derived from System.Web.UI.UserControl namespace. These controls once created, can be added to the aspx page either at design time or programmatically during run time. But they lack the design time support of setting the properties created along with the control. They cannot run on their own and they need to stand on another platform like an aspx page. [ 132 more words ]

Web user controls are derived from System.Web.UI.UserControl namespace. These controls once created, can be added to the aspx page either at design time or programmatically during run time. But the…

20/04/2019

A custom control is a control made by the user for a specific purpose and later we can use it in our application. In this article we are going to see how we can create and implement a custom web control. Now we are going to make a required valid Textbox value which checks that the Text box has the value or not, if not then it will give an error that it cannot not be empty. [ 222 more words ]

A custom control is a control made by the user for a specific purpose and later we can use it in our application. In this article we are going to see how we can create and implement a custom web co…

20/04/2019

Depth First Traversal (or Search) for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a Boolean visited array. voidGraph::DFSUtil(intv, boolvisited[]) { // Mark the current node as visited and… [ 276 more words ]

Depth First Traversal (or Search) for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. …

22/11/2011

=============Notice=============
From 23 November college timing will be 8:00 AM to 2:00 pm.

And internal start from 28 November, Monday.
_______________________________________
Note: only for BCA students. {1st,2nd and 3rd year}
For more information call Shailesh sir 9414939140