Trick and Tips: structure

Showing posts with label structure. Show all posts

Tuesday, March 3, 2015

Making Sentence Structure Easy for Kindergarten Students!

Hey everyone! As promised, Ive added some really exciting updates to my "Writing a Winning Sentence" anchor chart! I am so excited about all of these additions! There is now:

a coordinating writing goals chart, where you can post your students names next to their individual goals (Pinterest inspired)
a self-check skills card, to help students check that theyve addressed each skill
two writing conferences charts - for if you have one teacher or two teachers in your classroom
a SECOND writing anchor chart and set that is better suited for 1st grade and 2nd grade
a THIRD writing anchor chart and set that is suitable for 3rd and 4th

All of this is only $2 in my TPT store! Click the picture to head over there and purchase it!

I started using this set with my kids and they just love it! And for all of you blog hoppers, Im offering part of this set for free! Check it out below...

I printed out copies of this page for each of my students. During writing time, I put these at each of their seats so that they can check their work. The constant visual helps remind them of the skills they need to include. Click the picture below to download the freebie!

Note: This preview is hosted on Google Docs. Once you open the file, click File > Download to save onto your computer!

This post is linked up with Manic Monday!

Unrolled Linked List Data Structure

What is Unrolled Linked List?

An Unrolled linked list is a type of link list that stores multiple elements in each node. It is also known as cache sensitive data structure. The term ‘cache’ has been taken from cache memory which is associated with CPU. A cache memory is used to store recently visited pages or data so that they can be made available for RAM immediately without accessing secondary or permanent memory. A typical unrolled linked list can be declared in C as follows.

#define SIZE 50

struct node

{

int count;

int elements[SIZE];

struct node *next;

};

Each node in the unrolled array contains a certain maximum number of elements. The number of elements are large enough to fill a single cache line. The position of the element in the list can be indicated either by reference or by position in the array. An unrolled linked list can be shown like following.

The operations those can be performed on an unrolled linked list are insertion and deletion.

Insertion

First of all it is checked if the space is available in the list for inserting a new element. If the space is available, the element is just inserted. When the element is inserted in the array elements, the count variable is incremented by one. If array doesn’t have free space to have an element, we just create a new node, place it after the current node and move half of the elements to newly created node. It creates room/space for the new element.

Deletion

When an element is deleted from the list it is simply removed from the array. If the number of elements in the array falls below N/2, we take the elements from a neighboring array to fill the array. If neighboring array also has N/2 elements then we merge both of the arrays.

Advantages of Unrolled Linked List

1. Due to its cache behavior, the unrolled linked list performs the sequential traversal very rapidly.

2. It requires less storage space.

3. It performs the operations more quickly than ordinary linked list.

4. Indexing time O (N) is reduced to O (N/max), as we are able to process a whole node at a time instead of individual elements.

Disadvantages of Unrolled Linked List

The overhead per node for references and elements count is considerably high.