Skip to main content

open new form, close existing wpf form c#

This thread solve all realted questions which is generated on open new form, close existing wpf form c#. Also this thread solve other related thread like:

  • WPF Application still runs in background after closing.
  • My Windows Store app is still running in debug mode after I close it.
  • VS2012 Debugging fails on subsequent runs.
  • WPF Main application stops responding if a child window is being moved around.
  • Application doesn't exit if it creates a window which is not shown.
  • How main WPF window knows when secondary WPF window is closed.
  • When shutting down the application, not all windows are closed.
  • How to connect WPF Application project to Windows Game project?
  • Clarification on WPF Window.Show() and Window.Close() and how they work with Multiple Windows.
  • WPF App Doesn't Shut Down When Closing Main Window.

Now the solution of all thread is, following steps which is mentioned below:
Step-1 :   Add two new window in wpf solution explorer. like first.xaml and second.xaml 

Step-2 :  Add a button control in first window from the toolbox.

Step-3 : Add this code into your first.xaml.cs file.

        private void Button_Click(object sender, RoutedEventArgs e)
            second sc = new second();
            sc.Owner = this;

Step-4 :  Also add this code into your second.xaml.cs file.

protected override void OnClosed(EventArgs e)

Now, run your application, but first to set the start page from app.xaml file. 
How to set startup page in wpf:
1. Open app.xaml file; also set startupUri like

<Application x:Class="WpfApplication1.App"


Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video

Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:

      Suppose next node is allocated at an address 506, so the list becomes,

  Suppose next node is allocated with an address with an address 10,s the list become,

The other way to represent the linked list is as shown below:

 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …